Cleanup: spelling

3 files changed, 5 insertions, 5 deletions

diff --git a/intern/cycles/render/graph.cpp b/intern/cycles/render/graph.cpp
index 436324b00ba..1b138455515 100644
--- a/intern/cycles/render/graph.cpp
+++ b/intern/cycles/render/graph.cpp
@@ -484,8 +484,8 @@ void ShaderGraph::remove_proxy_nodes()
         vector<ShaderInput *> links(output->links);
 
         foreach (ShaderInput *to, links) {
-          /* remove any autoconvert nodes too if they lead to
-           * sockets with an automatically set default value */
+          /* Remove any auto-convert nodes too if they lead to
+           * sockets with an automatically set default value. */
           ShaderNode *tonode = to->parent;
 
           if (tonode->special_type == SHADER_SPECIAL_TYPE_AUTOCONVERT) {
diff --git a/intern/cycles/util/util_transform.cpp b/intern/cycles/util/util_transform.cpp
index 6417752f704..e8233b7fe6d 100644
--- a/intern/cycles/util/util_transform.cpp
+++ b/intern/cycles/util/util_transform.cpp
@@ -317,7 +317,7 @@ void transform_motion_decompose(DecomposedTransform *decomp, const Transform *mo
    *
    * Note that this is very simple and naive implementation, which only deals with degenerated
    * scale happening only on one frame. It is possible to improve it further by interpolating
-   * rotation into s degenerated range using rotation from timesteps from adjacent non-degenerated
+   * rotation into s degenerated range using rotation from time-steps from adjacent non-degenerated
    * time steps. */
   for (size_t i = 0; i < size; i++) {
     const float3 scale = make_float3(decomp[i].y.w, decomp[i].z.w, decomp[i].w.w);
diff --git a/source/blender/blenkernel/intern/subdiv_ccg.c b/source/blender/blenkernel/intern/subdiv_ccg.c
index bc1b79f62c5..c992990e0a0 100644
--- a/source/blender/blenkernel/intern/subdiv_ccg.c
+++ b/source/blender/blenkernel/intern/subdiv_ccg.c
@@ -1618,7 +1618,7 @@ static int prev_adjacent_edge_point_index(const SubdivCCG *subdiv_ccg, const int
   return point_index - 1;
 }
 
-/* When the point index corresponds to a grid corner, returs the point index which corresponds to
+/* When the point index corresponds to a grid corner, returns the point index which corresponds to
  * the corner of the adjacent grid, as the adjacent edge has two separate points for each grid
  * corner at the middle of the edge. */
 static int adjacent_grid_corner_point_index_on_edge(const SubdivCCG *subdiv_ccg,
@@ -1650,7 +1650,7 @@ static void neighbor_coords_edge_get(const SubdivCCG *subdiv_ccg,
   if (include_duplicates) {
     num_duplicates += num_adjacent_faces - 1;
     if (is_corner) {
-      /* When the coord is a grid corner, add an extra duplicate per adajacent grid in all adjacent
+      /* When the coord is a grid corner, add an extra duplicate per adjacent grid in all adjacent
        * faces to the edge. */
       num_duplicates += num_adjacent_faces;
     }