Home
last modified time | relevance | path

Searched refs:rb_node (Results 1 – 2 of 2) sorted by relevance

/include/linux/
A Drbtree.h24 struct rb_node { struct
26 struct rb_node *rb_right; argument
27 struct rb_node *rb_left; argument
32 struct rb_node *rb_node; member
40 #define RB_EMPTY_ROOT(root) ((root)->rb_node == NULL)
52 extern struct rb_node *rb_next(const struct rb_node *);
53 extern struct rb_node *rb_prev(const struct rb_node *);
59 extern struct rb_node *rb_next_postorder(const struct rb_node *);
62 extern void rb_replace_node(struct rb_node *victim, struct rb_node *new,
65 static inline void rb_link_node(struct rb_node * node, struct rb_node * parent, in rb_link_node()
[all …]
A Drbtree_augmented.h26 void (*propagate)(struct rb_node *node, struct rb_node *stop);
27 void (*copy)(struct rb_node *old, struct rb_node *new);
28 void (*rotate)(struct rb_node *old, struct rb_node *new);
32 void (*augment_rotate)(struct rb_node *old, struct rb_node *new));
43 rbname ## _propagate(struct rb_node *rb, struct rb_node *stop) \
55 rbname ## _copy(struct rb_node *rb_old, struct rb_node *rb_new) \
62 rbname ## _rotate(struct rb_node *rb_old, struct rb_node *rb_new) \
85 static inline void rb_set_parent(struct rb_node *rb, struct rb_node *p) in rb_set_parent()
97 __rb_change_child(struct rb_node *old, struct rb_node *new, in __rb_change_child()
106 root->rb_node = new; in __rb_change_child()
[all …]

Completed in 7 milliseconds