Home
last modified time | relevance | path

Searched refs:llink (Results 1 – 8 of 8) sorted by relevance

/freebsd/crypto/heimdal/lib/roken/
H A Dtsearch.c24 struct node *llink, *rlink; member
56 &(*rootp)->llink : /* T3: follow left branch */ in rk_tsearch()
65 q->llink = q->rlink = NULL; in rk_tsearch()
81 if (root->llink == NULL && root->rlink == NULL) in trecurse()
85 if (root->llink != NULL) in trecurse()
86 trecurse(root->llink, action, level + 1); in trecurse()
129 &(*rootp)->llink : /* follow llink branch */ in rk_tdelete()
135 if ((q = (*rootp)->llink) == NULL) /* Left NULL? */ in rk_tdelete()
138 if (r->llink == NULL) { /* D2: Find successor */ in rk_tdelete()
139 r->llink = q; in rk_tdelete()
[all …]
/freebsd/lib/libc/stdlib/
H A Dtdelete.c52 leaf = &(*leaf)->llink; \
58 ((*leaf)->balance > 0 && (*leaf)->llink->balance == 0)) { \
103 if ((*leaf)->llink == NULL) { in tdelete()
119 *leaf = old->llink; in tdelete()
138 z = y->llink; in tdelete()
139 x->rlink = z->llink; in tdelete()
140 z->llink = x; in tdelete()
141 y->llink = z->rlink; in tdelete()
150 x->rlink = y->llink; in tdelete()
151 y->llink = x; in tdelete()
[all …]
H A Dtsearch.c68 leaf = &(*leaf)->llink; in tsearch()
82 result->llink = NULL; in tsearch()
95 n = n->llink; in tsearch()
109 y = x->llink; in tsearch()
123 y->rlink = z->llink; in tsearch()
124 z->llink = y; in tsearch()
125 x->llink = z->rlink; in tsearch()
142 x->llink = y->rlink; in tsearch()
163 posix_tnode *z = y->llink; in tsearch()
164 x->rlink = z->llink; in tsearch()
[all …]
H A Dtwalk.c29 if (root->llink == NULL && root->rlink == NULL) in trecurse()
33 if (root->llink != NULL) in trecurse()
34 trecurse(root->llink, action, level + 1); in trecurse()
H A Dtfind.c42 &(*rootp)->llink : /* T3: follow left branch */ in tfind()
/freebsd/contrib/ntp/libntp/
H A Dauthkeys.c27 DECL_DLIST_LINK(symkey, llink); /* for overall & free lists */
289 INIT_DLIST(key_listhead, llink); in init_auth()
309 while (NULL != (sk = HEAD_DLIST(key_listhead, llink))) { in free_auth_mem()
355 LINK_SLIST(authfreekeys, sk, llink.f); in auth_moremem()
462 ITER_DLIST_BEGIN(key_listhead, sk, llink, symkey) in auth_resize_hashtable()
495 UNLINK_HEAD_SLIST(sk, authfreekeys, llink.f); in allocsymkey()
505 LINK_TAIL_DLIST(key_listhead, sk, llink); in allocsymkey()
535 UNLINK_DLIST(sk, llink); in freesymkey()
538 LINK_SLIST(authfreekeys, sk, llink.f); in freesymkey()
829 ITER_DLIST_BEGIN(key_listhead, sk, llink, symke in auth_delkeys()
[all...]
/freebsd/include/
H A Dsearch.h38 struct __posix_tnode *llink, *rlink; member
/freebsd/lib/libc/tests/stdlib/
H A Dtsearch_test.c45 height_left = tnode_assert(n->llink); in tnode_assert()