| /external/linux-tools-perf/util/include/linux/added/ |
| D | rbtree.h | 106 struct rb_node struct
111 struct rb_node *rb_right; argument
112 struct rb_node *rb_left; argument
118 struct rb_node *rb_node; member
122 #define rb_parent(r) ((struct rb_node *)((r)->rb_parent_color & ~3))
129 static inline void rb_set_parent(struct rb_node *rb, struct rb_node *p) in rb_set_parent()
133 static inline void rb_set_color(struct rb_node *rb, int color) in rb_set_color()
141 #define RB_EMPTY_ROOT(root) ((root)->rb_node == NULL)
145 extern void rb_insert_color(struct rb_node *, struct rb_root *);
146 extern void rb_erase(struct rb_node *, struct rb_root *);
[all …]
|
| /external/kernel-headers/original/linux/ |
| 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 …]
|
| /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 …]
|
| D | blkparse.c | 226 struct rb_node rb_node; member
246 struct rb_node rb_node; member
782 rb_erase(&t->rb_node, &pci->rb_last); in __put_trace_last()
791 rb_erase(&t->rb_node, &rb_sort_root); in put_trace()
799 struct rb_node **p = &root->rb_node; in trace_rb_insert()
800 struct rb_node *parent = NULL; in trace_rb_insert()
806 __t = rb_entry(parent, struct trace, rb_node); in trace_rb_insert()
822 rb_link_node(&t->rb_node, parent, p); in trace_rb_insert()
823 rb_insert_color(&t->rb_node, root); in trace_rb_insert()
847 struct rb_node *n = rb_first(&pci->rb_last); in trace_rb_insert_last()
[all …]
|
| /external/linux-tools-perf/util/added/ |
| D | rbtree.c | 26 static void __rb_rotate_left(struct rb_node *node, struct rb_root *root) in __rb_rotate_left()
28 struct rb_node *right = node->rb_right; in __rb_rotate_left()
29 struct rb_node *parent = rb_parent(node); in __rb_rotate_left()
45 root->rb_node = right; in __rb_rotate_left()
49 static void __rb_rotate_right(struct rb_node *node, struct rb_root *root) in __rb_rotate_right()
51 struct rb_node *left = node->rb_left; in __rb_rotate_right()
52 struct rb_node *parent = rb_parent(node); in __rb_rotate_right()
68 root->rb_node = left; in __rb_rotate_right()
72 void rb_insert_color(struct rb_node *node, struct rb_root *root) in rb_insert_color()
74 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/linux-tools-perf/util/ |
| D | map.c | 31 RB_CLEAR_NODE(&self->rb_node); in map__init()
82 struct rb_node *nd = rb_first(symbols); in map__fixup_start()
84 struct symbol *sym = rb_entry(nd, struct symbol, rb_node); in map__fixup_start()
92 struct rb_node *nd = rb_last(symbols); in map__fixup_end()
94 struct symbol *sym = rb_entry(nd, struct symbol, rb_node); in map__fixup_end()
235 struct rb_node *next = rb_first(self); in maps__delete()
238 struct map *pos = rb_entry(next, struct map, rb_node); in maps__delete()
240 next = rb_next(&pos->rb_node); in maps__delete()
241 rb_erase(&pos->rb_node, self); in maps__delete()
272 struct rb_node *next = rb_first(root); in map_groups__flush()
[all …]
|
| D | strlist.c | 42 struct rb_node **p = &self->entries.rb_node; in strlist__add()
43 struct rb_node *parent = NULL; in strlist__add()
50 sn = rb_entry(parent, struct str_node, rb_node); in strlist__add()
65 rb_link_node(&sn->rb_node, parent, p); in strlist__add()
66 rb_insert_color(&sn->rb_node, &self->entries); in strlist__add()
101 rb_erase(&sn->rb_node, &self->entries); in strlist__remove()
107 struct rb_node **p = &self->entries.rb_node; in strlist__find()
108 struct rb_node *parent = NULL; in strlist__find()
115 sn = rb_entry(parent, struct str_node, rb_node); in strlist__find()
176 struct rb_node *next = rb_first(&self->entries); in strlist__delete()
[all …]
|
| D | hist.c | 134 struct rb_node **p = &self->entries.rb_node; in __hists__add_entry()
135 struct rb_node *parent = NULL; in __hists__add_entry()
154 he = rb_entry(parent, struct hist_entry, rb_node); in __hists__add_entry()
173 rb_link_node(&he->rb_node, parent, p); in __hists__add_entry()
174 rb_insert_color(&he->rb_node, &self->entries); in __hists__add_entry()
228 struct rb_node **p = &root->rb_node; in hists__collapse_insert_entry()
229 struct rb_node *parent = NULL; in hists__collapse_insert_entry()
235 iter = rb_entry(parent, struct hist_entry, rb_node); in hists__collapse_insert_entry()
256 rb_link_node(&he->rb_node, parent, p); in hists__collapse_insert_entry()
257 rb_insert_color(&he->rb_node, root); in hists__collapse_insert_entry()
[all …]
|
| D | strlist.h | 15 struct rb_node rb_node; member
53 struct rb_node *rn = rb_first(&self->entries); in strlist__first()
54 return rn ? rb_entry(rn, struct str_node, rb_node) : NULL; in strlist__first()
58 struct rb_node *rn; in strlist__next()
61 rn = rb_next(&sn->rb_node); in strlist__next()
62 return rn ? rb_entry(rn, struct str_node, rb_node) : NULL; in strlist__next()
|
| D | thread.c | 66 struct rb_node **p = &self->threads.rb_node; in perf_session__findnew()
67 struct rb_node *parent = NULL; in perf_session__findnew()
80 th = rb_entry(parent, struct thread, rb_node); in perf_session__findnew()
95 rb_link_node(&th->rb_node, parent, p); in perf_session__findnew()
96 rb_insert_color(&th->rb_node, &self->threads); in perf_session__findnew()
131 struct rb_node *nd; in perf_session__fprintf()
134 struct thread *pos = rb_entry(nd, struct thread, rb_node); in perf_session__fprintf()
|
| D | symbol.c | 95 struct rb_node *nd, *prevnd = rb_first(symbols); in symbols__fixup_end()
101 curr = rb_entry(prevnd, struct symbol, rb_node); in symbols__fixup_end()
105 curr = rb_entry(nd, struct symbol, rb_node); in symbols__fixup_end()
119 struct rb_node *nd, *prevnd = rb_first(&mg->maps[type]); in __map_groups__fixup_end()
124 curr = rb_entry(prevnd, struct map, rb_node); in __map_groups__fixup_end()
128 curr = rb_entry(nd, struct map, rb_node); in __map_groups__fixup_end()
230 struct rb_node *next = rb_first(symbols); in symbols__delete()
233 pos = rb_entry(next, struct symbol, rb_node); in symbols__delete()
234 next = rb_next(&pos->rb_node); in symbols__delete()
235 rb_erase(&pos->rb_node, symbols); in symbols__delete()
[all …]
|
| D | top.c | 46 struct rb_node **p = &tree->rb_node; in rb_insert_active_sym()
47 struct rb_node *parent = NULL; in rb_insert_active_sym()
52 iter = rb_entry(parent, struct sym_entry, rb_node); in rb_insert_active_sym()
60 rb_link_node(&se->rb_node, parent, p); in rb_insert_active_sym()
61 rb_insert_color(&se->rb_node, tree); in rb_insert_active_sym()
216 struct rb_node *nd; in perf_top__find_widths()
222 struct sym_entry *syme = rb_entry(nd, struct sym_entry, rb_node); in perf_top__find_widths()
|
| D | callchain.c | 39 struct rb_node **p = &root->rb_node; in rb_insert_callchain()
40 struct rb_node *parent = NULL; in rb_insert_callchain()
48 rnode = rb_entry(parent, struct callchain_node, rb_node); in rb_insert_callchain()
71 rb_link_node(&chain->rb_node, parent, p); in rb_insert_callchain()
72 rb_insert_color(&chain->rb_node, root); in rb_insert_callchain()
119 rb_root->rb_node = chain_root->node.rb_root.rb_node; in sort_chain_graph_abs()
144 rb_root->rb_node = chain_root->node.rb_root.rb_node; in sort_chain_graph_rel()
|
| /external/linux-tools-perf/ |
| D | builtin-diff.c | 72 struct rb_node **p = &root->rb_node; in perf_session__insert_hist_entry_by_name()
73 struct rb_node *parent = NULL; in perf_session__insert_hist_entry_by_name()
78 iter = rb_entry(parent, struct hist_entry, rb_node); in perf_session__insert_hist_entry_by_name()
85 rb_link_node(&he->rb_node, parent, p); in perf_session__insert_hist_entry_by_name()
86 rb_insert_color(&he->rb_node, root); in perf_session__insert_hist_entry_by_name()
93 struct rb_node *next = rb_first(&self->entries); in hists__resort_entries()
96 struct hist_entry *n = rb_entry(next, struct hist_entry, rb_node); in hists__resort_entries()
98 next = rb_next(&n->rb_node); in hists__resort_entries()
99 rb_erase(&n->rb_node, &self->entries); in hists__resort_entries()
116 struct rb_node *n = self->entries.rb_node; in hists__find_entry()
[all …]
|
| D | builtin-kmem.c | 52 struct rb_node node;
122 struct rb_node **node = &root_alloc_stat.rb_node; in insert_alloc_stat()
123 struct rb_node *parent = NULL; in insert_alloc_stat()
162 struct rb_node **node = &root_caller_stat.rb_node; in insert_caller_stat()
163 struct rb_node *parent = NULL; in insert_caller_stat()
238 struct rb_node *node = root->rb_node; in search_alloc_stat()
350 struct rb_node *next; in __print_result()
438 struct rb_node **new = &(root->rb_node); in sort_insert()
439 struct rb_node *parent = NULL; in sort_insert()
468 struct rb_node *node; in __sort_result()
|
| D | builtin-lock.c | 50 struct rb_node rb; /* used for sorting */
115 struct rb_node rb;
125 struct rb_node *node; in thread_stat_find()
128 node = thread_stats.rb_node; in thread_stat_find()
144 struct rb_node **rb = &thread_stats.rb_node; in thread_stat_insert()
145 struct rb_node *parent = NULL; in thread_stat_insert()
198 rb_link_node(&st->rb, NULL, &thread_stats.rb_node); in thread_stat_findnew_first()
277 struct rb_node **rb = &result.rb_node; in insert_to_result()
278 struct rb_node *parent = NULL; in insert_to_result()
298 struct rb_node *node = result.rb_node; in pop_from_result()
[all …]
|
| D | builtin-test.c | 28 struct rb_node *nd; in test__vmlinux_matches_kallsyms()
126 sym = rb_entry(nd, struct symbol, rb_node); in test__vmlinux_matches_kallsyms()
153 struct rb_node *nnd; in test__vmlinux_matches_kallsyms()
155 nnd = backwards ? rb_prev(&pair->rb_node) : in test__vmlinux_matches_kallsyms()
156 rb_next(&pair->rb_node); in test__vmlinux_matches_kallsyms()
158 struct symbol *next = rb_entry(nnd, struct symbol, rb_node); in test__vmlinux_matches_kallsyms()
187 struct map *pos = rb_entry(nd, struct map, rb_node), *pair; in test__vmlinux_matches_kallsyms()
207 struct map *pos = rb_entry(nd, struct map, rb_node), *pair; in test__vmlinux_matches_kallsyms()
229 struct map *pos = rb_entry(nd, struct map, rb_node); in test__vmlinux_matches_kallsyms()
|
| /external/linux-tools-perf/util/ui/browsers/ |
| D | annotate.c | 22 struct rb_node *curr_hot;
26 struct rb_node rb_node; member
101 struct rb_node **p = &self->rb_node; in objdump__insert_line()
102 struct rb_node *parent = NULL; in objdump__insert_line()
107 l = rb_entry(parent, struct objdump_line_rb_node, rb_node); in objdump__insert_line()
113 rb_link_node(&line->rb_node, parent, p); in objdump__insert_line()
114 rb_insert_color(&line->rb_node, self); in objdump__insert_line()
118 struct rb_node *nd) in annotate_browser__set_top()
126 rbpos = rb_entry(nd, struct objdump_line_rb_node, rb_node); in annotate_browser__set_top()
156 RB_CLEAR_NODE(&rbpos->rb_node); in annotate_browser__calc_percent()
[all …]
|
| D | hists.c | 71 struct rb_node *nd; in callchain_node__count_rows_rb_tree()
74 struct callchain_node *child = rb_entry(nd, struct callchain_node, rb_node); in callchain_node__count_rows_rb_tree()
112 struct rb_node *nd; in callchain__count_rows()
116 struct callchain_node *node = rb_entry(nd, struct callchain_node, rb_node); in callchain__count_rows()
134 struct rb_node *nd = rb_first(&self->rb_root); in callchain_node__init_have_children_rb_tree()
137 struct callchain_node *child = rb_entry(nd, struct callchain_node, rb_node); in callchain_node__init_have_children_rb_tree()
167 struct rb_node *nd; in callchain__init_have_children()
170 struct callchain_node *node = rb_entry(nd, struct callchain_node, rb_node); in callchain__init_have_children()
209 struct rb_node *nd; in callchain_node__set_folding_rb_tree()
212 struct callchain_node *child = rb_entry(nd, struct callchain_node, rb_node); in callchain_node__set_folding_rb_tree()
[all …]
|
| D | map.c | 55 struct symbol *sym = rb_entry(nd, struct symbol, rb_node); in map_browser__write()
73 return ((void *)self) - sizeof(struct rb_node) - sizeof(u32); in symbol__browser_index()
94 self->b.top = &sym->rb_node; in map_browser__search()
138 struct rb_node *nd; in map__browse()
143 struct symbol *pos = rb_entry(nd, struct symbol, rb_node); in map__browse()
|
| /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* }
|