diff options
author | Campbell Barton <ideasman42@gmail.com> | 2012-02-28 23:10:53 +0400 |
---|---|---|
committer | Campbell Barton <ideasman42@gmail.com> | 2012-02-28 23:10:53 +0400 |
commit | 2a7f1af61ec8e11e73e2c16ca5579baca04bf78a (patch) | |
tree | a9f9c3dd8d0d5d179a4491ca21986f62c4e89854 /source/blender/bmesh/intern/bmesh_structure.c | |
parent | d1d11bbe9bc73f8578dbd138d079dc6488b5920d (diff) |
Code Cleanup:
- apply some rules for function naming conventions, added to main bmesh doc in bmesh.h.
- remove unused function BM_loops_to_corners().
Diffstat (limited to 'source/blender/bmesh/intern/bmesh_structure.c')
-rw-r--r-- | source/blender/bmesh/intern/bmesh_structure.c | 20 |
1 files changed, 10 insertions, 10 deletions
diff --git a/source/blender/bmesh/intern/bmesh_structure.c b/source/blender/bmesh/intern/bmesh_structure.c index 8dc6a5c6029..93b1b1d5866 100644 --- a/source/blender/bmesh/intern/bmesh_structure.c +++ b/source/blender/bmesh/intern/bmesh_structure.c @@ -206,7 +206,7 @@ void bmesh_disk_edge_remove(struct BMEdge *e, struct BMVert *v) * Pointer to the next edge in the disk cycle for the vertex v. */ -struct BMEdge *bmesh_disk_edge_next(struct BMEdge *e, struct BMVert *v) +struct BMEdge *bm_disk_edge_next(struct BMEdge *e, struct BMVert *v) { if (v == e->v1) return e->v1_disk_link.next; @@ -215,7 +215,7 @@ struct BMEdge *bmesh_disk_edge_next(struct BMEdge *e, struct BMVert *v) return NULL; } -static BMEdge *bmesh_disk_edge_prev(BMEdge *e, BMVert *v) +static BMEdge *bm_disk_edge_prev(BMEdge *e, BMVert *v) { if (v == e->v1) return e->v1_disk_link.prev; @@ -235,7 +235,7 @@ BMEdge *bmesh_disk_edge_exists(BMVert *v1, BMVert *v2) if (bmesh_verts_in_edge(v1, v2, e_iter)) { return e_iter; } - } while ((e_iter = bmesh_disk_edge_next(e_iter, v1)) != e_first); + } while ((e_iter = bm_disk_edge_next(e_iter, v1)) != e_first); } return NULL; @@ -259,7 +259,7 @@ int bmesh_disk_count(struct BMVert *v) return 0; } count++; - } while ((e_iter = bmesh_disk_edge_next(e_iter, v)) != e_first); + } while ((e_iter = bm_disk_edge_next(e_iter, v)) != e_first); return count; } else { @@ -278,10 +278,10 @@ int bmesh_disk_validate(int len, BMEdge *e, BMVert *v) e_iter = e; do { - if (len != 1 && bmesh_disk_edge_prev(e_iter, v) == e_iter) { + if (len != 1 && bm_disk_edge_prev(e_iter, v) == e_iter) { return FALSE; } - } while ((e_iter = bmesh_disk_edge_next(e_iter, v)) != e); + } while ((e_iter = bm_disk_edge_next(e_iter, v)) != e); return TRUE; } @@ -308,7 +308,7 @@ int bmesh_disk_facevert_count(BMVert *v) if (e_iter->l) { count += bmesh_radial_facevert_count(e_iter->l, v); } - } while ((e_iter = bmesh_disk_edge_next(e_iter, v)) != e_first); + } while ((e_iter = bm_disk_edge_next(e_iter, v)) != e_first); return count; } else { @@ -333,7 +333,7 @@ struct BMEdge *bmesh_disk_faceedge_find_first(struct BMEdge *e, struct BMVert *v if (searchedge->l && bmesh_radial_facevert_count(searchedge->l, v)) { return searchedge; } - } while ((searchedge = bmesh_disk_edge_next(searchedge, v)) != e); + } while ((searchedge = bm_disk_edge_next(searchedge, v)) != e); return NULL; } @@ -341,12 +341,12 @@ struct BMEdge *bmesh_disk_faceedge_find_first(struct BMEdge *e, struct BMVert *v struct BMEdge *bmesh_disk_faceedge_find_next(struct BMEdge *e, struct BMVert *v) { BMEdge *searchedge = NULL; - searchedge = bmesh_disk_edge_next(e, v); + searchedge = bm_disk_edge_next(e, v); do { if (searchedge->l && bmesh_radial_facevert_count(searchedge->l, v)) { return searchedge; } - } while ((searchedge = bmesh_disk_edge_next(searchedge, v)) != e); + } while ((searchedge = bm_disk_edge_next(searchedge, v)) != e); return e; } |