/dports/graphics/blender/blender-2.91.0/source/blender/bmesh/intern/ |
H A D | bmesh_iterators.c | 562 if (iter->l_next) { in bmiter__loop_of_edge_step() 563 iter->l_next = iter->l_next->radial_next; in bmiter__loop_of_edge_step() 591 if (iter->l_next) { in bmiter__loop_of_loop_step() 592 iter->l_next = iter->l_next->radial_next; in bmiter__loop_of_loop_step() 615 if (iter->l_next) { in bmiter__face_of_edge_step() 616 iter->l_next = iter->l_next->radial_next; in bmiter__face_of_edge_step() 659 if (iter->l_next) { in bmiter__vert_of_face_step() 660 iter->l_next = iter->l_next->next; in bmiter__vert_of_face_step() 682 if (iter->l_next) { in bmiter__edge_of_face_step() 683 iter->l_next = iter->l_next->next; in bmiter__edge_of_face_step() [all …]
|
H A D | bmesh_iterators.h | 121 BMLoop *l_first, *l_next; member 126 BMLoop *l_first, *l_next; member 131 BMLoop *l_first, *l_next; member 135 BMLoop *l_first, *l_next; member 139 BMLoop *l_first, *l_next; member 146 BMLoop *l_first, *l_next; member 150 BMLoop *l_first, *l_next; member 154 BMLoop *l_first, *l_next; member
|
/dports/cad/jspice3/jspice3-2.5/src/lib/sced/ |
H A D | dir.c | 55 struct list *l_next; member 108 wx = wx->l_next; in Dir() 115 wx->l_next = wl; in Dir() 116 while (wx->l_next) wx = wx->l_next; in Dir() 172 if (!wl->l_next) { 176 wl->l_next->l_next = NULL; 178 wl = wl->l_next; 181 if (wl->l_next) 183 wl->l_next = NULL; 217 nw = wl->l_next; [all …]
|
/dports/misc/rump/buildrump.sh-b914579/src/external/cddl/osnet/dist/tools/ctf/common/ |
H A D | list.c | 46 struct list *l_next; member 57 le->l_next = *list; in list_add() 92 for (le = *list, le2 = list; le; le2 = &le->l_next, le = le->l_next) { in list_remove() 94 *le2 = le->l_next; in list_remove() 111 list = list->l_next; in list_free() 130 lnext = list->l_next; in list_iter() 187 last->l_next = list2; in list_concat() 207 next2 = list2->l_next; in slist_merge() 212 list2->l_next = list1; in slist_merge() 214 list2->l_next = list1; in slist_merge() [all …]
|
/dports/misc/rump/buildrump.sh-b914579/src/external/cddl/osnet/dist/common/ctf/ |
H A D | ctf_util.c | 49 q->l_next = NULL; in ctf_list_append() 52 p->l_next = q; in ctf_list_append() 54 lp->l_next = q; in ctf_list_append() 65 ctf_list_t *q = lp->l_next; /* q = head list element */ in ctf_list_prepend() 67 lp->l_next = p; in ctf_list_prepend() 69 p->l_next = q; in ctf_list_prepend() 87 p->l_prev->l_next = p->l_next; in ctf_list_delete() 89 lp->l_next = p->l_next; in ctf_list_delete() 91 if (p->l_next != NULL) in ctf_list_delete() 92 p->l_next->l_prev = p->l_prev; in ctf_list_delete()
|
/dports/devel/arm-elf-binutils/binutils-2.37/libctf/ |
H A D | ctf-util.c | 38 q->l_next = NULL; in ctf_list_append() 41 p->l_next = q; in ctf_list_append() 43 lp->l_next = q; in ctf_list_append() 55 lp->l_next = p; in ctf_list_prepend() 57 p->l_next = q; in ctf_list_prepend() 74 p->l_prev->l_next = p->l_next; in ctf_list_delete() 76 lp->l_next = p->l_next; in ctf_list_delete() 78 if (p->l_next != NULL) in ctf_list_delete() 102 lp->l_prev->l_next = append->l_next; in ctf_list_splice() 104 lp->l_next = append->l_next; in ctf_list_splice() [all …]
|
/dports/devel/gdb/gdb-11.1/libctf/ |
H A D | ctf-util.c | 38 q->l_next = NULL; in ctf_list_append() 41 p->l_next = q; in ctf_list_append() 43 lp->l_next = q; in ctf_list_append() 55 lp->l_next = p; in ctf_list_prepend() 57 p->l_next = q; in ctf_list_prepend() 74 p->l_prev->l_next = p->l_next; in ctf_list_delete() 76 lp->l_next = p->l_next; in ctf_list_delete() 78 if (p->l_next != NULL) in ctf_list_delete() 102 lp->l_prev->l_next = append->l_next; in ctf_list_splice() 104 lp->l_next = append->l_next; in ctf_list_splice() [all …]
|
/dports/devel/gnulibiberty/binutils-2.37/libctf/ |
H A D | ctf-util.c | 38 q->l_next = NULL; in ctf_list_append() 41 p->l_next = q; in ctf_list_append() 43 lp->l_next = q; in ctf_list_append() 55 lp->l_next = p; in ctf_list_prepend() 57 p->l_next = q; in ctf_list_prepend() 74 p->l_prev->l_next = p->l_next; in ctf_list_delete() 76 lp->l_next = p->l_next; in ctf_list_delete() 78 if (p->l_next != NULL) in ctf_list_delete() 102 lp->l_prev->l_next = append->l_next; in ctf_list_splice() 104 lp->l_next = append->l_next; in ctf_list_splice() [all …]
|
/dports/devel/binutils/binutils-2.37/libctf/ |
H A D | ctf-util.c | 38 q->l_next = NULL; in ctf_list_append() 41 p->l_next = q; in ctf_list_append() 43 lp->l_next = q; in ctf_list_append() 55 lp->l_next = p; in ctf_list_prepend() 57 p->l_next = q; in ctf_list_prepend() 74 p->l_prev->l_next = p->l_next; in ctf_list_delete() 76 lp->l_next = p->l_next; in ctf_list_delete() 78 if (p->l_next != NULL) in ctf_list_delete() 102 lp->l_prev->l_next = append->l_next; in ctf_list_splice() 104 lp->l_next = append->l_next; in ctf_list_splice() [all …]
|
/dports/mail/pathalias/pathalias-9.16/ |
H A D | addlink.c | 55 l->l_next = prev->l_next; 56 prev->l_next = l; 58 l->l_next = from->n_link; 103 for (lprev = nleft->n_link; lprev && lprev->l_next; lprev = lprev->l_next) { 105 l = lprev->l_next; 106 lprev->l_next = l->l_next; /* disconnect */ 120 lnext = l->l_next; 254 lnext = l->l_next; 265 lnext = l->l_next; 273 for (lnext = l->l_next; lnext; lnext = l->l_next) { [all …]
|
/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/android_crazy_linker/src/src/ |
H A D | crazy_linker_rdebug.cpp | 217 if (!r_debug_->r_map || !r_debug_->r_map->l_next || in AddEntry() 218 !r_debug_->r_map->l_next->l_next) { in AddEntry() 228 link_map_t* before = r_debug_->r_map->l_next; in AddEntry() 229 link_map_t* after = before->l_next; in AddEntry() 233 entry->l_next = after; in AddEntry() 239 WriteLinkMapField(&before->l_next, entry); in AddEntry() 262 WriteLinkMapField(&entry->l_prev->l_next, entry->l_next); in DelEntry() 263 if (entry->l_next) in DelEntry() 264 WriteLinkMapField(&entry->l_next->l_prev, entry->l_prev); in DelEntry() 267 r_debug_->r_map = entry->l_next; in DelEntry() [all …]
|
/dports/devel/z88dk/z88dk/src/copt/ |
H A D | copt.c | 42 struct lnode *l_prev, *l_next; member 84 p1->l_next = p2; in connect() 183 head.l_next->l_prev = 0; in init() 194 if (head.l_next) in init() 196 p->o_new = head.l_next; in init() 425 psav = p->l_next; in rep() 440 return p1->l_next; in rep() 475 if (head.l_next == &tail) in copylist() 480 *sub = head.l_next; in copylist() 575 printlines(c->l_next, r->l_next, stderr); in opt() [all …]
|
/dports/editors/jove/jove/ |
H A D | delete.c | 70 retline->l_next = NULL; 72 retline->l_next = line1->l_next; 80 line1->l_next = line2->l_next; 81 if (line1->l_next) 82 line1->l_next->l_prev = line1; 85 line2->l_next = NULL; 96 LinePtr next = line1->l_next; 100 line1->l_next = line2->l_next; 101 if (line1->l_next) 102 line1->l_next->l_prev = line1; [all …]
|
H A D | insert.c | 52 newline->l_next = after->l_next; 53 after->l_next = newline; 55 if (newline->l_next != NULL) 494 fline = fline->l_next; 499 fline = fline->l_next; 600 line->l_next = ffline; 648 last = line2->l_next; 651 next = line1->l_next; 727 faline = lp->l_next; 729 lp->l_prev->l_next = lp->l_next; [all …]
|
/dports/graphics/blender/blender-2.91.0/source/blender/blenlib/intern/ |
H A D | freetypefont.c | 116 const int l_next = (k < n - 1) ? (l + 1) : l_first; in freetypechar_to_vchar() local 118 ftoutline.tags[l_next] == FT_Curve_Tag_Conic) { in freetypechar_to_vchar() 151 const int l_next = (k < n - 1) ? (l + 1) : l_first; in freetypechar_to_vchar() local 153 ftoutline.tags[l_next] == FT_Curve_Tag_Conic) { in freetypechar_to_vchar() 154 dx = (ftoutline.points[l].x + ftoutline.points[l_next].x) * scale / 2.0f; in freetypechar_to_vchar() 155 dy = (ftoutline.points[l].y + ftoutline.points[l_next].y) * scale / 2.0f; in freetypechar_to_vchar() 178 const int l_next = (k < n - 1) ? (l + 1) : l_first; in freetypechar_to_vchar() local 206 if (ftoutline.tags[l_next] == FT_Curve_Tag_Cubic) { in freetypechar_to_vchar() 207 bezt->vec[2][0] = ftoutline.points[l_next].x * scale; in freetypechar_to_vchar() 208 bezt->vec[2][1] = ftoutline.points[l_next].y * scale; in freetypechar_to_vchar() [all …]
|
/dports/news/nntp/nntp-1.5.12.2_10/xmit/ |
H A D | llist.c | 26 if (lp->l_next == (ll_t *)NULL) 28 l_free(lp->l_next); 52 lp->l_next = (ll_t *)(&lp->l_item[len]); 57 lp = lp->l_next; 58 lp->l_next = (ll_t *)NULL;
|
/dports/editors/mg/mg-6.9/ |
H A D | graph2.c | 94 if (e2->l_next == unused) in graph2_check_duplicates() 96 j = e2->l_next; in graph2_check_duplicates() 128 graph->edges[i].l_next = v->l_edge; in graph2_hash() 162 if (e->l_next != unused) in graph2_remove_vertex() 180 v2->l_edge = e->l_next; in graph2_remove_vertex() 182 graph->edges[e->l_prev].l_next = e->l_next; in graph2_remove_vertex() 183 if (e->l_next != unused) in graph2_remove_vertex() 184 graph->edges[e->l_next].l_prev = e->l_prev; in graph2_remove_vertex()
|
/dports/sysutils/linrename/util-linux-2.25.2/text-utils/ |
H A D | col.c | 92 LINE *l_next; /* next line */ member 317 lnew->l_next = l; in main() 331 for (; nmove > 0 && l->l_next; nmove--) in main() 332 l = l->l_next; in main() 336 l->l_next = lnew; in main() 374 for (; l->l_next; l = l->l_next) in main() 399 lines = l->l_next; in flush_lines() 561 l->l_next = l + 1; in alloc_line() 562 l->l_next = NULL; in alloc_line() 565 line_freelist = l->l_next; in alloc_line() [all …]
|
/dports/sysutils/heirloom/heirloom-070715/shl/ |
H A D | shl.c | 520 for (lp = l0; lp->l_next != NULL; lp = lp->l_next); in lalloc() 521 lp->l_next = l; in lalloc() 524 l->l_next = NULL; in lalloc() 540 l->l_prev->l_next = l->l_next; in lfree() 541 if (l->l_next) in lfree() 544 l0 = l->l_next; in lfree() 579 if (l->l_next) { in setcur() 581 l->l_prev->l_next = l->l_next; in setcur() 583 l0 = l->l_next; in setcur() 585 for (lp = l; lp->l_next; lp = lp->l_next); in setcur() [all …]
|
/dports/devel/util-linux/util-linux-2.36/text-utils/ |
H A D | col.c | 101 LINE *l_next; /* next line */ member 337 lnew->l_next = l; in main() 351 for (; nmove > 0 && l->l_next; nmove--) in main() 352 l = l->l_next; in main() 356 l->l_next = lnew; in main() 397 for (; l->l_next; l = l->l_next) in main() 424 lines = l->l_next; in flush_lines() 587 l->l_next = l + 1; in alloc_line() 588 l->l_next = NULL; in alloc_line() 591 line_freelist = l->l_next; in alloc_line() [all …]
|
/dports/graphics/blender/blender-2.91.0/source/blender/modifiers/intern/ |
H A D | MOD_laplaciansmooth.c | 241 const MLoop *l_term = l_next + mp->totloop; in init_laplacian_matrix() 245 for (; l_next != l_term; l_prev = l_curr, l_curr = l_next, l_next++) { in init_laplacian_matrix() 261 sys->ring_areas[l_next->v] += areaf; in init_laplacian_matrix() 272 sys->vweights[l_next->v] += w1 + w3; in init_laplacian_matrix() 295 const MLoop *l_term = l_next + mp->totloop; in fill_laplacian_matrix() 299 for (; l_next != l_term; l_prev = l_curr, l_curr = l_next, l_next++) { in fill_laplacian_matrix() 306 l_next->v, in fill_laplacian_matrix() 313 if (sys->numNeEd[l_next->v] == sys->numNeFa[l_next->v] && sys->zerola[l_next->v] == 0) { in fill_laplacian_matrix() 315 l_next->v, in fill_laplacian_matrix() 319 l_next->v, in fill_laplacian_matrix() [all …]
|
/dports/net-im/libpurple/pidgin-2.14.8/libpurple/plugins/perl/ |
H A D | perl-handlers.c | 459 GSList *l, *l_next; in purple_perl_timeout_remove() local 463 l_next = l->next; in purple_perl_timeout_remove() 478 GSList *l, *l_next; in purple_perl_timeout_clear_for_plugin() local 482 l_next = l->next; in purple_perl_timeout_clear_for_plugin() 541 GSList *l, *l_next; in purple_perl_signal_clear_for_plugin() local 544 l_next = l->next; in purple_perl_signal_clear_for_plugin() 670 GSList *l, *l_next; in purple_perl_cmd_clear_for_plugin() local 674 l_next = l->next; in purple_perl_cmd_clear_for_plugin() 818 GSList *l, *l_next; in purple_perl_prefs_disconnect_callback() local 822 l_next = l->next; in purple_perl_prefs_disconnect_callback() [all …]
|
/dports/net-im/pidgin/pidgin-2.14.8/libpurple/plugins/perl/ |
H A D | perl-handlers.c | 459 GSList *l, *l_next; in purple_perl_timeout_remove() local 463 l_next = l->next; in purple_perl_timeout_remove() 478 GSList *l, *l_next; in purple_perl_timeout_clear_for_plugin() local 482 l_next = l->next; in purple_perl_timeout_clear_for_plugin() 541 GSList *l, *l_next; in purple_perl_signal_clear_for_plugin() local 544 l_next = l->next; in purple_perl_signal_clear_for_plugin() 670 GSList *l, *l_next; in purple_perl_cmd_clear_for_plugin() local 674 l_next = l->next; in purple_perl_cmd_clear_for_plugin() 818 GSList *l, *l_next; in purple_perl_prefs_disconnect_callback() local 822 l_next = l->next; in purple_perl_prefs_disconnect_callback() [all …]
|
/dports/net-im/finch/pidgin-2.14.8/libpurple/plugins/perl/ |
H A D | perl-handlers.c | 459 GSList *l, *l_next; in purple_perl_timeout_remove() local 463 l_next = l->next; in purple_perl_timeout_remove() 478 GSList *l, *l_next; in purple_perl_timeout_clear_for_plugin() local 482 l_next = l->next; in purple_perl_timeout_clear_for_plugin() 541 GSList *l, *l_next; in purple_perl_signal_clear_for_plugin() local 544 l_next = l->next; in purple_perl_signal_clear_for_plugin() 670 GSList *l, *l_next; in purple_perl_cmd_clear_for_plugin() local 674 l_next = l->next; in purple_perl_cmd_clear_for_plugin() 818 GSList *l, *l_next; in purple_perl_prefs_disconnect_callback() local 822 l_next = l->next; in purple_perl_prefs_disconnect_callback() [all …]
|
/dports/sysutils/heirloom/heirloom-070715/logins/ |
H A D | logins.c | 79 struct login *l_next; /* next ptr in table */ member 218 for (lc = 1, lp = l0; lp->l_next; lp = lp->l_next, lc++); in report() 220 for (i = 0, lp = l0; i < lc; i++, lp = lp->l_next) in report() 235 for (l = l0; l; l = l->l_next) in duplicate() 268 for (lp = l0; lp; lp = lp->l_next) in userdel() 273 lprev->l_next = lp->l_next; in userdel() 275 l0 = lp->l_next; in userdel() 317 for (lp = l0; lp; lp = lp->l_next) { in usergroup() 359 for (lp = l0; lp; lp = lp->l_next) in findlogin() 436 lp->l_next = ln; in readpasswd() [all …]
|