| /external/e2fsprogs/lib/ext2fs/ |
| D | rbtree.h | 110 struct rb_node struct
115 struct rb_node *rb_right; argument
116 struct rb_node *rb_left; argument
122 struct rb_node *rb_node; member
126 #define ext2fs_rb_parent(r) ((struct rb_node *)((r)->rb_parent_color & ~3))
133 static inline void ext2fs_rb_set_parent(struct rb_node *rb, struct rb_node *p) in ext2fs_rb_set_parent()
137 static inline void ext2fs_rb_set_color(struct rb_node *rb, int color) in ext2fs_rb_set_color()
145 #define EXT2FS_RB_EMPTY_ROOT(root) ((root)->rb_node == NULL)
149 extern void ext2fs_rb_insert_color(struct rb_node *, struct rb_root *);
150 extern void ext2fs_rb_erase(struct rb_node *, struct rb_root *);
[all …]
|
| D | rbtree.c | 25 static void __rb_rotate_left(struct rb_node *node, struct rb_root *root) in __rb_rotate_left()
27 struct rb_node *right = node->rb_right; in __rb_rotate_left()
28 struct rb_node *parent = ext2fs_rb_parent(node); in __rb_rotate_left()
44 root->rb_node = right; in __rb_rotate_left()
48 static void __rb_rotate_right(struct rb_node *node, struct rb_root *root) in __rb_rotate_right()
50 struct rb_node *left = node->rb_left; in __rb_rotate_right()
51 struct rb_node *parent = ext2fs_rb_parent(node); in __rb_rotate_right()
67 root->rb_node = left; in __rb_rotate_right()
71 void ext2fs_rb_insert_color(struct rb_node *node, struct rb_root *root) in ext2fs_rb_insert_color()
73 struct rb_node *parent, *gparent; in ext2fs_rb_insert_color()
[all …]
|
| D | blkmap64_rb.c | 34 struct rb_node node;
50 inline static struct bmap_rb_extent *node_to_extent(struct rb_node *node) in node_to_extent()
70 struct rb_node *node = NULL; in print_tree()
86 struct rb_node *new_node, *node, *next; in check_tree()
210 struct rb_node *node, *next; in rb_free_tree()
236 struct rb_node *dest_node, *src_node, *dest_last, **n; in rb_copy_bmap()
259 n = &dest_bp->root.rb_node; in rb_copy_bmap()
279 struct rb_node *node; in rb_truncate()
325 struct rb_node *parent = NULL, *next; in rb_test_bit()
326 struct rb_node **n = &bp->root.rb_node; in rb_test_bit()
[all …]
|
| /external/linux-tools-perf/src/include/linux/ |
| D | rbtree.h | 35 struct rb_node { struct
37 struct rb_node *rb_right; argument
38 struct rb_node *rb_left; argument
43 struct rb_node *rb_node; member
47 #define rb_parent(r) ((struct rb_node *)((r)->__rb_parent_color & ~3))
52 #define RB_EMPTY_ROOT(root) ((root)->rb_node == NULL)
61 extern void rb_insert_color(struct rb_node *, struct rb_root *);
62 extern void rb_erase(struct rb_node *, struct rb_root *);
66 extern struct rb_node *rb_next(const struct rb_node *);
67 extern struct rb_node *rb_prev(const struct rb_node *);
[all …]
|
| D | rbtree_augmented.h | 39 void (*propagate)(struct rb_node *node, struct rb_node *stop);
40 void (*copy)(struct rb_node *old, struct rb_node *new);
41 void (*rotate)(struct rb_node *old, struct rb_node *new);
44 extern void __rb_insert_augmented(struct rb_node *node, struct rb_root *root,
45 void (*augment_rotate)(struct rb_node *old, struct rb_node *new));
47 rb_insert_augmented(struct rb_node *node, struct rb_root *root, in rb_insert_augmented()
56 rbname ## _propagate(struct rb_node *rb, struct rb_node *stop) \
68 rbname ## _copy(struct rb_node *rb_old, struct rb_node *rb_new) \
75 rbname ## _rotate(struct rb_node *rb_old, struct rb_node *rb_new) \
90 #define __rb_parent(pc) ((struct rb_node *)(pc & ~3))
[all …]
|
| /external/linux-tools-perf/src/lib/ |
| D | rbtree.c | 47 static inline void rb_set_black(struct rb_node *rb) in rb_set_black()
52 static inline struct rb_node *rb_red_parent(struct rb_node *red) in rb_red_parent()
54 return (struct rb_node *)red->__rb_parent_color; in rb_red_parent()
63 __rb_rotate_set_parents(struct rb_node *old, struct rb_node *new, in __rb_rotate_set_parents()
66 struct rb_node *parent = rb_parent(old); in __rb_rotate_set_parents()
73 __rb_insert(struct rb_node *node, struct rb_root *root, in __rb_insert()
74 void (*augment_rotate)(struct rb_node *old, struct rb_node *new)) in __rb_insert()
76 struct rb_node *parent = rb_red_parent(node), *gparent, *tmp; in __rb_insert()
202 ____rb_erase_color(struct rb_node *parent, struct rb_root *root, in ____rb_erase_color()
203 void (*augment_rotate)(struct rb_node *old, struct rb_node *new)) in ____rb_erase_color()
[all …]
|
| /external/blktrace/ |
| D | rbtree.h | 99 struct rb_node struct
104 struct rb_node *rb_right; argument
105 struct rb_node *rb_left; argument
110 struct rb_node *rb_node; member
124 #define rb_parent(r) ((struct rb_node *)((r)->rb_parent_color & ~3))
131 static inline void rb_set_parent(struct rb_node *rb, struct rb_node *p) in rb_set_parent()
135 static inline void rb_set_color(struct rb_node *rb, int color) in rb_set_color()
143 extern void rb_insert_color(struct rb_node *, struct rb_root *);
144 extern void rb_erase(struct rb_node *, struct rb_root *);
147 extern struct rb_node *rb_next(struct rb_node *);
[all …]
|
| D | rbtree.c | 25 static void __rb_rotate_left(struct rb_node *node, struct rb_root *root) in __rb_rotate_left()
27 struct rb_node *right = node->rb_right; in __rb_rotate_left()
28 struct rb_node *parent = rb_parent(node); in __rb_rotate_left()
44 root->rb_node = right; in __rb_rotate_left()
48 static void __rb_rotate_right(struct rb_node *node, struct rb_root *root) in __rb_rotate_right()
50 struct rb_node *left = node->rb_left; in __rb_rotate_right()
51 struct rb_node *parent = rb_parent(node); in __rb_rotate_right()
67 root->rb_node = left; in __rb_rotate_right()
71 void rb_insert_color(struct rb_node *node, struct rb_root *root) in rb_insert_color()
73 struct rb_node *parent, *gparent; in rb_insert_color()
[all …]
|
| /external/linux-tools-perf/src/tools/perf/util/ |
| D | intlist.c | 14 static struct rb_node *intlist__node_new(struct rblist *rblist __maybe_unused, in intlist__node_new()
18 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() argument
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, struct int_node, rb_node); in intlist__node_cmp()
57 rblist__remove_node(&ilist->rblist, &node->rb_node); in intlist__remove()
63 struct rb_node *rb_node; in intlist__find() local
69 rb_node = rblist__find(&ilist->rblist, (void *)((long)i)); in intlist__find()
[all …]
|
| D | strlist.c | 14 struct rb_node *strlist__node_new(struct rblist *rblist, const void *entry) in strlist__node_new()
17 struct rb_node *rc = NULL; in strlist__node_new()
28 rc = &snode->rb_node; in strlist__node_new()
46 void strlist__node_delete(struct rblist *rblist, struct rb_node *rb_node) in strlist__node_delete() argument
49 struct str_node *snode = container_of(rb_node, struct str_node, rb_node); in strlist__node_delete()
54 static int strlist__node_cmp(struct rb_node *rb_node, const void *entry) in strlist__node_cmp() argument
57 struct str_node *snode = container_of(rb_node, struct str_node, rb_node); in strlist__node_cmp()
96 rblist__remove_node(&slist->rblist, &snode->rb_node); in strlist__remove()
102 struct rb_node *rb_node = rblist__find(&slist->rblist, entry); in strlist__find() local
104 if (rb_node) in strlist__find()
[all …]
|
| D | rblist.c | 16 struct rb_node **p = &rblist->entries.rb_node; in rblist__add_node()
17 struct rb_node *parent = NULL, *new_node; in rblist__add_node()
44 void rblist__remove_node(struct rblist *rblist, struct rb_node *rb_node) in rblist__remove_node() argument
46 rb_erase(rb_node, &rblist->entries); in rblist__remove_node()
48 rblist->node_delete(rblist, rb_node); in rblist__remove_node()
51 struct rb_node *rblist__find(struct rblist *rblist, const void *entry) in rblist__find()
53 struct rb_node **p = &rblist->entries.rb_node; in rblist__find()
54 struct rb_node *parent = NULL; in rblist__find()
86 struct rb_node *pos, *next = rb_first(&rblist->entries); in rblist__delete()
97 struct rb_node *rblist__entry(const struct rblist *rblist, unsigned int idx) in rblist__entry()
[all …]
|
| D | map.c | 44 RB_CLEAR_NODE(&map->rb_node); in map__init()
132 struct rb_node *nd = rb_first(symbols); in map__fixup_start()
134 struct symbol *sym = rb_entry(nd, struct symbol, rb_node); in map__fixup_start()
142 struct rb_node *nd = rb_last(symbols); in map__fixup_end()
144 struct symbol *sym = rb_entry(nd, struct symbol, rb_node); in map__fixup_end()
283 struct rb_node *next = rb_first(maps); in maps__delete()
286 struct map *pos = rb_entry(next, struct map, rb_node); in maps__delete()
288 next = rb_next(&pos->rb_node); in maps__delete()
289 rb_erase(&pos->rb_node, maps); in maps__delete()
320 struct rb_node *next = rb_first(root); in map_groups__flush()
[all …]
|
| D | rblist.h | 25 int (*node_cmp)(struct rb_node *rbn, const void *entry);
26 struct rb_node *(*node_new)(struct rblist *rlist, const void *new_entry);
27 void (*node_delete)(struct rblist *rblist, struct rb_node *rb_node);
33 void rblist__remove_node(struct rblist *rblist, struct rb_node *rb_node);
34 struct rb_node *rblist__find(struct rblist *rblist, const void *entry);
35 struct rb_node *rblist__entry(const struct rblist *rblist, unsigned int idx);
|
| D | symbol.c | 143 struct rb_node *nd; in symbols__fixup_duplicate()
149 curr = rb_entry(nd, struct symbol, rb_node); in symbols__fixup_duplicate()
151 nd = rb_next(&curr->rb_node); in symbols__fixup_duplicate()
152 next = rb_entry(nd, struct symbol, rb_node); in symbols__fixup_duplicate()
161 rb_erase(&next->rb_node, symbols); in symbols__fixup_duplicate()
164 nd = rb_next(&curr->rb_node); in symbols__fixup_duplicate()
165 rb_erase(&curr->rb_node, symbols); in symbols__fixup_duplicate()
172 struct rb_node *nd, *prevnd = rb_first(symbols); in symbols__fixup_end()
178 curr = rb_entry(prevnd, struct symbol, rb_node); in symbols__fixup_end()
182 curr = rb_entry(nd, struct symbol, rb_node); in symbols__fixup_end()
[all …]
|
| D | intlist.h | 10 struct rb_node rb_node; member
45 struct rb_node *rn = rb_first(&ilist->rblist.entries); in intlist__first()
46 return rn ? rb_entry(rn, struct int_node, rb_node) : NULL; in intlist__first()
50 struct rb_node *rn; in intlist__next()
53 rn = rb_next(&in->rb_node); in intlist__next()
54 return rn ? rb_entry(rn, struct int_node, rb_node) : NULL; in intlist__next()
|
| D | strlist.h | 10 struct rb_node rb_node; member
47 struct rb_node *rn = rb_first(&slist->rblist.entries); in strlist__first()
48 return rn ? rb_entry(rn, struct str_node, rb_node) : NULL; in strlist__first()
52 struct rb_node *rn; in strlist__next()
55 rn = rb_next(&sn->rb_node); in strlist__next()
56 return rn ? rb_entry(rn, struct str_node, rb_node) : NULL; in strlist__next()
|
| D | hist.c | 167 struct rb_node *next = rb_first(&hists->entries); in hists__output_recalc_col_len()
174 n = rb_entry(next, struct hist_entry, rb_node); in hists__output_recalc_col_len()
177 next = rb_next(&n->rb_node); in hists__output_recalc_col_len()
246 struct rb_node *next = rb_first(&hists->entries); in hists__decay_entries()
250 n = rb_entry(next, struct hist_entry, rb_node); in hists__decay_entries()
251 next = rb_next(&n->rb_node); in hists__decay_entries()
261 rb_erase(&n->rb_node, &hists->entries); in hists__decay_entries()
346 struct rb_node **p; in add_hist_entry()
347 struct rb_node *parent = NULL; in add_hist_entry()
351 p = &hists->entries_in->rb_node; in add_hist_entry()
[all …]
|
| D | machine.c | 17 RB_CLEAR_NODE(&machine->rb_node); in machine__init()
71 struct rb_node *nd = rb_first(&machine->threads); in machine__delete_threads()
74 struct thread *t = rb_entry(nd, struct thread, rb_node); in machine__delete_threads()
76 rb_erase(&t->rb_node, &machine->threads); in machine__delete_threads()
113 struct rb_node **p = &machines->guests.rb_node; in machines__add()
114 struct rb_node *parent = NULL; in machines__add()
129 pos = rb_entry(parent, struct machine, rb_node); in machines__add()
136 rb_link_node(&machine->rb_node, parent, p); in machines__add()
137 rb_insert_color(&machine->rb_node, &machines->guests); in machines__add()
145 struct rb_node *nd; in machines__set_symbol_filter()
[all …]
|
| /external/fio/lib/ |
| D | rbtree.h | 100 struct rb_node struct
105 struct rb_node *rb_right; argument
106 struct rb_node *rb_left; argument
112 struct rb_node *rb_node; member
116 #define rb_parent(r) ((struct rb_node *)((r)->rb_parent_color & ~3))
123 static inline void rb_set_parent(struct rb_node *rb, struct rb_node *p) in rb_set_parent()
127 static inline void rb_set_color(struct rb_node *rb, int color) in rb_set_color()
135 #define RB_EMPTY_ROOT(root) ((root)->rb_node == NULL)
139 extern void rb_insert_color(struct rb_node *, struct rb_root *);
140 extern void rb_erase(struct rb_node *, struct rb_root *);
[all …]
|
| D | rbtree.c | 25 static void __rb_rotate_left(struct rb_node *node, struct rb_root *root) in __rb_rotate_left()
27 struct rb_node *right = node->rb_right; in __rb_rotate_left()
28 struct rb_node *parent = rb_parent(node); in __rb_rotate_left()
44 root->rb_node = right; in __rb_rotate_left()
48 static void __rb_rotate_right(struct rb_node *node, struct rb_root *root) in __rb_rotate_right()
50 struct rb_node *left = node->rb_left; in __rb_rotate_right()
51 struct rb_node *parent = rb_parent(node); in __rb_rotate_right()
67 root->rb_node = left; in __rb_rotate_right()
71 void rb_insert_color(struct rb_node *node, struct rb_root *root) in rb_insert_color()
73 struct rb_node *parent, *gparent; in rb_insert_color()
[all …]
|
| /external/blktrace/btt/ |
| D | proc.c | 26 struct rb_node rb_node; member
36 static void __foreach(struct rb_node *n, void (*f)(struct p_info *, void *), in __foreach()
41 f(rb_entry(n, struct pn_info, rb_node)->pip, arg); in __foreach()
46 static void __destroy(struct rb_node *n, int free_name, int free_pip) in __destroy()
49 struct pn_info *pnp = rb_entry(n, struct pn_info, rb_node); in __destroy()
68 struct rb_node *n = root_pid.rb_node; in __find_process_pid()
71 this = rb_entry(n, struct pn_info, rb_node); in __find_process_pid()
87 struct rb_node *n = root_name.rb_node; in __find_process_name()
90 this = rb_entry(n, struct pn_info, rb_node); in __find_process_name()
106 struct rb_node *parent = NULL; in insert_pid()
[all …]
|
| D | dip_rb.c | 27 struct rb_node *parent = NULL; in rb_insert()
28 struct rb_node **p = &root->rb_node; in rb_insert()
33 __iop = rb_entry(parent, struct io, rb_node); in rb_insert()
44 rb_link_node(&iop->rb_node, parent, p); in rb_insert()
45 rb_insert_color(&iop->rb_node, root); in rb_insert()
52 struct rb_node *n = root->rb_node; in rb_find_sec()
55 __iop = rb_entry(n, struct io, rb_node); in rb_find_sec()
67 void rb_foreach(struct rb_node *n, struct io *iop, in rb_foreach()
72 struct io *this = rb_entry(n, struct io, rb_node); in rb_foreach()
|
| D | seek.c | 25 struct rb_node rb_node; member
65 struct rb_node *parent = NULL; in __insert()
66 struct rb_node **p = &root->rb_node; in __insert()
70 sbp = rb_entry(parent, struct seek_bkt, rb_node); in __insert()
85 rb_link_node(&sbp->rb_node, parent, p); in __insert()
86 rb_insert_color(&sbp->rb_node, root); in __insert()
89 static void __destroy(struct rb_node *n) in __destroy()
92 struct seek_bkt *sbp = rb_entry(n, struct seek_bkt, rb_node); in __destroy()
138 static int __median(struct rb_node *n, long long sofar, long long target, in __median()
143 sbp = rb_entry(n, struct seek_bkt, rb_node); in __median()
[all …]
|
| /external/llvm/test/Transforms/ConstProp/ |
| D | 2009-09-01-GEP-Crash.ll | 9 %3 = type { %struct.hrtimer_cpu_base*, i32, %struct.rb_root, %struct.rb_node*, %struct.pgprot, i64 …
11 …k_base = type { %struct.hrtimer_cpu_base*, i32, %struct.rb_root, %struct.rb_node*, %struct.pgprot,…
14 %struct.rb_node = type { i64, %struct.rb_node*, %struct.rb_node* }
15 %struct.rb_root = type { %struct.rb_node* }
|
| /external/linux-tools-perf/src/tools/perf/tests/ |
| D | vmlinux-kallsyms.c | 24 struct rb_node *nd; in test__vmlinux_matches_kallsyms()
124 sym = rb_entry(nd, struct symbol, rb_node); in test__vmlinux_matches_kallsyms()
163 struct rb_node *nnd; in test__vmlinux_matches_kallsyms()
165 nnd = backwards ? rb_prev(&pair->rb_node) : in test__vmlinux_matches_kallsyms()
166 rb_next(&pair->rb_node); in test__vmlinux_matches_kallsyms()
168 struct symbol *next = rb_entry(nnd, struct symbol, rb_node); in test__vmlinux_matches_kallsyms()
198 struct map *pos = rb_entry(nd, struct map, rb_node), *pair; in test__vmlinux_matches_kallsyms()
218 struct map *pos = rb_entry(nd, struct map, rb_node), *pair; in test__vmlinux_matches_kallsyms()
243 struct map *pos = rb_entry(nd, struct map, rb_node); in test__vmlinux_matches_kallsyms()
|