Home
last modified time | relevance | path

Searched refs:rb_left (Results 1 – 25 of 234) sorted by relevance

12345678910

/linux/tools/lib/
A Drbtree.c154 tmp = node->rb_left; in __rb_insert()
195 tmp = parent->rb_left; in __rb_insert()
207 tmp = node->rb_left; in __rb_insert()
469 while (n->rb_left) in rb_first()
470 n = n->rb_left; in rb_first()
499 while (node->rb_left) in rb_next()
500 node = node->rb_left; in rb_next()
528 if (node->rb_left) { in rb_prev()
529 node = node->rb_left; in rb_prev()
554 if (victim->rb_left) in rb_replace_node()
[all …]
/linux/lib/
A Drbtree.c154 tmp = node->rb_left; in __rb_insert()
195 tmp = parent->rb_left; in __rb_insert()
207 tmp = node->rb_left; in __rb_insert()
473 while (n->rb_left) in rb_first()
474 n = n->rb_left; in rb_first()
505 while (node->rb_left) in rb_next()
535 if (node->rb_left) { in rb_prev()
536 node = node->rb_left; in rb_prev()
562 if (victim->rb_left) in rb_replace_node()
579 if (victim->rb_left) in rb_replace_node_rcu()
[all …]
A Drbtree_test.c40 new = &parent->rb_left; in insert()
58 new = &parent->rb_left; in insert_cached()
99 new = &parent->rb.rb_left; in RB_DECLARE_CALLBACKS_MAX()
124 new = &parent->rb.rb_left; in insert_augmented_cached()
205 WARN_ON_ONCE((!rb->rb_left || !rb->rb_right) && in check()
226 if (node->rb.rb_left) { in check_augmented()
227 subtree = rb_entry(node->rb.rb_left, struct test_node, in check_augmented()
/linux/include/linux/
A Drbtree_augmented.h126 if (node->RBFIELD.rb_left) { \
173 if (parent->rb_left == old) in __rb_change_child()
174 WRITE_ONCE(parent->rb_left, new); in __rb_change_child()
186 if (parent->rb_left == old) in __rb_change_child_rcu()
187 rcu_assign_pointer(parent->rb_left, new); in __rb_change_child_rcu()
202 struct rb_node *tmp = node->rb_left; in __rb_erase_augmented()
233 tmp = child->rb_left; in __rb_erase_augmented()
266 tmp = tmp->rb_left; in __rb_erase_augmented()
269 WRITE_ONCE(parent->rb_left, child2); in __rb_erase_augmented()
277 tmp = node->rb_left; in __rb_erase_augmented()
[all …]
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()
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()
265 node = node->rb_left; in rb_find()
296 node = node->rb_left; in rb_find_first()
A Dinterval_tree_generic.h52 link = &parent->ITRB.rb_left; \
88 if (node->ITRB.rb_left) { \
89 ITSTRUCT *left = rb_entry(node->ITRB.rb_left, \
A Drbtree_latch.h90 link = &parent->rb_left; in __lt_insert()
118 node = rcu_dereference_raw(node->rb_left); in __lt_find()
/linux/drivers/block/drbd/
A Ddrbd_interval.c40 new = &(*new)->rb_left; in drbd_insert_interval()
44 new = &(*new)->rb_left; in drbd_insert_interval()
79 node = node->rb_left; in drbd_contains_interval()
83 node = node->rb_left; in drbd_contains_interval()
126 if (node->rb_left && in drbd_find_overlap()
127 sector < interval_end(node->rb_left)) { in drbd_find_overlap()
129 node = node->rb_left; in drbd_find_overlap()
/linux/tools/include/linux/
A Drbtree_augmented.h128 if (node->RBFIELD.rb_left) { \
129 child = rb_entry(node->RBFIELD.rb_left, RBSTRUCT, RBFIELD); \
175 if (parent->rb_left == old) in __rb_change_child()
176 WRITE_ONCE(parent->rb_left, new); in __rb_change_child()
191 struct rb_node *tmp = node->rb_left; in __rb_erase_augmented()
222 tmp = child->rb_left; in __rb_erase_augmented()
255 tmp = tmp->rb_left; in __rb_erase_augmented()
258 WRITE_ONCE(parent->rb_left, child2); in __rb_erase_augmented()
266 tmp = node->rb_left; in __rb_erase_augmented()
267 WRITE_ONCE(successor->rb_left, tmp); in __rb_erase_augmented()
A Drbtree.h26 struct rb_node *rb_left; member
70 node->rb_left = node->rb_right = NULL; in rb_link_node()
188 link = &parent->rb_left; in rb_add_cached()
215 link = &parent->rb_left; in rb_add()
246 link = &parent->rb_left; in rb_find_add()
276 node = node->rb_left; in rb_find()
307 node = node->rb_left; in rb_find_first()
/linux/net/netfilter/
A Dnft_set_rbtree.c68 parent = rcu_dereference_raw(parent->rb_left); in __nft_rbtree_lookup()
79 parent = rcu_dereference_raw(parent->rb_left); in __nft_rbtree_lookup()
89 parent = rcu_dereference_raw(parent->rb_left); in __nft_rbtree_lookup()
150 parent = rcu_dereference_raw(parent->rb_left); in __nft_rbtree_get()
176 parent = rcu_dereference_raw(parent->rb_left); in __nft_rbtree_get()
291 p = &parent->rb_left; in __nft_rbtree_insert()
335 p = &parent->rb_left; in __nft_rbtree_insert()
352 p = &parent->rb_left; in __nft_rbtree_insert()
437 parent = parent->rb_left; in nft_rbtree_deactivate()
443 parent = parent->rb_left; in nft_rbtree_deactivate()
[all …]
/linux/block/
A Dbfq-wf2q.c379 node = &parent->rb_left; in bfq_insert()
425 bfq_update_min(entity, node->rb_left); in bfq_update_active_node()
451 else if (parent->rb_left) in bfq_update_active_tree()
482 if (node->rb_left) in bfq_active_insert()
483 node = node->rb_left; in bfq_active_insert()
549 if (!node->rb_right && !node->rb_left) in bfq_find_deepest()
552 deepest = node->rb_left; in bfq_find_deepest()
553 else if (!node->rb_left) in bfq_find_deepest()
1359 if (node->rb_left) { in bfq_first_active_entity()
1360 entry = rb_entry(node->rb_left, in bfq_first_active_entity()
[all …]
/linux/drivers/gpu/drm/
A Ddrm_vma_manager.c160 iter = iter->rb_left; in drm_vma_offset_lookup_locked()
290 iter = &(*iter)->rb_left; in drm_vma_node_allow()
345 iter = iter->rb_left; in drm_vma_node_revoke()
382 iter = iter->rb_left; in drm_vma_node_is_allowed()
A Ddrm_mm.c200 link = &parent->rb.rb_left; in drm_mm_interval_tree_add_node()
230 link = &rb->rb_left; in insert_hole_size()
257 link = &parent->rb_hole_addr.rb_left; in RB_DECLARE_CALLBACKS_MAX()
318 rb = rb->rb_left; in best_hole()
345 rb = node->rb_hole_addr.rb_left; in find_hole_addr()
410 DECLARE_NEXT_HOLE_ADDR(next_hole_high_addr, rb_left, rb_right) in DECLARE_NEXT_HOLE_ADDR() argument
411 DECLARE_NEXT_HOLE_ADDR(next_hole_low_addr, rb_right, rb_left) in DECLARE_NEXT_HOLE_ADDR()
/linux/mm/
A Dinterval_tree.c46 while (parent->shared.rb.rb_left) { in vma_interval_tree_insert_after()
47 parent = rb_entry(parent->shared.rb.rb_left, in vma_interval_tree_insert_after()
52 link = &parent->shared.rb.rb_left; in vma_interval_tree_insert_after()
/linux/tools/perf/util/
A Dblock-range.c44 p = &parent->rb_left; in block_range__find()
56 struct rb_node **p = &node->rb_left; in rb_link_left_of_node()
69 p = &node->rb_left; in rb_link_right_of_node()
93 p = &parent->rb_left; in block_range__create()
A Drblist.c26 p = &(*p)->rb_left; in rblist__add_node()
68 p = &(*p)->rb_left; in __rblist__findnew()
/linux/arch/arm/xen/
A Dp2m.c48 link = &(*link)->rb_left; in xen_add_phys_to_mach_entry()
80 n = n->rb_left; in __pfn_to_mfn()
169 n = n->rb_left; in __set_phys_to_machine_multi()
/linux/fs/btrfs/
A Dmisc.h82 node = node->rb_left; in rb_simple_search()
103 p = &(*p)->rb_left; in rb_simple_insert()
/linux/fs/xfs/
A Dxfs_extent_busy.c52 rbp = &(*rbp)->rb_left; in xfs_extent_busy_insert()
98 rbp = rbp->rb_left; in xfs_extent_busy_search()
294 rbp = rbp->rb_left; in xfs_extent_busy_reuse()
346 rbp = rbp->rb_left; in xfs_extent_busy_trim()
/linux/net/ceph/
A Dstring_table.c24 p = &(*p)->rb_left; in ceph_find_or_create_string()
59 p = &(*p)->rb_left; in ceph_find_or_create_string()
/linux/drivers/mtd/ubi/
A Dattach.c125 p = &(*p)->rb_left; in find_or_add_av()
598 p = &(*p)->rb_left; in ubi_add_to_av()
1284 if (this->rb_left) in destroy_av()
1285 this = this->rb_left; in destroy_av()
1292 if (this->rb_left == &aeb->u.rb) in destroy_av()
1293 this->rb_left = NULL; in destroy_av()
1341 if (rb->rb_left) in destroy_ai()
1342 rb = rb->rb_left; in destroy_ai()
1350 if (rb->rb_left == &av->rb) in destroy_ai()
1351 rb->rb_left = NULL; in destroy_ai()
/linux/drivers/iommu/
A Diova.c187 while (node->rb_left && to_iova(node->rb_left)->pfn_lo >= limit_pfn) in iova_find_limit()
188 node = node->rb_left; in iova_find_limit()
190 if (!node->rb_left) in iova_find_limit()
193 next = node->rb_left; in iova_find_limit()
220 new = &((*new)->rb_left); in iova_insert_rbtree()
403 node = node->rb_left; in private_find_iova()
/linux/drivers/infiniband/sw/rdmavt/
A Dmcast.c124 n = n->rb_left; in rvt_mcast_find()
171 n = &pn->rb_left; in rvt_mcast_add()
329 n = n->rb_left; in rvt_detach_mcast()
/linux/net/bridge/
A Dbr_multicast_eht.c57 node = node->rb_left; in br_multicast_eht_host_lookup()
93 node = node->rb_left; in br_multicast_eht_set_entry_lookup()
117 node = node->rb_left; in br_multicast_eht_set_lookup()
256 link = &((*link)->rb_left); in __eht_lookup_create_host()
302 link = &((*link)->rb_left); in __eht_lookup_create_set_entry()
353 link = &((*link)->rb_left); in __eht_lookup_create_set()

Completed in 50 milliseconds

12345678910