diff options
Diffstat (limited to 'source/blender/gpencil_modifiers/intern')
-rw-r--r-- | source/blender/gpencil_modifiers/intern/lineart/lineart_cpu.c | 14 | ||||
-rw-r--r-- | source/blender/gpencil_modifiers/intern/lineart/lineart_intern.h | 2 |
2 files changed, 8 insertions, 8 deletions
diff --git a/source/blender/gpencil_modifiers/intern/lineart/lineart_cpu.c b/source/blender/gpencil_modifiers/intern/lineart/lineart_cpu.c index da4d02f9ff2..e5e3eb850bf 100644 --- a/source/blender/gpencil_modifiers/intern/lineart/lineart_cpu.c +++ b/source/blender/gpencil_modifiers/intern/lineart/lineart_cpu.c @@ -2484,8 +2484,8 @@ static void lineart_main_load_geometries( flags |= DEG_ITER_OBJECT_FLAG_DUPLI; } - /* XXX(Yiming): Temporary solution, this iterator is technially unsafe to use *during* depsgraph - * evaluation, see https://developer.blender.org/D14997 for detailed explainations. */ + /* XXX(@Yiming): Temporary solution, this iterator is technically unsafe to use *during* + * depsgraph evaluation, see D14997 for detailed explanations. */ DEG_OBJECT_ITER_BEGIN (depsgraph, ob, flags) { Object *eval_ob = DEG_get_evaluated_object(depsgraph, ob); @@ -3245,7 +3245,7 @@ static void lineart_triangle_intersect_in_bounding_area(LineartTriangle *tri, double *G0 = tri->v[0]->gloc, *G1 = tri->v[1]->gloc, *G2 = tri->v[2]->gloc; - /* If this _is_ the smallest subdiv bounding area, then do the intersections there. */ + /* If this _is_ the smallest subdivision bounding area, then do the intersections there. */ for (int i = 0; i < up_to; i++) { /* Testing_triangle->testing[0] is used to store pairing triangle reference. * See definition of LineartTriangleThread for more info. */ @@ -3792,7 +3792,7 @@ static void lineart_bounding_area_split(LineartRenderBuffer *rb, b[3] = MIN3(tri->v[0]->fbcoord[1], tri->v[1]->fbcoord[1], tri->v[2]->fbcoord[1]); /* Re-link triangles into child tiles, not doing intersection lines during this because this - * batch of triangles are all tested with each other for intersecctions. */ + * batch of triangles are all tested with each other for intersections. */ if (LRT_BOUND_AREA_CROSSES(b, &ba[0].l)) { lineart_bounding_area_link_triangle(rb, &ba[0], tri, b, 0, recursive_level + 1, false, NULL); } @@ -4284,8 +4284,8 @@ static void lineart_create_edges_from_isec_data(LineartIsecData *d) if (!th->current) { continue; } - /* We don't care about removing duplicated vert in this method, chaning can handle that, and it - * saves us from using locks and look up tables. */ + /* We don't care about removing duplicated vert in this method, chaining can handle that, + * and it saves us from using locks and look up tables. */ LineartVertIntersection *v = lineart_mem_acquire( &rb->render_data_pool, sizeof(LineartVertIntersection) * th->current * 2); LineartEdge *e = lineart_mem_acquire(&rb->render_data_pool, sizeof(LineartEdge) * th->current); @@ -4712,7 +4712,7 @@ bool MOD_lineart_compute_feature_lines(Depsgraph *depsgraph, lineart_main_add_triangles(rb); /* Re-link bounding areas because they have been subdivided by worker threads and we need - * andjacent info. */ + * adjacent info. */ lineart_main_bounding_areas_connect_post(rb); /* Link lines to acceleration structure, this can only be done after perspective division, if diff --git a/source/blender/gpencil_modifiers/intern/lineart/lineart_intern.h b/source/blender/gpencil_modifiers/intern/lineart/lineart_intern.h index 738f020d8f7..2114ca1dc91 100644 --- a/source/blender/gpencil_modifiers/intern/lineart/lineart_intern.h +++ b/source/blender/gpencil_modifiers/intern/lineart/lineart_intern.h @@ -80,7 +80,7 @@ void lineart_count_and_print_render_buffer_memory(struct LineartRenderBuffer *rb #define LRT_BOUND_AREA_CROSSES(b1, b2) \ ((b1)[0] < (b2)[1] && (b1)[1] > (b2)[0] && (b1)[3] < (b2)[2] && (b1)[2] > (b2)[3]) -/* Initial bounding area row/column count, setting 10 is tested to be realitvely optimal for the +/* Initial bounding area row/column count, setting 10 is tested to be relatively optimal for the * performance under current algorithm. */ #define LRT_BA_ROWS 10 |