| /tools/perf/util/ |
| D | rb_resort.h | 59 static void __name##_sorted__init_entry(struct rb_node *nd, \
72 struct __name##_sorted_entry nd[0]; \
93 struct rb_node *nd; \
95 for (nd = rb_first(entries); nd; nd = rb_next(nd)) { \
96 struct __name##_sorted_entry *snd = &sorted->nd[i++]; \
97 __name##_sorted__init_entry(nd, snd); \
106 sorted = malloc(sizeof(*sorted) + sizeof(sorted->nd[0]) * nr_entries); \
119 static void __name##_sorted__init_entry(struct rb_node *nd, \
|
| D | symbol_fprintf.c | 62 struct rb_node *nd; in dso__fprintf_symbols_by_name() local
65 for (nd = rb_first(&dso->symbol_names[type]); nd; nd = rb_next(nd)) { in dso__fprintf_symbols_by_name()
66 pos = rb_entry(nd, struct symbol_name_rb_node, rb_node); in dso__fprintf_symbols_by_name()
|
| D | build-id.c | 394 struct rb_node *nd; in perf_session__write_buildid_table() local
400 for (nd = rb_first(&session->machines.guests); nd; nd = rb_next(nd)) { in perf_session__write_buildid_table()
401 struct machine *pos = rb_entry(nd, struct machine, rb_node); in perf_session__write_buildid_table()
426 struct rb_node *nd; in dsos__hit_all() local
433 for (nd = rb_first(&session->machines.guests); nd; nd = rb_next(nd)) { in dsos__hit_all()
434 struct machine *pos = rb_entry(nd, struct machine, rb_node); in dsos__hit_all()
468 struct str_node *nd, *nd2; in build_id_cache__list_all() local
493 strlist__for_each_entry(nd, toplist) { in build_id_cache__list_all()
494 if (asprintf(&linkdir, "%s/%s", topdir, nd->s) < 0) in build_id_cache__list_all()
504 nd->s, nd2->s) != SBUILD_ID_SIZE - 1) in build_id_cache__list_all()
[all …]
|
| D | machine.c | 114 struct rb_node *nd; in machine__delete_threads() local
117 nd = rb_first(&machine->threads); in machine__delete_threads()
118 while (nd) { in machine__delete_threads()
119 struct thread *t = rb_entry(nd, struct thread, rb_node); in machine__delete_threads()
121 nd = rb_next(nd); in machine__delete_threads()
190 struct rb_node *nd; in machines__set_comm_exec() local
194 for (nd = rb_first(&machines->guests); nd; nd = rb_next(nd)) { in machines__set_comm_exec()
195 struct machine *machine = rb_entry(nd, struct machine, rb_node); in machines__set_comm_exec()
264 struct rb_node *nd; in machines__process_guests() local
266 for (nd = rb_first(&machines->guests); nd; nd = rb_next(nd)) { in machines__process_guests()
[all …]
|
| D | map.c | 265 struct rb_node *nd = rb_first(symbols); in map__fixup_start() local
266 if (nd != NULL) { in map__fixup_start()
267 struct symbol *sym = rb_entry(nd, struct symbol, rb_node); in map__fixup_start()
275 struct rb_node *nd = rb_last(symbols); in map__fixup_end() local
276 if (nd != NULL) { in map__fixup_end()
277 struct symbol *sym = rb_entry(nd, struct symbol, rb_node); in map__fixup_end()
574 struct rb_node *nd; in maps__find_symbol_by_name() local
578 for (nd = rb_first(&maps->entries); nd; nd = rb_next(nd)) { in maps__find_symbol_by_name()
579 struct map *pos = rb_entry(nd, struct map, rb_node); in maps__find_symbol_by_name()
626 struct rb_node *nd; in maps__fprintf() local
[all …]
|
| D | hist.c | 1938 struct rb_node *nd; in hists__filter_by_type() local
1945 for (nd = rb_first(&hists->entries); nd; nd = rb_next(nd)) { in hists__filter_by_type()
1946 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node); in hists__filter_by_type()
1961 struct rb_node *nd; in resort_filtered_entry() local
1979 nd = rb_first(&he->hroot_out); in resort_filtered_entry()
1980 while (nd) { in resort_filtered_entry()
1981 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node); in resort_filtered_entry()
1983 nd = rb_next(nd); in resort_filtered_entry()
1994 struct rb_node *nd; in hists__filter_hierarchy() local
2002 nd = rb_first(&hists->entries); in hists__filter_hierarchy()
[all …]
|
| D | symbol.h | 74 #define symbols__for_each_entry(symbols, pos, nd) \ argument
75 for (nd = rb_first(symbols); \
76 nd && (pos = rb_entry(nd, struct symbol, rb_node)); \
77 nd = rb_next(nd))
|
| D | symbol.c | 153 struct rb_node *nd; in symbols__fixup_duplicate() local
159 nd = rb_first(symbols); in symbols__fixup_duplicate()
161 while (nd) { in symbols__fixup_duplicate()
162 curr = rb_entry(nd, struct symbol, rb_node); in symbols__fixup_duplicate()
164 nd = rb_next(&curr->rb_node); in symbols__fixup_duplicate()
165 next = rb_entry(nd, struct symbol, rb_node); in symbols__fixup_duplicate()
167 if (!nd) in symbols__fixup_duplicate()
178 nd = rb_next(&curr->rb_node); in symbols__fixup_duplicate()
187 struct rb_node *nd, *prevnd = rb_first(symbols); in symbols__fixup_end() local
195 for (nd = rb_next(prevnd); nd; nd = rb_next(nd)) { in symbols__fixup_end()
[all …]
|
| D | probe-file.c | 852 struct str_node *nd; in probe_cache__show_all_caches() local
863 strlist__for_each_entry(nd, bidlist) { in probe_cache__show_all_caches()
864 pcache = probe_cache__new(nd->s); in probe_cache__show_all_caches()
868 buf = build_id_cache__origname(nd->s); in probe_cache__show_all_caches()
869 printf("%s (%s):\n", buf, nd->s); in probe_cache__show_all_caches()
|
| D | parse-events.c | 2047 struct str_node *nd, *nd2; in print_sdt_events() local
2062 strlist__for_each_entry(nd, bidlist) { in print_sdt_events()
2063 pcache = probe_cache__new(nd->s); in print_sdt_events()
2076 ent->pev.event, nd->s); in print_sdt_events()
2084 strlist__for_each_entry(nd, sdtlist) { in print_sdt_events()
2085 buf = strchr(nd->s, '@'); in print_sdt_events()
2089 printf("%s ", nd->s); in print_sdt_events()
2092 nd2 = strlist__next(nd); in print_sdt_events()
2097 if (strcmp(nd->s, nd2->s) == 0) in print_sdt_events()
2102 ret = asprintf(&buf, "%s@%s(%.12s)", nd->s, path, buf); in print_sdt_events()
[all …]
|
| D | dso.c | 1324 struct rb_node *nd; in dso__fprintf() local
1333 for (nd = rb_first(&dso->symbols[type]); nd; nd = rb_next(nd)) { in dso__fprintf()
1334 struct symbol *pos = rb_entry(nd, struct symbol, rb_node); in dso__fprintf()
|
| D | probe-event.c | 3151 struct str_node *nd; in find_cached_events_all() local
3165 strlist__for_each_entry(nd, bidlist) { in find_cached_events_all()
3166 pathname = build_id_cache__origname(nd->s); in find_cached_events_all()
3431 struct rb_node *nd; in show_available_funcs() local
3464 for (nd = rb_first(&map->dso->symbol_names[map->type]); nd; nd = rb_next(nd)) { in show_available_funcs()
3465 struct symbol_name_rb_node *pos = rb_entry(nd, struct symbol_name_rb_node, rb_node); in show_available_funcs()
|
| /tools/perf/ui/browsers/ |
| D | map.c | 20 static void map_browser__write(struct ui_browser *browser, void *nd, int row) in map_browser__write() argument
22 struct symbol *sym = rb_entry(nd, struct symbol, rb_node); in map_browser__write()
111 struct rb_node *nd; in map__browse() local
115 for (nd = rb_first(mb.b.entries); nd; nd = rb_next(nd)) { in map__browse()
116 struct symbol *pos = rb_entry(nd, struct symbol, rb_node); in map__browse()
|
| D | hists.c | 28 static struct rb_node *hists__filter_entries(struct rb_node *nd,
38 struct rb_node *nd; in hist_browser__get_folding() local
42 for (nd = rb_first(&hists->entries); in hist_browser__get_folding()
43 (nd = hists__filter_entries(nd, browser->min_pcnt)) != NULL; in hist_browser__get_folding()
44 nd = rb_hierarchy_next(nd)) { in hist_browser__get_folding()
46 rb_entry(nd, struct hist_entry, rb_node); in hist_browser__get_folding()
150 struct rb_node *nd; in callchain_node__count_rows_rb_tree() local
152 for (nd = rb_first(&node->rb_root); nd; nd = rb_next(nd)) { in callchain_node__count_rows_rb_tree()
153 struct callchain_node *child = rb_entry(nd, struct callchain_node, rb_node); in callchain_node__count_rows_rb_tree()
230 struct rb_node *nd; in callchain__count_rows() local
[all …]
|
| D | annotate.c | 362 struct rb_node *nd) in annotate_browser__set_rb_top() argument
368 bpos = rb_entry(nd, struct browser_disasm_line, rb_node); in annotate_browser__set_rb_top()
374 browser->curr_hot = nd; in annotate_browser__set_rb_top()
705 struct rb_node *nd = NULL; in annotate_browser__run() local
724 nd = browser->curr_hot; in annotate_browser__run()
736 if (nd != NULL && RB_EMPTY_NODE(nd)) in annotate_browser__run()
737 nd = NULL; in annotate_browser__run()
749 if (nd != NULL) { in annotate_browser__run()
750 nd = rb_prev(nd); in annotate_browser__run()
751 if (nd == NULL) in annotate_browser__run()
[all …]
|
| /tools/perf/ |
| D | builtin-annotate.c | 232 struct rb_node *nd = rb_first(&hists->entries), *next; in hists__find_annotations() local
235 while (nd) { in hists__find_annotations()
236 struct hist_entry *he = rb_entry(nd, struct hist_entry, rb_node); in hists__find_annotations()
246 nd = rb_prev(nd); in hists__find_annotations()
248 nd = rb_next(nd); in hists__find_annotations()
270 nd = rb_next(nd); in hists__find_annotations()
279 next = rb_next(nd); in hists__find_annotations()
282 next = rb_prev(nd); in hists__find_annotations()
289 nd = next; in hists__find_annotations()
292 nd = rb_next(nd); in hists__find_annotations()
|
| D | builtin-probe.c | 375 struct str_node *nd; in del_perf_probe_caches() local
385 strlist__for_each_entry(nd, bidlist) { in del_perf_probe_caches()
386 cache = probe_cache__new(nd->s); in del_perf_probe_caches()
391 pr_warning("Failed to remove entries for %s\n", nd->s); in del_perf_probe_caches()
|
| D | builtin-trace.c | 2567 struct int_node *source = rb_entry(nd, struct int_node, rb_node);
2580 struct rb_node *nd; in thread__dump_stats() local
2592 resort_rb__for_each_entry(nd, syscall_stats) { in thread__dump_stats()
2655 entry->thread = rb_entry(nd, struct thread, rb_node);
2662 struct rb_node *nd; in trace__fprintf_thread_summary() local
2669 resort_rb__for_each_entry(nd, threads) in trace__fprintf_thread_summary()
|
| /tools/perf/ui/gtk/ |
| D | hists.c | 95 struct rb_node *nd; in perf_gtk__add_callchain_flat() local
98 for (nd = rb_first(root); nd; nd = rb_next(nd)) { in perf_gtk__add_callchain_flat()
104 node = rb_entry(nd, struct callchain_node, rb_node); in perf_gtk__add_callchain_flat()
158 struct rb_node *nd; in perf_gtk__add_callchain_folded() local
160 for (nd = rb_first(root); nd; nd = rb_next(nd)) { in perf_gtk__add_callchain_folded()
168 node = rb_entry(nd, struct callchain_node, rb_node); in perf_gtk__add_callchain_folded()
218 struct rb_node *nd; in perf_gtk__add_callchain_graph() local
221 for (nd = rb_first(root); nd; nd = rb_next(nd)) { in perf_gtk__add_callchain_graph()
228 node = rb_entry(nd, struct callchain_node, rb_node); in perf_gtk__add_callchain_graph()
295 struct rb_node *nd; in perf_gtk__show_hists() local
[all …]
|
| /tools/perf/tests/ |
| D | vmlinux-kallsyms.c | 16 struct rb_node *nd; in test__vmlinux_matches_kallsyms() local
109 for (nd = rb_first(&vmlinux_map->dso->symbols[type]); nd; nd = rb_next(nd)) { in test__vmlinux_matches_kallsyms()
112 sym = rb_entry(nd, struct symbol, rb_node); in test__vmlinux_matches_kallsyms()
|
| /tools/perf/ui/ |
| D | browser.c | 128 struct rb_node *nd; in ui_browser__rb_tree_seek() local
132 nd = rb_first(root); in ui_browser__rb_tree_seek()
135 nd = browser->top; in ui_browser__rb_tree_seek()
138 nd = rb_last(root); in ui_browser__rb_tree_seek()
146 nd = rb_next(nd); in ui_browser__rb_tree_seek()
149 nd = rb_prev(nd); in ui_browser__rb_tree_seek()
152 browser->top = nd; in ui_browser__rb_tree_seek()
157 struct rb_node *nd; in ui_browser__rb_tree_refresh() local
163 nd = browser->top; in ui_browser__rb_tree_refresh()
165 while (nd != NULL) { in ui_browser__rb_tree_refresh()
[all …]
|
| /tools/perf/ui/stdio/ |
| D | hist.c | 726 struct rb_node *nd; in hists__fprintf() local
757 for (nd = rb_first(&hists->entries); nd; nd = __rb_hierarchy_next(nd, HMD_FORCE_CHILD)) { in hists__fprintf()
758 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node); in hists__fprintf()
|
| /tools/perf/util/intel-pt-decoder/ |
| D | x86-opcode-map.txt | 11 # opcode: mnemonic|GrpXXX [operand1[,operand2...]] [(extra1)[,(extra2)...] [| 2nd-mnemonic ...]
21 # reg: mnemonic [operand1[,operand2...]] [(extra1)[,(extra2)...] [| 2nd-mnemonic ...]
|
| /tools/objtool/arch/x86/insn/ |
| D | x86-opcode-map.txt | 11 # opcode: mnemonic|GrpXXX [operand1[,operand2...]] [(extra1)[,(extra2)...] [| 2nd-mnemonic ...]
21 # reg: mnemonic [operand1[,operand2...]] [(extra1)[,(extra2)...] [| 2nd-mnemonic ...]
|