Home
last modified time | relevance | path

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

12345678910

/linux/tools/lib/
A Drbtree.c115 tmp = gparent->rb_right; in __rb_insert()
139 tmp = parent->rb_right; in __rb_insert()
163 tmp = node->rb_right; in __rb_insert()
198 tmp = node->rb_right; in __rb_insert()
481 while (n->rb_right) in rb_last()
482 n = n->rb_right; in rb_last()
497 if (node->rb_right) { in rb_next()
498 node = node->rb_right; in rb_next()
530 while (node->rb_right) in rb_prev()
531 node = node->rb_right; in rb_prev()
[all …]
/linux/lib/
A Drbtree.c115 tmp = gparent->rb_right; in __rb_insert()
139 tmp = parent->rb_right; in __rb_insert()
163 tmp = node->rb_right; in __rb_insert()
198 tmp = node->rb_right; in __rb_insert()
486 while (n->rb_right) in rb_last()
487 n = n->rb_right; in rb_last()
503 if (node->rb_right) { in rb_next()
504 node = node->rb_right; in rb_next()
537 while (node->rb_right) in rb_prev()
564 if (victim->rb_right) in rb_replace_node()
[all …]
A Drbtree_test.c42 new = &parent->rb_right; in insert()
60 new = &parent->rb_right; in insert_cached()
101 new = &parent->rb.rb_right; in RB_DECLARE_CALLBACKS_MAX()
126 new = &parent->rb.rb_right; in insert_augmented_cached()
205 WARN_ON_ONCE((!rb->rb_left || !rb->rb_right) && in check()
232 if (node->rb.rb_right) { in check_augmented()
233 subtree = rb_entry(node->rb.rb_right, struct test_node, in check_augmented()
/linux/include/linux/
A 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()
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()
237 link = &parent->rb_right; in rb_find_add()
267 node = node->rb_right; in rb_find()
298 node = node->rb_right; in rb_find_first()
A 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; \
A Drbtree_latch.h92 link = &parent->rb_right; in __lt_insert()
120 node = rcu_dereference_raw(node->rb_right); in __lt_find()
/linux/tools/include/linux/
A Drbtree.h25 struct rb_node *rb_right; member
70 node->rb_left = node->rb_right = NULL; in rb_link_node()
190 link = &parent->rb_right; in rb_add_cached()
217 link = &parent->rb_right; in rb_add()
248 link = &parent->rb_right; in rb_find_add()
278 node = node->rb_right; in rb_find()
309 node = node->rb_right; in rb_find_first()
A Drbtree_augmented.h133 if (node->RBFIELD.rb_right) { \
134 child = rb_entry(node->RBFIELD.rb_right, RBSTRUCT, RBFIELD); \
178 WRITE_ONCE(parent->rb_right, new); in __rb_change_child()
190 struct rb_node *child = node->rb_right; in __rb_erase_augmented()
234 child2 = successor->rb_right; in __rb_erase_augmented()
257 child2 = successor->rb_right; in __rb_erase_augmented()
259 WRITE_ONCE(successor->rb_right, child); in __rb_erase_augmented()
/linux/drivers/block/drbd/
A Ddrbd_interval.c42 new = &(*new)->rb_right; in drbd_insert_interval()
46 new = &(*new)->rb_right; in drbd_insert_interval()
81 node = node->rb_right; in drbd_contains_interval()
85 node = node->rb_right; in drbd_contains_interval()
136 node = node->rb_right; in drbd_find_overlap()
/linux/drivers/gpu/drm/
A Ddrm_vma_manager.c155 iter = iter->rb_right; in drm_vma_offset_lookup_locked()
288 iter = &(*iter)->rb_right; in drm_vma_node_allow()
343 iter = iter->rb_right; in drm_vma_node_revoke()
380 iter = iter->rb_right; in drm_vma_node_is_allowed()
A Ddrm_mm.c186 link = &hole_node->rb.rb_right; in drm_mm_interval_tree_add_node()
202 link = &parent->rb.rb_right; in drm_mm_interval_tree_add_node()
232 link = &rb->rb_right; in insert_hole_size()
259 link = &parent->rb_hole_addr.rb_right; in RB_DECLARE_CALLBACKS_MAX()
316 rb = rb->rb_right; in best_hole()
347 rb = node->rb_hole_addr.rb_right; 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()
A Ddrm_prime.c123 p = &rb->rb_right; in drm_prime_add_buf_handle()
138 p = &rb->rb_right; in drm_prime_add_buf_handle()
161 rb = rb->rb_right; in drm_prime_lookup_buf_by_handle()
184 rb = rb->rb_right; in drm_prime_lookup_buf_handle()
211 rb = rb->rb_right; in drm_prime_remove_buf_handle_locked()
/linux/block/
A Dbfq-wf2q.c381 node = &parent->rb_right; in bfq_insert()
424 bfq_update_min(entity, node->rb_right); in bfq_update_active_node()
450 bfq_update_active_node(parent->rb_right); in bfq_update_active_tree()
484 else if (node->rb_right) in bfq_active_insert()
485 node = node->rb_right; in bfq_active_insert()
549 if (!node->rb_right && !node->rb_left) in bfq_find_deepest()
551 else if (!node->rb_right) in bfq_find_deepest()
554 deepest = node->rb_right; in bfq_find_deepest()
557 if (deepest->rb_right) in bfq_find_deepest()
558 deepest = deepest->rb_right; in bfq_find_deepest()
[all …]
/linux/mm/
A Dinterval_tree.c38 if (!prev->shared.rb.rb_right) { in vma_interval_tree_insert_after()
40 link = &prev->shared.rb.rb_right; in vma_interval_tree_insert_after()
42 parent = rb_entry(prev->shared.rb.rb_right, in vma_interval_tree_insert_after()
/linux/tools/perf/util/
A Dblock-range.c46 p = &parent->rb_right; in block_range__find()
59 p = &node->rb_right; in rb_link_left_of_node()
66 struct rb_node **p = &node->rb_right; in rb_link_right_of_node()
95 p = &parent->rb_right; in block_range__create()
A Drblist.c28 p = &(*p)->rb_right; in rblist__add_node()
70 p = &(*p)->rb_right; in __rblist__findnew()
A Dmem2node.c31 p = &(*p)->rb_right; in phys_entry__insert()
131 p = &(*p)->rb_right; in mem2node__node()
/linux/arch/arm/xen/
A Dp2m.c50 link = &(*link)->rb_right; in xen_add_phys_to_mach_entry()
82 n = n->rb_right; in __pfn_to_mfn()
171 n = n->rb_right; in __set_phys_to_machine_multi()
/linux/fs/btrfs/
A Dmisc.h84 node = node->rb_right; in rb_simple_search()
105 p = &(*p)->rb_right; in rb_simple_insert()
/linux/fs/xfs/
A Dxfs_extent_busy.c55 rbp = &(*rbp)->rb_right; in xfs_extent_busy_insert()
103 rbp = rbp->rb_right; in xfs_extent_busy_search()
297 rbp = rbp->rb_right; in xfs_extent_busy_reuse()
349 rbp = rbp->rb_right; in xfs_extent_busy_trim()
/linux/net/netfilter/
A Dnft_set_rbtree.c76 parent = rcu_dereference_raw(parent->rb_right); in __nft_rbtree_lookup()
154 parent = rcu_dereference_raw(parent->rb_right); in __nft_rbtree_get()
313 p = &parent->rb_right; in __nft_rbtree_insert()
342 p = &parent->rb_right; in __nft_rbtree_insert()
439 parent = parent->rb_right; in nft_rbtree_deactivate()
447 parent = parent->rb_right; in nft_rbtree_deactivate()
/linux/net/ceph/
A Dstring_table.c26 p = &(*p)->rb_right; in ceph_find_or_create_string()
61 p = &(*p)->rb_right; in ceph_find_or_create_string()
/linux/drivers/infiniband/sw/rdmavt/
A Dmcast.c126 n = n->rb_right; in rvt_mcast_find()
175 n = &pn->rb_right; in rvt_mcast_add()
331 n = n->rb_right; in rvt_detach_mcast()
/linux/net/bridge/
A Dbr_multicast_eht.c59 node = node->rb_right; in br_multicast_eht_host_lookup()
95 node = node->rb_right; in br_multicast_eht_set_entry_lookup()
119 node = node->rb_right; in br_multicast_eht_set_lookup()
258 link = &((*link)->rb_right); in __eht_lookup_create_host()
304 link = &((*link)->rb_right); in __eht_lookup_create_set_entry()
355 link = &((*link)->rb_right); in __eht_lookup_create_set()

Completed in 686 milliseconds

12345678910