| /Linux-v4.19/tools/lib/ |
| D | rbtree.c | 131 parent->rb_right = tmp = node->rb_left; in __rb_insert()
132 node->rb_left = parent; in __rb_insert()
151 gparent->rb_left = tmp; /* == parent->rb_right */ in __rb_insert()
159 tmp = gparent->rb_left; in __rb_insert()
170 tmp = parent->rb_left; in __rb_insert()
173 parent->rb_left = tmp = node->rb_right; in __rb_insert()
181 tmp = node->rb_left; in __rb_insert()
186 parent->rb_left = gparent; in __rb_insert()
226 parent->rb_right = tmp1 = sibling->rb_left; in ____rb_erase_color()
227 sibling->rb_left = parent; in ____rb_erase_color()
[all …]
|
| /Linux-v4.19/lib/ |
| D | rbtree.c | 170 tmp = node->rb_left; in __rb_insert()
172 WRITE_ONCE(node->rb_left, parent); in __rb_insert()
192 WRITE_ONCE(gparent->rb_left, tmp); /* == parent->rb_right */ in __rb_insert()
200 tmp = gparent->rb_left; in __rb_insert()
211 tmp = parent->rb_left; in __rb_insert()
215 WRITE_ONCE(parent->rb_left, tmp); in __rb_insert()
223 tmp = node->rb_left; in __rb_insert()
228 WRITE_ONCE(parent->rb_left, gparent); in __rb_insert()
268 tmp1 = sibling->rb_left; in ____rb_erase_color()
270 WRITE_ONCE(sibling->rb_left, parent); in ____rb_erase_color()
[all …]
|
| D | rbtree_test.c | 39 new = &parent->rb_left; in insert()
57 new = &parent->rb_left; in insert_cached()
82 if (node->rb.rb_left) { in augment_recompute()
83 child_augmented = rb_entry(node->rb.rb_left, struct test_node, in augment_recompute()
114 new = &parent->rb.rb_left; in RB_DECLARE_CALLBACKS()
139 new = &parent->rb.rb_left; in insert_augmented_cached()
220 WARN_ON_ONCE((!rb->rb_left || !rb->rb_right) && in check()
|
| /Linux-v4.19/drivers/block/drbd/ |
| D | drbd_interval.c | 28 if (node->rb.rb_left) { in compute_subtree_last()
29 sector_t left = interval_end(node->rb.rb_left); in compute_subtree_last()
63 new = &(*new)->rb_left; in drbd_insert_interval()
67 new = &(*new)->rb_left; in drbd_insert_interval()
101 node = node->rb_left; in drbd_contains_interval()
105 node = node->rb_left; in drbd_contains_interval()
147 if (node->rb_left && in drbd_find_overlap()
148 sector < interval_end(node->rb_left)) { in drbd_find_overlap()
150 node = node->rb_left; in drbd_find_overlap()
|
| /Linux-v4.19/include/linux/ |
| D | rbtree_augmented.h | 139 if (parent->rb_left == old) in __rb_change_child()
140 WRITE_ONCE(parent->rb_left, new); in __rb_change_child()
152 if (parent->rb_left == old) in __rb_change_child_rcu()
153 rcu_assign_pointer(parent->rb_left, new); in __rb_change_child_rcu()
169 struct rb_node *tmp = node->rb_left; in __rb_erase_augmented()
203 tmp = child->rb_left; in __rb_erase_augmented()
236 tmp = tmp->rb_left; in __rb_erase_augmented()
239 WRITE_ONCE(parent->rb_left, child2); in __rb_erase_augmented()
247 tmp = node->rb_left; in __rb_erase_augmented()
248 WRITE_ONCE(successor->rb_left, tmp); in __rb_erase_augmented()
|
| D | interval_tree_generic.h | 48 if (node->ITRB.rb_left) { \
49 subtree_last = rb_entry(node->ITRB.rb_left, \
82 link = &parent->ITRB.rb_left; \
118 if (node->ITRB.rb_left) { \
119 ITSTRUCT *left = rb_entry(node->ITRB.rb_left, \
|
| D | rbtree.h | 39 struct rb_node *rb_left; member
109 node->rb_left = node->rb_right = NULL; in rb_link_node()
118 node->rb_left = node->rb_right = NULL; in rb_link_node_rcu()
|
| D | rbtree_latch.h | 90 link = &parent->rb_left; in __lt_insert()
118 node = rcu_dereference_raw(node->rb_left); in __lt_find()
|
| /Linux-v4.19/tools/include/linux/ |
| D | rbtree_augmented.h | 128 if (parent->rb_left == old) in __rb_change_child()
129 parent->rb_left = new; in __rb_change_child()
143 struct rb_node *child = node->rb_right, *tmp = node->rb_left; in __rb_erase_augmented()
173 tmp = child->rb_left; in __rb_erase_augmented()
205 tmp = tmp->rb_left; in __rb_erase_augmented()
207 parent->rb_left = child2 = successor->rb_right; in __rb_erase_augmented()
214 successor->rb_left = tmp = node->rb_left; in __rb_erase_augmented()
|
| D | rbtree.h | 38 struct rb_node *rb_left; member
83 node->rb_left = node->rb_right = NULL; in rb_link_node()
|
| /Linux-v4.19/net/netfilter/ |
| D | nft_set_rbtree.c | 66 parent = rcu_dereference_raw(parent->rb_left); in __nft_rbtree_lookup()
77 parent = rcu_dereference_raw(parent->rb_left); in __nft_rbtree_lookup()
137 parent = rcu_dereference_raw(parent->rb_left); in __nft_rbtree_get()
143 parent = rcu_dereference_raw(parent->rb_left); in __nft_rbtree_get()
208 p = &parent->rb_left; in __nft_rbtree_insert()
214 p = &parent->rb_left; in __nft_rbtree_insert()
222 p = &parent->rb_left; in __nft_rbtree_insert()
301 parent = parent->rb_left; in nft_rbtree_deactivate()
306 parent = parent->rb_left; in nft_rbtree_deactivate()
311 parent = parent->rb_left; in nft_rbtree_deactivate()
|
| /Linux-v4.19/drivers/gpu/drm/ |
| D | drm_vma_manager.c | 163 iter = iter->rb_left; in drm_vma_offset_lookup_locked()
293 iter = &(*iter)->rb_left; in drm_vma_node_allow()
348 iter = iter->rb_left; in drm_vma_node_revoke()
385 iter = iter->rb_left; in drm_vma_node_is_allowed()
|
| /Linux-v4.19/mm/ |
| D | interval_tree.c | 47 while (parent->shared.rb.rb_left) { in vma_interval_tree_insert_after()
48 parent = rb_entry(parent->shared.rb.rb_left, in vma_interval_tree_insert_after()
53 link = &parent->shared.rb.rb_left; in vma_interval_tree_insert_after()
|
| /Linux-v4.19/block/ |
| D | bfq-wf2q.c | 388 node = &parent->rb_left; in bfq_insert()
434 bfq_update_min(entity, node->rb_left); in bfq_update_active_node()
458 if (node == parent->rb_left && parent->rb_right) in bfq_update_active_tree()
460 else if (parent->rb_left) in bfq_update_active_tree()
461 bfq_update_active_node(parent->rb_left); in bfq_update_active_tree()
491 if (node->rb_left) in bfq_active_insert()
492 node = node->rb_left; in bfq_active_insert()
558 if (!node->rb_right && !node->rb_left) in bfq_find_deepest()
561 deepest = node->rb_left; in bfq_find_deepest()
562 else if (!node->rb_left) in bfq_find_deepest()
[all …]
|
| /Linux-v4.19/arch/x86/mm/ |
| D | pat_rbtree.c | 65 child_max_end = get_subtree_max_end(data->rb.rb_left); in compute_subtree_max_end()
85 if (get_subtree_max_end(node->rb_left) > start) { in RB_DECLARE_CALLBACKS()
87 node = node->rb_left; in RB_DECLARE_CALLBACKS()
191 node = &((*node)->rb_left); in memtype_rb_insert()
|
| /Linux-v4.19/arch/arm/xen/ |
| D | p2m.c | 46 link = &(*link)->rb_left; in xen_add_phys_to_mach_entry()
77 n = n->rb_left; in __pfn_to_mfn()
139 n = n->rb_left; in __set_phys_to_machine_multi()
|
| /Linux-v4.19/tools/perf/util/ |
| D | block-range.c | 42 p = &parent->rb_left; in block_range__find()
54 struct rb_node **p = &node->rb_left; in rb_link_left_of_node()
67 p = &node->rb_left; in rb_link_right_of_node()
91 p = &parent->rb_left; in block_range__create()
|
| D | rblist.c | 26 p = &(*p)->rb_left; in rblist__add_node()
65 p = &(*p)->rb_left; in __rblist__findnew()
|
| D | mem2node.c | 25 p = &(*p)->rb_left; in phys_entry__insert()
124 p = &(*p)->rb_left; in mem2node__node()
|
| /Linux-v4.19/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-v4.19/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-v4.19/security/integrity/ |
| D | iint.c | 45 n = n->rb_left; in __integrity_iint_find()
120 p = &(*p)->rb_left; in integrity_inode_get()
|
| /Linux-v4.19/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()
|
| /Linux-v4.19/fs/btrfs/ |
| D | ulist.c | 128 n = n->rb_left; in ulist_rbtree_search()
157 p = &(*p)->rb_left; in ulist_rbtree_insert()
|
| /Linux-v4.19/drivers/infiniband/sw/rxe/ |
| D | rxe_pool.c | 291 link = &(*link)->rb_left; in insert_index()
322 link = &(*link)->rb_left; in insert_key()
450 node = node->rb_left; in rxe_pool_get_index()
486 node = node->rb_left; in rxe_pool_get_key()
|
