Lines Matching defs:node
18 * 1) A node is either red or black
21 * 4) Both children of every red node are black
26 * consecutive red nodes in a path and every red node is therefore followed by
85 __rb_insert(struct rb_node *node, struct rb_root *root,
88 struct rb_node *parent = rb_red_parent(node), *gparent, *tmp;
92 * Loop invariant: node is red.
96 * The inserted node is root. Either this is the
97 * first node, or we recursed at Case 1 below and
100 rb_set_parent_color(node, NULL, RB_BLACK);
119 * Case 1 - node's uncle is red (color flips).
133 node = gparent;
134 parent = rb_parent(node);
135 rb_set_parent_color(node, parent, RB_RED);
140 if (node == tmp) {
142 * Case 2 - node's uncle is black and node is
154 tmp = node->rb_left;
156 WRITE_ONCE(node->rb_left, parent);
160 rb_set_parent_color(parent, node, RB_RED);
161 augment_rotate(parent, node);
162 parent = node;
163 tmp = node->rb_right;
167 * Case 3 - node's uncle is black and node is
189 node = gparent;
190 parent = rb_parent(node);
191 rb_set_parent_color(node, parent, RB_RED);
196 if (node == tmp) {
198 tmp = node->rb_right;
200 WRITE_ONCE(node->rb_right, parent);
204 rb_set_parent_color(parent, node, RB_RED);
205 augment_rotate(parent, node);
206 parent = node;
207 tmp = node->rb_left;
230 struct rb_node *node = NULL, *sibling, *tmp1, *tmp2;
235 * - node is black (or NULL on first iteration)
236 * - node is not the root (parent is not NULL)
237 * - All leaf paths going through parent and node have a
238 * black node count that is 1 lower than other leaf paths.
241 if (node != sibling) { /* node == parent->rb_left */
285 node = parent;
286 parent = rb_parent(node);
375 node = parent;
376 parent = rb_parent(node);
423 static inline void dummy_propagate(struct rb_node *node, struct rb_node *stop) {}
433 void rb_insert_color(struct rb_node *node, struct rb_root *root)
435 __rb_insert(node, root, dummy_rotate);
438 void rb_erase(struct rb_node *node, struct rb_root *root)
441 rebalance = __rb_erase_augmented(node, root, &dummy_callbacks);
453 void __rb_insert_augmented(struct rb_node *node, struct rb_root *root,
456 __rb_insert(node, root, augment_rotate);
460 * This function returns the first node (in sort order) of the tree.
486 struct rb_node *rb_next(const struct rb_node *node)
490 if (RB_EMPTY_NODE(node))
497 if (node->rb_right) {
498 node = node->rb_right;
499 while (node->rb_left)
500 node = node->rb_left;
501 return (struct rb_node *)node;
506 * so any 'next' node must be in the general direction of our parent.
509 * parent, said parent is our 'next' node.
511 while ((parent = rb_parent(node)) && node == parent->rb_right)
512 node = parent;
517 struct rb_node *rb_prev(const struct rb_node *node)
521 if (RB_EMPTY_NODE(node))
528 if (node->rb_left) {
529 node = node->rb_left;
530 while (node->rb_right)
531 node = node->rb_right;
532 return (struct rb_node *)node;
539 while ((parent = rb_parent(node)) && node == parent->rb_left)
540 node = parent;
561 static struct rb_node *rb_left_deepest_node(const struct rb_node *node)
564 if (node->rb_left)
565 node = node->rb_left;
566 else if (node->rb_right)
567 node = node->rb_right;
569 return (struct rb_node *)node;
573 struct rb_node *rb_next_postorder(const struct rb_node *node)
576 if (!node)
578 parent = rb_parent(node);
580 /* If we're sitting on node, we've already seen our children */
581 if (parent && node == parent->rb_left && parent->rb_right) {
582 /* If we are the parent's left node, go to the parent's right
583 * node then all the way down to the left */
586 /* Otherwise we are the parent's right node, and the parent