Spelling fixes in comments and descriptions, patch by luzpaz

Differential Revision: https://developer.blender.org/D3744

3 files changed, 7 insertions, 7 deletions

diff --git a/source/blender/bmesh/tools/bmesh_decimate_collapse.c b/source/blender/bmesh/tools/bmesh_decimate_collapse.c
index da525becc78..e32a9334343 100644
--- a/source/blender/bmesh/tools/bmesh_decimate_collapse.c
+++ b/source/blender/bmesh/tools/bmesh_decimate_collapse.c
@@ -698,7 +698,7 @@ static void bm_edge_collapse_loop_customdata(
   const bool is_manifold = BM_edge_is_manifold(l->e);
   int side;
 
-  /* first find the loop of 'v_other' thats attached to the face of 'l' */
+  /* first find the loop of 'v_other' that's attached to the face of 'l' */
   if (l->v == v_clear) {
     l_clear = l;
     l_other = l->next;
@@ -882,7 +882,7 @@ static bool bm_edge_collapse_is_degenerate_topology(BMEdge *e_first)
     bm_edge_tag_enable(e_iter);
   } while ((e_iter = bmesh_disk_edge_next(e_iter, e_first->v1)) != e_first);
 
-  /* ... except for the edge we will collapse, we know thats shared,
+  /* ... except for the edge we will collapse, we know that's shared,
    * disable this to avoid false positive. We could be smart and never enable these
    * face/edge tags in the first place but easier to do this */
   // bm_edge_tag_disable(e_first);
diff --git a/source/blender/bmesh/tools/bmesh_path_region.c b/source/blender/bmesh/tools/bmesh_path_region.c
index 8b139e6a5ff..841109a251f 100644
--- a/source/blender/bmesh/tools/bmesh_path_region.c
+++ b/source/blender/bmesh/tools/bmesh_path_region.c
@@ -224,7 +224,7 @@ static LinkNode *mesh_calc_path_region_elem(BMesh *bm,
 #endif /* USE_EDGE_CHAIN */
 
     /* Keep walking over connected geometry until we find all the vertices in
-     * `ele_verts[side_other]`, or exit the loop when theres no connection. */
+     * `ele_verts[side_other]`, or exit the loop when there's no connection. */
     found_all = false;
     for (pass = 1; (STACK_SIZE(stack) != 0); pass++) {
       while (STACK_SIZE(stack) != 0) {
@@ -268,7 +268,7 @@ static LinkNode *mesh_calc_path_region_elem(BMesh *bm,
         } while ((e = BM_DISK_EDGE_NEXT(e, v_a)) != v_a->e);
       }
 
-      /* Stop searching once theres none left.
+      /* Stop searching once there's none left.
        * Note that this looks in-efficient, however until the target elements reached,
        * it will exit immediately.
        * After that, it takes as many passes as the element has edges to finish off. */
diff --git a/source/blender/bmesh/tools/bmesh_region_match.c b/source/blender/bmesh/tools/bmesh_region_match.c
index 8b9a9de3988..943f7532960 100644
--- a/source/blender/bmesh/tools/bmesh_region_match.c
+++ b/source/blender/bmesh/tools/bmesh_region_match.c
@@ -43,7 +43,7 @@
 
 #include "bmesh.h"
 
-#include "tools/bmesh_region_match.h" /* own incldue */
+#include "tools/bmesh_region_match.h" /* own include */
 
 /* avoid re-creating ghash and pools for each search */
 #define USE_WALKER_REUSE
@@ -95,13 +95,13 @@ typedef struct UUIDWalk {
   BLI_mempool *step_pool;
   BLI_mempool *step_pool_items;
 
-  /* Optionaly use face-tag to isolate search */
+  /* Optionally use face-tag to isolate search */
   bool use_face_isolate;
 
   /* Increment for each pass added */
   UUID_Int pass;
 
-  /* runtime vars, aviod re-creating each pass */
+  /* runtime vars, avoid re-creating each pass */
   struct {
     GHash *verts_uuid; /* BMVert -> UUID */
     GSet *faces_step;  /* BMFace */