| /openbmc/u-boot/lib/ |
| H A D | rbtree.c | 84 tmp = gparent->rb_right; in __rb_insert()
108 tmp = parent->rb_right; in __rb_insert()
130 tmp = node->rb_right; in __rb_insert()
428 while (n->rb_right) in rb_last()
429 n = n->rb_right; in rb_last()
445 if (node->rb_right) { in rb_next()
446 node = node->rb_right; in rb_next()
479 while (node->rb_right) in rb_prev()
480 node=node->rb_right; in rb_prev()
504 if (victim->rb_right) in rb_replace_node()
[all …]
|
| /openbmc/linux/tools/lib/ |
| H A D | rbtree.c | 115 tmp = gparent->rb_right; in __rb_insert()
139 tmp = parent->rb_right; in __rb_insert()
163 tmp = node->rb_right; in __rb_insert()
198 tmp = node->rb_right; in __rb_insert()
481 while (n->rb_right) in rb_last()
482 n = n->rb_right; in rb_last()
497 if (node->rb_right) { in rb_next()
498 node = node->rb_right; in rb_next()
530 while (node->rb_right) in rb_prev()
531 node = node->rb_right; in rb_prev()
[all …]
|
| /openbmc/linux/lib/ |
| H A D | rbtree.c | 115 tmp = gparent->rb_right; in __rb_insert()
139 tmp = parent->rb_right; in __rb_insert()
163 tmp = node->rb_right; in __rb_insert()
198 tmp = node->rb_right; in __rb_insert()
486 while (n->rb_right) in rb_last()
487 n = n->rb_right; in rb_last()
503 if (node->rb_right) { in rb_next()
504 node = node->rb_right; in rb_next()
537 while (node->rb_right) in rb_prev()
564 if (victim->rb_right) in rb_replace_node()
[all …]
|
| H A 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()
|
| /openbmc/qemu/util/ |
| H A D | interval-tree.c | 156 if (node->rb_right) { in rb_next()
157 node = node->rb_right; in rb_next()
230 tmp = gparent->rb_right; in rb_insert_augmented()
253 tmp = parent->rb_right; in rb_insert_augmented()
277 tmp = node->rb_right; in rb_insert_augmented()
313 tmp = node->rb_right; in rb_insert_augmented()
361 sibling = parent->rb_right; in rb_erase_color()
381 tmp1 = sibling->rb_right; in rb_erase_color()
531 RBNode *child = node->rb_right; in rb_erase_augmented()
663 if (node->rb.rb_right) { in interval_tree_compute_max()
[all …]
|
| /openbmc/linux/include/linux/ |
| H A D | rbtree_augmented.h | 77 link = &parent->rb_right; in rb_add_augmented_cached()
157 if (node->RBFIELD.rb_right) { \
158 child = rb_entry(node->RBFIELD.rb_right, RBSTRUCT, RBFIELD); \
202 WRITE_ONCE(parent->rb_right, new); in __rb_change_child()
215 rcu_assign_pointer(parent->rb_right, new); in __rb_change_child_rcu()
227 struct rb_node *child = node->rb_right; in __rb_erase_augmented()
271 child2 = successor->rb_right; in __rb_erase_augmented()
294 child2 = successor->rb_right; in __rb_erase_augmented()
296 WRITE_ONCE(successor->rb_right, child); in __rb_erase_augmented()
|
| H A 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; \
|
| H A D | rbtree.h | 63 node->rb_left = node->rb_right = NULL; in rb_link_node()
72 node->rb_left = node->rb_right = NULL; in rb_link_node_rcu()
177 link = &parent->rb_right; in rb_add_cached()
206 link = &parent->rb_right; in rb_add()
237 link = &parent->rb_right; in rb_find_add()
267 node = node->rb_right; in rb_find()
298 node = node->rb_right; in rb_find_first()
|
| H A D | rbtree_latch.h | 92 link = &parent->rb_right; in __lt_insert()
120 node = rcu_dereference_raw(node->rb_right); in __lt_find()
|
| /openbmc/linux/tools/include/linux/ |
| H A 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; \
|
| H A D | rbtree.h | 25 struct rb_node *rb_right; member
70 node->rb_left = node->rb_right = NULL; in rb_link_node()
190 link = &parent->rb_right; in rb_add_cached()
217 link = &parent->rb_right; in rb_add()
248 link = &parent->rb_right; in rb_find_add()
278 node = node->rb_right; in rb_find()
309 node = node->rb_right; in rb_find_first()
|
| H A 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()
|
| /openbmc/linux/drivers/block/drbd/ |
| H A D | drbd_interval.c | 42 new = &(*new)->rb_right; in drbd_insert_interval()
46 new = &(*new)->rb_right; in drbd_insert_interval()
81 node = node->rb_right; in drbd_contains_interval()
85 node = node->rb_right; in drbd_contains_interval()
140 node = node->rb_right; in drbd_find_overlap()
|
| /openbmc/u-boot/include/linux/ |
| H A D | rbtree_augmented.h | 105 parent->rb_right = new; in __rb_change_child()
117 struct rb_node *child = node->rb_right, *tmp = node->rb_left; in __rb_erase_augmented()
159 child2 = successor->rb_right; in __rb_erase_augmented()
181 parent->rb_left = child2 = successor->rb_right; in __rb_erase_augmented()
182 successor->rb_right = child; in __rb_erase_augmented()
|
| H A D | rbtree.h | 26 struct rb_node *rb_right; member
72 node->rb_left = node->rb_right = NULL; in rb_link_node()
|
| /openbmc/linux/mm/ |
| H A 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()
|
| /openbmc/linux/drivers/gpu/drm/ |
| H A D | drm_vma_manager.c | 155 iter = iter->rb_right; in drm_vma_offset_lookup_locked()
270 iter = &(*iter)->rb_right; in vma_node_allow()
375 iter = iter->rb_right; in drm_vma_node_revoke()
412 iter = iter->rb_right; in drm_vma_node_is_allowed()
|
| /openbmc/linux/Documentation/translations/zh_CN/core-api/ |
| H A D | rbtree.rst | 92 node = node->rb_right;
123 new = &((*new)->rb_right);
294 if (node->rb.rb_right) {
295 node = rb_entry(node->rb.rb_right,
317 if (node->rb.rb_right) {
318 subtree_last = rb_entry(node->rb.rb_right,
379 link = &parent->rb.rb_right;
|
| /openbmc/linux/fs/btrfs/ |
| H A D | misc.h | 78 node = node->rb_right; in rb_simple_search()
111 node = node->rb_right; in rb_simple_search_first()
134 p = &(*p)->rb_right; in rb_simple_insert()
|
| /openbmc/linux/block/ |
| H A D | bfq-wf2q.c | 392 node = &parent->rb_right; in bfq_insert()
435 bfq_update_min(entity, node->rb_right); in bfq_update_active_node()
461 bfq_update_active_node(parent->rb_right); in bfq_update_active_tree()
490 else if (node->rb_right) in bfq_active_insert()
491 node = node->rb_right; in bfq_active_insert()
548 if (!node->rb_right && !node->rb_left) in bfq_find_deepest()
550 else if (!node->rb_right) in bfq_find_deepest()
553 deepest = node->rb_right; in bfq_find_deepest()
556 if (deepest->rb_right) in bfq_find_deepest()
557 deepest = deepest->rb_right; in bfq_find_deepest()
[all …]
|
| /openbmc/linux/tools/perf/util/ |
| H A D | block-range.c | 42 p = &parent->rb_right; in block_range__find()
55 p = &node->rb_right; in rb_link_left_of_node()
62 struct rb_node **p = &node->rb_right; in rb_link_right_of_node()
91 p = &parent->rb_right; in block_range__create()
|
| H A D | rblist.c | 28 p = &(*p)->rb_right; in rblist__add_node()
70 p = &(*p)->rb_right; in __rblist__findnew()
|
| /openbmc/linux/arch/arm/xen/ |
| H A D | p2m.c | 50 link = &(*link)->rb_right; in xen_add_phys_to_mach_entry()
83 n = n->rb_right; in __pfn_to_mfn()
173 n = n->rb_right; in __set_phys_to_machine_multi()
|
| /openbmc/linux/net/ceph/ |
| H A 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()
|
| /openbmc/linux/net/netfilter/ |
| H A D | nft_set_rbtree.c | 82 parent = rcu_dereference_raw(parent->rb_right); in __nft_rbtree_lookup()
160 parent = rcu_dereference_raw(parent->rb_right); in __nft_rbtree_get()
337 p = &parent->rb_right; in __nft_rbtree_insert()
342 p = &parent->rb_right; in __nft_rbtree_insert()
474 p = &parent->rb_right; in __nft_rbtree_insert()
478 p = &parent->rb_right; in __nft_rbtree_insert()
561 parent = parent->rb_right; in nft_rbtree_deactivate()
569 parent = parent->rb_right; in nft_rbtree_deactivate()
|