| /Linux-v4.19/tools/lib/ |
| D | rbtree.c | 93 tmp = gparent->rb_right; in __rb_insert()
117 tmp = parent->rb_right; in __rb_insert()
131 parent->rb_right = tmp = node->rb_left; in __rb_insert()
139 tmp = node->rb_right; in __rb_insert()
152 parent->rb_right = gparent; in __rb_insert()
173 parent->rb_left = tmp = node->rb_right; in __rb_insert()
174 node->rb_right = parent; in __rb_insert()
185 gparent->rb_right = tmp; /* == parent->rb_left */ in __rb_insert()
214 sibling = parent->rb_right; in ____rb_erase_color()
226 parent->rb_right = tmp1 = sibling->rb_left; in ____rb_erase_color()
[all …]
|
| /Linux-v4.19/lib/ |
| D | rbtree.c | 131 tmp = gparent->rb_right; in __rb_insert()
155 tmp = parent->rb_right; in __rb_insert()
171 WRITE_ONCE(parent->rb_right, tmp); in __rb_insert()
179 tmp = node->rb_right; in __rb_insert()
193 WRITE_ONCE(parent->rb_right, gparent); in __rb_insert()
214 tmp = node->rb_right; in __rb_insert()
216 WRITE_ONCE(node->rb_right, parent); in __rb_insert()
227 WRITE_ONCE(gparent->rb_right, tmp); /* == parent->rb_left */ in __rb_insert()
256 sibling = parent->rb_right; in ____rb_erase_color()
269 WRITE_ONCE(parent->rb_right, tmp1); in ____rb_erase_color()
[all …]
|
| D | rbtree_test.c | 41 new = &parent->rb_right; in insert()
59 new = &parent->rb_right; in insert_cached()
88 if (node->rb.rb_right) { in augment_recompute()
89 child_augmented = rb_entry(node->rb.rb_right, struct test_node, in augment_recompute()
116 new = &parent->rb.rb_right; in RB_DECLARE_CALLBACKS()
141 new = &parent->rb.rb_right; 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 | 33 if (node->rb.rb_right) { in compute_subtree_last()
34 sector_t right = interval_end(node->rb.rb_right); in compute_subtree_last()
65 new = &(*new)->rb_right; in drbd_insert_interval()
69 new = &(*new)->rb_right; in drbd_insert_interval()
103 node = node->rb_right; in drbd_contains_interval()
107 node = node->rb_right; in drbd_contains_interval()
157 node = node->rb_right; in drbd_find_overlap()
|
| /Linux-v4.19/include/linux/ |
| D | interval_tree_generic.h | 54 if (node->ITRB.rb_right) { \
55 subtree_last = rb_entry(node->ITRB.rb_right, \
84 link = &parent->ITRB.rb_right; \
137 if (node->ITRB.rb_right) { \
138 node = rb_entry(node->ITRB.rb_right, \
184 struct rb_node *rb = node->ITRB.rb_right, *prev; \
208 rb = node->ITRB.rb_right; \
|
| D | rbtree_augmented.h | 142 WRITE_ONCE(parent->rb_right, new); in __rb_change_child()
155 rcu_assign_pointer(parent->rb_right, new); in __rb_change_child_rcu()
168 struct rb_node *child = node->rb_right; in __rb_erase_augmented()
215 child2 = successor->rb_right; in __rb_erase_augmented()
238 child2 = successor->rb_right; in __rb_erase_augmented()
240 WRITE_ONCE(successor->rb_right, child); in __rb_erase_augmented()
|
| D | rbtree.h | 38 struct rb_node *rb_right; 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 | 92 link = &parent->rb_right; in __lt_insert()
120 node = rcu_dereference_raw(node->rb_right); in __lt_find()
|
| /Linux-v4.19/tools/include/linux/ |
| D | rbtree_augmented.h | 131 parent->rb_right = new; in __rb_change_child()
143 struct rb_node *child = node->rb_right, *tmp = node->rb_left; in __rb_erase_augmented()
185 child2 = successor->rb_right; in __rb_erase_augmented()
207 parent->rb_left = child2 = successor->rb_right; in __rb_erase_augmented()
208 successor->rb_right = child; in __rb_erase_augmented()
|
| D | rbtree.h | 37 struct rb_node *rb_right; member
83 node->rb_left = node->rb_right = NULL; in rb_link_node()
|
| /Linux-v4.19/drivers/gpu/drm/ |
| D | drm_vma_manager.c | 158 iter = iter->rb_right; in drm_vma_offset_lookup_locked()
291 iter = &(*iter)->rb_right; in drm_vma_node_allow()
346 iter = iter->rb_right; in drm_vma_node_revoke()
383 iter = iter->rb_right; in drm_vma_node_is_allowed()
|
| /Linux-v4.19/mm/ |
| D | interval_tree.c | 39 if (!prev->shared.rb.rb_right) { in vma_interval_tree_insert_after()
41 link = &prev->shared.rb.rb_right; in vma_interval_tree_insert_after()
43 parent = rb_entry(prev->shared.rb.rb_right, in vma_interval_tree_insert_after()
|
| /Linux-v4.19/block/ |
| D | bfq-wf2q.c | 390 node = &parent->rb_right; in bfq_insert()
433 bfq_update_min(entity, node->rb_right); in bfq_update_active_node()
458 if (node == parent->rb_left && parent->rb_right) in bfq_update_active_tree()
459 bfq_update_active_node(parent->rb_right); in bfq_update_active_tree()
493 else if (node->rb_right) in bfq_active_insert()
494 node = node->rb_right; in bfq_active_insert()
558 if (!node->rb_right && !node->rb_left) in bfq_find_deepest()
560 else if (!node->rb_right) in bfq_find_deepest()
563 deepest = node->rb_right; in bfq_find_deepest()
566 if (deepest->rb_right) in bfq_find_deepest()
[all …]
|
| /Linux-v4.19/arch/arm/xen/ |
| D | p2m.c | 48 link = &(*link)->rb_right; in xen_add_phys_to_mach_entry()
79 n = n->rb_right; in __pfn_to_mfn()
141 n = n->rb_right; in __set_phys_to_machine_multi()
|
| /Linux-v4.19/tools/perf/util/ |
| D | block-range.c | 44 p = &parent->rb_right; in block_range__find()
57 p = &node->rb_right; in rb_link_left_of_node()
64 struct rb_node **p = &node->rb_right; in rb_link_right_of_node()
93 p = &parent->rb_right; in block_range__create()
|
| D | rblist.c | 28 p = &(*p)->rb_right; in rblist__add_node()
67 p = &(*p)->rb_right; in __rblist__findnew()
|
| D | mem2node.c | 27 p = &(*p)->rb_right; in phys_entry__insert()
126 p = &(*p)->rb_right; in mem2node__node()
|
| /Linux-v4.19/net/netfilter/ |
| D | nft_set_rbtree.c | 74 parent = rcu_dereference_raw(parent->rb_right); in __nft_rbtree_lookup()
140 parent = rcu_dereference_raw(parent->rb_right); in __nft_rbtree_get()
210 p = &parent->rb_right; in __nft_rbtree_insert()
217 p = &parent->rb_right; in __nft_rbtree_insert()
303 parent = parent->rb_right; in nft_rbtree_deactivate()
315 parent = parent->rb_right; in nft_rbtree_deactivate()
|
| /Linux-v4.19/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-v4.19/arch/x86/mm/ |
| D | pat_rbtree.c | 61 child_max_end = get_subtree_max_end(data->rb.rb_right); in compute_subtree_max_end()
93 node = node->rb_right; in RB_DECLARE_CALLBACKS()
193 node = &((*node)->rb_right); in memtype_rb_insert()
|
| /Linux-v4.19/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-v4.19/security/integrity/ |
| D | iint.c | 47 n = n->rb_right; in __integrity_iint_find()
122 p = &(*p)->rb_right; in integrity_inode_get()
|
| /Linux-v4.19/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()
|
| /Linux-v4.19/fs/btrfs/ |
| D | ulist.c | 126 n = n->rb_right; in ulist_rbtree_search()
155 p = &(*p)->rb_right; in ulist_rbtree_insert()
|
| /Linux-v4.19/drivers/infiniband/sw/rxe/ |
| D | rxe_pool.c | 293 link = &(*link)->rb_right; in insert_index()
324 link = &(*link)->rb_right; in insert_key()
452 node = node->rb_right; in rxe_pool_get_index()
488 node = node->rb_right; in rxe_pool_get_key()
|
