| /src/crypto/external/bsd/heimdal/dist/lib/roken/ |
| tsearch.c | 26 struct node *llink, *rlink; member in struct:node
58 &(*rootp)->llink : /* T3: follow left branch */
67 q->llink = q->rlink = NULL;
83 if (root->llink == NULL && root->rlink == NULL)
87 if (root->llink != NULL)
88 trecurse(root->llink, action, level + 1);
130 &(*rootp)->llink : /* follow llink branch */
136 if ((q = (*rootp)->llink) == NULL) /* Left NULL? */
139 if (r->llink == NULL) { /* D2: Find successor *
[all...] |
| tsearch.c | 26 struct node *llink, *rlink; member in struct:node
58 &(*rootp)->llink : /* T3: follow left branch */
67 q->llink = q->rlink = NULL;
83 if (root->llink == NULL && root->rlink == NULL)
87 if (root->llink != NULL)
88 trecurse(root->llink, action, level + 1);
130 &(*rootp)->llink : /* follow llink branch */
136 if ((q = (*rootp)->llink) == NULL) /* Left NULL? */
139 if (r->llink == NULL) { /* D2: Find successor *
[all...] |
| tsearch.c | 26 struct node *llink, *rlink; member in struct:node
58 &(*rootp)->llink : /* T3: follow left branch */
67 q->llink = q->rlink = NULL;
83 if (root->llink == NULL && root->rlink == NULL)
87 if (root->llink != NULL)
88 trecurse(root->llink, action, level + 1);
130 &(*rootp)->llink : /* follow llink branch */
136 if ((q = (*rootp)->llink) == NULL) /* Left NULL? */
139 if (r->llink == NULL) { /* D2: Find successor *
[all...] |
| /src/include/ |
| search.h | 48 struct node *llink, *rlink; member in struct:node
|
| search.h | 48 struct node *llink, *rlink; member in struct:node
|
| search.h | 48 struct node *llink, *rlink; member in struct:node
|
| /src/sys/compat/linux/arch/powerpc/ |
| linux_machdep.h | 51 unsigned long llink; member in struct:linux_pt_regs
|
| linux_machdep.h | 51 unsigned long llink; member in struct:linux_pt_regs
|
| linux_machdep.h | 51 unsigned long llink; member in struct:linux_pt_regs
|
| /src/external/gpl2/gettext/dist/gettext-tools/libgrep/ |
| kwset.c | 54 struct tree *llink; /* Left link; MUST be first field. */ member in struct:tree
160 dirs[depth++] = L, link = link->llink;
174 link->llink = 0;
192 links[depth]->llink = 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...] |
| kwset.c | 54 struct tree *llink; /* Left link; MUST be first field. */ member in struct:tree
160 dirs[depth++] = L, link = link->llink;
174 link->llink = 0;
192 links[depth]->llink = 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...] |
| kwset.c | 54 struct tree *llink; /* Left link; MUST be first field. */ member in struct:tree
160 dirs[depth++] = L, link = link->llink;
174 link->llink = 0;
192 links[depth]->llink = 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 | 54 struct tree *llink; /* Left link; MUST be first field. */ member in struct:tree
160 dirs[depth++] = L, link = link->llink;
174 link->llink = 0;
192 links[depth]->llink = 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...] |
| kwset.c | 54 struct tree *llink; /* Left link; MUST be first field. */ member in struct:tree
160 dirs[depth++] = L, link = link->llink;
174 link->llink = 0;
192 links[depth]->llink = 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...] |
| kwset.c | 54 struct tree *llink; /* Left link; MUST be first field. */ member in struct:tree
160 dirs[depth++] = L, link = link->llink;
174 link->llink = 0;
192 links[depth]->llink = 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...] |
