D | tsearch.c | 115 #define LEFT(N) (N)->left_node macro 139 #define LEFT(N) (node)((N)->left_node & ~((uintptr_t) 0x1)) macro 168 check_tree_recurse (LEFT(p), d_sofar + (LEFT(p) && !RED(LEFT(p))), in check_tree_recurse() 172 if (LEFT(p)) in check_tree_recurse() 173 assert (!(RED(LEFT(p)) && RED(p))); in check_tree_recurse() 186 for(p = LEFT(root); p; p = LEFT(p)) in check_tree() 213 lpn = LEFT(root); in maybe_split_for_insert() 278 SETRIGHT(gp,LEFT(p)); in maybe_split_for_insert() 440 root = LEFT(p); in weak_alias() 463 q = LEFT(root); in weak_alias() [all …]
|