Home
last modified time | relevance | path

Searched refs:rb_right (Results 1 – 25 of 181) 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
115 tmp = gparent->rb_right; in __rb_insert()
139 tmp = parent->rb_right; in __rb_insert()
155 WRITE_ONCE(parent->rb_right, tmp); in __rb_insert()
163 tmp = node->rb_right; in __rb_insert()
176 WRITE_ONCE(gparent->rb_left, tmp); /* == parent->rb_right */ in __rb_insert()
177 WRITE_ONCE(parent->rb_right, gparent); in __rb_insert()
198 tmp = node->rb_right; in __rb_insert()
200 WRITE_ONCE(node->rb_right, parent); in __rb_insert()
211 WRITE_ONCE(gparent->rb_right, tm in __rb_insert()
[all...]
/linux/lib/
H A Drbtree.c115 tmp = gparent->rb_right; in __rb_insert()
139 tmp = parent->rb_right; in __rb_insert()
155 WRITE_ONCE(parent->rb_right, tmp); in __rb_insert()
163 tmp = node->rb_right; in __rb_insert()
177 WRITE_ONCE(parent->rb_right, gparent); in __rb_insert()
198 tmp = node->rb_right; in __rb_insert()
200 WRITE_ONCE(node->rb_right, parent); in __rb_insert()
211 WRITE_ONCE(gparent->rb_right, tmp); /* == parent->rb_left */ in __rb_insert()
240 sibling = parent->rb_right; in ____rb_erase_color()
253 WRITE_ONCE(parent->rb_right, tmp1); in ____rb_erase_color()
[all …]
/linux/include/linux/
H A Drbtree.h72 while (n->rb_right) in rb_last()
73 n = n->rb_right; in rb_last()
91 node->rb_left = node->rb_right = NULL; in rb_link_node()
100 node->rb_left = node->rb_right = NULL; in rb_link_node_rcu()
205 link = &parent->rb_right; in rb_add_cached()
234 link = &parent->rb_right; in rb_add()
266 link = &parent->rb_right; in rb_find_add_cached()
302 link = &parent->rb_right; in rb_find_add()
338 link = &parent->rb_right; in rb_find_add_rcu()
368 node = node->rb_right; in rb_find()
[all …]
H A Drbtree_augmented.h77 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 Drbtree_types.h7 struct rb_node *rb_right; member
/linux/tools/include/linux/
H A Drbtree.h25 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 Drbtree_augmented.h133 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()
/linux/drivers/block/drbd/
H A Ddrbd_interval.c42 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()
/linux/mm/
H A Dinterval_tree.c38 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()
H A Dshmem_quota.c134 node = node->rb_right; in shmem_get_next_id()
187 n = &(*n)->rb_right; in shmem_acquire_dquot()
286 node = node->rb_right; in shmem_release_dquot()
/linux/Documentation/translations/zh_CN/core-api/
H A Drbtree.rst92 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;
/linux/block/
H A Dbfq-wf2q.c392 node = &parent->rb_right; in bfq_insert()
435 bfq_update_min(entity, node->rb_right); in bfq_update_active_node()
460 if (node == parent->rb_left && parent->rb_right) in bfq_update_active_tree()
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()
[all …]
/linux/tools/perf/util/
H A Dblock-range.c42 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 Drblist.c28 p = &(*p)->rb_right; in rblist__add_node()
70 p = &(*p)->rb_right; in __rblist__findnew()
H A Dsrcline.c285 p = &(*p)->rb_right; in srcline__tree_insert()
304 n = n->rb_right; in srcline__tree_find()
369 p = &(*p)->rb_right; in inlines__tree_insert()
388 n = n->rb_right; in inlines__tree_find()
H A Dmem2node.c31 p = &(*p)->rb_right; in phys_entry__insert()
131 p = &(*p)->rb_right; in mem2node__node()
/linux/arch/arm/xen/
H A Dp2m.c50 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()
/linux/net/netfilter/
H A Dnft_set_rbtree.c84 parent = rcu_dereference_raw(parent->rb_right); in __nft_rbtree_lookup()
158 parent = rcu_dereference_raw(parent->rb_right); in __nft_rbtree_get()
335 p = &parent->rb_right; in __nft_rbtree_insert()
340 p = &parent->rb_right; in __nft_rbtree_insert()
472 p = &parent->rb_right; in __nft_rbtree_insert()
476 p = &parent->rb_right; in __nft_rbtree_insert()
564 parent = parent->rb_right; in nft_rbtree_deactivate()
572 parent = parent->rb_right; in nft_rbtree_deactivate()
/linux/net/ceph/
H A Dstring_table.c26 p = &(*p)->rb_right; in ceph_find_or_create_string()
61 p = &(*p)->rb_right; in ceph_find_or_create_string()
/linux/fs/xfs/
H A Dxfs_extent_busy.c65 rbp = &(*rbp)->rb_right; in xfs_extent_busy_insert_list()
136 rbp = rbp->rb_right; in xfs_extent_busy_search()
331 rbp = rbp->rb_right; in xfs_extent_busy_reuse()
386 rbp = rbp->rb_right; in xfs_extent_busy_trim()
/linux/drivers/infiniband/sw/rdmavt/
H A Dmcast.c126 n = n->rb_right; in rvt_mcast_find()
175 n = &pn->rb_right; in rvt_mcast_add()
331 n = n->rb_right; in rvt_detach_mcast()
/linux/net/rxrpc/
H A Dconn_service.c48 p = rcu_dereference_raw(p->rb_right); in rxrpc_find_service_conn_rcu()
83 pp = &(*pp)->rb_right; in rxrpc_publish_service_conn()
/linux/net/bridge/
H A Dbr_multicast_eht.c59 node = node->rb_right; in br_multicast_eht_host_lookup()
95 node = node->rb_right; in br_multicast_eht_set_entry_lookup()
119 node = node->rb_right; in br_multicast_eht_set_lookup()
261 link = &((*link)->rb_right); in __eht_lookup_create_host()
307 link = &((*link)->rb_right); in __eht_lookup_create_set_entry()
358 link = &((*link)->rb_right); in __eht_lookup_create_set()
/linux/arch/powerpc/kernel/
H A Deeh_cache.c65 n = n->rb_right; in __eeh_addr_cache_get_device()
132 p = &parent->rb_right; in eeh_addr_cache_insert()
/linux/Documentation/core-api/
H A Drbtree.rst99 node = node->rb_right;
131 new = &((*new)->rb_right);
332 if (node->rb.rb_right) {
333 node = rb_entry(node->rb.rb_right,
355 if (node->rb.rb_right) {
356 subtree_last = rb_entry(node->rb.rb_right,
417 link = &parent->rb.rb_right;

12345678