| /Linux-v5.10/tools/lib/ |
| D | rbtree.c | 154 tmp = node->rb_left; in __rb_insert()
156 WRITE_ONCE(node->rb_left, parent); in __rb_insert()
176 WRITE_ONCE(gparent->rb_left, tmp); /* == parent->rb_right */ in __rb_insert()
184 tmp = gparent->rb_left; in __rb_insert()
195 tmp = parent->rb_left; in __rb_insert()
199 WRITE_ONCE(parent->rb_left, tmp); in __rb_insert()
207 tmp = node->rb_left; in __rb_insert()
212 WRITE_ONCE(parent->rb_left, gparent); in __rb_insert()
252 tmp1 = sibling->rb_left; in ____rb_erase_color()
254 WRITE_ONCE(sibling->rb_left, parent); in ____rb_erase_color()
[all …]
|
| /Linux-v5.10/lib/ |
| D | rbtree.c | 154 tmp = node->rb_left; in __rb_insert()
156 WRITE_ONCE(node->rb_left, parent); in __rb_insert()
176 WRITE_ONCE(gparent->rb_left, tmp); /* == parent->rb_right */ in __rb_insert()
184 tmp = gparent->rb_left; in __rb_insert()
195 tmp = parent->rb_left; in __rb_insert()
199 WRITE_ONCE(parent->rb_left, tmp); in __rb_insert()
207 tmp = node->rb_left; in __rb_insert()
212 WRITE_ONCE(parent->rb_left, gparent); in __rb_insert()
252 tmp1 = sibling->rb_left; in ____rb_erase_color()
254 WRITE_ONCE(sibling->rb_left, parent); in ____rb_erase_color()
[all …]
|
| D | rbtree_test.c | 40 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-v5.10/include/linux/ |
| D | rbtree_augmented.h | 126 if (node->RBFIELD.rb_left) { \
127 child = rb_entry(node->RBFIELD.rb_left, RBSTRUCT, RBFIELD); \
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()
[all …]
|
| D | rbtree.h | 27 struct rb_node *rb_left; 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 | interval_tree_generic.h | 52 link = &parent->ITRB.rb_left; \
88 if (node->ITRB.rb_left) { \
89 ITSTRUCT *left = rb_entry(node->ITRB.rb_left, \
|
| D | rbtree_latch.h | 90 link = &parent->rb_left; in __lt_insert()
118 node = rcu_dereference_raw(node->rb_left); in __lt_find()
|
| /Linux-v5.10/drivers/block/drbd/ |
| D | drbd_interval.c | 40 new = &(*new)->rb_left; in drbd_insert_interval()
44 new = &(*new)->rb_left; in drbd_insert_interval()
78 node = node->rb_left; in drbd_contains_interval()
82 node = node->rb_left; in drbd_contains_interval()
124 if (node->rb_left && in drbd_find_overlap()
125 sector < interval_end(node->rb_left)) { in drbd_find_overlap()
127 node = node->rb_left; in drbd_find_overlap()
|
| /Linux-v5.10/tools/include/linux/ |
| D | rbtree_augmented.h | 128 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()
|
| D | rbtree.h | 26 struct rb_node *rb_left; member
70 node->rb_left = node->rb_right = NULL; in rb_link_node()
|
| /Linux-v5.10/net/netfilter/ |
| D | nft_set_rbtree.c | 68 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()
149 parent = rcu_dereference_raw(parent->rb_left); in __nft_rbtree_get()
158 parent = rcu_dereference_raw(parent->rb_left); in __nft_rbtree_get()
175 parent = rcu_dereference_raw(parent->rb_left); in __nft_rbtree_get()
290 p = &parent->rb_left; in __nft_rbtree_insert()
334 p = &parent->rb_left; in __nft_rbtree_insert()
351 p = &parent->rb_left; in __nft_rbtree_insert()
436 parent = parent->rb_left; in nft_rbtree_deactivate()
[all …]
|
| /Linux-v5.10/drivers/gpu/drm/ |
| D | drm_vma_manager.c | 160 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()
|
| D | drm_mm.c | 203 link = &parent->rb.rb_left; in drm_mm_interval_tree_add_node()
233 link = &rb->rb_left; in insert_hole_size()
260 link = &parent->rb_hole_addr.rb_left; in RB_DECLARE_CALLBACKS_MAX()
321 rb = rb->rb_left; in best_hole()
348 rb = node->rb_hole_addr.rb_left; 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 | 46 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-v5.10/block/ |
| D | bfq-wf2q.c | 382 node = &parent->rb_left; in bfq_insert()
428 bfq_update_min(entity, node->rb_left); in bfq_update_active_node()
452 if (node == parent->rb_left && parent->rb_right) in bfq_update_active_tree()
454 else if (parent->rb_left) in bfq_update_active_tree()
455 bfq_update_active_node(parent->rb_left); in bfq_update_active_tree()
485 if (node->rb_left) in bfq_active_insert()
486 node = node->rb_left; in bfq_active_insert()
552 if (!node->rb_right && !node->rb_left) in bfq_find_deepest()
555 deepest = node->rb_left; in bfq_find_deepest()
556 else if (!node->rb_left) in bfq_find_deepest()
[all …]
|
| /Linux-v5.10/arch/arm/xen/ |
| D | p2m.c | 47 link = &(*link)->rb_left; in xen_add_phys_to_mach_entry()
79 n = n->rb_left; in __pfn_to_mfn()
141 n = n->rb_left; in __set_phys_to_machine_multi()
|
| /Linux-v5.10/tools/perf/util/ |
| D | block-range.c | 44 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()
|
| D | rblist.c | 26 p = &(*p)->rb_left; in rblist__add_node()
68 p = &(*p)->rb_left; in __rblist__findnew()
|
| D | env.c | 33 p = &(*p)->rb_left; in perf_env__insert_bpf_prog_info()
61 n = n->rb_left; in perf_env__find_bpf_prog_info()
88 p = &(*p)->rb_left; in perf_env__insert_btf()
115 n = n->rb_left; in perf_env__find_btf()
|
| D | mem2node.c | 29 p = &(*p)->rb_left; in phys_entry__insert()
128 p = &(*p)->rb_left; in mem2node__node()
|
| /Linux-v5.10/fs/btrfs/ |
| D | misc.h | 82 node = node->rb_left; in rb_simple_search()
103 p = &(*p)->rb_left; in rb_simple_insert()
|
| /Linux-v5.10/net/ceph/ |
| D | string_table.c | 24 p = &(*p)->rb_left; in ceph_find_or_create_string()
59 p = &(*p)->rb_left; in ceph_find_or_create_string()
|
| /Linux-v5.10/fs/xfs/ |
| D | xfs_extent_busy.c | 54 rbp = &(*rbp)->rb_left; in xfs_extent_busy_insert()
105 rbp = rbp->rb_left; in xfs_extent_busy_search()
305 rbp = rbp->rb_left; in xfs_extent_busy_reuse()
359 rbp = rbp->rb_left; in xfs_extent_busy_trim()
|
| /Linux-v5.10/security/integrity/ |
| D | iint.c | 42 n = n->rb_left; in __integrity_iint_find()
117 p = &(*p)->rb_left; in integrity_inode_get()
|
| /Linux-v5.10/drivers/infiniband/sw/rdmavt/ |
| D | mcast.c | 166 n = n->rb_left; in rvt_mcast_find()
213 n = &pn->rb_left; in rvt_mcast_add()
371 n = n->rb_left; in rvt_detach_mcast()
|
