Lines Matching refs:rb_node

49 tree implementations.  Instead of using pointers to separate rb_node and data
50 structures, each instance of struct rb_node is embedded in the data structure
59 Data nodes in an rbtree tree are structures containing a struct rb_node member:
62   	struct rb_node node;
66 When dealing with a pointer to the embedded struct rb_node, the containing data
85   	struct rb_node *node = root->rb_node;
117   	struct rb_node **new = &(root->rb_node), *parent = NULL;
145   void rb_erase(struct rb_node *victim, struct rb_root *tree);
158   void rb_replace_node(struct rb_node *old, struct rb_node *new,
171   struct rb_node *rb_first(struct rb_root *tree);
172   struct rb_node *rb_last(struct rb_root *tree);
173   struct rb_node *rb_next(struct rb_node *node);
174   struct rb_node *rb_prev(struct rb_node *node);
182 The iterator functions return a pointer to the embedded struct rb_node, from
189   struct rb_node *node;
270 	if (!root->rb_node)
272 	node = rb_entry(root->rb_node, struct interval_tree_node, rb);
327 static void augment_propagate(struct rb_node *rb, struct rb_node *stop)
340 static void augment_copy(struct rb_node *rb_old, struct rb_node *rb_new)
350 static void augment_rotate(struct rb_node *rb_old, struct rb_node *rb_new)
368 	struct rb_node **link = &root->rb_node, *rb_parent = NULL;