| /linux-6.6.21/tools/include/linux/ |
| D | rbtree.h | 30 struct rb_root { struct
36 #define RB_ROOT (struct rb_root) { NULL, } argument
48 extern void rb_insert_color(struct rb_node *, struct rb_root *);
49 extern void rb_erase(struct rb_node *, struct rb_root *);
55 extern struct rb_node *rb_first(const struct rb_root *);
56 extern struct rb_node *rb_last(const struct rb_root *);
59 extern struct rb_node *rb_first_postorder(const struct rb_root *);
64 struct rb_root *root);
103 static inline void rb_erase_init(struct rb_node *n, struct rb_root *root) in rb_erase_init()
120 struct rb_root rb_root; member
[all …]
|
| D | rbtree_augmented.h | 35 extern void __rb_insert_augmented(struct rb_node *node, struct rb_root *root,
49 rb_insert_augmented(struct rb_node *node, struct rb_root *root, in rb_insert_augmented()
62 rb_insert_augmented(node, &root->rb_root, augment); in rb_insert_augmented_cached()
172 struct rb_node *parent, struct rb_root *root) in __rb_change_child()
183 extern void __rb_erase_color(struct rb_node *parent, struct rb_root *root,
187 __rb_erase_augmented(struct rb_node *node, struct rb_root *root, in __rb_erase_augmented()
291 rb_erase_augmented(struct rb_node *node, struct rb_root *root, in rb_erase_augmented()
305 rb_erase_augmented(node, &root->rb_root, augment); in rb_erase_augmented_cached()
|
| /linux-6.6.21/include/linux/ |
| D | rbtree.h | 39 extern void rb_insert_color(struct rb_node *, struct rb_root *);
40 extern void rb_erase(struct rb_node *, struct rb_root *);
46 extern struct rb_node *rb_first(const struct rb_root *);
47 extern struct rb_node *rb_last(const struct rb_root *);
50 extern struct rb_node *rb_first_postorder(const struct rb_root *);
55 struct rb_root *root);
57 struct rb_root *root);
114 rb_insert_color(node, &root->rb_root); in rb_insert_color_cached()
126 rb_erase(node, &root->rb_root); in rb_erase_cached()
137 rb_replace_node(victim, new, &root->rb_root); in rb_replace_node_cached()
[all …]
|
| D | rbtree_types.h | 12 struct rb_root { struct
27 struct rb_root rb_root; argument
31 #define RB_ROOT (struct rb_root) { NULL, }
|
| D | rbtree_augmented.h | 33 extern void __rb_insert_augmented(struct rb_node *node, struct rb_root *root,
47 rb_insert_augmented(struct rb_node *node, struct rb_root *root, in rb_insert_augmented()
60 rb_insert_augmented(node, &root->rb_root, augment); in rb_insert_augmented_cached()
68 struct rb_node **link = &tree->rb_root.rb_node; in rb_add_augmented_cached()
196 struct rb_node *parent, struct rb_root *root) in __rb_change_child()
209 struct rb_node *parent, struct rb_root *root) in __rb_change_child_rcu()
220 extern void __rb_erase_color(struct rb_node *parent, struct rb_root *root,
224 __rb_erase_augmented(struct rb_node *node, struct rb_root *root, in __rb_erase_augmented()
326 rb_erase_augmented(struct rb_node *node, struct rb_root *root, in rb_erase_augmented()
340 rb_erase_augmented(node, &root->rb_root, augment); in rb_erase_augmented_cached()
|
| D | timerqueue.h | 15 struct rb_root_cached rb_root; member
36 struct rb_node *leftmost = rb_first_cached(&head->rb_root); in timerqueue_getnext()
58 head->rb_root = RB_ROOT_CACHED; in timerqueue_init_head()
|
| /linux-6.6.21/arch/powerpc/kernel/ |
| D | eeh_cache.c | 50 struct rb_root rb_root; member
56 struct rb_node *n = pci_io_addr_cache_root.rb_root.rb_node; in __eeh_addr_cache_get_device()
103 n = rb_first(&cache->rb_root); in eeh_addr_cache_print()
121 struct rb_node **p = &pci_io_addr_cache_root.rb_root.rb_node; in eeh_addr_cache_insert()
155 rb_insert_color(&piar->rb_node, &pci_io_addr_cache_root.rb_root); in eeh_addr_cache_insert()
218 n = rb_first(&pci_io_addr_cache_root.rb_root); in __eeh_addr_cache_rmv_dev()
226 rb_erase(n, &pci_io_addr_cache_root.rb_root); in __eeh_addr_cache_rmv_dev()
270 for (n = rb_first(&pci_io_addr_cache_root.rb_root); n; n = rb_next(n)) { in eeh_addr_cache_show()
|
| /linux-6.6.21/include/linux/ceph/ |
| D | osdmap.h | 182 struct rb_root pg_temp;
183 struct rb_root primary_temp;
186 struct rb_root pg_upmap; /* PG := raw set */
187 struct rb_root pg_upmap_items; /* from -> to within raw set */
191 struct rb_root pg_pools;
326 int ceph_parse_crush_location(char *crush_location, struct rb_root *locs);
327 int ceph_compare_crush_locs(struct rb_root *locs1, struct rb_root *locs2);
328 void ceph_clear_crush_locs(struct rb_root *locs);
331 struct rb_root *locs);
|
| D | osd_client.h | 89 struct rb_root o_requests;
90 struct rb_root o_linger_requests;
91 struct rb_root o_backoff_mappings;
92 struct rb_root o_backoffs_by_id;
365 struct rb_root backoffs;
411 struct rb_root osds; /* osds */
418 struct rb_root linger_requests; /* lingering requests */
419 struct rb_root map_checks;
420 struct rb_root linger_map_checks;
|
| /linux-6.6.21/lib/ |
| D | rbtree_test.c | 34 struct rb_node **new = &root->rb_root.rb_node, *parent = NULL; in insert()
46 rb_insert_color(&node->rb, &root->rb_root); in insert()
51 struct rb_node **new = &root->rb_root.rb_node, *parent = NULL; in insert_cached()
71 rb_erase(&node->rb, &root->rb_root); in erase()
88 struct rb_node **new = &root->rb_root.rb_node, *rb_parent = NULL; in RB_DECLARE_CALLBACKS_MAX()
106 rb_insert_augmented(&node->rb, &root->rb_root, &augment_callbacks); in RB_DECLARE_CALLBACKS_MAX()
112 struct rb_node **new = &root->rb_root.rb_node, *rb_parent = NULL; in insert_augmented_cached()
140 rb_erase_augmented(&node->rb, &root->rb_root, &augment_callbacks); in erase_augmented()
175 rbtree_postorder_for_each_entry_safe(cur, n, &root.rb_root, rb) in check_postorder_foreach()
185 for (rb = rb_first_postorder(&root.rb_root); rb; rb = rb_next_postorder(rb)) in check_postorder()
[all …]
|
| D | timerqueue.c | 40 return rb_add_cached(&node->node, &head->rb_root, __timerqueue_less); in timerqueue_add()
57 rb_erase_cached(&node->node, &head->rb_root); in timerqueue_del()
60 return !RB_EMPTY_ROOT(&head->rb_root.rb_root); in timerqueue_del()
|
| D | rbtree.c | 76 struct rb_root *root, int color) in __rb_rotate_set_parents()
85 __rb_insert(struct rb_node *node, struct rb_root *root, in __rb_insert()
227 ____rb_erase_color(struct rb_node *parent, struct rb_root *root, in ____rb_erase_color()
410 void __rb_erase_color(struct rb_node *parent, struct rb_root *root, in __rb_erase_color()
434 void rb_insert_color(struct rb_node *node, struct rb_root *root) in rb_insert_color()
440 void rb_erase(struct rb_node *node, struct rb_root *root) in rb_erase()
456 void __rb_insert_augmented(struct rb_node *node, struct rb_root *root, in __rb_insert_augmented()
466 struct rb_node *rb_first(const struct rb_root *root) in rb_first()
479 struct rb_node *rb_last(const struct rb_root *root) in rb_last()
554 struct rb_root *root) in rb_replace_node()
[all …]
|
| /linux-6.6.21/Documentation/translations/zh_CN/core-api/ |
| D | rbtree.rst | 67 每颗红黑树的根是一个rb_root数据结构，它由以下方式初始化为空:
69 struct rb_root mytree = RB_ROOT;
79 struct mytype *my_search(struct rb_root *root, char *string)
110 int my_insert(struct rb_root *root, struct mytype *data)
140 void rb_erase(struct rb_node *victim, struct rb_root *tree);
154 struct rb_root *tree);
165 struct rb_node *rb_first(struct rb_root *tree);
166 struct rb_node *rb_last(struct rb_root *tree);
192 和rb_root结构体类似，带缓存的红黑树由以下方式初始化为空::
196 带缓存的红黑树只是一个常规的rb_root，加上一个额外的指针来缓存最左边的节点。这使得
[all …]
|
| /linux-6.6.21/drivers/block/drbd/ |
| D | drbd_interval.h | 29 extern bool drbd_insert_interval(struct rb_root *, struct drbd_interval *);
30 extern bool drbd_contains_interval(struct rb_root *, sector_t,
32 extern void drbd_remove_interval(struct rb_root *, struct drbd_interval *);
33 extern struct drbd_interval *drbd_find_overlap(struct rb_root *, sector_t,
|
| D | drbd_interval.c | 25 drbd_insert_interval(struct rb_root *root, struct drbd_interval *this) in drbd_insert_interval()
69 drbd_contains_interval(struct rb_root *root, sector_t sector, in drbd_contains_interval()
96 drbd_remove_interval(struct rb_root *root, struct drbd_interval *this) in drbd_remove_interval()
118 drbd_find_overlap(struct rb_root *root, sector_t sector, unsigned int size) in drbd_find_overlap()
|
| /linux-6.6.21/tools/lib/ |
| D | rbtree.c | 76 struct rb_root *root, int color) in __rb_rotate_set_parents()
85 __rb_insert(struct rb_node *node, struct rb_root *root, in __rb_insert()
227 ____rb_erase_color(struct rb_node *parent, struct rb_root *root, in ____rb_erase_color()
410 void __rb_erase_color(struct rb_node *parent, struct rb_root *root, in __rb_erase_color()
433 void rb_insert_color(struct rb_node *node, struct rb_root *root) in rb_insert_color()
438 void rb_erase(struct rb_node *node, struct rb_root *root) in rb_erase()
453 void __rb_insert_augmented(struct rb_node *node, struct rb_root *root, in __rb_insert_augmented()
462 struct rb_node *rb_first(const struct rb_root *root) in rb_first()
474 struct rb_node *rb_last(const struct rb_root *root) in rb_last()
546 struct rb_root *root) in rb_replace_node()
[all …]
|
| /linux-6.6.21/tools/perf/util/ |
| D | rb_resort.h | 72 struct rb_root entries; \
92 struct rb_root *entries) \
103 static struct __name##_sorted *__name##_sorted__new(struct rb_root *entries, \
143 DECLARE_RESORT_RB(__name)(&__ilist->rblist.entries.rb_root, \
148 DECLARE_RESORT_RB(__name)(&__machine->threads[hash_bucket].entries.rb_root, \
|
| D | callchain.c | 379 rb_insert_callchain(struct rb_root *root, struct callchain_node *chain, in rb_insert_callchain()
420 __sort_chain_flat(struct rb_root *rb_root, struct callchain_node *node, in __sort_chain_flat() argument
431 __sort_chain_flat(rb_root, child, min_hit); in __sort_chain_flat()
435 rb_insert_callchain(rb_root, node, CHAIN_FLAT); in __sort_chain_flat()
443 sort_chain_flat(struct rb_root *rb_root, struct callchain_root *root, in sort_chain_flat() argument
446 *rb_root = RB_ROOT; in sort_chain_flat()
447 __sort_chain_flat(rb_root, &root->node, min_hit); in sort_chain_flat()
456 node->rb_root = RB_ROOT; in __sort_chain_graph_abs()
465 rb_insert_callchain(&node->rb_root, child, in __sort_chain_graph_abs()
471 sort_chain_graph_abs(struct rb_root *rb_root, struct callchain_root *chain_root, in sort_chain_graph_abs() argument
[all …]
|
| /linux-6.6.21/drivers/mtd/ubi/ |
| D | wl.h | 6 static struct ubi_wl_entry *find_anchor_wl_entry(struct rb_root *root);
19 struct rb_root *root);
26 struct rb_root *root) { in may_reserve_for_fm()
|
| /linux-6.6.21/net/ipv4/ |
| D | inetpeer.c | 59 bp->rb_root = RB_ROOT; in inet_peer_base_init()
102 pp = &base->rb_root.rb_node; in lookup()
172 rb_erase(&p->rb_node, &base->rb_root); in inet_peer_gc()
228 rb_insert_color(&p->rb_node, &base->rb_root); in inet_getpeer()
295 struct rb_node *p = rb_first(&base->rb_root); in inetpeer_invalidate_tree()
301 rb_erase(&peer->rb_node, &base->rb_root); in inetpeer_invalidate_tree()
|
| /linux-6.6.21/include/linux/crush/ |
| D | crush.h | 305 struct rb_root type_names;
308 struct rb_root names;
311 struct rb_root choose_args;
356 void clear_crush_names(struct rb_root *root);
|
| /linux-6.6.21/include/net/netns/ |
| D | nexthop.h | 13 struct rb_root rb_root; /* tree of nexthops by id */ member
|
| /linux-6.6.21/tools/bpf/resolve_btfids/ |
| D | main.c | 121 struct rb_root sets;
122 struct rb_root structs;
123 struct rb_root unions;
124 struct rb_root typedefs;
125 struct rb_root funcs;
167 static struct btf_id *btf_id__find(struct rb_root *root, const char *name) in btf_id__find()
187 btf_id__add(struct rb_root *root, char *name, bool unique) in btf_id__add()
267 static struct btf_id *add_symbol(struct rb_root *root, char *name, size_t size) in add_symbol()
542 struct rb_root *root; in symbols_resolve()
625 static int __symbols_patch(struct object *obj, struct rb_root *root) in __symbols_patch()
|
| /linux-6.6.21/mm/ |
| D | shmem_quota.c | 72 info->dqi_priv = kzalloc(sizeof(struct rb_root), GFP_NOFS); in shmem_read_file_info()
98 struct rb_root *root = info->dqi_priv; 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()
209 rb_insert_color(new_node, (struct rb_root *)info->dqi_priv); in shmem_acquire_dquot()
267 struct rb_node *node = ((struct rb_root *)info->dqi_priv)->rb_node; in shmem_release_dquot()
|
| /linux-6.6.21/fs/nfs/blocklayout/ |
| D | extent_tree.c | 19 ext_tree_first(struct rb_root *root) in ext_tree_first()
46 __ext_tree_search(struct rb_root *root, sector_t start) in __ext_tree_search()
95 ext_try_to_merge_left(struct rb_root *root, struct pnfs_block_extent *be) in ext_try_to_merge_left()
111 ext_try_to_merge_right(struct rb_root *root, struct pnfs_block_extent *be) in ext_try_to_merge_right()
136 __ext_tree_insert(struct rb_root *root, in __ext_tree_insert()
177 __ext_tree_remove(struct rb_root *root, in __ext_tree_remove()
258 struct rb_root *root; in ext_tree_insert()
322 __ext_tree_lookup(struct rb_root *root, sector_t isect, in __ext_tree_lookup()
380 ext_tree_split(struct rb_root *root, struct pnfs_block_extent *be, in ext_tree_split()
408 struct rb_root *root = &bl->bl_ext_rw; in ext_tree_mark_written()
[all …]
|