Lines Matching refs:node
30 void (*propagate)(struct rb_node *node, struct rb_node *stop);
35 extern void __rb_insert_augmented(struct rb_node *node, struct rb_root *root,
49 rb_insert_augmented(struct rb_node *node, struct rb_root *root, in rb_insert_augmented() argument
52 __rb_insert_augmented(node, root, augment->rotate); in rb_insert_augmented()
56 rb_insert_augmented_cached(struct rb_node *node, in rb_insert_augmented_cached() argument
61 root->rb_leftmost = node; in rb_insert_augmented_cached()
62 rb_insert_augmented(node, &root->rb_root, augment); in rb_insert_augmented_cached()
82 RBSTRUCT *node = rb_entry(rb, RBSTRUCT, RBFIELD); \
83 if (RBCOMPUTE(node, true)) \
85 rb = rb_parent(&node->RBFIELD); \
124 static inline bool RBNAME ## _compute_max(RBSTRUCT *node, bool exit) \
127 RBTYPE max = RBCOMPUTE(node); \
128 if (node->RBFIELD.rb_left) { \
129 child = rb_entry(node->RBFIELD.rb_left, RBSTRUCT, RBFIELD); \
133 if (node->RBFIELD.rb_right) { \
134 child = rb_entry(node->RBFIELD.rb_right, RBSTRUCT, RBFIELD); \
138 if (exit && node->RBAUGMENTED == max) \
140 node->RBAUGMENTED = max; \
187 __rb_erase_augmented(struct rb_node *node, struct rb_root *root, in __rb_erase_augmented() argument
190 struct rb_node *child = node->rb_right; in __rb_erase_augmented()
191 struct rb_node *tmp = node->rb_left; in __rb_erase_augmented()
203 pc = node->__rb_parent_color; in __rb_erase_augmented()
205 __rb_change_child(node, child, parent, root); in __rb_erase_augmented()
214 tmp->__rb_parent_color = pc = node->__rb_parent_color; in __rb_erase_augmented()
216 __rb_change_child(node, tmp, parent, root); in __rb_erase_augmented()
236 augment->copy(node, successor); in __rb_erase_augmented()
262 augment->copy(node, successor); in __rb_erase_augmented()
266 tmp = node->rb_left; in __rb_erase_augmented()
270 pc = node->__rb_parent_color; in __rb_erase_augmented()
272 __rb_change_child(node, successor, tmp, root); in __rb_erase_augmented()
291 rb_erase_augmented(struct rb_node *node, struct rb_root *root, in rb_erase_augmented() argument
294 struct rb_node *rebalance = __rb_erase_augmented(node, root, augment); in rb_erase_augmented()
300 rb_erase_augmented_cached(struct rb_node *node, struct rb_root_cached *root, in rb_erase_augmented_cached() argument
303 if (root->rb_leftmost == node) in rb_erase_augmented_cached()
304 root->rb_leftmost = rb_next(node); in rb_erase_augmented_cached()
305 rb_erase_augmented(node, &root->rb_root, augment); in rb_erase_augmented_cached()