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

1234567891011>>

/linux-master/include/linux/
H A Drbtree_types.h12 struct rb_root { struct
27 struct rb_root rb_root; member in struct:rb_root_cached
31 #define RB_ROOT (struct rb_root) { NULL, }
H A Dtimerqueue_types.h14 struct rb_root_cached rb_root; member in struct:timerqueue_head
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);
[all...]
H A Dtimerqueue.h25 struct rb_node *leftmost = rb_first_cached(&head->rb_root);
47 head->rb_root = RB_ROOT_CACHED;
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,
60 rb_insert_augmented(node, &root->rb_root, augment);
68 struct rb_node **link = &tree->rb_root.rb_node;
196 struct rb_node *parent, struct rb_root *root)
209 struct rb_node *parent, struct rb_root *root)
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,
326 rb_erase_augmented(struct rb_node *node, struct rb_root *root,
340 rb_erase_augmented(node, &root->rb_root, augmen
[all...]
/linux-master/include/net/netns/
H A Dnexthop.h13 struct rb_root rb_root; /* tree of nexthops by id */ member in struct:netns_nexthop
/linux-master/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,
/linux-master/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; member in struct:rb_root_cached
[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,
62 rb_insert_augmented(node, &root->rb_root, augment);
172 struct rb_node *parent, struct rb_root *root)
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,
291 rb_erase_augmented(struct rb_node *node, struct rb_root *root,
305 rb_erase_augmented(node, &root->rb_root, augment);
/linux-master/drivers/mtd/ubi/
H A Dwl.h6 static struct ubi_wl_entry *find_anchor_wl_entry(struct rb_root *root);
21 struct rb_root *root);
28 struct rb_root *root) {
/linux-master/tools/perf/util/
H A Dmem2node.h11 struct rb_root root;
H A Ddsos.h20 struct rb_root root; /* rbtree root sorted by long name */
31 struct dso *__dsos__findnew_link_by_longname_id(struct rb_root *root, struct dso *dso,
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, \
H A Dcgroup.h41 struct cgroup *__cgroup__find(struct rb_root *root, uint64_t id);
55 void read_all_cgroups(struct rb_root *root);
H A Dannotate-data.h119 void annotated_data_type__tree_delete(struct rb_root *root);
141 static inline void annotated_data_type__tree_delete(struct rb_root *root __maybe_unused)
H A Dcomm.c19 static struct rb_root comm_str_root;
61 struct comm_str *__comm_str__findnew(const char *str, struct rb_root *root)
97 static struct comm_str *comm_str__findnew(const char *str, struct rb_root *root)
/linux-master/lib/
H A Dtimerqueue.c40 return rb_add_cached(&node->node, &head->rb_root, __timerqueue_less);
57 rb_erase_cached(&node->node, &head->rb_root);
60 return !RB_EMPTY_ROOT(&head->rb_root.rb_root);
H A Drbtree_test.c34 struct rb_node **new = &root->rb_root.rb_node, *parent = NULL;
46 rb_insert_color(&node->rb, &root->rb_root);
51 struct rb_node **new = &root->rb_root.rb_node, *parent = NULL;
71 rb_erase(&node->rb, &root->rb_root);
88 struct rb_node **new = &root->rb_root.rb_node, *rb_parent = NULL;
106 rb_insert_augmented(&node->rb, &root->rb_root, &augment_callbacks);
112 struct rb_node **new = &root->rb_root.rb_node, *rb_parent = NULL;
140 rb_erase_augmented(&node->rb, &root->rb_root, &augment_callbacks);
175 rbtree_postorder_for_each_entry_safe(cur, n, &root.rb_root, rb)
185 for (rb = rb_first_postorder(&root.rb_root); r
[all...]
H A Drbtree.c76 struct rb_root *root, int color)
85 __rb_insert(struct rb_node *node, struct rb_root *root,
227 ____rb_erase_color(struct rb_node *parent, struct rb_root *root,
410 void __rb_erase_color(struct rb_node *parent, struct rb_root *root,
434 void rb_insert_color(struct rb_node *node, struct rb_root *root)
440 void rb_erase(struct rb_node *node, struct rb_root *root)
456 void __rb_insert_augmented(struct rb_node *node, struct rb_root *root,
466 struct rb_node *rb_first(const struct rb_root *root)
479 struct rb_node *rb_last(const struct rb_root *root)
554 struct rb_root *roo
[all...]
/linux-master/fs/jffs2/
H A Djffs2_fs_i.h33 struct rb_root fragtree;
/linux-master/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...]
/linux-master/net/ceph/
H A Dauth_x.h47 struct rb_root ticket_handlers;
/linux-master/arch/powerpc/kernel/
H A Deeh_cache.c50 struct rb_root rb_root; member in struct:pci_io_addr_cache
56 struct rb_node *n = pci_io_addr_cache_root.rb_root.rb_node;
103 n = rb_first(&cache->rb_root);
121 struct rb_node **p = &pci_io_addr_cache_root.rb_root.rb_node;
155 rb_insert_color(&piar->rb_node, &pci_io_addr_cache_root.rb_root);
218 n = rb_first(&pci_io_addr_cache_root.rb_root);
226 rb_erase(n, &pci_io_addr_cache_root.rb_root);
270 for (n = rb_first(&pci_io_addr_cache_root.rb_root); n; n = rb_next(n)) {
/linux-master/fs/btrfs/
H A Dmisc.h69 static inline struct rb_node *rb_simple_search(struct rb_root *root, u64 bytenr)
96 static inline struct rb_node *rb_simple_search_first(struct rb_root *root,
122 static inline struct rb_node *rb_simple_insert(struct rb_root *root, u64 bytenr,
/linux-master/include/linux/crush/
H A Dcrush.h305 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);

Completed in 926 milliseconds

1234567891011>>