Searched refs:rb_left (Results 1 – 7 of 7) sorted by relevance
75 link = &parent->rb_left; in rb_add_augmented_cached()152 if (node->RBFIELD.rb_left) { \153 child = rb_entry(node->RBFIELD.rb_left, RBSTRUCT, RBFIELD); \199 if (parent->rb_left == old) in __rb_change_child()200 WRITE_ONCE(parent->rb_left, new); in __rb_change_child()212 if (parent->rb_left == old) in __rb_change_child_rcu()213 rcu_assign_pointer(parent->rb_left, new); in __rb_change_child_rcu()228 struct rb_node *tmp = node->rb_left; in __rb_erase_augmented()259 tmp = child->rb_left; in __rb_erase_augmented()292 tmp = tmp->rb_left; in __rb_erase_augmented()[all …]
63 node->rb_left = node->rb_right = NULL; in rb_link_node()72 node->rb_left = node->rb_right = NULL; in rb_link_node_rcu()175 link = &parent->rb_left; in rb_add_cached()204 link = &parent->rb_left; in rb_add()235 link = &parent->rb_left; in rb_find_add()271 link = &parent->rb_left; in rb_find_add_rcu()301 node = node->rb_left; in rb_find()332 node = rcu_dereference_raw(node->rb_left); in rb_find_rcu()363 node = node->rb_left; in rb_find_first()
8 struct rb_node *rb_left; member
52 link = &parent->ITRB.rb_left; \88 if (node->ITRB.rb_left) { \89 ITSTRUCT *left = rb_entry(node->ITRB.rb_left, \
90 link = &parent->rb_left; in __lt_insert()118 node = rcu_dereference_raw(node->rb_left); in __lt_find()
1136 tmp = tmp->rb_left; in kvm_memslot_iter_start()1800 node = node->rb_left; in search_memslots()
205 n = &(*n)->rb_left; \244 n = n->rb_left; \