Home
last modified time | relevance | path

Searched refs:rb_root (Results 1 - 25 of 640) sorted by relevance

12345678910>>...26

/kernel/linux/linux-5.10/include/linux/
H A Drbtree.h31 struct rb_root { struct
37 #define RB_ROOT (struct rb_root) { NULL, }
49 extern void rb_insert_color(struct rb_node *, struct rb_root *);
50 extern void rb_erase(struct rb_node *, struct rb_root *);
56 extern struct rb_node *rb_first(const struct rb_root *);
57 extern struct rb_node *rb_last(const struct rb_root *);
60 extern struct rb_node *rb_first_postorder(const struct rb_root *);
65 struct rb_root *root);
67 struct rb_root *root);
93 * rbtree_postorder_for_each_entry_safe - iterate in post-order over rb_root o
126 struct rb_root rb_root; global() member
[all...]
H A Drbtree_augmented.h33 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()
170 struct rb_node *parent, struct rb_root *root) in __rb_change_child()
183 struct rb_node *parent, struct rb_root *root) in __rb_change_child_rcu()
194 extern void __rb_erase_color(struct rb_node *parent, struct rb_root *root,
198 __rb_erase_augmented(struct rb_node *node, struct rb_root *root, in __rb_erase_augmented()
300 rb_erase_augmented(struct rb_node *node, struct rb_root *root, in rb_erase_augmented()
314 rb_erase_augmented(node, &root->rb_root, augment); in rb_erase_augmented_cached()
/kernel/linux/linux-5.10/tools/include/linux/
H A Drbtree.h30 struct rb_root { struct
36 #define RB_ROOT (struct rb_root) { NULL, }
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);
81 * rbtree_postorder_for_each_entry_safe - iterate in post-order over rb_root of
86 * @root: 'rb_root *' o
120 struct rb_root rb_root; global() member
[all...]
H A Drbtree_augmented.h35 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()
/kernel/linux/linux-6.6/tools/include/linux/
H A Drbtree.h30 struct rb_root { struct
36 #define RB_ROOT (struct rb_root) { NULL, }
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);
81 * rbtree_postorder_for_each_entry_safe - iterate in post-order over rb_root of
86 * @root: 'rb_root *' o
120 struct rb_root rb_root; global() member
[all...]
/kernel/linux/linux-6.6/include/linux/
H A Drbtree.h39 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);
83 * rbtree_postorder_for_each_entry_safe - iterate in post-order over rb_root of
88 * @root: 'rb_root *' of the rbtree.
114 rb_insert_color(node, &root->rb_root); in rb_insert_color_cached()
[all...]
H A Drbtree_types.h12 struct rb_root { struct
27 struct rb_root rb_root; member
31 #define RB_ROOT (struct rb_root) { NULL, }
H A Drbtree_augmented.h33 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, augmen in rb_erase_augmented_cached()
[all...]
/kernel/linux/linux-5.10/lib/
H A Dtimerqueue.c29 struct rb_node **p = &head->rb_root.rb_root.rb_node; in timerqueue_add()
48 rb_insert_color_cached(&node->node, &head->rb_root, leftmost); in timerqueue_add()
67 rb_erase_cached(&node->node, &head->rb_root); in timerqueue_del()
70 return !RB_EMPTY_ROOT(&head->rb_root.rb_root); in timerqueue_del()
H A Drbtree_test.c34 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 insert_augmented()
106 rb_insert_augmented(&node->rb, &root->rb_root, &augment_callbacks); in insert_augmented()
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); r in check_postorder()
[all...]
H A Drbtree.c76 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 *roo in rb_replace_node()
[all...]
/kernel/linux/linux-5.10/arch/powerpc/kernel/
H A Deeh_cache.c50 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()
/kernel/linux/linux-6.6/arch/powerpc/kernel/
H A Deeh_cache.c50 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()
/kernel/linux/linux-6.6/lib/
H A Drbtree_test.c34 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 insert_augmented()
106 rb_insert_augmented(&node->rb, &root->rb_root, &augment_callbacks); in insert_augmented()
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); r in check_postorder()
[all...]
H A Dtimerqueue.c40 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()
H A Drbtree.c76 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 *roo in rb_replace_node()
[all...]
/kernel/linux/linux-5.10/drivers/block/drbd/
H A Ddrbd_interval.h29 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,
/kernel/linux/linux-6.6/drivers/block/drbd/
H A Ddrbd_interval.h29 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,
/kernel/linux/linux-5.10/include/linux/ceph/
H A Dosdmap.h182 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 *loc
[all...]
/kernel/linux/linux-6.6/include/linux/ceph/
H A Dosdmap.h182 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 *loc
[all...]
/kernel/linux/common_modules/memory_security/include/
H A Djit_process.h17 struct result_of_find_process find_process_jit_space(struct rb_root *root, int pid);
18 struct list_head *update_process_jit_space(struct rb_root *root, int pid, unsigned long cookie, unsigned long *err);
19 struct jit_process *delete_process_jit_space(struct rb_root *root, int pid);
/kernel/linux/linux-5.10/net/6lowpan/
H A Dnhc.c15 static struct rb_root rb_root = RB_ROOT; variable
21 struct rb_node **new = &rb_root.rb_node, *parent = NULL; in lowpan_nhc_insert()
51 rb_insert_color(&nhc->node, &rb_root); in lowpan_nhc_insert()
58 rb_erase(&nhc->node, &rb_root); in lowpan_nhc_remove()
63 struct rb_node *node = rb_root.rb_node; in lowpan_nhc_by_nhcid()
/kernel/linux/linux-5.10/tools/perf/util/
H A Drb_resort.h31 * helpers are available to get the rb_root and the nr_entries:
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, \
/kernel/linux/linux-6.6/tools/perf/util/
H A Drb_resort.h31 * helpers are available to get the rb_root and the nr_entries:
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, \
/kernel/linux/linux-5.10/drivers/mtd/ubi/
H A Dwl.h6 static struct ubi_wl_entry *find_anchor_wl_entry(struct rb_root *root);
17 struct rb_root *root);
24 struct rb_root *root) { in may_reserve_for_fm()

Completed in 12 milliseconds

12345678910>>...26