Lines Matching refs:leaf
41 if ((*leaf)->balance == 0 || \
42 ((*leaf)->balance < 0 && (*leaf)->rlink->balance == 0)) { \
51 base = leaf; \
55 leaf = &(*leaf)->llink; \
60 if ((*leaf)->balance == 0 || \
61 ((*leaf)->balance > 0 && (*leaf)->llink->balance == 0)) { \
62 base = leaf; \
66 leaf = &(*leaf)->rlink; \
74 node_t *root, **base, **leaf, *old, **n, *x, *y, *z;
84 * Find the leaf that needs to be removed. Return if we cannot
92 leaf = &root;
94 if (*leaf == NULL)
96 cmp = compar(key, (*leaf)->key);
98 result = &(*leaf)->key;
101 result = &(*leaf)->key;
109 if ((*leaf)->llink == NULL) {
111 old = *leaf;
112 *leaf = old->rlink;
119 void **keyp = &(*leaf)->key;
121 while ((*leaf)->rlink != NULL)
123 old = *leaf;
125 *leaf = old->llink;
137 for (n = base; n != leaf;) {