Lines Matching defs:child
126 RBSTRUCT *child; \
129 child = rb_entry(node->RBFIELD.rb_left, RBSTRUCT, RBFIELD); \
130 if (child->RBAUGMENTED > max) \
131 max = child->RBAUGMENTED; \
134 child = rb_entry(node->RBFIELD.rb_right, RBSTRUCT, RBFIELD); \
135 if (child->RBAUGMENTED > max) \
136 max = child->RBAUGMENTED; \
190 struct rb_node *child = node->rb_right;
197 * Case 1: node to erase has no more than 1 child (easy!)
199 * Note that if there is one child it must be red due to 5)
205 __rb_change_child(node, child, parent, root);
206 if (child) {
207 child->__rb_parent_color = pc;
212 } else if (!child) {
213 /* Still case 1, but this time the child is node->rb_left */
220 struct rb_node *successor = child, *child2;
222 tmp = child->rb_left;
225 * Case 2: node's successor is its right child
240 * node's right child subtree
259 WRITE_ONCE(successor->rb_right, child);
260 rb_set_parent(child, successor);