Home
last modified time | relevance | path

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

12345678910

/linux-6.15/tools/lib/
H 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-6.15/lib/
H 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 …]
H A Drbtree_test.c43 new = &parent->rb_right; in insert()
61 new = &parent->rb_right; in insert_cached()
102 new = &parent->rb.rb_right; in RB_DECLARE_CALLBACKS_MAX()
127 new = &parent->rb.rb_right; in insert_augmented_cached()
206 WARN_ON_ONCE((!rb->rb_left || !rb->rb_right) && in check()
233 if (node->rb.rb_right) { in check_augmented()
234 subtree = rb_entry(node->rb.rb_right, struct test_node, in check_augmented()
/linux-6.15/include/linux/
H 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()
H 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()
H 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; \
H A Drbtree_latch.h92 link = &parent->rb_right; in __lt_insert()
120 node = rcu_dereference_raw(node->rb_right); in __lt_find()
/linux-6.15/tools/include/linux/
H 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()
H 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; \
H 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-6.15/drivers/block/drbd/
H 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()
140 node = node->rb_right; in drbd_find_overlap()
/linux-6.15/drivers/gpu/drm/
H A Ddrm_vma_manager.c155 iter = iter->rb_right; in drm_vma_offset_lookup_locked()
270 iter = &(*iter)->rb_right; in vma_node_allow()
375 iter = iter->rb_right; in drm_vma_node_revoke()
412 iter = iter->rb_right; in drm_vma_node_is_allowed()
H 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()
/linux-6.15/Documentation/translations/zh_CN/core-api/
H A Drbtree.rst92 node = node->rb_right;
123 new = &((*new)->rb_right);
294 if (node->rb.rb_right) {
295 node = rb_entry(node->rb.rb_right,
317 if (node->rb.rb_right) {
318 subtree_last = rb_entry(node->rb.rb_right,
379 link = &parent->rb.rb_right;
/linux-6.15/mm/
H 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-6.15/fs/btrfs/
H A Dmisc.h80 node = node->rb_right; in rb_simple_search()
113 node = node->rb_right; in rb_simple_search_first()
136 p = &(*p)->rb_right; in rb_simple_insert()
/linux-6.15/block/
H A Dbfq-wf2q.c392 node = &parent->rb_right; in bfq_insert()
435 bfq_update_min(entity, node->rb_right); in bfq_update_active_node()
461 bfq_update_active_node(parent->rb_right); in bfq_update_active_tree()
490 else if (node->rb_right) in bfq_active_insert()
491 node = node->rb_right; in bfq_active_insert()
548 if (!node->rb_right && !node->rb_left) in bfq_find_deepest()
550 else if (!node->rb_right) in bfq_find_deepest()
553 deepest = node->rb_right; in bfq_find_deepest()
556 if (deepest->rb_right) in bfq_find_deepest()
557 deepest = deepest->rb_right; in bfq_find_deepest()
[all …]
/linux-6.15/tools/perf/util/
H A Dblock-range.c42 p = &parent->rb_right; in block_range__find()
55 p = &node->rb_right; in rb_link_left_of_node()
62 struct rb_node **p = &node->rb_right; in rb_link_right_of_node()
91 p = &parent->rb_right; in block_range__create()
H A Drblist.c28 p = &(*p)->rb_right; in rblist__add_node()
70 p = &(*p)->rb_right; in __rblist__findnew()
H A Dmem2node.c31 p = &(*p)->rb_right; in phys_entry__insert()
131 p = &(*p)->rb_right; in mem2node__node()
/linux-6.15/arch/arm/xen/
H A Dp2m.c50 link = &(*link)->rb_right; in xen_add_phys_to_mach_entry()
83 n = n->rb_right; in __pfn_to_mfn()
173 n = n->rb_right; in __set_phys_to_machine_multi()
/linux-6.15/net/netfilter/
H A Dnft_set_rbtree.c82 parent = rcu_dereference_raw(parent->rb_right); in __nft_rbtree_lookup()
160 parent = rcu_dereference_raw(parent->rb_right); in __nft_rbtree_get()
337 p = &parent->rb_right; in __nft_rbtree_insert()
342 p = &parent->rb_right; in __nft_rbtree_insert()
474 p = &parent->rb_right; in __nft_rbtree_insert()
478 p = &parent->rb_right; in __nft_rbtree_insert()
566 parent = parent->rb_right; in nft_rbtree_deactivate()
574 parent = parent->rb_right; in nft_rbtree_deactivate()
/linux-6.15/net/ceph/
H 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-6.15/drivers/staging/media/atomisp/pci/hmm/
H A Dhmm_bo.c77 if (!this->node.rb_right) in __bo_search_and_remove_from_free_rbtree()
80 this->node.rb_right, pgnr); in __bo_search_and_remove_from_free_rbtree()
131 if (!n->rb_right) in __bo_search_by_addr()
133 n = n->rb_right; in __bo_search_by_addr()
158 if (!n->rb_right) in __bo_search_by_addr_in_range()
160 n = n->rb_right; in __bo_search_by_addr_in_range()
182 new = &((*new)->rb_right); in __bo_insert_to_free_rbtree()
215 new = &((*new)->rb_right); in __bo_insert_to_alloc_rbtree()
/linux-6.15/fs/xfs/
H A Dxfs_extent_busy.c65 rbp = &(*rbp)->rb_right; in xfs_extent_busy_insert_list()
136 rbp = rbp->rb_right; in xfs_extent_busy_search()
331 rbp = rbp->rb_right; in xfs_extent_busy_reuse()
386 rbp = rbp->rb_right; in xfs_extent_busy_trim()

12345678910