Home
last modified time | relevance | path

Searched refs:rb_node (Results 1 - 25 of 907) sorted by relevance

12345678910>>...37

/kernel/linux/linux-6.6/include/linux/
H A Drbtree.h26 #define rb_parent(r) ((struct rb_node *)((r)->__rb_parent_color & ~3))
30 #define RB_EMPTY_ROOT(root) (READ_ONCE((root)->rb_node) == NULL)
39 extern void rb_insert_color(struct rb_node *, struct rb_root *);
40 extern void rb_erase(struct rb_node *, struct rb_root *);
44 extern struct rb_node *rb_next(const struct rb_node *);
45 extern struct rb_node *rb_prev(const struct rb_node *);
46 extern struct rb_node *rb_first(const struct rb_root *);
47 extern struct rb_node *rb_las
[all...]
H A Drbtree_augmented.h28 void (*propagate)(struct rb_node *node, struct rb_node *stop);
29 void (*copy)(struct rb_node *old, struct rb_node *new);
30 void (*rotate)(struct rb_node *old, struct rb_node *new);
33 extern void __rb_insert_augmented(struct rb_node *node, struct rb_root *root,
34 void (*augment_rotate)(struct rb_node *old, struct rb_node *new));
47 rb_insert_augmented(struct rb_node *nod
[all...]
/kernel/linux/linux-6.6/tools/include/linux/
H A Drbtree.h23 struct rb_node { struct
25 struct rb_node *rb_right;
26 struct rb_node *rb_left;
31 struct rb_node *rb_node; member
34 #define rb_parent(r) ((struct rb_node *)((r)->__rb_parent_color & ~3))
39 #define RB_EMPTY_ROOT(root) (READ_ONCE((root)->rb_node) == NULL)
48 extern void rb_insert_color(struct rb_node *, struct rb_root *);
49 extern void rb_erase(struct rb_node *, struct rb_root *);
53 extern struct rb_node *rb_nex
[all...]
H A Drbtree_augmented.h30 void (*propagate)(struct rb_node *node, struct rb_node *stop);
31 void (*copy)(struct rb_node *old, struct rb_node *new);
32 void (*rotate)(struct rb_node *old, struct rb_node *new);
35 extern void __rb_insert_augmented(struct rb_node *node, struct rb_root *root,
36 void (*augment_rotate)(struct rb_node *old, struct rb_node *new));
49 rb_insert_augmented(struct rb_node *nod
[all...]
/kernel/linux/linux-5.10/include/linux/
H A Drbtree.h24 struct rb_node { struct
26 struct rb_node *rb_right;
27 struct rb_node *rb_left;
32 struct rb_node *rb_node; member
35 #define rb_parent(r) ((struct rb_node *)((r)->__rb_parent_color & ~3))
40 #define RB_EMPTY_ROOT(root) (READ_ONCE((root)->rb_node) == NULL)
49 extern void rb_insert_color(struct rb_node *, struct rb_root *);
50 extern void rb_erase(struct rb_node *, struct rb_root *);
54 extern struct rb_node *rb_nex
[all...]
H A Drbtree_augmented.h28 void (*propagate)(struct rb_node *node, struct rb_node *stop);
29 void (*copy)(struct rb_node *old, struct rb_node *new);
30 void (*rotate)(struct rb_node *old, struct rb_node *new);
33 extern void __rb_insert_augmented(struct rb_node *node, struct rb_root *root,
34 void (*augment_rotate)(struct rb_node *old, struct rb_node *new));
47 rb_insert_augmented(struct rb_node *nod
[all...]
/kernel/linux/linux-5.10/tools/include/linux/
H A Drbtree.h23 struct rb_node { struct
25 struct rb_node *rb_right;
26 struct rb_node *rb_left;
31 struct rb_node *rb_node; member
34 #define rb_parent(r) ((struct rb_node *)((r)->__rb_parent_color & ~3))
39 #define RB_EMPTY_ROOT(root) (READ_ONCE((root)->rb_node) == NULL)
48 extern void rb_insert_color(struct rb_node *, struct rb_root *);
49 extern void rb_erase(struct rb_node *, struct rb_root *);
53 extern struct rb_node *rb_nex
[all...]
H A Drbtree_augmented.h30 void (*propagate)(struct rb_node *node, struct rb_node *stop);
31 void (*copy)(struct rb_node *old, struct rb_node *new);
32 void (*rotate)(struct rb_node *old, struct rb_node *new);
35 extern void __rb_insert_augmented(struct rb_node *node, struct rb_root *root,
36 void (*augment_rotate)(struct rb_node *old, struct rb_node *new));
49 rb_insert_augmented(struct rb_node *nod
[all...]
/kernel/linux/linux-5.10/tools/perf/util/
H A Dintlist.c13 static struct rb_node *intlist__node_new(struct rblist *rblist __maybe_unused, in intlist__node_new()
17 struct rb_node *rc = NULL; in intlist__node_new()
23 rc = &node->rb_node; in intlist__node_new()
35 struct rb_node *rb_node) in intlist__node_delete()
37 struct int_node *node = container_of(rb_node, struct int_node, rb_node); in intlist__node_delete()
42 static int intlist__node_cmp(struct rb_node *rb_node, const void *entry) in intlist__node_cmp() argument
45 struct int_node *node = container_of(rb_node, struc in intlist__node_cmp()
34 intlist__node_delete(struct rblist *rblist __maybe_unused, struct rb_node *rb_node) intlist__node_delete() argument
64 struct rb_node *rb_node; __intlist__findnew() local
138 struct rb_node *rb_node; intlist__entry() local
[all...]
H A Dstrlist.c15 struct rb_node *strlist__node_new(struct rblist *rblist, const void *entry) in strlist__node_new()
18 struct rb_node *rc = NULL; in strlist__node_new()
29 rc = &snode->rb_node; in strlist__node_new()
47 void strlist__node_delete(struct rblist *rblist, struct rb_node *rb_node) in strlist__node_delete() argument
50 struct str_node *snode = container_of(rb_node, struct str_node, rb_node); in strlist__node_delete()
55 static int strlist__node_cmp(struct rb_node *rb_node, const void *entry) in strlist__node_cmp() argument
58 struct str_node *snode = container_of(rb_node, struc in strlist__node_cmp()
103 struct rb_node *rb_node = rblist__find(&slist->rblist, entry); strlist__find() local
201 struct rb_node *rb_node; strlist__entry() local
[all...]
H A Drblist.c15 struct rb_node **p = &rblist->entries.rb_root.rb_node; in rblist__add_node()
16 struct rb_node *parent = NULL, *new_node; in rblist__add_node()
46 void rblist__remove_node(struct rblist *rblist, struct rb_node *rb_node) in rblist__remove_node() argument
48 rb_erase_cached(rb_node, &rblist->entries); in rblist__remove_node()
50 rblist->node_delete(rblist, rb_node); in rblist__remove_node()
53 static struct rb_node *__rblist__findnew(struct rblist *rblist, in __rblist__findnew()
57 struct rb_node **p = &rblist->entries.rb_root.rb_node; in __rblist__findnew()
[all...]
H A Drb_resort.h26 entry->thread = rb_entry(nd, struct thread, rb_node);
37 struct rb_node *nd;
57 struct rb_node rb_node; \
60 static void __name##_sorted__init_entry(struct rb_node *nd, \
63 static int __name##_sorted__cmp(struct rb_node *nda, struct rb_node *ndb) \
66 a = rb_entry(nda, struct __name##_sorted_entry, rb_node); \
67 b = rb_entry(ndb, struct __name##_sorted_entry, rb_node); \
77 struct rb_node *sorted_n
[all...]
/kernel/linux/linux-6.6/tools/perf/util/
H A Dintlist.c13 static struct rb_node *intlist__node_new(struct rblist *rblist __maybe_unused, in intlist__node_new()
17 struct rb_node *rc = NULL; in intlist__node_new()
23 rc = &node->rb_node; in intlist__node_new()
35 struct rb_node *rb_node) in intlist__node_delete()
37 struct int_node *node = container_of(rb_node, struct int_node, rb_node); in intlist__node_delete()
42 static int intlist__node_cmp(struct rb_node *rb_node, const void *entry) in intlist__node_cmp() argument
45 struct int_node *node = container_of(rb_node, struc in intlist__node_cmp()
34 intlist__node_delete(struct rblist *rblist __maybe_unused, struct rb_node *rb_node) intlist__node_delete() argument
69 struct rb_node *rb_node; __intlist__findnew() local
143 struct rb_node *rb_node; intlist__entry() local
[all...]
H A Dstrlist.c15 struct rb_node *strlist__node_new(struct rblist *rblist, const void *entry) in strlist__node_new()
18 struct rb_node *rc = NULL; in strlist__node_new()
29 rc = &snode->rb_node; in strlist__node_new()
47 void strlist__node_delete(struct rblist *rblist, struct rb_node *rb_node) in strlist__node_delete() argument
50 struct str_node *snode = container_of(rb_node, struct str_node, rb_node); in strlist__node_delete()
55 static int strlist__node_cmp(struct rb_node *rb_node, const void *entry) in strlist__node_cmp() argument
58 struct str_node *snode = container_of(rb_node, struc in strlist__node_cmp()
103 struct rb_node *rb_node = rblist__find(&slist->rblist, entry); strlist__find() local
201 struct rb_node *rb_node; strlist__entry() local
[all...]
H A Drblist.c15 struct rb_node **p = &rblist->entries.rb_root.rb_node; in rblist__add_node()
16 struct rb_node *parent = NULL, *new_node; in rblist__add_node()
46 void rblist__remove_node(struct rblist *rblist, struct rb_node *rb_node) in rblist__remove_node() argument
48 rb_erase_cached(rb_node, &rblist->entries); in rblist__remove_node()
50 rblist->node_delete(rblist, rb_node); in rblist__remove_node()
53 static struct rb_node *__rblist__findnew(struct rblist *rblist, in __rblist__findnew()
57 struct rb_node **p = &rblist->entries.rb_root.rb_node; in __rblist__findnew()
[all...]
H A Dmaps.c38 struct rb_node **p = &maps__entries(maps)->rb_node; in __maps__insert()
39 struct rb_node *parent = NULL; in __maps__insert()
47 RB_CLEAR_NODE(&new_rb_node->rb_node); in __maps__insert()
52 m = rb_entry(parent, struct map_rb_node, rb_node); in __maps__insert()
59 rb_link_node(&new_rb_node->rb_node, parent, p); in __maps__insert()
60 rb_insert_color(&new_rb_node->rb_node, maps__entries(maps)); in __maps__insert()
113 static void __maps__remove(struct maps *maps, struct map_rb_node *rb_node) in __maps__remove() argument
115 rb_erase_init(&rb_node->rb_node, maps__entrie in __maps__remove()
122 struct map_rb_node *rb_node; maps__remove() local
390 struct map_rb_node *rb_node; maps__clone() local
421 struct map_rb_node *rb_node; maps__find_node() local
[all...]
H A Drb_resort.h26 entry->thread = rb_entry(nd, struct thread, rb_node);
37 struct rb_node *nd;
57 struct rb_node rb_node; \
60 static void __name##_sorted__init_entry(struct rb_node *nd, \
63 static int __name##_sorted__cmp(struct rb_node *nda, struct rb_node *ndb) \
66 a = rb_entry(nda, struct __name##_sorted_entry, rb_node); \
67 b = rb_entry(ndb, struct __name##_sorted_entry, rb_node); \
77 struct rb_node *sorted_n
[all...]
/kernel/linux/linux-5.10/lib/
H A Drbtree.c59 static inline void rb_set_black(struct rb_node *rb) in rb_set_black()
64 static inline struct rb_node *rb_red_parent(struct rb_node *red) in rb_red_parent()
66 return (struct rb_node *)red->__rb_parent_color; in rb_red_parent()
75 __rb_rotate_set_parents(struct rb_node *old, struct rb_node *new, in __rb_rotate_set_parents()
78 struct rb_node *parent = rb_parent(old); in __rb_rotate_set_parents()
85 __rb_insert(struct rb_node *node, struct rb_root *root, in __rb_insert()
86 void (*augment_rotate)(struct rb_node *old, struct rb_node *ne in __rb_insert()
[all...]
/kernel/linux/linux-6.6/lib/
H A Drbtree.c59 static inline void rb_set_black(struct rb_node *rb) in rb_set_black()
64 static inline struct rb_node *rb_red_parent(struct rb_node *red) in rb_red_parent()
66 return (struct rb_node *)red->__rb_parent_color; in rb_red_parent()
75 __rb_rotate_set_parents(struct rb_node *old, struct rb_node *new, in __rb_rotate_set_parents()
78 struct rb_node *parent = rb_parent(old); in __rb_rotate_set_parents()
85 __rb_insert(struct rb_node *node, struct rb_root *root, in __rb_insert()
86 void (*augment_rotate)(struct rb_node *old, struct rb_node *ne in __rb_insert()
[all...]
/kernel/linux/linux-5.10/tools/lib/
H A Drbtree.c59 static inline void rb_set_black(struct rb_node *rb) in rb_set_black()
64 static inline struct rb_node *rb_red_parent(struct rb_node *red) in rb_red_parent()
66 return (struct rb_node *)red->__rb_parent_color; in rb_red_parent()
75 __rb_rotate_set_parents(struct rb_node *old, struct rb_node *new, in __rb_rotate_set_parents()
78 struct rb_node *parent = rb_parent(old); in __rb_rotate_set_parents()
85 __rb_insert(struct rb_node *node, struct rb_root *root, in __rb_insert()
86 void (*augment_rotate)(struct rb_node *old, struct rb_node *ne in __rb_insert()
[all...]
/kernel/linux/linux-6.6/tools/lib/
H A Drbtree.c59 static inline void rb_set_black(struct rb_node *rb) in rb_set_black()
64 static inline struct rb_node *rb_red_parent(struct rb_node *red) in rb_red_parent()
66 return (struct rb_node *)red->__rb_parent_color; in rb_red_parent()
75 __rb_rotate_set_parents(struct rb_node *old, struct rb_node *new, in __rb_rotate_set_parents()
78 struct rb_node *parent = rb_parent(old); in __rb_rotate_set_parents()
85 __rb_insert(struct rb_node *node, struct rb_root *root, in __rb_insert()
86 void (*augment_rotate)(struct rb_node *old, struct rb_node *ne in __rb_insert()
[all...]
/kernel/linux/linux-5.10/fs/btrfs/
H A Dextent_map.c56 RB_CLEAR_NODE(&em->rb_node); in alloc_extent_map()
96 struct rb_node **p = &root->rb_root.rb_node; in tree_insert()
97 struct rb_node *parent = NULL; in tree_insert()
99 struct rb_node *orig_parent = NULL; in tree_insert()
105 entry = rb_entry(parent, struct extent_map, rb_node); in tree_insert()
120 entry = rb_entry(parent, struct extent_map, rb_node); in tree_insert()
127 entry = rb_entry(parent, struct extent_map, rb_node); in tree_insert()
130 entry = rb_entry(parent, struct extent_map, rb_node); in tree_insert()
136 rb_link_node(&em->rb_node, orig_paren in tree_insert()
422 struct rb_node *rb_node; __lookup_extent_mapping() local
[all...]
H A Dmisc.h69 struct rb_node rb_node; member
73 static inline struct rb_node *rb_simple_search(struct rb_root *root, u64 bytenr) in rb_simple_search()
75 struct rb_node *node = root->rb_node; in rb_simple_search()
79 entry = rb_entry(node, struct rb_simple_node, rb_node); in rb_simple_search()
91 static inline struct rb_node *rb_simple_insert(struct rb_root *root, u64 bytenr, in rb_simple_insert()
92 struct rb_node *node) in rb_simple_insert()
94 struct rb_node **p = &root->rb_node; in rb_simple_insert()
[all...]
/kernel/linux/linux-6.6/fs/btrfs/
H A Dmisc.h63 struct rb_node rb_node; member
67 static inline struct rb_node *rb_simple_search(struct rb_root *root, u64 bytenr) in rb_simple_search()
69 struct rb_node *node = root->rb_node; in rb_simple_search()
73 entry = rb_entry(node, struct rb_simple_node, rb_node); in rb_simple_search()
91 * Return the rb_node that start at or after @bytenr. If there is no entry at
94 static inline struct rb_node *rb_simple_search_first(struct rb_root *root, in rb_simple_search_first()
97 struct rb_node *node = root->rb_node, *re in rb_simple_search_first()
[all...]
/kernel/linux/linux-5.10/tools/perf/tests/
H A Dhists_output.c97 struct rb_node *node; in del_hist_entries()
109 he = rb_entry(node, struct hist_entry, rb_node); in del_hist_entries()
131 struct rb_node *node; in test1()
167 he = rb_entry(node, struct hist_entry, rb_node); in test1()
173 he = rb_entry(node, struct hist_entry, rb_node); in test1()
179 he = rb_entry(node, struct hist_entry, rb_node); in test1()
185 he = rb_entry(node, struct hist_entry, rb_node); in test1()
191 he = rb_entry(node, struct hist_entry, rb_node); in test1()
197 he = rb_entry(node, struct hist_entry, rb_node); in test1()
203 he = rb_entry(node, struct hist_entry, rb_node); in test1()
[all...]

Completed in 11 milliseconds

12345678910>>...37