Home
last modified time | relevance | path

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

/include/linux/
A Drbtree.h63 node->rb_left = node->rb_right = NULL; in rb_link_node()
72 node->rb_left = node->rb_right = NULL; in rb_link_node_rcu()
177 link = &parent->rb_right; in rb_add_cached()
206 link = &parent->rb_right; in rb_add()
238 link = &parent->rb_right; in rb_find_add_cached()
274 link = &parent->rb_right; in rb_find_add()
310 link = &parent->rb_right; in rb_find_add_rcu()
340 node = node->rb_right; in rb_find()
371 node = rcu_dereference_raw(node->rb_right); in rb_find_rcu()
402 node = node->rb_right; in rb_find_first()
A Drbtree_augmented.h77 link = &parent->rb_right; in rb_add_augmented_cached()
157 if (node->RBFIELD.rb_right) { \
158 child = rb_entry(node->RBFIELD.rb_right, RBSTRUCT, RBFIELD); \
202 WRITE_ONCE(parent->rb_right, new); in __rb_change_child()
215 rcu_assign_pointer(parent->rb_right, new); in __rb_change_child_rcu()
227 struct rb_node *child = node->rb_right; in __rb_erase_augmented()
271 child2 = successor->rb_right; in __rb_erase_augmented()
294 child2 = successor->rb_right; in __rb_erase_augmented()
296 WRITE_ONCE(successor->rb_right, child); in __rb_erase_augmented()
A Dinterval_tree_generic.h54 link = &parent->ITRB.rb_right; \
107 node = rb_entry(node->ITRB.rb_right, ITSTRUCT, ITRB); \
150 struct rb_node *rb = node->ITRB.rb_right, *prev; \
174 rb = node->ITRB.rb_right; \
A Drbtree_types.h7 struct rb_node *rb_right; member
A Drbtree_latch.h92 link = &parent->rb_right; in __lt_insert()
120 node = rcu_dereference_raw(node->rb_right); in __lt_find()
A Dkvm_host.h1139 tmp = tmp->rb_right; in kvm_memslot_iter_start()
1808 node = node->rb_right; in search_memslots()
/include/linux/ceph/
A Dlibceph.h207 n = &(*n)->rb_right; \
246 n = n->rb_right; \

Completed in 17 milliseconds