Searched refs:rlink (Results 1 - 15 of 15) sorted by relevance

/freebsd-11-stable/contrib/wpa/src/ap/
H A Dvlan_util.c28 struct rtnl_link *rlink = NULL; local
59 err = rtnl_link_get_kernel(handle, 0, if_name, &rlink);
66 if_idx = rtnl_link_get_ifindex(rlink);
67 rtnl_link_put(rlink);
68 rlink = NULL;
70 err = rtnl_link_get_kernel(handle, 0, vlan_if_name, &rlink);
73 rtnl_link_put(rlink);
74 rlink = NULL;
81 rlink = rtnl_link_alloc();
82 if (!rlink) {
128 struct rtnl_link *rlink = NULL; local
[all...]
/freebsd-11-stable/lib/libc/stdlib/
H A Dtsearch.c74 leaf = &(*leaf)->rlink;
86 result->rlink = NULL;
101 n = n->rlink;
125 z = y->rlink;
126 y->rlink = z->llink;
128 x->llink = z->rlink;
129 z->rlink = x;
145 x->llink = y->rlink;
146 y->rlink = x;
153 y = x->rlink;
[all...]
H A Dtdelete.c42 ((*leaf)->balance < 0 && (*leaf)->rlink->balance == 0)) { \
66 leaf = &(*leaf)->rlink; \
109 *leaf = old->rlink;
118 while ((*leaf)->rlink != NULL)
138 y = x->rlink;
142 x->rlink = z->llink;
144 y->llink = z->rlink;
145 z->rlink = y;
153 x->rlink = y->llink;
175 z = y->rlink;
[all...]
H A Dtwalk.c31 if (root->llink == NULL && root->rlink == NULL)
38 if (root->rlink != NULL)
39 trecurse(root->rlink, action, level + 1);
H A Dtfind.c45 &(*rootp)->rlink; /* T4: follow right branch */
/freebsd-11-stable/crypto/heimdal/lib/roken/
H A Dtsearch.c24 struct node *llink, *rlink; member in struct:node
57 &(*rootp)->rlink; /* T4: follow right branch */
65 q->llink = q->rlink = NULL;
81 if (root->llink == NULL && root->rlink == NULL)
88 if (root->rlink != NULL)
89 trecurse(root->rlink, action, level + 1);
130 &(*rootp)->rlink; /* follow rlink branch */
134 r = (*rootp)->rlink; /* D1: */
144 r->llink = q->rlink;
[all...]
/freebsd-11-stable/usr.sbin/fmtree/
H A Dextern.h43 char *rlink(char *);
H A Dcompare.c321 strcmp(cp = rlink(p->fts_accpath), s->slink)) {
378 rlink(char *name) function
H A Dcreate.c268 output(indent, &offset, "link=%s", rlink(p->fts_accpath));
/freebsd-11-stable/gnu/usr.bin/grep/
H A Dkwset.c55 struct tree *rlink; /* Right link (to larger labels). */ member in struct:tree
162 dirs[depth++] = R, link = link->rlink;
175 link->rlink = 0;
194 links[depth]->rlink = link;
216 r = links[depth], t = r->llink, rl = t->rlink;
217 t->rlink = r, r->llink = rl;
221 r = links[depth], l = r->llink, t = l->rlink;
222 rl = t->rlink, lr = t->llink;
223 t->llink = l, l->rlink = lr, t->rlink
[all...]
/freebsd-11-stable/contrib/mtree/
H A Dextern.h76 const char *rlink(const char *);
H A Dcompare.c546 strcmp(cp = rlink(p->fts_accpath), s->slink)) {
567 rlink(const char *name) function
H A Dcreate.c304 vispath(rlink(p->fts_accpath)));
/freebsd-11-stable/include/
H A Dsearch.h39 struct __posix_tnode *llink, *rlink; member in struct:__posix_tnode
/freebsd-11-stable/lib/libc/tests/stdlib/
H A Dtsearch_test.c45 height_right = tnode_assert(n->rlink);

Completed in 112 milliseconds