26 e->v1_disk_link.next =
e->v1_disk_link.prev =
nullptr;
28 else if (
e->v2 == v_src) {
30 e->v2_disk_link.next =
e->v2_disk_link.prev =
nullptr;
42 l_iter = l_first =
e->l;
44 if (l_iter->
v == v_src) {
47 else if (l_iter->
next->
v == v_src) {
48 l_iter->
next->
v = v_dst;
53 }
while ((l_iter = l_iter->
radial_next) != l_first);
150 dl1 = bmesh_disk_edge_link_from_vert(
e,
v);
151 dl2 = bmesh_disk_edge_link_from_vert(
v->
e,
v);
152 dl3 = dl2->
prev ? bmesh_disk_edge_link_from_vert(dl2->
prev,
v) :
nullptr;
168 dl1 = bmesh_disk_edge_link_from_vert(
e,
v);
170 dl2 = bmesh_disk_edge_link_from_vert(dl1->
prev,
v);
175 dl2 = bmesh_disk_edge_link_from_vert(dl1->
next,
v);
190 e_first = e_iter = v1->
e;
207 e_iter = e_first =
v->
e;
220 e_iter = e_first =
v->
e;
223 if (count == count_max) {
260 e_first = e_iter =
v->
e;
278 e_first = e_iter =
v->
e;
282 if (count == count_max) {
295 if (e_iter->
l !=
nullptr) {
296 return const_cast<BMEdge *
>((e_iter->
l->
v ==
v) ? e_iter : e_iter->
l->
next->
e);
306 if (e_iter->
l !=
nullptr) {
307 return (e_iter->
l->
v ==
v) ? e_iter->
l : e_iter->
l->
next;
318 if (e_iter->
l !=
nullptr) {
320 l_iter = l_first = e_iter->
l;
323 return (l_iter->
v ==
v) ? l_iter : l_iter->
next;
325 }
while ((l_iter = l_iter->
radial_next) != l_first);
341 return const_cast<BMEdge *
>(
e);
354 if (!l_iter) [[unlikely]] {
359 if (l_iter->
e !=
l->
e) {
379 if (
e->l ==
nullptr) {
387 e->l->radial_next->radial_prev =
l;
388 e->l->radial_next =
l;
393 if (
l->
e &&
l->
e !=
e) [[unlikely]] {
404 if (
e !=
l->
e) [[unlikely]] {
449 if (l_iter->
v ==
v) {
450 return const_cast<BMLoop *
>(l_iter);
461 if (l_iter->
v ==
v) {
465 return const_cast<BMLoop *
>(
l);
478 if (!l_iter) [[unlikely]] {
500 if (l_iter->
v ==
v) {
514 if (l_iter->
v ==
v) {
516 if (count == count_max) {
530 if (l_iter->
v ==
v) {
546 if (l_first ==
nullptr) {
551 for (i = 1, l_iter = l_first->
next; i < len; i++, l_iter = l_iter->next) {
552 if ((l_iter->
f != f) || (l_iter == l_first)) {
556 if (l_iter != l_first) {
561 for (i = 1, l_iter = l_first->
prev; i < len; i++, l_iter = l_iter->prev) {
562 if (l_iter == l_first) {
566 if (l_iter != l_first) {
#define BM_LOOP_RADIAL_MAX
#define BM_FACE_FIRST_LOOP(p)
#define BM_elem_flag_test(ele, hflag)
ccl_device_inline dual1 len(const ccl_private dual< T > &a)
bool bmesh_radial_facevert_check(const BMLoop *l, const BMVert *v)
RADIAL CHECK FACE VERT.
void bmesh_disk_edge_remove(BMEdge *e, BMVert *v)
BLI_assert(slot->slot_subtype.map==BMO_OP_SLOT_SUBTYPE_MAP_FLT)
void bmesh_radial_loop_append(BMEdge *e, BMLoop *l)
bool bmesh_disk_validate(int len, BMEdge *e, BMVert *v)
ATTR_WARN_UNUSED_RESULT const BMLoop * l
bool bmesh_radial_validate(int radlen, BMLoop *l)
void bmesh_edge_vert_swap(BMEdge *e, BMVert *v_dst, BMVert *v_src)
int bmesh_disk_facevert_count(const BMVert *v)
DISK COUNT FACE VERT.
void bmesh_disk_vert_swap(BMEdge *e, BMVert *v_dst, BMVert *v_src)
bool bmesh_loop_validate(BMFace *f)
ATTR_WARN_UNUSED_RESULT const BMVert * v
BLI_INLINE bool BM_vert_in_edge(const BMEdge *e, const BMVert *v) ATTR_WARN_UNUSED_RESULT ATTR_NONNULL()
void bmesh_radial_loop_remove(BMEdge *e, BMLoop *l)
BMESH RADIAL REMOVE LOOP.
BMLoop * bmesh_disk_faceloop_find_first(const BMEdge *e, const BMVert *v)
int bmesh_radial_length(const BMLoop *l)
int bmesh_radial_facevert_count_at_most(const BMLoop *l, const BMVert *v, const int count_max)
int bmesh_disk_count_at_most(const BMVert *v, int count_max)
void bmesh_disk_vert_replace(BMEdge *e, BMVert *v_dst, BMVert *v_src)
BMEdge * bmesh_disk_faceedge_find_first(const BMEdge *e, const BMVert *v)
FIND FIRST FACE EDGE.
int bmesh_disk_count(const BMVert *v)
void bmesh_disk_edge_append(BMEdge *e, BMVert *v)
BLI_INLINE bool BM_verts_in_edge(const BMVert *v1, const BMVert *v2, const BMEdge *e) ATTR_WARN_UNUSED_RESULT ATTR_NONNULL()
BMEdge * bmesh_disk_faceedge_find_next(const BMEdge *e, const BMVert *v)
BMLoop * bmesh_radial_faceloop_find_first(const BMLoop *l, const BMVert *v)
BME RADIAL FIND FIRST FACE VERT.
BLI_INLINE BMEdge * bmesh_disk_edge_prev(const BMEdge *e, const BMVert *v) ATTR_WARN_UNUSED_RESULT ATTR_NONNULL()
ATTR_WARN_UNUSED_RESULT const BMVert * v2
BMLoop * bmesh_radial_faceloop_find_next(const BMLoop *l, const BMVert *v)
BLI_INLINE BMEdge * bmesh_disk_edge_next(const BMEdge *e, const BMVert *v) ATTR_WARN_UNUSED_RESULT ATTR_NONNULL()
int bmesh_disk_facevert_count_at_most(const BMVert *v, const int count_max)
BMEdge * bmesh_disk_edge_exists(const BMVert *v1, const BMVert *v2)
int bmesh_radial_facevert_count(const BMLoop *l, const BMVert *v)
RADIAL COUNT FACE VERT.
BMLoop * bmesh_disk_faceloop_find_first_visible(const BMEdge *e, const BMVert *v)
void bmesh_radial_loop_unlink(BMLoop *l)
ATTR_WARN_UNUSED_RESULT const BMVert const BMEdge * e
struct BMLoop * radial_next
struct BMLoop * radial_next
struct BMLoop * radial_prev