Home
last modified time | relevance | path

Searched refs:rb_right (Results 1 – 25 of 238) sorted by relevance

12345678910

/linux/tools/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/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 …]
H A Drbtree_test.c43 new = &parent->rb_right; in insert()
61 new = &parent->rb_right; in insert_cached()
102 new = &parent->rb.rb_right; in RB_DECLARE_CALLBACKS_MAX()
127 new = &parent->rb.rb_right; in insert_augmented_cached()
206 WARN_ON_ONCE((!rb->rb_left || !rb->rb_right) && in check()
233 if (node->rb.rb_right) { in check_augmented()
234 subtree = rb_entry(node->rb.rb_right, struct test_node, in check_augmented()
/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 Dinterval_tree_generic.h54 link = &parent->ITRB.rb_right; \
107 node = rb_entry(node->ITRB.rb_right, ITSTRUCT, ITRB); \
150 struct rb_node *rb = node->ITRB.rb_right, *prev; \
174 rb = node->ITRB.rb_right; \
H A Drbtree_latch.h92 link = &parent->rb_right; in __lt_insert()
120 node = rcu_dereference_raw(node->rb_right); in __lt_find()
/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()
H A Dinterval_tree_generic.h54 link = &parent->ITRB.rb_right; \
107 node = rb_entry(node->ITRB.rb_right, ITSTRUCT, ITRB); \
150 struct rb_node *rb = node->ITRB.rb_right, *prev; \
174 rb = node->ITRB.rb_right; \
/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/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/drivers/gpu/drm/
H A Ddrm_vma_manager.c156 iter = iter->rb_right; in drm_vma_offset_lookup_locked()
271 iter = &(*iter)->rb_right; in vma_node_allow()
376 iter = iter->rb_right; in drm_vma_node_revoke()
413 iter = iter->rb_right; in drm_vma_node_is_allowed()
H A Ddrm_mm.c187 link = &hole_node->rb.rb_right; in drm_mm_interval_tree_add_node()
203 link = &parent->rb.rb_right; in drm_mm_interval_tree_add_node()
233 link = &rb->rb_right; in insert_hole_size()
260 link = &parent->rb_hole_addr.rb_right; in RB_DECLARE_CALLBACKS_MAX()
317 rb = rb->rb_right; in best_hole()
348 rb = node->rb_hole_addr.rb_right; in find_hole_addr()
411 DECLARE_NEXT_HOLE_ADDR(next_hole_high_addr, rb_left, rb_right) in DECLARE_NEXT_HOLE_ADDR() argument
412 DECLARE_NEXT_HOLE_ADDR(next_hole_low_addr, rb_right, rb_left) in DECLARE_NEXT_HOLE_ADDR()
/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/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()
/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.c385 p = &(*p)->rb_right; in srcline__tree_insert()
404 n = n->rb_right; in srcline__tree_find()
469 p = &(*p)->rb_right; in inlines__tree_insert()
488 n = n->rb_right; in inlines__tree_find()
/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/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/drivers/staging/media/atomisp/pci/hmm/
H A Dhmm_bo.c75 if (!this->node.rb_right) in __bo_search_and_remove_from_free_rbtree()
78 this->node.rb_right, pgnr); in __bo_search_and_remove_from_free_rbtree()
129 if (!n->rb_right) in __bo_search_by_addr()
131 n = n->rb_right; in __bo_search_by_addr()
156 if (!n->rb_right) in __bo_search_by_addr_in_range()
158 n = n->rb_right; in __bo_search_by_addr_in_range()
180 new = &((*new)->rb_right); in __bo_insert_to_free_rbtree()
213 new = &((*new)->rb_right); in __bo_insert_to_alloc_rbtree()
/linux/fs/xfs/
H A Dxfs_extent_busy.c64 rbp = &(*rbp)->rb_right; in xfs_extent_busy_insert_list()
135 rbp = rbp->rb_right; in xfs_extent_busy_search()
330 rbp = rbp->rb_right; in xfs_extent_busy_reuse()
385 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/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()

12345678910