Home
last modified time | relevance | path

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

/freebsd-11-stable/crypto/heimdal/lib/roken/
HDtsearch.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-11-stable/lib/libc/stdlib/
HDtdelete.c55 leaf = &(*leaf)->llink; \
61 ((*leaf)->balance > 0 && (*leaf)->llink->balance == 0)) { \
106 if ((*leaf)->llink == NULL) { in tdelete()
122 *leaf = old->llink; in tdelete()
141 z = y->llink; in tdelete()
142 x->rlink = z->llink; in tdelete()
143 z->llink = x; in tdelete()
144 y->llink = z->rlink; in tdelete()
153 x->rlink = y->llink; in tdelete()
154 y->llink = x; in tdelete()
[all …]
HDtsearch.c71 leaf = &(*leaf)->llink; in tsearch()
85 result->llink = NULL; in tsearch()
98 n = n->llink; in tsearch()
112 y = x->llink; in tsearch()
126 y->rlink = z->llink; in tsearch()
127 z->llink = y; in tsearch()
128 x->llink = z->rlink; in tsearch()
145 x->llink = y->rlink; in tsearch()
166 posix_tnode *z = y->llink; in tsearch()
167 x->rlink = z->llink; in tsearch()
[all …]
HDtwalk.c31 if (root->llink == NULL && root->rlink == NULL) in trecurse()
35 if (root->llink != NULL) in trecurse()
36 trecurse(root->llink, action, level + 1); in trecurse()
HDtfind.c44 &(*rootp)->llink : /* T3: follow left branch */ in tfind()
/freebsd-11-stable/gnu/usr.bin/grep/
HDkwset.c54 struct tree *llink; /* Left link; MUST be first field. */ member
160 dirs[depth++] = L, link = link->llink; in kwsincr()
174 link->llink = 0; in kwsincr()
192 links[depth]->llink = link; in kwsincr()
216 r = links[depth], t = r->llink, rl = t->rlink; in kwsincr()
217 t->rlink = r, r->llink = rl; in kwsincr()
221 r = links[depth], l = r->llink, t = l->rlink; in kwsincr()
222 rl = t->rlink, lr = t->llink; in kwsincr()
223 t->llink = l, l->rlink = lr, t->rlink = r, r->llink = rl; in kwsincr()
236 l = links[depth], t = l->rlink, lr = t->llink; in kwsincr()
[all …]
/freebsd-11-stable/contrib/ntp/libntp/
HDauthkeys.c27 DECL_DLIST_LINK(symkey, llink); /* for overall & free lists */
290 INIT_DLIST(key_listhead, llink); in init_auth()
310 while (NULL != (sk = HEAD_DLIST(key_listhead, llink))) { in free_auth_mem()
356 LINK_SLIST(authfreekeys, sk, llink.f); in auth_moremem()
463 ITER_DLIST_BEGIN(key_listhead, sk, llink, symkey) in auth_resize_hashtable()
496 UNLINK_HEAD_SLIST(sk, authfreekeys, llink.f); in allocsymkey()
506 LINK_TAIL_DLIST(key_listhead, sk, llink); in allocsymkey()
536 UNLINK_DLIST(sk, llink); in freesymkey()
539 LINK_SLIST(authfreekeys, sk, llink.f); in freesymkey()
827 ITER_DLIST_BEGIN(key_listhead, sk, llink, symkey) in auth_delkeys()
[all …]
/freebsd-11-stable/bin/cp/
HDutils.c281 char llink[PATH_MAX]; in copy_link() local
288 if ((len = readlink(p->fts_path, llink, sizeof(llink) - 1)) == -1) { in copy_link()
292 llink[len] = '\0'; in copy_link()
297 if (symlink(llink, to.p_path)) { in copy_link()
298 warn("symlink: %s", llink); in copy_link()
/freebsd-11-stable/include/
HDsearch.h39 struct __posix_tnode *llink, *rlink; member
/freebsd-11-stable/lib/libc/tests/stdlib/
HDtsearch_test.c44 height_left = tnode_assert(n->llink); in tnode_assert()