| /kernel/linux/linux-6.6/fs/nilfs2/ |
| H A D | the_nilfs.c | 821 struct rb_node *n; in nilfs_lookup_root()
825 n = nilfs->ns_cptree.rb_node; in nilfs_lookup_root()
827 root = rb_entry(n, struct nilfs_root, rb_node); in nilfs_lookup_root()
847 struct rb_node **p, *parent; in nilfs_find_or_create_root()
861 p = &nilfs->ns_cptree.rb_node; in nilfs_find_or_create_root()
866 root = rb_entry(parent, struct nilfs_root, rb_node); in nilfs_find_or_create_root()
887 rb_link_node(&new->rb_node, parent, p); in nilfs_find_or_create_root()
888 rb_insert_color(&new->rb_node, &nilfs->ns_cptree); in nilfs_find_or_create_root()
906 rb_erase(&root->rb_node, &nilfs->ns_cptree); in nilfs_put_root()
|
| /kernel/linux/linux-6.6/fs/ext2/ |
| H A D | balloc.c | 201 struct rb_node *n; in __rsv_window_dump()
292 struct rb_node *n = root->rb_node; in search_reserve_window()
332 struct rb_node *node = &rsv->rsv_node; in ext2_rsv_window_add()
335 struct rb_node ** p = &root->rb_node; in ext2_rsv_window_add()
336 struct rb_node * parent = NULL; in ext2_rsv_window_add()
755 struct rb_node *next; in find_next_reservable_window()
1009 struct rb_node *next; in try_to_extend_reservation()
|
| /kernel/linux/linux-6.6/fs/btrfs/ |
| H A D | tree-mod-log.c | 16 struct rb_node node;
78 struct rb_node *node; in btrfs_put_tree_mod_seq()
79 struct rb_node *next; in btrfs_put_tree_mod_seq()
137 struct rb_node **new; in tree_mod_log_insert()
138 struct rb_node *parent = NULL; in tree_mod_log_insert()
146 new = &tm_root->rb_node; in tree_mod_log_insert()
479 struct rb_node *node; in __tree_mod_log_search()
485 node = tm_root->rb_node; in __tree_mod_log_search()
797 struct rb_node *next; in tree_mod_log_rewind()
|
| H A D | qgroup.h | 112 struct rb_node node;
130 struct rb_node node;
232 struct rb_node node; /* tree of qgroups */
|
| /kernel/linux/linux-6.6/drivers/staging/hungtask/ |
| H A D | hungtask_base.c | 192 struct rb_node *p = NULL; in refresh_task_type()
229 struct rb_node **p = &root->rb_node; in find_task()
231 struct rb_node *parent = NULL; in find_task()
250 struct rb_node **p = &root->rb_node; in insert_task()
251 struct rb_node *parent = NULL; in insert_task()
472 struct rb_node *n = NULL; in shrink_list_tasks()
714 struct rb_node *n = NULL; in htbase_post_process()
|
| /kernel/linux/linux-5.10/tools/perf/tests/ |
| H A D | hists_common.c | 167 struct rb_node *node; in print_hists_in()
197 struct rb_node *node; in print_hists_out()
206 he = rb_entry(node, struct hist_entry, rb_node); in print_hists_out()
|
| /kernel/linux/linux-5.10/tools/perf/util/ |
| H A D | sort.h | 92 struct rb_node rb_node_in;
93 struct rb_node rb_node; member
|
| H A D | callchain.h | 64 struct rb_node rb_node_in; /* to insert nodes in an rbtree */
65 struct rb_node rb_node; /* to sort nodes in an output tree */ member
|
| /kernel/linux/linux-5.10/fs/btrfs/ |
| H A D | qgroup.h | 108 struct rb_node node;
126 struct rb_node node;
219 struct rb_node node; /* tree of qgroups */
|
| H A D | delayed-inode.c | 347 struct rb_node *node, *prev_node = NULL; in __btrfs_lookup_delayed_item()
351 node = root->rb_node; in __btrfs_lookup_delayed_item()
355 rb_node); in __btrfs_lookup_delayed_item()
373 rb_node); in __btrfs_lookup_delayed_item()
385 rb_node); in __btrfs_lookup_delayed_item()
404 struct rb_node **p, *node; in __btrfs_add_delayed_item()
405 struct rb_node *parent_node = NULL; in __btrfs_add_delayed_item()
417 p = &root->rb_root.rb_node; in __btrfs_add_delayed_item()
418 node = &ins->rb_node; in __btrfs_add_delayed_item()
423 rb_node); in __btrfs_add_delayed_item()
[all...] |
| /kernel/linux/linux-5.10/include/drm/ |
| H A D | drm_mm.h | 166 struct rb_node rb;
167 struct rb_node rb_hole_size;
168 struct rb_node rb_hole_addr;
|
| /kernel/linux/linux-6.6/include/drm/ |
| H A D | drm_mm.h | 168 struct rb_node rb;
169 struct rb_node rb_hole_size;
170 struct rb_node rb_hole_addr;
|
| /kernel/linux/linux-6.6/tools/perf/tests/ |
| H A D | hists_common.c | 167 struct rb_node *node; in print_hists_in()
199 struct rb_node *node; in print_hists_out()
208 he = rb_entry(node, struct hist_entry, rb_node); in print_hists_out()
|
| /kernel/linux/linux-6.6/tools/perf/util/ |
| H A D | callchain.h | 64 struct rb_node rb_node_in; /* to insert nodes in an rbtree */
65 struct rb_node rb_node; /* to sort nodes in an output tree */ member
|
| H A D | sort.h | 91 struct rb_node rb_node_in;
92 struct rb_node rb_node; member
|
| H A D | metricgroup.c | 39 struct rb_node *nd; in metricgroup__lookup()
59 static int metric_event_cmp(struct rb_node *rb_node, const void *entry) in metric_event_cmp() argument
61 struct metric_event *a = container_of(rb_node, in metric_event_cmp()
73 static struct rb_node *metric_event_new(struct rblist *rblist __maybe_unused, in metric_event_new()
88 struct rb_node *rb_node) in metric_event_delete()
90 struct metric_event *me = container_of(rb_node, struct metric_event, nd); in metric_event_delete()
388 struct rb_node nd;
399 static int mep_cmp(struct rb_node *rb_nod argument
87 metric_event_delete(struct rblist *rblist __maybe_unused, struct rb_node *rb_node) metric_event_delete() argument
[all...] |
| /kernel/linux/linux-5.10/fs/jffs2/ |
| H A D | readinode.c | 177 struct rb_node *next; in jffs2_lookup_tn()
182 next = tn_root->rb_node; in jffs2_lookup_tn()
338 struct rb_node *parent; in jffs2_add_tn_to_tree()
339 struct rb_node **link = &rii->tn_root.rb_node; in jffs2_add_tn_to_tree()
402 static void eat_last(struct rb_root *root, struct rb_node *node) in eat_last()
404 struct rb_node *parent = rb_parent(node); in eat_last()
405 struct rb_node **link; in eat_last()
411 link = &root->rb_node; in eat_last()
426 struct rb_node **lin in ver_insert()
[all...] |
| /kernel/linux/linux-6.6/fs/jffs2/ |
| H A D | readinode.c | 177 struct rb_node *next; in jffs2_lookup_tn()
182 next = tn_root->rb_node; in jffs2_lookup_tn()
338 struct rb_node *parent; in jffs2_add_tn_to_tree()
339 struct rb_node **link = &rii->tn_root.rb_node; in jffs2_add_tn_to_tree()
402 static void eat_last(struct rb_root *root, struct rb_node *node) in eat_last()
404 struct rb_node *parent = rb_parent(node); in eat_last()
405 struct rb_node **link; in eat_last()
411 link = &root->rb_node; in eat_last()
426 struct rb_node **lin in ver_insert()
[all...] |
| /kernel/linux/linux-6.6/fs/ntfs3/ |
| H A D | bitmap.c | 26 struct rb_node node;
125 struct rb_node *node, *next; in wnd_close()
142 static struct rb_node *rb_lookup(struct rb_root *root, size_t v) in rb_lookup()
144 struct rb_node **p = &root->rb_node; in rb_lookup()
145 struct rb_node *r = NULL; in rb_lookup()
169 struct rb_node **p = &root->rb_node; in rb_insert_count()
170 struct rb_node *parent = NULL; in rb_insert_count()
202 struct rb_node ** in rb_insert_start()
[all...] |
| /kernel/linux/linux-5.10/fs/ceph/ |
| H A D | inode.c | 130 struct rb_node **p; in __get_or_create_frag()
131 struct rb_node *parent = NULL; in __get_or_create_frag()
135 p = &ci->i_fragtree.rb_node; in __get_or_create_frag()
170 struct rb_node *n = ci->i_fragtree.rb_node; in __ceph_find_frag()
337 struct rb_node *rb_node; in ceph_fill_fragtree() local
352 rb_node = rb_first(&ci->i_fragtree); in ceph_fill_fragtree()
353 frag = rb_entry(rb_node, struct ceph_inode_frag, node); in ceph_fill_fragtree()
354 if (frag->frag != ceph_frag_make(0, 0) || rb_next(rb_node)) in ceph_fill_fragtree()
[all...] |
| /kernel/linux/linux-5.10/net/sched/ |
| H A D | sch_hfsc.c | 128 struct rb_node el_node; /* qdisc's eligible tree member */
130 struct rb_node vt_node; /* parent's vt_tree member */
132 struct rb_node cf_node; /* parent's cf_heap member */
188 struct rb_node **p = &cl->sched->eligible.rb_node; in eltree_insert()
189 struct rb_node *parent = NULL; in eltree_insert()
222 struct rb_node *n; in eltree_get_mindl()
238 struct rb_node *n; in eltree_get_minel()
253 struct rb_node **p = &cl->cl_parent->vt_tree.rb_node; in vttree_insert()
[all...] |
| /kernel/linux/linux-6.6/fs/f2fs/ |
| H A D | gc.c | 397 struct rb_node *cur = rb_first_cached(root), *next; in f2fs_check_victim_tree()
405 cur_ve = rb_entry(cur, struct victim_entry, rb_node); in f2fs_check_victim_tree()
406 next_ve = rb_entry(next, struct victim_entry, rb_node); in f2fs_check_victim_tree()
424 struct rb_node *node = am->root.rb_root.rb_node; in __lookup_victim_entry()
428 ve = rb_entry(node, struct victim_entry, rb_node); in __lookup_victim_entry()
460 struct rb_node **p = &root->rb_root.rb_node; in __insert_victim_entry()
461 struct rb_node *parent = NULL; in __insert_victim_entry()
468 ve = rb_entry(parent, struct victim_entry, rb_node); in __insert_victim_entry()
[all...] |
| /kernel/linux/linux-6.6/net/sched/ |
| H A D | sch_hfsc.c | 127 struct rb_node el_node; /* qdisc's eligible tree member */
129 struct rb_node vt_node; /* parent's vt_tree member */
131 struct rb_node cf_node; /* parent's cf_heap member */
187 struct rb_node **p = &cl->sched->eligible.rb_node; in eltree_insert()
188 struct rb_node *parent = NULL; in eltree_insert()
221 struct rb_node *n; in eltree_get_mindl()
237 struct rb_node *n; in eltree_get_minel()
252 struct rb_node **p = &cl->cl_parent->vt_tree.rb_node; in vttree_insert()
[all...] |
| /kernel/linux/linux-6.6/kernel/sched/ |
| H A D | deadline.c | 78 return !RB_EMPTY_NODE(&dl_se->rb_node); in on_dl_rq()
490 return rb_first_cached(&dl_rq->root) == &dl_se->rb_node; in is_leftmost()
593 static inline bool __pushable_less(struct rb_node *a, const struct rb_node *b) in __pushable_less()
604 struct rb_node *leftmost; in enqueue_pushable_dl_task()
619 struct rb_node *leftmost; in dequeue_pushable_dl_task()
1451 rb_entry((node), struct sched_dl_entity, rb_node)
1482 struct rb_node *leftmost = rb_first_cached(&dl_rq->root); in dec_dl_deadline()
1527 static inline bool __dl_less(struct rb_node *a, const struct rb_node *
[all...] |
| /kernel/linux/linux-5.10/block/ |
| H A D | bfq-iosched.h | 115 struct rb_node weights_node;
147 struct rb_node rb_node; member
254 struct rb_node pos_node;
1034 struct bfq_entity *bfq_entity_of(struct rb_node *node);
|