Home
last modified time | relevance | path

Searched refs:rb_left (Results 1 – 25 of 242) sorted by relevance

12345678910

/Linux-v6.6/tools/lib/
Drbtree.c154 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-v6.6/lib/
Drbtree.c154 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 …]
Drbtree_test.c40 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-v6.6/include/linux/
Drbtree_augmented.h75 link = &parent->rb_left; in rb_add_augmented_cached()
152 if (node->RBFIELD.rb_left) { \
153 child = rb_entry(node->RBFIELD.rb_left, RBSTRUCT, RBFIELD); \
199 if (parent->rb_left == old) in __rb_change_child()
200 WRITE_ONCE(parent->rb_left, new); in __rb_change_child()
212 if (parent->rb_left == old) in __rb_change_child_rcu()
213 rcu_assign_pointer(parent->rb_left, new); in __rb_change_child_rcu()
228 struct rb_node *tmp = node->rb_left; in __rb_erase_augmented()
259 tmp = child->rb_left; in __rb_erase_augmented()
292 tmp = tmp->rb_left; in __rb_erase_augmented()
[all …]
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()
175 link = &parent->rb_left; in rb_add_cached()
204 link = &parent->rb_left; in rb_add()
235 link = &parent->rb_left; in rb_find_add()
265 node = node->rb_left; in rb_find()
296 node = node->rb_left; in rb_find_first()
Dinterval_tree_generic.h52 link = &parent->ITRB.rb_left; \
88 if (node->ITRB.rb_left) { \
89 ITSTRUCT *left = rb_entry(node->ITRB.rb_left, \
Drbtree_latch.h90 link = &parent->rb_left; in __lt_insert()
118 node = rcu_dereference_raw(node->rb_left); in __lt_find()
/Linux-v6.6/drivers/block/drbd/
Ddrbd_interval.c40 new = &(*new)->rb_left; in drbd_insert_interval()
44 new = &(*new)->rb_left; in drbd_insert_interval()
79 node = node->rb_left; in drbd_contains_interval()
83 node = node->rb_left; in drbd_contains_interval()
130 if (node->rb_left && in drbd_find_overlap()
131 sector < interval_end(node->rb_left)) { in drbd_find_overlap()
133 node = node->rb_left; in drbd_find_overlap()
/Linux-v6.6/tools/include/linux/
Drbtree_augmented.h128 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()
Drbtree.h26 struct rb_node *rb_left; member
70 node->rb_left = node->rb_right = NULL; in rb_link_node()
188 link = &parent->rb_left; in rb_add_cached()
215 link = &parent->rb_left; in rb_add()
246 link = &parent->rb_left; in rb_find_add()
276 node = node->rb_left; in rb_find()
307 node = node->rb_left; in rb_find_first()
Dinterval_tree_generic.h52 link = &parent->ITRB.rb_left; \
88 if (node->ITRB.rb_left) { \
89 ITSTRUCT *left = rb_entry(node->ITRB.rb_left, \
/Linux-v6.6/net/netfilter/
Dnft_set_rbtree.c74 parent = rcu_dereference_raw(parent->rb_left); in __nft_rbtree_lookup()
85 parent = rcu_dereference_raw(parent->rb_left); in __nft_rbtree_lookup()
95 parent = rcu_dereference_raw(parent->rb_left); in __nft_rbtree_lookup()
156 parent = rcu_dereference_raw(parent->rb_left); in __nft_rbtree_get()
165 parent = rcu_dereference_raw(parent->rb_left); in __nft_rbtree_get()
182 parent = rcu_dereference_raw(parent->rb_left); in __nft_rbtree_get()
331 p = &parent->rb_left; in __nft_rbtree_insert()
340 p = &parent->rb_left; in __nft_rbtree_insert()
472 p = &parent->rb_left; in __nft_rbtree_insert()
476 p = &parent->rb_left; in __nft_rbtree_insert()
[all …]
/Linux-v6.6/drivers/gpu/drm/
Ddrm_vma_manager.c160 iter = iter->rb_left; in drm_vma_offset_lookup_locked()
272 iter = &(*iter)->rb_left; in vma_node_allow()
377 iter = iter->rb_left; in drm_vma_node_revoke()
414 iter = iter->rb_left; in drm_vma_node_is_allowed()
Ddrm_mm.c200 link = &parent->rb.rb_left; in drm_mm_interval_tree_add_node()
230 link = &rb->rb_left; in insert_hole_size()
257 link = &parent->rb_hole_addr.rb_left; in RB_DECLARE_CALLBACKS_MAX()
318 rb = rb->rb_left; in best_hole()
345 rb = node->rb_hole_addr.rb_left; 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-v6.6/Documentation/translations/zh_CN/core-api/
Drbtree.rst90 node = node->rb_left;
121 new = &((*new)->rb_left);
274 if (node->rb.rb_left) {
276 rb_entry(node->rb.rb_left,
311 if (node->rb.rb_left) {
312 subtree_last = rb_entry(node->rb.rb_left,
377 link = &parent->rb.rb_left;
/Linux-v6.6/block/
Dbfq-wf2q.c390 node = &parent->rb_left; in bfq_insert()
436 bfq_update_min(entity, node->rb_left); in bfq_update_active_node()
460 if (node == parent->rb_left && parent->rb_right) in bfq_update_active_tree()
462 else if (parent->rb_left) in bfq_update_active_tree()
463 bfq_update_active_node(parent->rb_left); in bfq_update_active_tree()
488 if (node->rb_left) in bfq_active_insert()
489 node = node->rb_left; in bfq_active_insert()
548 if (!node->rb_right && !node->rb_left) in bfq_find_deepest()
551 deepest = node->rb_left; in bfq_find_deepest()
552 else if (!node->rb_left) in bfq_find_deepest()
[all …]
/Linux-v6.6/mm/
Dinterval_tree.c46 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-v6.6/fs/btrfs/
Dmisc.h76 node = node->rb_left; in rb_simple_search()
109 node = node->rb_left; in rb_simple_search_first()
132 p = &(*p)->rb_left; in rb_simple_insert()
/Linux-v6.6/tools/perf/util/
Dblock-range.c40 p = &parent->rb_left; in block_range__find()
52 struct rb_node **p = &node->rb_left; in rb_link_left_of_node()
65 p = &node->rb_left; in rb_link_right_of_node()
89 p = &parent->rb_left; in block_range__create()
Drblist.c26 p = &(*p)->rb_left; in rblist__add_node()
68 p = &(*p)->rb_left; in __rblist__findnew()
/Linux-v6.6/arch/arm/xen/
Dp2m.c48 link = &(*link)->rb_left; in xen_add_phys_to_mach_entry()
81 n = n->rb_left; in __pfn_to_mfn()
171 n = n->rb_left; in __set_phys_to_machine_multi()
/Linux-v6.6/net/ceph/
Dstring_table.c24 p = &(*p)->rb_left; in ceph_find_or_create_string()
59 p = &(*p)->rb_left; in ceph_find_or_create_string()
/Linux-v6.6/drivers/iommu/
Diova.c132 while (node->rb_left && to_iova(node->rb_left)->pfn_lo >= limit_pfn) in iova_find_limit()
133 node = node->rb_left; in iova_find_limit()
135 if (!node->rb_left) in iova_find_limit()
138 next = node->rb_left; in iova_find_limit()
165 new = &((*new)->rb_left); in iova_insert_rbtree()
348 node = node->rb_left; in private_find_iova()
/Linux-v6.6/fs/xfs/
Dxfs_extent_busy.c52 rbp = &(*rbp)->rb_left; in xfs_extent_busy_insert_list()
121 rbp = rbp->rb_left; in xfs_extent_busy_search()
318 rbp = rbp->rb_left; in xfs_extent_busy_reuse()
370 rbp = rbp->rb_left; in xfs_extent_busy_trim()
/Linux-v6.6/drivers/staging/media/atomisp/pci/hmm/
Dhmm_bo.c84 (this->pgnr > pgnr && !this->node.rb_left)) { in __bo_search_and_remove_from_free_rbtree()
94 this->node.rb_left, pgnr); in __bo_search_and_remove_from_free_rbtree()
138 if (!n->rb_left) in __bo_search_by_addr()
140 n = n->rb_left; in __bo_search_by_addr()
163 if (!n->rb_left) in __bo_search_by_addr_in_range()
165 n = n->rb_left; in __bo_search_by_addr_in_range()
191 new = &((*new)->rb_left); in __bo_insert_to_free_rbtree()
224 new = &((*new)->rb_left); in __bo_insert_to_alloc_rbtree()

12345678910