52 for (j = 0; j < 2; j++) {
55 l_other = j ? l_other->
next : l_other->
prev;
56 if (l_other == l_pivot) {
60 l_end_pair[j] = l_other;
74 return (((depths[0][
index] != -1) && (depths[1][
index] != -1)) &&
75 ((depths[0][
index] + depths[1][
index]) < pass));
119 const int cd_loop_uv_offset,
120 const char path_htype)
123 int ele_loops_len[2];
128 for (
int side = 0; side < 2; side++) {
129 BMElem *ele = side ? ele_dst : ele_src;
135 ele_loops[side] = ele_loops_buf[side].
data();
140 ele_loops[side][j++] = l_iter;
141 }
while ((l_iter = l_iter->
next) != l_first);
146 ele_loops_buf[side].
resize(2);
147 ele_loops[side] = ele_loops_buf[side].
data();
148 ele_loops[side][j++] =
l;
149 ele_loops[side][j++] =
l->
next;
151 else if (path_htype ==
BM_VERT) {
153 ele_loops_buf[side].
resize(1);
154 ele_loops[side] = ele_loops_buf[side].
data();
156 ele_loops[side][j++] =
l;
165 ele_loops_len[side] = j;
168 int *depths[2] = {
nullptr};
184 bool found_all =
false;
186 for (
int side = 0; side < 2; side++) {
187 const int side_other = !side;
191 std::fill_n(depths[side],
bm->
totloop, -1);
197 for (
int i = 0; i < ele_loops_len[side]; i++) {
198 BMLoop *
l = ele_loops[side][i];
210 for (
int i = 0; i < ele_loops_len[side]; i++) {
211 BMLoop *
l = ele_loops[side][i];
214 for (
int j = 0; j < 2; j++) {
216 if (depths[side][l_end_index] == -1) {
217 depths[side][l_end_index] = 0;
231 for (pass = 1; (
STACK_SIZE(stack) != 0); pass++) {
252 for (
int j = 0; j < 2; j++) {
255 if (depths[side][l_b_index] == -1) {
261 ((depths[side][l_b_index] == -1) &&
265 depths[side][l_b_index] = pass;
274 if (depths[side][l_b_index] == -1) {
279 depths[side][l_b_index] = pass;
294 for (
int i = 0; i < ele_loops_len[side_other]; i++) {
300 if (found_all ==
true) {
310 if (found_all ==
false) {
316 MEM_delete(stack_other);
322 if (found_all ==
false) {
325 else if (path_htype ==
BM_FACE) {
341 }
while ((l_iter = l_iter->
next) != l_first);
346 int ok_tests = f->
len > 3 ? 1 : 0;
355 }
while ((l_iter = l_iter->
next) != l_first);
364 else if (path_htype ==
BM_EDGE) {
373 const bool l_in_chain = l_in_chain_next;
375 if (l_in_chain && l_in_chain_next) {
381 else if (path_htype ==
BM_VERT) {
395 for (
int side = 0; side < 2; side++) {
397 MEM_delete(depths[side]);
413 const int cd_loop_uv_offset,
414 bool (*filter_fn)(
BMLoop *,
void *user_data),
442 const int cd_loop_uv_offset,
443 bool (*filter_fn)(
BMLoop *,
void *user_data),
471 const int cd_loop_uv_offset,
472 bool (*filter_fn)(
BMFace *,
void *user_data),
494 }
while ((l_iter = l_iter->
next) != l_first);
#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 Blender memory allocation and freeing.
#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_ELEM(ele, iter, data, itype)
#define BM_ITER_MESH(ele, iter, bm, itype)
#define BM_ITER_MESH_INDEX(ele, iter, bm, itype, indexvar)
void resize(const int64_t new_size)
BLI_assert(slot->slot_subtype.map==BMO_OP_SLOT_SUBTYPE_MAP_FLT)
void BM_mesh_elem_index_ensure(BMesh *bm, const char htype)
void BM_mesh_elem_hflag_enable_all(BMesh *bm, const char htype, const char hflag, const bool respecthide)
void * MEM_new_array_uninitialized(size_t len, size_t size, const char *str) ATTR_WARN_UNUSED_RESULT ATTR_ALLOC_SIZE(1
ATTR_WARN_UNUSED_RESULT const BMLoop * l
bool BM_loop_uv_share_vert_check(const BMLoop *l_a, const BMLoop *l_b, const int cd_loop_uv_offset)
void void BLI_linklist_prepend(LinkNode **listp, void *ptr) ATTR_NONNULL(1)
bool BM_vert_is_edge_pair_manifold(const BMVert *v)
ATTR_WARN_UNUSED_RESULT const BMLoop * l_b
LinkNode * BM_mesh_calc_path_uv_region_face(BMesh *bm, BMElem *ele_src, BMElem *ele_dst, const int cd_loop_uv_offset, bool(*filter_fn)(BMFace *, void *user_data), void *user_data)
static bool bm_loop_region_test_chain(BMLoop *l, int *const depths[2], const int pass)
static bool bm_loop_region_test(BMLoop *l, int *const depths[2], const int pass)
LinkNode * BM_mesh_calc_path_uv_region_vert(BMesh *bm, BMElem *ele_src, BMElem *ele_dst, const int cd_loop_uv_offset, bool(*filter_fn)(BMLoop *, 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)
static bool bm_loop_pair_ends(BMLoop *l_pivot, BMLoop *l_end_pair[2])
LinkNode * BM_mesh_calc_path_uv_region_edge(BMesh *bm, BMElem *ele_src, BMElem *ele_dst, const int cd_loop_uv_offset, bool(*filter_fn)(BMLoop *, void *user_data), void *user_data)