| /dports/science/mpqc/mpqc-2.3.1/src/lib/util/container/ |
| H A D | eavlmmap.h | 198 llink(r) = llink(node); in remove()
199 if (llink(r)) uplink(llink(r)) = r; in remove()
216 llink(r) = llink(node); in remove()
218 if (llink(r)) uplink(llink(r)) = r; in remove()
273 if (llink(n) && llink(n) == n) abort(); in check_node()
455 if (llink(B)) uplink(llink(B)) = B; in adjust_balance_insert()
485 if (llink(B)) uplink(llink(B)) = B; in adjust_balance_insert()
502 if (llink(A)) uplink(llink(A)) = A; in adjust_balance_insert()
532 if (llink(A)) uplink(llink(A)) = A; in adjust_balance_insert()
569 if (llink(B)) uplink(llink(B)) = B; in adjust_balance_remove()
[all …]
|
| /dports/devel/dwarfdump/dwarf-20161124/tsearch/ |
| H A D | dwarf_tsearchred.c | 395 e->llink = 0; in allocate_ts_entry()
405 if(h->llink) h->llink->color = BLACK; in flipcolors()
416 x->llink = h; in rotateleft()
440 if(isred(h->llink->llink)) { in moveredright()
502 if(isred(h->llink) && isred(h->llink->llink)) { in tsearch_insert()
591 if(h->llink) { h->llink->color = !h->llink->color; } in complementcolors()
604 if(isred(h->llink) && isred(h->llink->llink)) { h = rotateright(h); } in balance()
642 if(!isred(h->llink) && !isred(h->llink->llink)) { in deletemin()
645 h->llink = deletemin(h->llink); in deletemin()
674 if(!isred(h->llink) && (h->llink && !isred(h->llink->llink))) { in tdelete_inner()
[all …]
|
| H A D | dwarf_tsearchepp.c | 78 struct ts_entry * llink; member
138 return(t->llink); in getlink()
175 e->llink = 0; in allocate_ts_entry()
191 p->llink = e; in tsearch_insert_k()
415 r->llink = t->llink; in dwarf_tdelete()
427 s->llink = t->llink; in dwarf_tdelete()
436 l = t->llink; in dwarf_tdelete()
457 s->llink = t->llink; in dwarf_tdelete()
500 if(p->llink) { in dwarf_twalk_inner()
532 if(p->llink) { in dwarf_tdestroy_inner()
[all …]
|
| H A D | dwarf_tsearchbin.c | 74 struct ts_entry * llink; member
134 t->llink = x; in setlink()
144 return(t->llink); in getlink()
181 e->llink = 0; in allocate_ts_entry()
411 *q = t->llink; in dwarf_tdelete()
416 r->llink = t->llink; in dwarf_tdelete()
423 s = r->llink; in dwarf_tdelete()
428 s->llink = t->llink; in dwarf_tdelete()
474 if(p->llink) { in dwarf_twalk_inner()
506 if(p->llink) { in dwarf_tdestroy_inner()
[all …]
|
| /dports/devel/libdwarf/dwarf-20161124/tsearch/ |
| H A D | dwarf_tsearchred.c | 395 e->llink = 0; in allocate_ts_entry()
405 if(h->llink) h->llink->color = BLACK; in flipcolors()
416 x->llink = h; in rotateleft()
440 if(isred(h->llink->llink)) { in moveredright()
502 if(isred(h->llink) && isred(h->llink->llink)) { in tsearch_insert()
591 if(h->llink) { h->llink->color = !h->llink->color; } in complementcolors()
604 if(isred(h->llink) && isred(h->llink->llink)) { h = rotateright(h); } in balance()
642 if(!isred(h->llink) && !isred(h->llink->llink)) { in deletemin()
645 h->llink = deletemin(h->llink); in deletemin()
674 if(!isred(h->llink) && (h->llink && !isred(h->llink->llink))) { in tdelete_inner()
[all …]
|
| H A D | dwarf_tsearchepp.c | 78 struct ts_entry * llink; member
138 return(t->llink); in getlink()
175 e->llink = 0; in allocate_ts_entry()
191 p->llink = e; in tsearch_insert_k()
415 r->llink = t->llink; in dwarf_tdelete()
427 s->llink = t->llink; in dwarf_tdelete()
436 l = t->llink; in dwarf_tdelete()
457 s->llink = t->llink; in dwarf_tdelete()
500 if(p->llink) { in dwarf_twalk_inner()
532 if(p->llink) { in dwarf_tdestroy_inner()
[all …]
|
| H A D | dwarf_tsearchbin.c | 74 struct ts_entry * llink; member
134 t->llink = x; in setlink()
144 return(t->llink); in getlink()
181 e->llink = 0; in allocate_ts_entry()
411 *q = t->llink; in dwarf_tdelete()
416 r->llink = t->llink; in dwarf_tdelete()
423 s = r->llink; in dwarf_tdelete()
428 s->llink = t->llink; in dwarf_tdelete()
474 if(p->llink) { in dwarf_twalk_inner()
506 if(p->llink) { in dwarf_tdestroy_inner()
[all …]
|
| /dports/net/openmpi3/openmpi-3.1.6/ompi/mca/coll/libnbc/libdict/ |
| H A D | hb_tree.c | 25 hb_node *llink; member
124 node = node->llink ? node->llink : node->rlink; in hb_tree_empty()
336 for (out = node->rlink; out->llink; out = out->llink) in hb_tree_remove()
344 out = node->llink ? node->llink : node->rlink; in hb_tree_remove()
390 ASSERT(parent->llink->llink != NULL); in hb_tree_remove()
422 for (node = tree->root; node->llink; node = node->llink) in hb_tree_min()
573 l = node->llink ? node_height(node->llink) + 1 : 0; in node_height()
585 l = node->llink ? node_mheight(node->llink) + 1 : 0; in node_mheight()
669 llink = node->llink; in rot_right()
670 node->llink = llink->rlink; in rot_right()
[all …]
|
| /dports/net/openmpi/openmpi-4.1.1/ompi/mca/coll/libnbc/libdict/ |
| H A D | hb_tree.c | 25 hb_node *llink; member
123 node = node->llink ? node->llink : node->rlink; in hb_tree_empty()
329 for (out = node->rlink; out->llink; out = out->llink) in hb_tree_remove()
337 out = node->llink ? node->llink : node->rlink; in hb_tree_remove()
383 ASSERT(parent->llink->llink != NULL); in hb_tree_remove()
415 for (node = tree->root; node->llink; node = node->llink) in hb_tree_min()
566 l = node->llink ? node_height(node->llink) + 1 : 0; in node_height()
578 l = node->llink ? node_mheight(node->llink) + 1 : 0; in node_mheight()
662 llink = node->llink; in rot_right()
663 node->llink = llink->rlink; in rot_right()
[all …]
|
| /dports/multimedia/vlc/vlc-3.0.16/compat/ |
| H A D | tfind.c | 17 struct node *llink, *rlink; member
53 &(*rootp)->llink : /* follow llink branch */
63 r->llink = q;
66 for (q = r->llink; q->llink != NULL; q = r->llink)
68 r->llink = q->rlink;
69 q->llink = (*rootp)->llink;
97 if (root->llink != NULL) in tdestroy_recurse()
98 tdestroy_recurse(root->llink, free_action); in tdestroy_recurse()
203 q->llink = q->rlink = NULL;
232 if (root->llink == NULL && root->rlink == NULL)
[all …]
|
| /dports/www/libmicrohttpd/libmicrohttpd-0.9.74/src/lib/ |
| H A D | tsearch.c | 19 struct node *llink; member
45 &(*rootp)->llink : /* T3: follow left branch */ in tsearch()
54 q->llink = q->rlink = NULL; in tsearch()
79 &(*rootp)->llink : /* T3: follow left branch */ in tfind()
112 &(*rootp)->llink : /* follow llink branch */ in tdelete()
118 if ((q = (*rootp)->llink) == NULL) /* Left NULL? */ in tdelete()
124 if (r->llink == NULL) in tdelete()
126 r->llink = q; in tdelete()
131 for (q = r->llink; q->llink != NULL; q = r->llink) in tdelete()
133 r->llink = q->rlink; in tdelete()
[all …]
|
| /dports/www/libmicrohttpd/libmicrohttpd-0.9.74/src/microhttpd/ |
| H A D | tsearch.c | 25 struct node *llink; member
51 &(*rootp)->llink : /* T3: follow left branch */ in tsearch()
60 q->llink = q->rlink = NULL; in tsearch()
85 &(*rootp)->llink : /* T3: follow left branch */ in tfind()
118 &(*rootp)->llink : /* follow llink branch */ in tdelete()
124 if ((q = (*rootp)->llink) == NULL) /* Left NULL? */ in tdelete()
130 if (r->llink == NULL) in tdelete()
132 r->llink = q; in tdelete()
137 for (q = r->llink; q->llink != NULL; q = r->llink) in tdelete()
139 r->llink = q->rlink; in tdelete()
[all …]
|
| /dports/multimedia/musikcube/musikcube-0.96.7/src/3rdparty/win32_src/microhttpd/ |
| H A D | tsearch.c | 19 struct node *llink; member
45 &(*rootp)->llink : /* T3: follow left branch */ in tsearch()
54 q->llink = q->rlink = NULL; in tsearch()
79 &(*rootp)->llink : /* T3: follow left branch */ in tfind()
112 &(*rootp)->llink : /* follow llink branch */ in tdelete()
118 if ((q = (*rootp)->llink) == NULL) /* Left NULL? */ in tdelete()
124 if (r->llink == NULL) in tdelete()
126 r->llink = q; in tdelete()
131 for (q = r->llink; q->llink != NULL; q = r->llink) in tdelete()
133 r->llink = q->rlink; in tdelete()
[all …]
|
| /dports/devel/libcii/libcii-1.1/src/ |
| H A D | ring.c | 59 q = q->llink; in Ring_get()
76 q = q->llink; in Ring_put()
88 p->llink = q->llink; in Ring_addhi()
91 q->llink = p; in Ring_addhi()
122 q = q->llink; in Ring_add()
126 p->llink = q->llink; in Ring_add()
129 q->llink = p; in Ring_add()
149 q = q->llink; in Ring_remove()
155 q->rlink->llink = q->llink; in Ring_remove()
169 q->rlink->llink = q->llink; in Ring_remhi()
[all …]
|
| /dports/lang/eisl/eisl-2.35/cii/src/ |
| H A D | ring.c | 59 q = q->llink; in Ring_get()
76 q = q->llink; in Ring_put()
88 p->llink = q->llink; in Ring_addhi()
91 q->llink = p; in Ring_addhi()
122 q = q->llink; in Ring_add()
126 p->llink = q->llink; in Ring_add()
129 q->llink = p; in Ring_add()
149 q = q->llink; in Ring_remove()
155 q->rlink->llink = q->llink; in Ring_remove()
169 q->rlink->llink = q->llink; in Ring_remhi()
[all …]
|
| /dports/devel/tinygo/tinygo-0.14.1/lib/picolibc/newlib/libc/search/ |
| H A D | tdelete.c | 43 &(*rootp)->llink : /* follow llink branch */ in tdelete()
49 if ((q = (*rootp)->llink) == NULL) /* Left NULL? */ in tdelete()
52 if (r->llink == NULL) { /* D2: Find successor */ in tdelete()
53 r->llink = q; in tdelete()
56 for (q = r->llink; q->llink != NULL; q = r->llink) in tdelete()
58 r->llink = q->rlink; in tdelete()
59 q->llink = (*rootp)->llink; in tdelete()
|
| /dports/lang/zig-devel/zig-0.9.0/lib/libc/mingw/misc/ |
| H A D | tdelete.c | 41 &(*rootp)->llink : /* follow llink branch */ in tdelete()
47 if ((q = (*rootp)->llink) == NULL) /* Left NULL? */ in tdelete()
50 if (r->llink == NULL) { /* D2: Find successor */ in tdelete()
51 r->llink = q; in tdelete()
54 for (q = r->llink; q->llink != NULL; q = r->llink) in tdelete()
56 r->llink = q->rlink; in tdelete()
57 q->llink = (*rootp)->llink; in tdelete()
|
| /dports/devel/zpu-gcc/zpu-toolchain-1.0/toolchain/gcc/newlib/libc/search/ |
| H A D | tdelete.c | 44 &(*rootp)->llink : /* follow llink branch */
50 if ((q = (*rootp)->llink) == NULL) /* Left NULL? */
53 if (r->llink == NULL) { /* D2: Find successor */
54 r->llink = q;
57 for (q = r->llink; q->llink != NULL; q = r->llink)
59 r->llink = q->rlink;
60 q->llink = (*rootp)->llink;
|
| /dports/devel/arm-none-eabi-newlib/newlib-2.4.0/newlib/libc/search/ |
| H A D | tdelete.c | 44 &(*rootp)->llink : /* follow llink branch */
50 if ((q = (*rootp)->llink) == NULL) /* Left NULL? */
53 if (r->llink == NULL) { /* D2: Find successor */
54 r->llink = q;
57 for (q = r->llink; q->llink != NULL; q = r->llink)
59 r->llink = q->rlink;
60 q->llink = (*rootp)->llink;
|
| /dports/misc/rump/buildrump.sh-b914579/src/lib/libc/stdlib/ |
| H A D | tdelete.c | 43 &(*rootp)->llink : /* follow llink branch */ in tdelete()
49 if ((q = (*rootp)->llink) == NULL) /* Left NULL? */ in tdelete()
52 if (r->llink == NULL) { /* D2: Find successor */ in tdelete()
53 r->llink = q; in tdelete()
56 for (q = r->llink; q->llink != NULL; q = r->llink) in tdelete()
58 r->llink = q->rlink; in tdelete()
59 q->llink = (*rootp)->llink; in tdelete()
|
| /dports/lang/zig/zig-0.9.0/lib/libc/mingw/misc/ |
| H A D | tdelete.c | 41 &(*rootp)->llink : /* follow llink branch */ in tdelete()
47 if ((q = (*rootp)->llink) == NULL) /* Left NULL? */ in tdelete()
50 if (r->llink == NULL) { /* D2: Find successor */ in tdelete()
51 r->llink = q; in tdelete()
54 for (q = r->llink; q->llink != NULL; q = r->llink) in tdelete()
56 r->llink = q->rlink; in tdelete()
57 q->llink = (*rootp)->llink; in tdelete()
|
| /dports/devel/zpu-binutils/zpu-toolchain-1.0/toolchain/gcc/newlib/libc/search/ |
| H A D | tdelete.c | 44 &(*rootp)->llink : /* follow llink branch */
50 if ((q = (*rootp)->llink) == NULL) /* Left NULL? */
53 if (r->llink == NULL) { /* D2: Find successor */
54 r->llink = q;
57 for (q = r->llink; q->llink != NULL; q = r->llink)
59 r->llink = q->rlink; in __change_bit()
60 q->llink = (*rootp)->llink;
|
| /dports/x11-fm/fsv2/fsv2-1.1.0/debugloc/ |
| H A D | debug.c | 552 GList *llink; in debug_g_list_alloc() local
557 return llink; in debug_g_list_alloc()
565 GList *list2, *llink; in debug_g_list_prepend() local
572 llink = list2; in debug_g_list_prepend()
583 GList *list2, *llink; in debug_g_list_append() local
629 llink = list2; in debug_g_list_insert_sorted()
631 llink = g_list_find( llink, data ); in debug_g_list_insert_sorted()
634 llink = llink->next; in debug_g_list_insert_sorted()
649 if (llink == NULL) { in debug_g_list_remove()
696 llink = list; in debug_g_list_free()
[all …]
|
| /dports/x11/xloadimage/xloadimage.4.1/jpeg/ |
| H A D | jmemmgr.c | 223 small_ptr * llink; in free_small() local
229 llink = &small_list; in free_small()
233 llink = &( (*llink)->next ); in free_small()
235 *llink = hdr->next; in free_small()
304 llink = &( (*llink)->next ); in free_medium()
306 *llink = hdr->next; in free_medium()
413 llink = &( (*llink)->next ); in free_small_sarray()
415 *llink = hdr->next; in free_small_sarray()
521 llink = &( (*llink)->next ); in free_small_barray()
961 llink = &( (*llink)->next ); in free_big_sarray()
[all …]
|
| /dports/devel/libdwarf/dwarf-20161124/dwarfdump/ |
| H A D | dwarf_tsearchbal.c | 294 t->llink = x; in setlink()
318 e->llink = 0; in allocate_ts_entry()
441 head->llink = head->llink + 1; in tsearch_inner()
492 t->llink = p; in tsearch_inner()
620 s = r->llink; in rearrange_tree_so_p_llink_null()
637 s->llink = p->llink; in rearrange_tree_so_p_llink_null()
638 r->llink = p; in rearrange_tree_so_p_llink_null()
639 p->llink = 0; in rearrange_tree_so_p_llink_null()
758 r->llink = t->llink; in tdelete_inner()
934 if(p->llink) { in dwarf_twalk_inner()
[all …]
|