| /kernel/linux/linux-5.10/tools/perf/util/ |
| H A D | bpf-event.h | 23 struct rb_node rb_node; member
27 struct rb_node rb_node; member
|
| /kernel/linux/linux-5.10/lib/ |
| H A D | timerqueue.c | 29 struct rb_node **p = &head->rb_root.rb_root.rb_node; in timerqueue_add()
30 struct rb_node *parent = NULL; in timerqueue_add()
85 struct rb_node *next; in timerqueue_iterate_next()
|
| /kernel/linux/linux-5.10/tools/perf/ui/stdio/ |
| H A D | hist.c | 113 struct rb_node *node, *next; in __callchain__fprintf_graph()
130 child = rb_entry(node, struct callchain_node, rb_node); in __callchain__fprintf_graph()
206 static bool need_percent_display(struct rb_node *node, u64 parent_samples) in need_percent_display()
213 cnode = rb_entry(node, struct callchain_node, rb_node); in need_percent_display()
225 struct rb_node *node; in callchain__fprintf_graph()
232 cnode = rb_entry(node, struct callchain_node, rb_node); in callchain__fprintf_graph()
311 struct rb_node *rb_node = rb_first(tree); in callchain__fprintf_flat() local
313 while (rb_node) { in callchain__fprintf_flat()
314 chain = rb_entry(rb_node, struc in callchain__fprintf_flat()
362 struct rb_node *rb_node = rb_first(tree); callchain__fprintf_folded() local
[all...] |
| /kernel/linux/linux-6.6/tools/perf/ui/stdio/ |
| H A D | hist.c | 113 struct rb_node *node, *next; in __callchain__fprintf_graph()
130 child = rb_entry(node, struct callchain_node, rb_node); in __callchain__fprintf_graph()
206 static bool need_percent_display(struct rb_node *node, u64 parent_samples) in need_percent_display()
213 cnode = rb_entry(node, struct callchain_node, rb_node); in need_percent_display()
225 struct rb_node *node; in callchain__fprintf_graph()
232 cnode = rb_entry(node, struct callchain_node, rb_node); in callchain__fprintf_graph()
311 struct rb_node *rb_node = rb_first(tree); in callchain__fprintf_flat() local
313 while (rb_node) { in callchain__fprintf_flat()
314 chain = rb_entry(rb_node, struc in callchain__fprintf_flat()
362 struct rb_node *rb_node = rb_first(tree); callchain__fprintf_folded() local
[all...] |
| /kernel/linux/linux-6.6/fs/btrfs/ |
| H A D | ref-verify.c | 25 struct rb_node node;
39 struct rb_node node;
74 struct rb_node node;
81 struct rb_node **p = &root->rb_node; in insert_block_entry()
82 struct rb_node *parent_node = NULL; in insert_block_entry()
103 struct rb_node *n; in lookup_block_entry()
106 n = root->rb_node; in lookup_block_entry()
122 struct rb_node **p = &root->rb_node; in insert_root_entry()
[all...] |
| H A D | relocation.c | 93 struct rb_node rb_node; member
109 struct rb_node rb_node; member
241 struct rb_node *rb_node; in update_backref_node() local
242 rb_erase(&node->rb_node, &cache->rb_root); in update_backref_node()
244 rb_node = rb_simple_insert(&cache->rb_root, node->bytenr, &node->rb_node); in update_backref_node()
245 if (rb_node) in update_backref_node()
365 struct rb_node *rb_node; find_reloc_root() local
559 struct rb_node *rb_node; clone_backref_node() local
638 struct rb_node *rb_node; __add_reloc_root() local
671 struct rb_node *rb_node; __del_reloc_root() local
715 struct rb_node *rb_node; __update_reloc_root() local
2107 struct rb_node *rb_node; free_block_list() local
3204 struct rb_node *rb_node; add_tree_block() local
[all...] |
| /kernel/linux/linux-5.10/block/ |
| H A D | elevator.c | 256 struct rb_node **p = &root->rb_node; in elv_rb_add()
257 struct rb_node *parent = NULL; in elv_rb_add()
262 __rq = rb_entry(parent, struct request, rb_node); in elv_rb_add()
270 rb_link_node(&rq->rb_node, parent, p); in elv_rb_add()
271 rb_insert_color(&rq->rb_node, root); in elv_rb_add()
277 BUG_ON(RB_EMPTY_NODE(&rq->rb_node)); in elv_rb_del()
278 rb_erase(&rq->rb_node, root); in elv_rb_del()
279 RB_CLEAR_NODE(&rq->rb_node); in elv_rb_del()
285 struct rb_node * in elv_rb_find()
[all...] |
| /kernel/linux/linux-6.6/block/ |
| H A D | elevator.c | 229 struct rb_node **p = &root->rb_node; in elv_rb_add()
230 struct rb_node *parent = NULL; in elv_rb_add()
235 __rq = rb_entry(parent, struct request, rb_node); in elv_rb_add()
243 rb_link_node(&rq->rb_node, parent, p); in elv_rb_add()
244 rb_insert_color(&rq->rb_node, root); in elv_rb_add()
250 BUG_ON(RB_EMPTY_NODE(&rq->rb_node)); in elv_rb_del()
251 rb_erase(&rq->rb_node, root); in elv_rb_del()
252 RB_CLEAR_NODE(&rq->rb_node); in elv_rb_del()
258 struct rb_node * in elv_rb_find()
[all...] |
| /kernel/linux/linux-5.10/fs/btrfs/ |
| H A D | relocation.c | 82 struct rb_node rb_node; member
98 struct rb_node rb_node; member
229 struct rb_node *rb_node; in update_backref_node() local
230 rb_erase(&node->rb_node, &cache->rb_root); in update_backref_node()
232 rb_node = rb_simple_insert(&cache->rb_root, node->bytenr, &node->rb_node); in update_backref_node()
233 if (rb_node) in update_backref_node()
353 struct rb_node *rb_node; find_reloc_root() local
546 struct rb_node *rb_node; clone_backref_node() local
625 struct rb_node *rb_node; __add_reloc_root() local
657 struct rb_node *rb_node; __del_reloc_root() local
701 struct rb_node *rb_node; __update_reloc_root() local
2007 struct rb_node *rb_node; free_block_list() local
2870 struct rb_node *rb_node; add_tree_block() local
[all...] |
| /kernel/linux/linux-6.6/mm/ |
| H A D | shmem_quota.c | 49 struct rb_node node;
100 struct rb_node *node; in shmem_free_file_info()
119 struct rb_node *node = ((struct rb_root *)info->dqi_priv)->rb_node; in shmem_get_next_id()
168 struct rb_node **n = &((struct rb_root *)info->dqi_priv)->rb_node; in shmem_acquire_dquot()
170 struct rb_node *parent = NULL, *new_node = NULL; in shmem_acquire_dquot()
267 struct rb_node *node = ((struct rb_root *)info->dqi_priv)->rb_node; in shmem_release_dquot()
|
| /third_party/mesa3d/src/util/tests/ |
| H A D | rb_tree_test.cpp | 53 struct rb_node node;
57 rb_test_node_cmp_void(const struct rb_node *n, const void *v) in rb_test_node_cmp_void()
64 rb_test_node_cmp(const struct rb_node *a, const struct rb_node *b) in rb_test_node_cmp()
164 struct rb_node *n; in validate_search()
191 struct rb_node *next = rb_node_next(n); in validate_search()
198 struct rb_node *prev = rb_node_prev(n); in validate_search()
|
| /kernel/linux/linux-5.10/tools/perf/ui/browsers/ |
| H A D | map.c | 27 struct symbol *sym = rb_entry(nd, struct symbol, rb_node); in map_browser__write()
45 return ((void *)browser) - sizeof(struct rb_node) - sizeof(u32); in symbol__browser_index()
67 browser->b.top = &sym->rb_node; in map_browser__search()
116 struct rb_node *nd; in map__browse()
121 struct symbol *pos = rb_entry(nd, struct symbol, rb_node); in map__browse()
|
| /kernel/linux/linux-5.10/include/linux/ |
| H A D | interval_tree_generic.h | 16 * ITRB: name of struct rb_node field within ITSTRUCT
41 struct rb_node **link = &root->rb_root.rb_node, *rb_parent = NULL; \
124 if (!root->rb_root.rb_node) \
140 node = rb_entry(root->rb_root.rb_node, ITSTRUCT, ITRB); \
154 struct rb_node *rb = node->ITRB.rb_right, *prev; \
|
| /kernel/linux/linux-6.6/include/linux/ |
| H A D | interval_tree_generic.h | 16 * ITRB: name of struct rb_node field within ITSTRUCT
41 struct rb_node **link = &root->rb_root.rb_node, *rb_parent = NULL; \
124 if (!root->rb_root.rb_node) \
140 node = rb_entry(root->rb_root.rb_node, ITSTRUCT, ITRB); \
154 struct rb_node *rb = node->ITRB.rb_right, *prev; \
|
| /kernel/linux/linux-6.6/tools/perf/tests/ |
| H A D | maps.c | 19 struct map_rb_node *rb_node; in check_maps() local
27 maps__for_each_entry(maps, rb_node) { in check_maps()
28 struct map *map = rb_node->map; in check_maps()
46 maps__for_each_entry(maps, rb_node) { in check_maps()
47 struct map *map = rb_node->map; in check_maps()
|
| /kernel/linux/linux-6.6/tools/perf/ui/browsers/ |
| H A D | map.c | 27 struct symbol *sym = rb_entry(nd, struct symbol, rb_node); in map_browser__write()
45 return ((void *)browser) - sizeof(struct rb_node) - sizeof(u32); in symbol__browser_index()
67 browser->b.top = &sym->rb_node; in map_browser__search()
116 struct rb_node *nd; in map__browse()
121 struct symbol *pos = rb_entry(nd, struct symbol, rb_node); in map__browse()
|
| /kernel/linux/linux-6.6/tools/include/linux/ |
| H A D | interval_tree_generic.h | 16 * ITRB: name of struct rb_node field within ITSTRUCT
41 struct rb_node **link = &root->rb_root.rb_node, *rb_parent = NULL; \
124 if (!root->rb_root.rb_node) \
140 node = rb_entry(root->rb_root.rb_node, ITSTRUCT, ITRB); \
154 struct rb_node *rb = node->ITRB.rb_right, *prev; \
|
| /kernel/linux/linux-6.6/tools/bpf/resolve_btfids/ |
| H A D | main.c | 102 struct rb_node rb_node; member
179 struct rb_node *p = root->rb_node; in btf_id__find()
184 id = rb_entry(p, struct btf_id, rb_node); in btf_id__find()
199 struct rb_node **p = &root->rb_node; in btf_id__add()
200 struct rb_node *parent = NULL; in btf_id__add()
206 id = rb_entry(parent, struct btf_id, rb_node); in btf_id__add()
220 rb_link_node(&id->rb_node, paren in btf_id__add()
[all...] |
| /kernel/linux/linux-5.10/drivers/gpu/drm/i915/gt/ |
| H A D | intel_engine_user.c | 19 struct rb_node *p = i915->uabi_engines.rb_node; in intel_engine_lookup_user()
56 container_of((struct rb_node *)A, typeof(*a), uabi_node); in engine_cmp()
58 container_of((struct rb_node *)B, typeof(*b), uabi_node); in engine_cmp()
85 container_of((struct rb_node *)pos, typeof(*engine), in sort_engines()
192 struct rb_node **p, *prev; in intel_engines_driver_register()
198 p = &i915->uabi_engines.rb_node; in intel_engines_driver_register()
201 container_of((struct rb_node *)it, typeof(*engine), in intel_engines_driver_register()
|
| /kernel/linux/linux-6.6/drivers/gpu/drm/i915/gt/ |
| H A D | intel_engine_user.c | 19 struct rb_node *p = i915->uabi_engines.rb_node; in intel_engine_lookup_user()
60 container_of((struct rb_node *)A, typeof(*a), uabi_node); in engine_cmp()
62 container_of((struct rb_node *)B, typeof(*b), uabi_node); in engine_cmp()
89 container_of((struct rb_node *)pos, typeof(*engine), in sort_engines()
211 struct rb_node **p, *prev; in intel_engines_driver_register()
217 p = &i915->uabi_engines.rb_node; in intel_engines_driver_register()
220 container_of((struct rb_node *)it, typeof(*engine), in intel_engines_driver_register()
|
| /kernel/linux/linux-5.10/drivers/md/ |
| H A D | dm-writecache.c | 80 struct rb_node rb_node; member
591 struct rb_node *node = wc->tree.rb_node; in writecache_find_entry()
597 e = container_of(node, struct wc_entry, rb_node); in writecache_find_entry()
602 e->rb_node.rb_left : e->rb_node.rb_right); in writecache_find_entry()
609 node = rb_next(&e->rb_node); in writecache_find_entry()
612 e = container_of(node, struct wc_entry, rb_node); in writecache_find_entry()
621 node = rb_prev(&e->rb_node); in writecache_find_entry()
815 struct rb_node *rb_node = rb_prev(&e->rb_node); writecache_flush() local
[all...] |
| /kernel/linux/linux-5.10/mm/ |
| H A D | vmalloc.c | 460 get_subtree_max_size(struct rb_node *node) in get_subtree_max_size()
464 va = rb_entry_safe(node, struct vmap_area, rb_node); in get_subtree_max_size()
475 get_subtree_max_size(va->rb_node.rb_left), in compute_subtree_max_size()
476 get_subtree_max_size(va->rb_node.rb_right)); in compute_subtree_max_size()
480 struct vmap_area, rb_node, unsigned long, subtree_max_size, va_size)
495 struct rb_node *n = vmap_area_root.rb_node; in __find_vmap_area()
500 va = rb_entry(n, struct vmap_area, rb_node); in __find_vmap_area()
520 static __always_inline struct rb_node **
522 struct rb_root *root, struct rb_node *fro in find_va_links()
[all...] |
| /kernel/linux/linux-6.6/drivers/md/ |
| H A D | dm-writecache.c | 83 struct rb_node rb_node; member
611 struct rb_node *node = wc->tree.rb_node; in writecache_find_entry()
617 e = container_of(node, struct wc_entry, rb_node); in writecache_find_entry()
622 e->rb_node.rb_left : e->rb_node.rb_right); in writecache_find_entry()
629 node = rb_next(&e->rb_node); in writecache_find_entry()
633 e = container_of(node, struct wc_entry, rb_node); in writecache_find_entry()
642 node = rb_prev(&e->rb_node); in writecache_find_entry()
838 struct rb_node *rb_node = rb_prev(&e->rb_node); writecache_flush() local
[all...] |
| /kernel/linux/linux-5.10/drivers/base/regmap/ |
| H A D | regcache-rbtree.c | 31 struct rb_node node;
66 struct rb_node *node; in regcache_rbtree_lookup()
78 node = rbtree_ctx->root.rb_node; in regcache_rbtree_lookup()
99 struct rb_node **new, *parent; in regcache_rbtree_insert()
105 new = &root->rb_node; in regcache_rbtree_insert()
137 struct rb_node *node; in rbtree_show()
215 struct rb_node *next; in regcache_rbtree_exit()
373 struct rb_node *node; in regcache_rbtree_write()
402 node = rbtree_ctx->root.rb_node; in regcache_rbtree_write()
469 struct rb_node *nod in regcache_rbtree_sync()
[all...] |
| /kernel/linux/linux-6.6/drivers/base/regmap/ |
| H A D | regcache-rbtree.c | 31 struct rb_node node;
66 struct rb_node *node; in regcache_rbtree_lookup()
78 node = rbtree_ctx->root.rb_node; in regcache_rbtree_lookup()
99 struct rb_node **new, *parent; in regcache_rbtree_insert()
105 new = &root->rb_node; in regcache_rbtree_insert()
137 struct rb_node *node; in rbtree_show()
215 struct rb_node *next; in regcache_rbtree_exit()
373 struct rb_node *node; in regcache_rbtree_write()
402 node = rbtree_ctx->root.rb_node; in regcache_rbtree_write()
469 struct rb_node *nod in regcache_rbtree_sync()
[all...] |