| /src/external/bsd/wpa/dist/src/ap/ |
| vlan_util.c | 28 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...] |
| /src/lib/libc/stdlib/ |
| tdelete.c | 44 &(*rootp)->rlink; /* follow rlink branch */
48 r = (*rootp)->rlink; /* D1: */
58 r->llink = q->rlink;
60 q->rlink = (*rootp)->rlink;
|
| twalk.c | 34 if (root->llink == NULL && root->rlink == NULL)
41 if (root->rlink != NULL)
42 trecurse(root->rlink, action, level + 1);
|
| tsearch.c | 46 &(*rootp)->rlink; /* T4: follow right branch */
53 q->llink = q->rlink = NULL;
|
| tfind.c | 44 &(*rootp)->rlink; /* T4: follow right branch */
|
| /src/crypto/external/bsd/heimdal/dist/lib/roken/ |
| tsearch.c | 26 struct node *llink, *rlink; member in struct:node
59 &(*rootp)->rlink; /* T4: follow right branch */
67 q->llink = q->rlink = NULL;
83 if (root->llink == NULL && root->rlink == NULL)
90 if (root->rlink != NULL)
91 trecurse(root->rlink, action, level + 1);
131 &(*rootp)->rlink; /* follow rlink branch */
135 r = (*rootp)->rlink; /* D1: */
145 r->llink = q->rlink;
[all...] |
| /src/external/gpl2/gettext/dist/gettext-tools/libgrep/ |
| kwset.c | 55 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 = r, r->llink = rl
[all...] |
| /src/external/gpl2/grep/dist/src/ |
| kwset.c | 55 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 = r, r->llink = rl
[all...] |
| /src/include/ |
| search.h | 48 struct node *llink, *rlink; member in struct:node
|
| /src/usr.sbin/mtree/ |
| extern.h | 83 const char *rlink(const char *);
|
| compare.c | 551 strcmp(cp = rlink(p->fts_accpath), s->slink)) {
572 rlink(const char *name) function
|
| create.c | 303 vispath(rlink(p->fts_accpath)));
|
| /src/external/mpl/bind/dist/lib/ns/include/ns/ |
| client.h | 224 ISC_LINK(ns_client_t) rlink; member in struct:ns_client
|
| /src/external/mpl/bind/dist/lib/dns/ |
| dispatch.c | 112 ISC_LINK(dns_dispentry_t) rlink;
436 INSIST(!ISC_LINK_LINKED(resp, rlink));
726 ISC_LIST_APPEND(*resps, resp, rlink);
752 next = ISC_LIST_NEXT(resp, rlink);
753 ISC_LIST_UNLINK(*resps, resp, rlink);
1508 .rlink = ISC_LINK_INITIALIZER,
1932 ISC_LIST_APPEND(resps, resp, rlink);
1959 next = ISC_LIST_NEXT(resp, rlink);
1960 ISC_LIST_UNLINK(resps, resp, rlink);
|
| /src/external/mpl/bind/dist/lib/ns/ |
| client.c | 208 ISC_LIST_APPEND(client->manager->recursing, client, rlink);
220 ISC_LIST_UNLINK(client->manager->recursing, oldest, rlink);
244 if (ISC_LINK_LINKED(client, rlink)) {
246 rlink);
2582 ISC_LINK_INIT(client, rlink);
2664 client = ISC_LIST_NEXT(client, rlink))
2944 client = ISC_LIST_NEXT(client, rlink);
|
| query.c | 6557 if (ISC_LINK_LINKED(client, rlink)) {
6558 ISC_LIST_UNLINK(client->manager->recursing, client, rlink);
|
| /src/external/mpl/bind/dist/tests/ns/ |
| query_test.c | 956 INSIST(!ISC_LINK_LINKED(qctx->client, rlink));
|
