Lines Matching refs:node
109 } *node; typedef
132 } *node; typedef
134 #define RED(N) (node)((N)->left_node & ((uintptr_t) 0x1))
137 #define SETNODEPTR(NP,P) (*NP) = (node)((((uintptr_t)(*NP)) \
139 #define LEFT(N) (node)((N)->left_node & ~((uintptr_t) 0x1))
140 #define LEFTPTR(N) (node *)(&(N)->left_node)
143 #define RIGHT(N) (node)((N)->right_node)
144 #define RIGHTPTR(N) (node *)(&(N)->right_node)
146 #define DEREFNODEPTR(NP) (node)((uintptr_t)(*(NP)) & ~((uintptr_t) 0x1))
160 check_tree_recurse (node p, int d_sofar, int d_total) in check_tree_recurse()
179 check_tree (node root) in check_tree()
182 node p; in check_tree()
204 maybe_split_for_insert (node *rootp, node *parentp, node *gparentp, in maybe_split_for_insert()
207 node root = DEREFNODEPTR(rootp); in maybe_split_for_insert()
208 node *rp, *lp; in maybe_split_for_insert()
209 node rpn, lpn; in maybe_split_for_insert()
230 node gp = DEREFNODEPTR(gparentp); in maybe_split_for_insert()
231 node p = DEREFNODEPTR(parentp); in maybe_split_for_insert()
292 node q, root; in __tsearch()
293 node *parentp = NULL, *gparentp = NULL; in __tsearch()
294 node *rootp = (node *) vrootp; in __tsearch()
295 node *nextp; in __tsearch()
373 node root; in weak_alias()
374 node *rootp = (node *) vrootp; in weak_alias()
405 node p, q, r, retval; in weak_alias()
407 node *rootp = (node *) vrootp; in weak_alias()
408 node root, unchained; in weak_alias()
414 node **nodestack = alloca (sizeof (node *) * stacksize); in weak_alias()
429 node **newstack; in weak_alias()
431 newstack = alloca (sizeof (node *) * stacksize); in weak_alias()
432 nodestack = memcpy (newstack, nodestack, sp * sizeof (node *)); in weak_alias()
469 node *parentp = rootp, *up = RIGHTPTR(root); in weak_alias()
470 node upn; in weak_alias()
475 node **newstack; in weak_alias()
477 newstack = alloca (sizeof (node *) * stacksize); in weak_alias()
478 nodestack = memcpy (newstack, nodestack, sp * sizeof (node *)); in weak_alias()
519 node *pp = nodestack[sp - 1]; in weak_alias()
580 node q2 = LEFT(q); in weak_alias()
641 node q2 = RIGHT(q); in weak_alias()
713 CHECK_TREE ((node) root); in __twalk()
749 CHECK_TREE ((node) root); in __twalk_r()
760 tdestroy_recurse (node root, __free_fn_t freefct) in weak_alias()
774 node root = (node) vroot; in __tdestroy()