Cleanup: spelling

1 files changed, 5 insertions, 5 deletions

diff --git a/source/blender/blenkernel/intern/pbvh_bmesh.c b/source/blender/blenkernel/intern/pbvh_bmesh.c
index 65820566fd5..73042222436 100644
--- a/source/blender/blenkernel/intern/pbvh_bmesh.c
+++ b/source/blender/blenkernel/intern/pbvh_bmesh.c
@@ -895,11 +895,11 @@ static void long_edge_queue_edge_add_recursive(
   }
 
   if ((l_edge->radial_next != l_edge)) {
-    /* how much longer we need to be to consider for subdividing
+    /* How much longer we need to be to consider for subdividing
      * (avoids subdividing faces which are only *slightly* skinny) */
 #  define EVEN_EDGELEN_THRESHOLD 1.2f
-    /* how much the limit increases per recursion
-     * (avoids performing subdvisions too far away) */
+    /* How much the limit increases per recursion
+     * (avoids performing subdivisions too far away). */
 #  define EVEN_GENERATION_SCALE 1.6f
 
     const float len_sq_cmp = len_sq * EVEN_EDGELEN_THRESHOLD;
@@ -1687,7 +1687,7 @@ struct FastNodeBuildInfo {
 
 /**
  * Recursively split the node if it exceeds the leaf_limit.
- * This function is multi-threadabe since each invocation applies
+ * This function is multi-thread-able since each invocation applies
  * to a sub part of the arrays.
  */
 static void pbvh_bmesh_node_limit_ensure_fast(
@@ -1811,7 +1811,7 @@ static void pbvh_bmesh_create_nodes_fast_recursive(
   }
   else {
     /* node does not have children so it's a leaf node, populate with faces and tag accordingly
-     * this is an expensive part but it's not so easily threadable due to vertex node indices */
+     * this is an expensive part but it's not so easily thread-able due to vertex node indices */
     const int cd_vert_node_offset = bvh->cd_vert_node_offset;
     const int cd_face_node_offset = bvh->cd_face_node_offset;