Lines Matching refs:root
31 * 2) The root is black
34 * 5) Every simple path from root to leaves contains the same number
64 struct rb_root *root, int color)
69 __rb_change_child(old, new, parent, root);
73 __rb_insert(struct rb_node *node, struct rb_root *root,
84 * want a red root or two consecutive red nodes.
156 __rb_rotate_set_parents(gparent, parent, root, RB_RED);
190 __rb_rotate_set_parents(gparent, parent, root, RB_RED);
202 ____rb_erase_color(struct rb_node *parent, struct rb_root *root,
211 * - node is not the root (parent is not NULL)
230 __rb_rotate_set_parents(parent, sibling, root,
305 __rb_rotate_set_parents(parent, sibling, root,
316 __rb_rotate_set_parents(parent, sibling, root,
355 __rb_rotate_set_parents(parent, sibling, root,
364 void __rb_erase_color(struct rb_node *parent, struct rb_root *root,
367 ____rb_erase_color(parent, root, augment_rotate);
386 void rb_insert_color(struct rb_node *node, struct rb_root *root)
388 __rb_insert(node, root, dummy_rotate);
392 void rb_erase(struct rb_node *node, struct rb_root *root)
395 rebalance = __rb_erase_augmented(node, root, &dummy_callbacks);
397 ____rb_erase_color(rebalance, root, dummy_rotate);
408 void __rb_insert_augmented(struct rb_node *node, struct rb_root *root,
411 __rb_insert(node, root, augment_rotate);
418 struct rb_node *rb_first(const struct rb_root *root)
422 n = root->rb_node;
431 struct rb_node *rb_last(const struct rb_root *root)
435 n = root->rb_node;
506 struct rb_root *root)
511 __rb_change_child(victim, new, parent, root);
553 struct rb_node *rb_first_postorder(const struct rb_root *root)
555 if (!root->rb_node)
558 return rb_left_deepest_node(root->rb_node);
