| /Linux-v5.10/tools/lib/ |
| D | rbtree.c | 115 tmp = gparent->rb_right; in __rb_insert()
139 tmp = parent->rb_right; in __rb_insert()
155 WRITE_ONCE(parent->rb_right, tmp); in __rb_insert()
163 tmp = node->rb_right; in __rb_insert()
177 WRITE_ONCE(parent->rb_right, gparent); in __rb_insert()
198 tmp = node->rb_right; in __rb_insert()
200 WRITE_ONCE(node->rb_right, parent); in __rb_insert()
211 WRITE_ONCE(gparent->rb_right, tmp); /* == parent->rb_left */ in __rb_insert()
240 sibling = parent->rb_right; in ____rb_erase_color()
253 WRITE_ONCE(parent->rb_right, tmp1); in ____rb_erase_color()
[all …]
|
| /Linux-v5.10/lib/ |
| D | rbtree.c | 115 tmp = gparent->rb_right; in __rb_insert()
139 tmp = parent->rb_right; in __rb_insert()
155 WRITE_ONCE(parent->rb_right, tmp); in __rb_insert()
163 tmp = node->rb_right; in __rb_insert()
177 WRITE_ONCE(parent->rb_right, gparent); in __rb_insert()
198 tmp = node->rb_right; in __rb_insert()
200 WRITE_ONCE(node->rb_right, parent); in __rb_insert()
211 WRITE_ONCE(gparent->rb_right, tmp); /* == parent->rb_left */ in __rb_insert()
240 sibling = parent->rb_right; in ____rb_erase_color()
253 WRITE_ONCE(parent->rb_right, tmp1); in ____rb_erase_color()
[all …]
|
| D | rbtree_test.c | 42 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-v5.10/drivers/block/drbd/ |
| D | drbd_interval.c | 42 new = &(*new)->rb_right; in drbd_insert_interval()
46 new = &(*new)->rb_right; in drbd_insert_interval()
80 node = node->rb_right; in drbd_contains_interval()
84 node = node->rb_right; in drbd_contains_interval()
134 node = node->rb_right; in drbd_find_overlap()
|
| /Linux-v5.10/include/linux/ |
| D | interval_tree_generic.h | 54 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; \
|
| D | rbtree_augmented.h | 131 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()
|
| D | rbtree.h | 26 struct rb_node *rb_right; member
73 node->rb_left = node->rb_right = NULL; in rb_link_node()
82 node->rb_left = node->rb_right = NULL; in rb_link_node_rcu()
|
| D | rbtree_latch.h | 92 link = &parent->rb_right; in __lt_insert()
120 node = rcu_dereference_raw(node->rb_right); in __lt_find()
|
| /Linux-v5.10/tools/include/linux/ |
| D | rbtree_augmented.h | 133 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()
|
| D | rbtree.h | 25 struct rb_node *rb_right; member
70 node->rb_left = node->rb_right = NULL; in rb_link_node()
|
| /Linux-v5.10/drivers/gpu/drm/ |
| D | drm_vma_manager.c | 155 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()
|
| D | drm_mm.c | 189 link = &hole_node->rb.rb_right; in drm_mm_interval_tree_add_node()
205 link = &parent->rb.rb_right; in drm_mm_interval_tree_add_node()
235 link = &rb->rb_right; in insert_hole_size()
262 link = &parent->rb_hole_addr.rb_right; in RB_DECLARE_CALLBACKS_MAX()
319 rb = rb->rb_right; in best_hole()
350 rb = node->rb_hole_addr.rb_right; in find_hole_addr()
413 DECLARE_NEXT_HOLE_ADDR(next_hole_high_addr, rb_left, rb_right) in DECLARE_NEXT_HOLE_ADDR() argument
414 DECLARE_NEXT_HOLE_ADDR(next_hole_low_addr, rb_right, rb_left) in DECLARE_NEXT_HOLE_ADDR()
|
| /Linux-v5.10/mm/ |
| D | interval_tree.c | 38 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-v5.10/block/ |
| D | bfq-wf2q.c | 384 node = &parent->rb_right; in bfq_insert()
427 bfq_update_min(entity, node->rb_right); in bfq_update_active_node()
452 if (node == parent->rb_left && parent->rb_right) in bfq_update_active_tree()
453 bfq_update_active_node(parent->rb_right); in bfq_update_active_tree()
487 else if (node->rb_right) in bfq_active_insert()
488 node = node->rb_right; in bfq_active_insert()
552 if (!node->rb_right && !node->rb_left) in bfq_find_deepest()
554 else if (!node->rb_right) in bfq_find_deepest()
557 deepest = node->rb_right; in bfq_find_deepest()
560 if (deepest->rb_right) in bfq_find_deepest()
[all …]
|
| /Linux-v5.10/arch/arm/xen/ |
| D | p2m.c | 49 link = &(*link)->rb_right; in xen_add_phys_to_mach_entry()
81 n = n->rb_right; in __pfn_to_mfn()
143 n = n->rb_right; in __set_phys_to_machine_multi()
|
| /Linux-v5.10/tools/perf/util/ |
| D | block-range.c | 46 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()
|
| D | rblist.c | 28 p = &(*p)->rb_right; in rblist__add_node()
70 p = &(*p)->rb_right; in __rblist__findnew()
|
| D | env.c | 35 p = &(*p)->rb_right; in perf_env__insert_bpf_prog_info()
63 n = n->rb_right; in perf_env__find_bpf_prog_info()
90 p = &(*p)->rb_right; in perf_env__insert_btf()
117 n = n->rb_right; in perf_env__find_btf()
|
| D | mem2node.c | 31 p = &(*p)->rb_right; in phys_entry__insert()
130 p = &(*p)->rb_right; in mem2node__node()
|
| /Linux-v5.10/fs/btrfs/ |
| D | misc.h | 84 node = node->rb_right; in rb_simple_search()
105 p = &(*p)->rb_right; in rb_simple_insert()
|
| /Linux-v5.10/net/ceph/ |
| D | string_table.c | 26 p = &(*p)->rb_right; in ceph_find_or_create_string()
61 p = &(*p)->rb_right; in ceph_find_or_create_string()
|
| /Linux-v5.10/net/netfilter/ |
| D | nft_set_rbtree.c | 76 parent = rcu_dereference_raw(parent->rb_right); in __nft_rbtree_lookup()
153 parent = rcu_dereference_raw(parent->rb_right); in __nft_rbtree_get()
312 p = &parent->rb_right; in __nft_rbtree_insert()
341 p = &parent->rb_right; in __nft_rbtree_insert()
438 parent = parent->rb_right; in nft_rbtree_deactivate()
446 parent = parent->rb_right; in nft_rbtree_deactivate()
|
| /Linux-v5.10/fs/xfs/ |
| D | xfs_extent_busy.c | 57 rbp = &(*rbp)->rb_right; in xfs_extent_busy_insert()
110 rbp = rbp->rb_right; in xfs_extent_busy_search()
308 rbp = rbp->rb_right; in xfs_extent_busy_reuse()
362 rbp = rbp->rb_right; in xfs_extent_busy_trim()
|
| /Linux-v5.10/security/integrity/ |
| D | iint.c | 44 n = n->rb_right; in __integrity_iint_find()
119 p = &(*p)->rb_right; in integrity_inode_get()
|
| /Linux-v5.10/drivers/infiniband/sw/rdmavt/ |
| D | mcast.c | 168 n = n->rb_right; in rvt_mcast_find()
217 n = &pn->rb_right; in rvt_mcast_add()
373 n = n->rb_right; in rvt_detach_mcast()
|
