Home
last modified time | relevance | path

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

/titanic_50/usr/src/lib/libc/port/gen/
H A Dtsearch.c55 typedef struct node { char *key; struct node *llink, *rlink; } NODE; member
75 &(*rootp)->llink : /* T3: Take left branch */ in tsearch()
82 q->llink = q->rlink = NULL; in tsearch()
103 &(*rootp)->llink : /* Take left branch */ in tdelete()
109 if ((q = (*rootp)->llink) == NULL) /* Llink NULL? */ in tdelete()
112 if (r->llink == NULL) { /* D2: Find successor */ in tdelete()
113 r->llink = q; in tdelete()
116 for (q = r->llink; q->llink != NULL; q = r->llink) in tdelete()
118 r->llink = q->rlink; in tdelete()
119 q->llink = (*rootp)->llink; in tdelete()
[all …]
H A Dtfind.c48 typedef struct node { void *key; struct node *llink, *rlink; } NODE; member
70 &(*rootp)->llink : /* T3: Take left branch */ in tfind()
/titanic_50/usr/src/lib/libbc/libc/gen/common/
H A Dtsearch.c41 typedef struct node { POINTER key; struct node *llink, *rlink; } NODE; member
63 &(*rootp)->llink : /* T3: Take left branch */ in tsearch()
70 q->llink = q->rlink = NULL; in tsearch()
96 &(*rootp)->llink : /* Take left branch */ in tdelete()
102 if ((q = (*rootp)->llink) == NULL) /* Llink NULL? */ in tdelete()
105 if (r->llink == NULL) { /* D2: Find successor */ in tdelete()
106 r->llink = q; in tdelete()
109 for (q = r->llink; q->llink != NULL; q = r->llink) in tdelete()
111 r->llink = q->rlink; in tdelete()
112 q->llink = (*rootp)->llink; in tdelete()
[all …]
H A Dtfind.c37 typedef struct node { POINTER key; struct node *llink, *rlink; } NODE; member
56 &(*rootp)->llink : /* T3: Take left branch */
/titanic_50/usr/src/lib/libslp/clib/
H A Dslp_search.c55 struct node { char *key; struct node *llink, *rlink; }; member
62 if (root->llink == NULL && root->rlink == NULL) in slp_twalk()
66 if (root->llink != NULL) in slp_twalk()
67 slp_twalk(root->llink, action, level + 1, cookie); in slp_twalk()
88 &(*rootp)->llink : /* T3: Take left branch */ in slp_tsearch()
95 q->llink = q->rlink = NULL; in slp_tsearch()
111 &(*rootp)->llink : /* T3: Take left branch */ in slp_tfind()
/titanic_50/usr/src/lib/libast/common/cdt/
H A Ddttree.c148 { llink(l,t);
157 llink(l,t);
162 llink(l,root);
188 { llink(l,t);
205 llink(l,t);
210 { llink(l,root);
216 llink(l,root);
222 { llink(l,root);
H A Ddthdr.h71 #define llink(l,x) ((l) = (l)->right = (x) ) macro
/titanic_50/usr/src/cmd/cpio/
H A Dcpio.c311 struct sl_info *llink; /* Left subtree ptr (tree depth in *sl_head) */ member
9093 head->llink = NULL; in sl_insert()
9101 p->llink = NULL; in sl_insert()
9117 q = p->llink; in sl_insert()
9121 p->llink = q; in sl_insert()
9160 q->llink = q->rlink = NULL; in sl_insert()
9166 r = p = s->llink; in sl_insert()
9175 p = p->llink; in sl_insert()
9198 head->llink = (sl_info_t *)((int)head->llink + 1); in sl_insert()
9215 s->llink = r->rlink; in sl_insert()
[all …]