| /openbmc/u-boot/lib/ |
| H A D | rbtree.c | 122 parent->rb_right = tmp = node->rb_left; in __rb_insert()
123 node->rb_left = parent; in __rb_insert()
142 gparent->rb_left = tmp; /* == parent->rb_right */ in __rb_insert()
150 tmp = gparent->rb_left; in __rb_insert()
161 tmp = parent->rb_left; in __rb_insert()
164 parent->rb_left = tmp = node->rb_right; in __rb_insert()
172 tmp = node->rb_left; in __rb_insert()
177 parent->rb_left = gparent; in __rb_insert()
217 parent->rb_right = tmp1 = sibling->rb_left; in ____rb_erase_color()
218 sibling->rb_left = parent; in ____rb_erase_color()
[all …]
|
| /openbmc/linux/tools/lib/ |
| H A 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 …]
|
| /openbmc/linux/lib/ |
| H A 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 …]
|
| H A 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()
|
| /openbmc/qemu/util/ |
| H A D | interval-tree.c | 138 node->rb_left = node->rb_right = NULL; in rb_link_node()
158 while (node->rb_left) { in rb_next()
159 node = node->rb_left; in rb_next()
183 } else if (parent->rb_left == old) { in rb_change_child()
184 qatomic_set(&parent->rb_left, new); in rb_change_child()
268 tmp = node->rb_left; in rb_insert_augmented()
270 qatomic_set(&node->rb_left, parent); in rb_insert_augmented()
290 qatomic_set(&gparent->rb_left, tmp); /* == parent->rb_right */ in rb_insert_augmented()
299 tmp = gparent->rb_left; in rb_insert_augmented()
310 tmp = parent->rb_left; in rb_insert_augmented()
[all …]
|
| /openbmc/linux/include/linux/ |
| H A D | rbtree_augmented.h | 75 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 …]
|
| 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()
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()
|
| H A 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, \
|
| /openbmc/linux/drivers/block/drbd/ |
| H A D | drbd_interval.c | 40 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()
|
| /openbmc/linux/tools/include/linux/ |
| H A 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()
|
| H A D | rbtree.h | 26 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()
|
| H A 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, \
|
| /openbmc/u-boot/include/linux/ |
| H A D | rbtree_augmented.h | 102 if (parent->rb_left == old) in __rb_change_child()
103 parent->rb_left = new; in __rb_change_child()
117 struct rb_node *child = node->rb_right, *tmp = node->rb_left; in __rb_erase_augmented()
147 tmp = child->rb_left; in __rb_erase_augmented()
179 tmp = tmp->rb_left; in __rb_erase_augmented()
181 parent->rb_left = child2 = successor->rb_right; in __rb_erase_augmented()
188 successor->rb_left = tmp = node->rb_left; in __rb_erase_augmented()
|
| H A D | rbtree.h | 27 struct rb_node *rb_left; member
72 node->rb_left = node->rb_right = NULL; in rb_link_node()
|
| /openbmc/linux/net/netfilter/ |
| H A D | nft_set_rbtree.c | 73 parent = rcu_dereference_raw(parent->rb_left); in __nft_rbtree_lookup()
84 parent = rcu_dereference_raw(parent->rb_left); in __nft_rbtree_lookup()
94 parent = rcu_dereference_raw(parent->rb_left); in __nft_rbtree_lookup()
155 parent = rcu_dereference_raw(parent->rb_left); in __nft_rbtree_get()
164 parent = rcu_dereference_raw(parent->rb_left); in __nft_rbtree_get()
181 parent = rcu_dereference_raw(parent->rb_left); in __nft_rbtree_get()
332 p = &parent->rb_left; in __nft_rbtree_insert()
341 p = &parent->rb_left; in __nft_rbtree_insert()
473 p = &parent->rb_left; in __nft_rbtree_insert()
477 p = &parent->rb_left; in __nft_rbtree_insert()
[all...] |
| /openbmc/linux/drivers/gpu/drm/ |
| H A D | drm_vma_manager.c | 160 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()
|
| /openbmc/linux/Documentation/translations/zh_CN/core-api/ |
| H A D | rbtree.rst | 90 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;
|
| /openbmc/linux/block/ |
| H A D | bfq-wf2q.c | 390 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 …]
|
| /openbmc/linux/mm/ |
| H A 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()
|
| /openbmc/linux/fs/btrfs/ |
| H A D | misc.h | 76 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()
|
| /openbmc/linux/tools/perf/util/ |
| H A D | block-range.c | 40 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()
|
| H A D | rblist.c | 26 p = &(*p)->rb_left; in rblist__add_node()
68 p = &(*p)->rb_left; in __rblist__findnew()
|
| /openbmc/linux/arch/arm/xen/ |
| H A D | p2m.c | 48 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()
|
| /openbmc/linux/net/ceph/ |
| H A 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()
|
| /openbmc/u-boot/drivers/mtd/ubi/ |
| H A D | attach.c | 271 p = &(*p)->rb_left; in add_volume()
479 p = &(*p)->rb_left; in ubi_add_to_av()
613 p = p->rb_left; in ubi_find_av()
1138 if (this->rb_left) in destroy_av()
1139 this = this->rb_left; in destroy_av()
1146 if (this->rb_left == &aeb->u.rb) in destroy_av()
1147 this->rb_left = NULL; in destroy_av()
1188 if (rb->rb_left) in destroy_ai()
1189 rb = rb->rb_left; in destroy_ai()
1197 if (rb->rb_left == &av->rb) in destroy_ai()
[all …]
|