31 #define USE_EDGE_CHAIN
50 if (v_other == v_pivot) {
53 e_chain = e_chain_next;
55 v_end_pair[j++] = v_other;
70 return (((depths[0][index] != -1) && (depths[1][index] != -1)) &&
71 ((depths[0][index] + depths[1][index]) < pass));
114 const char path_htype)
116 int ele_verts_len[2];
120 for (
int side = 0; side < 2; side++) {
121 BMElem *ele = side ? ele_dst : ele_src;
131 ele_verts[side][j++] = l_iter->
v;
132 }
while ((l_iter = l_iter->
next) != l_first);
138 ele_verts[side][j++] =
e->v1;
139 ele_verts[side][j++] =
e->v2;
145 ele_verts[side][j++] =
v;
150 ele_verts_len[side] = j;
153 int *depths[2] = {
NULL};
169 bool found_all =
false;
171 for (
int side = 0; side < 2; side++) {
172 const int side_other = !side;
182 for (
int i = 0; i < ele_verts_len[side]; i++) {
183 BMVert *
v = ele_verts[side][i];
190 #ifdef USE_EDGE_CHAIN
195 for (
int i = 0; i < ele_verts_len[side]; i++) {
196 BMVert *
v = ele_verts[side][i];
199 for (
int j = 0; j < 2; j++) {
201 if (depths[side][v_end_index] == -1) {
202 depths[side][v_end_index] = 0;
216 for (pass = 1; (
STACK_SIZE(stack) != 0); pass++) {
225 if (depths[side][v_b_index] == -1) {
227 #ifdef USE_EDGE_CHAIN
232 depths[side][v_b_index] = pass;
238 e_chain = e_chain_next;
244 if (depths[side][v_b_index] == -1) {
245 #ifdef USE_EDGE_CHAIN
249 depths[side][v_b_index] = pass;
263 for (
int i = 0; i < ele_verts_len[side_other]; i++) {
269 if (found_all ==
true) {
279 if (found_all ==
false) {
291 if (found_all ==
false) {
294 else if (path_htype ==
BM_FACE) {
310 }
while ((l_iter = l_iter->
next) != l_first);
315 int ok_tests = f->
len > 3 ? 1 : 0;
324 }
while ((l_iter = l_iter->
next) != l_first);
333 else if (path_htype ==
BM_EDGE) {
341 for (
int j = 0; j < 2; j++) {
354 else if (path_htype ==
BM_VERT) {
365 for (
int side = 0; side < 2; side++) {
374 #undef USE_EDGE_CHAIN
424 for (
int j = 0; j < 2; j++) {
460 }
while ((l_iter = l_iter->
next) != l_first);
#define BLI_array_alloca(arr, realsize)
void void BLI_linklist_prepend(LinkNode **listp, void *ptr) ATTR_NONNULL(1)
void copy_vn_i(int *array_tar, int size, int val)
#define STACK_CLEAR(stack)
#define STACK_PUSH(stack, val)
#define STACK_DECLARE(stack)
#define STACK_SIZE(stack)
#define STACK_INIT(stack, stack_num)
#define STACK_SWAP(stack_a, stack_b)
Read Guarded memory(de)allocation.
#define BM_DISK_EDGE_NEXT(e, v)
#define BM_FACE_FIRST_LOOP(p)
#define BM_elem_index_get(ele)
#define BM_elem_flag_disable(ele, hflag)
#define BM_elem_flag_set(ele, hflag, val)
#define BM_elem_index_set(ele, index)
#define BM_elem_flag_test(ele, hflag)
#define BM_ITER_MESH(ele, iter, bm, itype)
#define BM_ITER_MESH_INDEX(ele, iter, bm, itype, indexvar)
ATTR_WARN_UNUSED_RESULT BMesh * bm
void BM_mesh_elem_hflag_enable_all(BMesh *bm, const char htype, const char hflag, const bool respecthide)
void BM_mesh_elem_index_ensure(BMesh *bm, const char htype)
static bool bm_vert_region_test(BMVert *v, int *const depths[2], const int pass)
static bool bm_vert_pair_ends(BMVert *v_pivot, BMVert *v_end_pair[2])
static bool bm_vert_region_test_chain(BMVert *v, int *const depths[2], const int pass)
LinkNode * BM_mesh_calc_path_region_edge(BMesh *bm, BMElem *ele_src, BMElem *ele_dst, bool(*filter_fn)(BMEdge *, void *user_data), void *user_data)
LinkNode * BM_mesh_calc_path_region_vert(BMesh *bm, BMElem *ele_src, BMElem *ele_dst, bool(*filter_fn)(BMVert *, void *user_data), void *user_data)
LinkNode * BM_mesh_calc_path_region_face(BMesh *bm, BMElem *ele_src, BMElem *ele_dst, bool(*filter_fn)(BMFace *, void *user_data), void *user_data)
static LinkNode * mesh_calc_path_region_elem(BMesh *bm, BMElem *ele_src, BMElem *ele_dst, const char path_htype)
bool BM_vert_is_edge_pair_manifold(const BMVert *v)
BLI_INLINE BMVert * BM_edge_other_vert(BMEdge *e, const BMVert *v) ATTR_WARN_UNUSED_RESULT ATTR_NONNULL()
ATTR_WARN_UNUSED_RESULT const BMVert const BMEdge * e
ATTR_WARN_UNUSED_RESULT const BMVert * v
void(* MEM_freeN)(void *vmemh)
void *(* MEM_mallocN)(size_t len, const char *str)