Home
last modified time | relevance | path

Searched refs:rb_right (Results 1 – 5 of 5) sorted by relevance

/include/linux/
Dinterval_tree_generic.h54 link = &parent->ITRB.rb_right; \
107 if (node->ITRB.rb_right) { \
108 node = rb_entry(node->ITRB.rb_right, \
154 struct rb_node *rb = node->ITRB.rb_right, *prev; \
178 rb = node->ITRB.rb_right; \
Drbtree_augmented.h131 if (node->RBFIELD.rb_right) { \
132 child = rb_entry(node->RBFIELD.rb_right, RBSTRUCT, RBFIELD); \
176 WRITE_ONCE(parent->rb_right, new); in __rb_change_child()
189 rcu_assign_pointer(parent->rb_right, new); in __rb_change_child_rcu()
201 struct rb_node *child = node->rb_right; in __rb_erase_augmented()
245 child2 = successor->rb_right; in __rb_erase_augmented()
268 child2 = successor->rb_right; in __rb_erase_augmented()
270 WRITE_ONCE(successor->rb_right, child); in __rb_erase_augmented()
Drbtree.h26 struct rb_node *rb_right; member
73 node->rb_left = node->rb_right = NULL; in rb_link_node()
82 node->rb_left = node->rb_right = NULL; in rb_link_node_rcu()
Drbtree_latch.h92 link = &parent->rb_right; in __lt_insert()
120 node = rcu_dereference_raw(node->rb_right); in __lt_find()
/include/linux/ceph/
Dlibceph.h207 n = &(*n)->rb_right; \
240 n = n->rb_right; \