Welcome to mirror list, hosted at ThFree Co, Russian Federation.

git.blender.org/blender.git - Unnamed repository; edit this file 'description' to name the repository.
summaryrefslogtreecommitdiff
diff options
context:
space:
mode:
Diffstat (limited to 'source/blender/bmesh/intern')
-rw-r--r--source/blender/bmesh/intern/bmesh_construct.c2
-rw-r--r--source/blender/bmesh/intern/bmesh_log.c2
-rw-r--r--source/blender/bmesh/intern/bmesh_operators.c2
-rw-r--r--source/blender/bmesh/intern/bmesh_polygon.c4
-rw-r--r--source/blender/bmesh/intern/bmesh_polygon_edgenet.c2
-rw-r--r--source/blender/bmesh/intern/bmesh_walkers.c2
6 files changed, 7 insertions, 7 deletions
diff --git a/source/blender/bmesh/intern/bmesh_construct.c b/source/blender/bmesh/intern/bmesh_construct.c
index 4c70be65bef..2e69c48708c 100644
--- a/source/blender/bmesh/intern/bmesh_construct.c
+++ b/source/blender/bmesh/intern/bmesh_construct.c
@@ -99,7 +99,7 @@ static void bm_loop_attrs_copy(
* If \a no_double is true, then a check is done to see if a face
* with these vertices already exists and returns it instead.
*
- * If a pointer to an example face is provided, it's custom data
+ * If a pointer to an example face is provided, its custom data
* and properties will be copied to the new face.
*
* \note The winding of the face is determined by the order
diff --git a/source/blender/bmesh/intern/bmesh_log.c b/source/blender/bmesh/intern/bmesh_log.c
index 69d73f3d647..40eed6238ca 100644
--- a/source/blender/bmesh/intern/bmesh_log.c
+++ b/source/blender/bmesh/intern/bmesh_log.c
@@ -815,7 +815,7 @@ void BM_log_redo(BMesh *bm, BMLog *log)
/* Log a vertex before it is modified
*
* Before modifying vertex coordinates, masks, or hflags, call this
- * function to log it's current values. This is better than logging
+ * function to log its current values. This is better than logging
* after the coordinates have been modified, because only those
* vertices that are modified need to have their original values
* stored.
diff --git a/source/blender/bmesh/intern/bmesh_operators.c b/source/blender/bmesh/intern/bmesh_operators.c
index 746e9668671..c5e030c436a 100644
--- a/source/blender/bmesh/intern/bmesh_operators.c
+++ b/source/blender/bmesh/intern/bmesh_operators.c
@@ -368,7 +368,7 @@ void _bmo_slot_copy(BMOpSlot slot_args_src[BMO_OP_MAX_SLOTS],
/*
* BMESH OPSTACK SET XXX
*
- * Sets the value of a slot depending on it's type
+ * Sets the value of a slot depending on its type
*/
void BMO_slot_float_set(BMOpSlot slot_args[BMO_OP_MAX_SLOTS], const char *slot_name, const float f)
diff --git a/source/blender/bmesh/intern/bmesh_polygon.c b/source/blender/bmesh/intern/bmesh_polygon.c
index 06bab8c8cc1..4ae2cc67140 100644
--- a/source/blender/bmesh/intern/bmesh_polygon.c
+++ b/source/blender/bmesh/intern/bmesh_polygon.c
@@ -667,7 +667,7 @@ void BM_face_calc_center_median_weighted(const BMFace *f, float r_cent[3])
/**
* \brief POLY ROTATE PLANE
*
- * Rotates a polygon so that it's
+ * Rotates a polygon so that its
* normal is pointing towards the mesh Z axis
*/
void poly_rotate_plane(const float normal[3], float (*verts)[3], const uint nverts)
@@ -889,7 +889,7 @@ float BM_face_calc_normal_vcos(const BMesh *bm,
* Calculate a normal from a vertex cloud.
*
* \note We could make a higher quality version that takes all vertices into account.
- * Currently it finds 4 outer most points returning it's normal.
+ * Currently it finds 4 outer most points returning its normal.
*/
void BM_verts_calc_normal_from_cloud_ex(
BMVert **varr, int varr_len, float r_normal[3], float r_center[3], int *r_index_tangent)
diff --git a/source/blender/bmesh/intern/bmesh_polygon_edgenet.c b/source/blender/bmesh/intern/bmesh_polygon_edgenet.c
index b92e431c86c..54dc25ebeba 100644
--- a/source/blender/bmesh/intern/bmesh_polygon_edgenet.c
+++ b/source/blender/bmesh/intern/bmesh_polygon_edgenet.c
@@ -521,7 +521,7 @@ bool BM_face_split_edgenet(BMesh *bm,
/* Note: 'VERT_IN_QUEUE' is often not needed at all,
* however in rare cases verts are added multiple times to the queue,
- * that on it's own is harmless but in _very_ rare cases,
+ * that on its own is harmless but in _very_ rare cases,
* the queue will overflow its maximum size,
* so we better be strict about this! see: T51539 */
diff --git a/source/blender/bmesh/intern/bmesh_walkers.c b/source/blender/bmesh/intern/bmesh_walkers.c
index 860c83ec1e5..da1d3df2046 100644
--- a/source/blender/bmesh/intern/bmesh_walkers.c
+++ b/source/blender/bmesh/intern/bmesh_walkers.c
@@ -39,7 +39,7 @@
* to implement recursive or looping behavior. generally only one
* state push per call with a specific state is desired.
*
- * basic design pattern: the walker step function goes through it's
+ * basic design pattern: the walker step function goes through its
* list of possible choices for recursion, and recurses (by pushing a new state)
* using the first non-visited one. This choice is the flagged as visited using
* the ghash. each step may push multiple new states onto the worklist at once.