Home
last modified time | relevance | path

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

12345678

/linux/tools/lib/
H A Drbtree.c38 * All stores to the tree structure (rb_left and rb_right) must be done using
116 if (parent != tmp) { /* parent == gparent->rb_left */ in __rb_insert()
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()
211 WRITE_ONCE(gparent->rb_right, tmp); /* == parent->rb_left */ in __rb_insert()
[all...]
/linux/include/linux/
H A Drbtree_augmented.h75 link = &parent->rb_left; in rb_add_augmented_cached()
173 if (node->RBFIELD.rb_left) { \
174 child = rb_entry(node->RBFIELD.rb_left, RBSTRUCT, RBFIELD); \
220 if (parent->rb_left == old) in __rb_change_child()
221 WRITE_ONCE(parent->rb_left, new); in __rb_change_child()
233 if (parent->rb_left == old) in __rb_change_child_rcu()
234 rcu_assign_pointer(parent->rb_left, new); in __rb_change_child_rcu()
249 struct rb_node *tmp = node->rb_left; in __rb_erase_augmented()
280 tmp = child->rb_left; in __rb_erase_augmented()
313 tmp = tmp->rb_left; in __rb_erase_augmented()
[all …]
/linux/drivers/block/drbd/
H A 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/tools/include/linux/
H A 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()
213 /* Still case 1, but this time the child is 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()
[all...]
H A 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()
/linux/block/
H A 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/Documentation/translations/zh_CN/core-api/
H A 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/drivers/gpu/drm/
H A Ddrm_vma_manager.c161 iter = iter->rb_left; in drm_vma_offset_lookup_locked()
273 iter = &(*iter)->rb_left; in vma_node_allow()
378 iter = iter->rb_left; in drm_vma_node_revoke()
415 iter = iter->rb_left; in drm_vma_node_is_allowed()
H A Ddrm_prime.c121 p = &rb->rb_left; in drm_prime_add_buf_handle()
136 p = &rb->rb_left; in drm_prime_add_buf_handle()
159 rb = rb->rb_left; in drm_prime_lookup_buf_by_handle()
182 rb = rb->rb_left; in drm_prime_lookup_buf_handle()
209 rb = rb->rb_left; in drm_prime_remove_buf_handle()
/linux/lib/
H A Drbtree_test.c41 new = &parent->rb_left; in insert()
59 new = &parent->rb_left; in insert_cached()
100 new = &parent->rb.rb_left; in RB_DECLARE_CALLBACKS_MAX()
125 new = &parent->rb.rb_left; in insert_augmented_cached()
206 WARN_ON_ONCE((!rb->rb_left || !rb->rb_right) && in check()
227 if (node->rb.rb_left) { in check_augmented()
228 subtree = rb_entry(node->rb.rb_left, struct test_node, in check_augmented()
/linux/mm/
H A Dinterval_tree.c46 while (parent->shared.rb.rb_left) { in mapping_rmap_tree_insert_after()
47 parent = rb_entry(parent->shared.rb.rb_left, in mapping_rmap_tree_insert_after()
52 link = &parent->shared.rb.rb_left; in mapping_rmap_tree_insert_after()
H A Dshmem_quota.c132 node = node->rb_left; in shmem_get_next_id()
185 n = &(*n)->rb_left; in shmem_acquire_dquot()
284 node = node->rb_left; in shmem_release_dquot()
/linux/tools/perf/util/
H A 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()
H A Drblist.c26 p = &(*p)->rb_left; in rblist__add_node()
68 p = &(*p)->rb_left; in __rblist__findnew()
H A Dsrcline.c377 p = &(*p)->rb_left; in srcline__tree_insert()
396 n = n->rb_left; in srcline__tree_find()
468 p = &(*p)->rb_left; in inlines__tree_insert()
487 n = n->rb_left; in inlines__tree_find()
H A Dmem2node.c29 p = &(*p)->rb_left; in phys_entry__insert()
129 p = &(*p)->rb_left; in mem2node__node()
/linux/arch/arm/xen/
H A 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/net/ceph/
H A 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/fs/xfs/
H A Dxfs_extent_busy.c61 rbp = &(*rbp)->rb_left; in xfs_extent_busy_insert_list()
130 rbp = rbp->rb_left; in xfs_extent_busy_search()
327 rbp = rbp->rb_left; in xfs_extent_busy_reuse()
382 rbp = rbp->rb_left; in xfs_extent_busy_trim()
/linux/drivers/mtd/ubi/
H A Dattach.c125 p = &(*p)->rb_left; in find_or_add_av()
598 p = &(*p)->rb_left; in ubi_add_to_av()
1284 if (this->rb_left) in destroy_av()
1285 this = this->rb_left; in destroy_av()
1292 if (this->rb_left == &aeb->u.rb) in destroy_av()
1293 this->rb_left = NULL; in destroy_av()
1341 if (rb->rb_left) in destroy_ai()
1342 rb = rb->rb_left; in destroy_ai()
1350 if (rb->rb_left == &av->rb) in destroy_ai()
1351 rb->rb_left = NULL; in destroy_ai()
/linux/net/bridge/
H A Dbr_multicast_eht.c57 node = node->rb_left; in br_multicast_eht_host_lookup()
93 node = node->rb_left; in br_multicast_eht_set_entry_lookup()
117 node = node->rb_left; in br_multicast_eht_set_lookup()
259 link = &((*link)->rb_left); in __eht_lookup_create_host()
305 link = &((*link)->rb_left); in __eht_lookup_create_set_entry()
356 link = &((*link)->rb_left); in __eht_lookup_create_set()
/linux/net/rxrpc/
H A Dconn_service.c46 p = rcu_dereference_raw(p->rb_left); in rxrpc_find_service_conn_rcu()
81 pp = &(*pp)->rb_left; in rxrpc_publish_service_conn()
/linux/fs/btrfs/
H A Dmisc.h144 node = node->rb_left; in rb_simple_search()
177 node = node->rb_left; in rb_simple_search_first()
/linux/net/netfilter/
H A Dnft_set_rbtree.c365 p = &parent->rb_left; in __nft_rbtree_insert()
374 p = &parent->rb_left; in __nft_rbtree_insert()
528 p = &parent->rb_left; in __nft_rbtree_insert()
532 p = &parent->rb_left; in __nft_rbtree_insert()
808 parent = parent->rb_left; in nft_rbtree_deactivate()
814 parent = parent->rb_left; in nft_rbtree_deactivate()
823 parent = parent->rb_left; in nft_rbtree_deactivate()
/linux/arch/powerpc/kernel/
H A Deeh_cache.c63 n = n->rb_left; in __eeh_addr_cache_get_device()
130 p = &parent->rb_left; in eeh_addr_cache_insert()

12345678