Cleanup: spelling in comments

source/blender/blenkernel/intern/blendfile_link_append.c

@@ -668,7 +668,7 @@ static void loose_data_instantiate_collection_process(
 
   /* NOTE: For collections we only view_layer-instantiate duplicated collections that have
    * non-instantiated objects in them.
-   * NOTE: Also avoid viewlayer-instantiating of collections children of other instantiated
+   * NOTE: Also avoid view-layer-instantiating of collections children of other instantiated
    * collections. This is why we need two passes here. */
   LinkNode *itemlink;
   for (itemlink = lapp_context->items.list; itemlink; itemlink = itemlink->next) {
@@ -719,7 +719,7 @@ static void loose_data_instantiate_collection_process(
     Collection *collection = (Collection *)id;
     bool do_add_collection = (id->tag & LIB_TAG_DOIT) != 0;
 
-    /* When instantiated into viewlayer, do not add collections if one of their parents is also
+    /* When instantiated into view-layer, do not add collections if one of their parents is also
      * instantiated. In case of empty-instantiation though, instantiation of all user-selected
      * collections is the desired behavior. */
     if (!do_add_collection ||
@@ -1508,7 +1508,7 @@ static void blendfile_library_relocate_remap(Main *bmain,
  *  * Relocating a library:
  *    - Add the new target library path to `lapp_context`.
  *    - Add all IDs from the library to relocate to `lapp_context`
- *    - Mark the new target library to beconsidered for each ID.
+ *    - Mark the new target library to be considered for each ID.
  *    - Call this function.
  *
  *  * Searching for (e.g.missing) linked IDs in a set or sub-set of libraries:

source/blender/io/usd/intern/usd_writer_abstract.cc

@@ -134,7 +134,7 @@ bool USDAbstractWriter::mark_as_instance(const HierarchyContext &context, const
 
   pxr::SdfPath ref_path(context.original_export_path);
   if (!prim.GetReferences().AddInternalReference(ref_path)) {
-    /* See this URL for a description fo why referencing may fail"
+    /* See this URL for a description for why referencing may fail"
      * https://graphics.pixar.com/usd/docs/api/class_usd_references.html#Usd_Failing_References
      */
     printf("USD Export warning: unable to add reference from %s to %s, not instancing object\n",

source/blender/makesrna/RNA_enum_items.h

@@ -223,7 +223,7 @@ DEF_ENUM(rna_enum_subdivision_boundary_smooth_items)
 
 DEF_ENUM(rna_enum_transform_orientation_items)
 
-/* Not available to RNA pre-processing (`makrsrna`).
+/* Not available to RNA pre-processing (`makesrna`).
  * Defined in editors for example. */
 #ifndef RNA_MAKESRNA
 

source/blender/nodes/geometry/nodes/node_geo_dual_mesh.cc

@@ -281,11 +281,11 @@ static void create_vertex_poly_map(const Mesh &mesh,
 }
 
 /**
- * Sorts the polygons connnected to the given vertex based on polygon adjacency. The ordering is
+ * Sorts the polygons connected to the given vertex based on polygon adjacency. The ordering is
  * so such that the normals point in the same way as the original mesh. If the vertex is a
  * boundary vertex, the first and last polygon have a boundary edge connected to the vertex. The
- * `r_shared_edges` array at index i is set to the index of the shared edge bewteen the i-th and
- * (i+1)-th sorted polygon. Similarly the `r_sorted_corners` array at index i is set to the
+ * `r_shared_edges` array at index i is set to the index of the shared edge between the i-th and
+ * `(i+1)-th` sorted polygon. Similarly the `r_sorted_corners` array at index i is set to the
  * corner in the i-th sorted polygon.
  *
  * How the faces are sorted (see diagrams below):
@@ -481,7 +481,7 @@ static void boundary_edge_on_poly(const MPoly &poly,
 
 /**
  * Get the two edges on the poly that contain the given vertex and are boundary edges. The
- * orientation of the poly is taken into acount.
+ * orientation of the poly is taken into account.
  */
 static void boundary_edges_on_poly(const MPoly &poly,
                                    const Mesh &mesh,
@@ -669,7 +669,7 @@ static void calc_dual_mesh(GeometrySet &geometry_set,
        * The first thing that happens is ordering the faces f1,f2 and f3 (stored in
        * loop_indices), together with their shared edges e3 and e4 (which get stored in
        * shared_edges). The ordering could end up being clockwise or counterclockwise, for this
-       * we'll asume that the ordering f1->f2->f3 is chosen. After that we add the edges in
+       * we'll assume that the ordering f1->f2->f3 is chosen. After that we add the edges in
        * between the polygons, in this case the edges f1--f2, and f2--f3. Now we need to merge
        * these with the boundary edges e1 and e2. To do this we create an edge from f3 to the
        * midpoint of e2 (computed in a previous step), from this midpoint to V, from V to the

source/blender/nodes/shader/node_shader_util.cc

@@ -277,11 +277,11 @@ void ntreeExecGPUNodes(bNodeTreeExec *exec, GPUMaterial *mat, bNode *output_node
 void node_shader_gpu_bump_tex_coord(GPUMaterial *mat, bNode *node, GPUNodeLink **link)
 {
   if (node->branch_tag == 1) {
-    /* Add one time the value fo derivative to the input vector. */
+    /* Add one time the value for derivative to the input vector. */
     GPU_link(mat, "dfdx_v3", *link, link);
   }
   else if (node->branch_tag == 2) {
-    /* Add one time the value fo derivative to the input vector. */
+    /* Add one time the value for derivative to the input vector. */
     GPU_link(mat, "dfdy_v3", *link, link);
   }
   else {