| /linux-4.19.296/lib/ |
| D | rbtree.c | 131 tmp = gparent->rb_right; in __rb_insert()
155 tmp = parent->rb_right; in __rb_insert()
171 WRITE_ONCE(parent->rb_right, tmp); in __rb_insert()
179 tmp = node->rb_right; in __rb_insert()
193 WRITE_ONCE(parent->rb_right, gparent); in __rb_insert()
214 tmp = node->rb_right; in __rb_insert()
216 WRITE_ONCE(node->rb_right, parent); in __rb_insert()
227 WRITE_ONCE(gparent->rb_right, tmp); /* == parent->rb_left */ in __rb_insert()
256 sibling = parent->rb_right; in ____rb_erase_color()
269 WRITE_ONCE(parent->rb_right, tmp1); in ____rb_erase_color()
[all …]
|
| D | rbtree_test.c | 41 new = &parent->rb_right; in insert()
59 new = &parent->rb_right; in insert_cached()
88 if (node->rb.rb_right) { in augment_recompute()
89 child_augmented = rb_entry(node->rb.rb_right, struct test_node, in augment_recompute()
116 new = &parent->rb.rb_right; in RB_DECLARE_CALLBACKS()
141 new = &parent->rb.rb_right; in insert_augmented_cached()
220 WARN_ON_ONCE((!rb->rb_left || !rb->rb_right) && in check()
|
| D | timerqueue.c | 56 p = &(*p)->rb_right; in timerqueue_add()
|
| /linux-4.19.296/include/linux/ |
| D | interval_tree_generic.h | 54 if (node->ITRB.rb_right) { \
55 subtree_last = rb_entry(node->ITRB.rb_right, \
84 link = &parent->ITRB.rb_right; \
137 if (node->ITRB.rb_right) { \
138 node = rb_entry(node->ITRB.rb_right, \
184 struct rb_node *rb = node->ITRB.rb_right, *prev; \
208 rb = node->ITRB.rb_right; \
|
| D | rbtree_augmented.h | 142 WRITE_ONCE(parent->rb_right, new); in __rb_change_child()
155 rcu_assign_pointer(parent->rb_right, new); in __rb_change_child_rcu()
168 struct rb_node *child = node->rb_right; in __rb_erase_augmented()
215 child2 = successor->rb_right; in __rb_erase_augmented()
238 child2 = successor->rb_right; in __rb_erase_augmented()
240 WRITE_ONCE(successor->rb_right, child); in __rb_erase_augmented()
|
| D | rbtree.h | 38 struct rb_node *rb_right; member
109 node->rb_left = node->rb_right = NULL; in rb_link_node()
118 node->rb_left = node->rb_right = NULL; in rb_link_node_rcu()
|
| D | rbtree_latch.h | 92 link = &parent->rb_right; in __lt_insert()
120 node = rcu_dereference_raw(node->rb_right); in __lt_find()
|
| /linux-4.19.296/block/ |
| D | bfq-wf2q.c | 390 node = &parent->rb_right; in bfq_insert()
433 bfq_update_min(entity, node->rb_right); in bfq_update_active_node()
458 if (node == parent->rb_left && parent->rb_right) in bfq_update_active_tree()
459 bfq_update_active_node(parent->rb_right); in bfq_update_active_tree()
493 else if (node->rb_right) in bfq_active_insert()
494 node = node->rb_right; in bfq_active_insert()
558 if (!node->rb_right && !node->rb_left) in bfq_find_deepest()
560 else if (!node->rb_right) in bfq_find_deepest()
563 deepest = node->rb_right; in bfq_find_deepest()
566 if (deepest->rb_right) in bfq_find_deepest()
[all …]
|
| /linux-4.19.296/fs/xfs/ |
| D | xfs_extent_busy.c | 57 rbp = &(*rbp)->rb_right; in xfs_extent_busy_insert()
110 rbp = rbp->rb_right; in xfs_extent_busy_search()
308 rbp = rbp->rb_right; in xfs_extent_busy_reuse()
362 rbp = rbp->rb_right; in xfs_extent_busy_trim()
|
| /linux-4.19.296/fs/btrfs/ |
| D | ulist.c | 126 n = n->rb_right; in ulist_rbtree_search()
155 p = &(*p)->rb_right; in ulist_rbtree_insert()
|
| D | ref-verify.c | 88 p = &(*p)->rb_right; in insert_block_entry()
107 n = n->rb_right; in lookup_block_entry()
129 p = &(*p)->rb_right; in insert_root_entry()
176 p = &(*p)->rb_right; in insert_ref_entry()
196 n = n->rb_right; in lookup_root_entry()
932 n = n->rb_right; in btrfs_free_ref_tree_range()
|
| D | delayed-ref.c | 123 p = &(*p)->rb_right; in htree_insert()
151 p = &(*p)->rb_right; in tree_insert()
182 n = n->rb_right; in find_ref_head()
|
| /linux-4.19.296/fs/ubifs/ |
| D | orphan.c | 89 p = &(*p)->rb_right; in ubifs_add_orphan()
127 p = p->rb_right; in ubifs_delete_orphan()
529 p = &(*p)->rb_right; in insert_dead_orphan()
759 p = p->rb_right; in dbg_find_orphan()
786 p = &(*p)->rb_right; in dbg_ins_check_orphan()
808 p = p->rb_right; in dbg_find_check_orphan()
|
| D | log.c | 54 p = p->rb_right; in ubifs_search_bud()
87 p = p->rb_right; in ubifs_get_wbuf()
139 p = &(*p)->rb_right; in ubifs_add_bud()
563 p = &(*p)->rb_right; in done_already()
|
| /linux-4.19.296/include/linux/ceph/ |
| D | libceph.h | 204 n = &(*n)->rb_right; \
237 n = n->rb_right; \
|
| /linux-4.19.296/fs/fscache/ |
| D | object-list.c | 62 p = &(*p)->rb_right; in fscache_objlist_add()
118 p = p->rb_right; in fscache_objlist_lookup()
|
| /linux-4.19.296/fs/ext4/ |
| D | block_validity.c | 83 n = &(*n)->rb_right; in add_system_zone()
172 n = n->rb_right; in ext4_data_block_valid_rcu()
|
| /linux-4.19.296/drivers/base/regmap/ |
| D | regcache-rbtree.c | 91 node = node->rb_right; in regcache_rbtree_lookup()
123 new = &((*new)->rb_right); in regcache_rbtree_insert()
447 node = node->rb_right; in regcache_rbtree_write()
|
| /linux-4.19.296/fs/jffs2/ |
| D | nodelist.c | 134 link = &base->rb.rb_right; in jffs2_fragtree_insert()
189 rb_link_node(&holefrag->rb, &this->rb, &this->rb.rb_right); in no_overlapping_node()
204 rb_link_node(&newfrag->rb, &this->rb, &this->rb.rb_right); in no_overlapping_node()
543 next = frag->rb.rb_right; in jffs2_lookup_node_frag()
|
| D | readinode.c | 188 next = tn->rb.rb_right; in jffs2_lookup_tn()
346 link = &insert_point->rb.rb_right; in jffs2_add_tn_to_tree()
351 link = &insert_point->rb.rb_right; in jffs2_add_tn_to_tree()
408 BUG_ON(node->rb_right); in eat_last()
415 link = &parent->rb_right; in eat_last()
437 link = &parent->rb_right; in ver_insert()
|
| D | nodelist.h | 351 #define frag_right(frag) rb_entry((frag)->rb.rb_right, struct jffs2_node_frag, rb)
358 #define tn_right(tn) rb_entry((tn)->rb.rb_right, struct jffs2_tmp_dnode_info, rb)
|
| /linux-4.19.296/fs/nfs/blocklayout/ |
| D | extent_tree.c | 56 node = node->rb_right; in __ext_tree_search()
162 p = &(*p)->rb_right; in __ext_tree_insert()
334 node = node->rb_right; in __ext_tree_lookup()
|
| /linux-4.19.296/fs/ocfs2/ |
| D | uptodate.c | 235 n = n->rb_right; in ocfs2_search_cache_tree()
339 p = &(*p)->rb_right; in __ocfs2_insert_cache_tree()
|
| /linux-4.19.296/fs/cachefiles/ |
| D | namei.c | 106 p = p->rb_right; in cachefiles_mark_object_buried()
173 _p = &(*_p)->rb_right; in cachefiles_mark_object_active()
914 _n = _n->rb_right; in cachefiles_check_active()
|
| /linux-4.19.296/fs/f2fs/ |
| D | extent_cache.c | 45 node = node->rb_right; in __lookup_rb_tree_slow()
78 p = &(*p)->rb_right; in f2fs_lookup_rb_tree_for_insert()
128 pnode = &(*pnode)->rb_right; in f2fs_lookup_rb_tree_ret()
|