| /tools/perf/util/ |
| D | rb_resort.h | 60 static void __name##_sorted__init_entry(struct rb_node *nd, \
73 struct __name##_sorted_entry nd[0]; \
94 struct rb_node *nd; \
96 for (nd = rb_first(entries); nd; nd = rb_next(nd)) { \
97 struct __name##_sorted_entry *snd = &sorted->nd[i++]; \
98 __name##_sorted__init_entry(nd, snd); \
107 sorted = malloc(sizeof(*sorted) + sizeof(sorted->nd[0]) * nr_entries); \
120 static void __name##_sorted__init_entry(struct rb_node *nd, \
|
| D | metricgroup.c | 30 struct rb_node *nd; in metricgroup__lookup() local
38 nd = rblist__find(metric_events, &me); in metricgroup__lookup()
39 if (nd) in metricgroup__lookup()
40 return container_of(nd, struct metric_event, nd); in metricgroup__lookup()
43 nd = rblist__find(metric_events, &me); in metricgroup__lookup()
44 if (nd) in metricgroup__lookup()
45 return container_of(nd, struct metric_event, nd); in metricgroup__lookup()
54 nd); in metric_event_cmp()
74 return &me->nd; in metric_event_new()
85 struct list_head nd; member
[all …]
|
| D | symbol_fprintf.c | 66 struct rb_node *nd; in dso__fprintf_symbols_by_name() local
69 for (nd = rb_first_cached(&dso->symbol_names); nd; nd = rb_next(nd)) { in dso__fprintf_symbols_by_name()
70 pos = rb_entry(nd, struct symbol_name_rb_node, rb_node); in dso__fprintf_symbols_by_name()
|
| D | build-id.c | 366 struct rb_node *nd; in perf_session__write_buildid_table() local
372 for (nd = rb_first_cached(&session->machines.guests); nd; in perf_session__write_buildid_table()
373 nd = rb_next(nd)) { in perf_session__write_buildid_table()
374 struct machine *pos = rb_entry(nd, struct machine, rb_node); in perf_session__write_buildid_table()
399 struct rb_node *nd; in dsos__hit_all() local
406 for (nd = rb_first_cached(&session->machines.guests); nd; in dsos__hit_all()
407 nd = rb_next(nd)) { in dsos__hit_all()
408 struct machine *pos = rb_entry(nd, struct machine, rb_node); in dsos__hit_all()
442 struct str_node *nd, *nd2; in build_id_cache__list_all() local
467 strlist__for_each_entry(nd, toplist) { in build_id_cache__list_all()
[all …]
|
| D | srccode.c | 26 struct list_head nd; member
86 list_del_init(&sf->nd); in free_srcfile()
107 list_del(&h->nd); in find_srcfile()
108 list_add(&h->nd, &srcfile_list); in find_srcfile()
117 h = list_entry(srcfile_list.prev, struct srcfile, nd); in find_srcfile()
148 list_add(&h->nd, &srcfile_list); in find_srcfile()
|
| D | metricgroup.h | 14 struct rb_node nd; member
20 struct list_head nd; member
|
| D | hist.c | 2093 struct rb_node *nd; in hists__filter_by_type() local
2100 for (nd = rb_first_cached(&hists->entries); nd; nd = rb_next(nd)) { in hists__filter_by_type()
2101 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node); in hists__filter_by_type()
2117 struct rb_node *nd; in resort_filtered_entry() local
2138 nd = rb_first_cached(&he->hroot_out); in resort_filtered_entry()
2139 while (nd) { in resort_filtered_entry()
2140 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node); in resort_filtered_entry()
2142 nd = rb_next(nd); in resort_filtered_entry()
2153 struct rb_node *nd; in hists__filter_hierarchy() local
2161 nd = rb_first_cached(&hists->entries); in hists__filter_hierarchy()
[all …]
|
| D | machine.c | 190 struct rb_node *nd; in machine__delete_threads() local
196 nd = rb_first_cached(&threads->entries); in machine__delete_threads()
197 while (nd) { in machine__delete_threads()
198 struct thread *t = rb_entry(nd, struct thread, rb_node); in machine__delete_threads()
200 nd = rb_next(nd); in machine__delete_threads()
295 struct rb_node *nd; in machines__set_comm_exec() local
299 for (nd = rb_first_cached(&machines->guests); nd; nd = rb_next(nd)) { in machines__set_comm_exec()
300 struct machine *machine = rb_entry(nd, struct machine, rb_node); in machines__set_comm_exec()
369 struct rb_node *nd; in machines__process_guests() local
371 for (nd = rb_first_cached(&machines->guests); nd; nd = rb_next(nd)) { in machines__process_guests()
[all …]
|
| D | map.c | 309 struct rb_node *nd = rb_first_cached(symbols); in map__fixup_start() local
310 if (nd != NULL) { in map__fixup_start()
311 struct symbol *sym = rb_entry(nd, struct symbol, rb_node); in map__fixup_start()
319 struct rb_node *nd = rb_last(&symbols->rb_root); in map__fixup_end() local
320 if (nd != NULL) { in map__fixup_end()
321 struct symbol *sym = rb_entry(nd, struct symbol, rb_node); in map__fixup_end()
689 struct rb_node *nd; in maps__find_symbol_by_name() local
693 for (nd = rb_first(&maps->entries); nd; nd = rb_next(nd)) { in maps__find_symbol_by_name()
694 struct map *pos = rb_entry(nd, struct map, rb_node); in maps__find_symbol_by_name()
741 struct rb_node *nd; in maps__fprintf() local
[all …]
|
| D | symbol.h | 69 #define symbols__for_each_entry(symbols, pos, nd) \ argument
70 for (nd = rb_first_cached(symbols); \
71 nd && (pos = rb_entry(nd, struct symbol, rb_node)); \
72 nd = rb_next(nd))
|
| D | symbol.c | 188 struct rb_node *nd; in symbols__fixup_duplicate() local
194 nd = rb_first_cached(symbols); in symbols__fixup_duplicate()
196 while (nd) { in symbols__fixup_duplicate()
197 curr = rb_entry(nd, struct symbol, rb_node); in symbols__fixup_duplicate()
199 nd = rb_next(&curr->rb_node); in symbols__fixup_duplicate()
200 next = rb_entry(nd, struct symbol, rb_node); in symbols__fixup_duplicate()
202 if (!nd) in symbols__fixup_duplicate()
213 nd = rb_next(&curr->rb_node); in symbols__fixup_duplicate()
222 struct rb_node *nd, *prevnd = rb_first_cached(symbols); in symbols__fixup_end() local
230 for (nd = rb_next(prevnd); nd; nd = rb_next(nd)) { in symbols__fixup_end()
[all …]
|
| D | stat-shadow.c | 80 struct saved_value *nd = malloc(sizeof(struct saved_value)); in saved_value_new() local
82 if (!nd) in saved_value_new()
84 memcpy(nd, entry, sizeof(struct saved_value)); in saved_value_new()
85 return &nd->rb_node; in saved_value_new()
106 struct rb_node *nd; in saved_value_lookup() local
117 nd = rblist__find(rblist, &dm); in saved_value_lookup()
118 if (nd) in saved_value_lookup()
119 return container_of(nd, struct saved_value, rb_node); in saved_value_lookup()
122 nd = rblist__find(rblist, &dm); in saved_value_lookup()
123 if (nd) in saved_value_lookup()
[all …]
|
| D | probe-file.c | 987 struct str_node *nd; in probe_cache__show_all_caches() local
998 strlist__for_each_entry(nd, bidlist) { in probe_cache__show_all_caches()
999 pcache = probe_cache__new(nd->s, NULL); in probe_cache__show_all_caches()
1003 buf = build_id_cache__origname(nd->s); in probe_cache__show_all_caches()
1004 printf("%s (%s):\n", buf, nd->s); in probe_cache__show_all_caches()
|
| D | dso.c | 1318 struct rb_node *nd; in dso__fprintf() local
1326 for (nd = rb_first_cached(&dso->symbols); nd; nd = rb_next(nd)) { in dso__fprintf()
1327 struct symbol *pos = rb_entry(nd, struct symbol, rb_node); in dso__fprintf()
|
| /tools/perf/ui/browsers/ |
| D | map.c | 25 static void map_browser__write(struct ui_browser *browser, void *nd, int row) in map_browser__write() argument
27 struct symbol *sym = rb_entry(nd, struct symbol, rb_node); in map_browser__write()
116 struct rb_node *nd; in map__browse() local
120 for (nd = rb_first(mb.b.entries); nd; nd = rb_next(nd)) { in map__browse()
121 struct symbol *pos = rb_entry(nd, struct symbol, rb_node); in map__browse()
|
| D | hists.c | 50 static struct rb_node *hists__filter_entries(struct rb_node *nd,
60 struct rb_node *nd; in hist_browser__get_folding() local
64 for (nd = rb_first_cached(&hists->entries); in hist_browser__get_folding()
65 (nd = hists__filter_entries(nd, browser->min_pcnt)) != NULL; in hist_browser__get_folding()
66 nd = rb_hierarchy_next(nd)) { in hist_browser__get_folding()
68 rb_entry(nd, struct hist_entry, rb_node); in hist_browser__get_folding()
176 struct rb_node *nd; in callchain_node__count_rows_rb_tree() local
178 for (nd = rb_first(&node->rb_root); nd; nd = rb_next(nd)) { in callchain_node__count_rows_rb_tree()
179 struct callchain_node *child = rb_entry(nd, struct callchain_node, rb_node); in callchain_node__count_rows_rb_tree()
258 struct rb_node *nd; in callchain__count_rows() local
[all …]
|
| D | annotate.c | 290 struct rb_node *nd) in annotate_browser__set_rb_top() argument
293 struct annotation_line * pos = rb_entry(nd, struct annotation_line, rb_node); in annotate_browser__set_rb_top()
299 browser->curr_hot = nd; in annotate_browser__set_rb_top()
663 struct rb_node *nd = NULL; in annotate_browser__run() local
684 nd = browser->curr_hot; in annotate_browser__run()
696 if (nd != NULL && RB_EMPTY_NODE(nd)) in annotate_browser__run()
697 nd = NULL; in annotate_browser__run()
712 if (nd != NULL) { in annotate_browser__run()
713 nd = rb_prev(nd); in annotate_browser__run()
714 if (nd == NULL) in annotate_browser__run()
[all …]
|
| /tools/perf/ui/gtk/ |
| D | hists.c | 100 struct rb_node *nd; in perf_gtk__add_callchain_flat() local
103 for (nd = rb_first(root); nd; nd = rb_next(nd)) { in perf_gtk__add_callchain_flat()
109 node = rb_entry(nd, struct callchain_node, rb_node); in perf_gtk__add_callchain_flat()
163 struct rb_node *nd; in perf_gtk__add_callchain_folded() local
165 for (nd = rb_first(root); nd; nd = rb_next(nd)) { in perf_gtk__add_callchain_folded()
173 node = rb_entry(nd, struct callchain_node, rb_node); in perf_gtk__add_callchain_folded()
223 struct rb_node *nd; in perf_gtk__add_callchain_graph() local
226 for (nd = rb_first(root); nd; nd = rb_next(nd)) { in perf_gtk__add_callchain_graph()
233 node = rb_entry(nd, struct callchain_node, rb_node); in perf_gtk__add_callchain_graph()
300 struct rb_node *nd; in perf_gtk__show_hists() local
[all …]
|
| /tools/perf/ |
| D | builtin-annotate.c | 313 struct rb_node *nd = rb_first_cached(&hists->entries), *next; in hists__find_annotations() local
316 while (nd) { in hists__find_annotations()
317 struct hist_entry *he = rb_entry(nd, struct hist_entry, rb_node); in hists__find_annotations()
331 nd = rb_prev(nd); in hists__find_annotations()
333 nd = rb_next(nd); in hists__find_annotations()
355 nd = rb_next(nd); in hists__find_annotations()
365 next = rb_next(nd); in hists__find_annotations()
368 next = rb_prev(nd); in hists__find_annotations()
375 nd = next; in hists__find_annotations()
378 nd = rb_next(nd); in hists__find_annotations()
|
| D | builtin-report.c | 731 struct rb_node *nd; in maps__fprintf_task() local
733 for (nd = rb_first(&maps->entries); nd; nd = rb_next(nd)) { in maps__fprintf_task()
734 struct map *map = rb_entry(nd, struct map, rb_node); in maps__fprintf_task()
778 struct rb_node *nd; in tasks_print() local
797 for (nd = rb_first_cached(&threads->entries); nd; in tasks_print()
798 nd = rb_next(nd)) { in tasks_print()
801 task->thread = rb_entry(nd, struct thread, rb_node); in tasks_print()
|
| D | builtin-buildid-cache.c | 335 struct str_node *nd; in build_id_cache__show_all() local
343 strlist__for_each_entry(nd, bidlist) { in build_id_cache__show_all()
344 buf = build_id_cache__origname(nd->s); in build_id_cache__show_all()
345 fprintf(stdout, "%s %s\n", nd->s, buf); in build_id_cache__show_all()
|
| D | builtin-probe.c | 398 struct str_node *nd; in del_perf_probe_caches() local
408 strlist__for_each_entry(nd, bidlist) { in del_perf_probe_caches()
409 cache = probe_cache__new(nd->s, NULL); in del_perf_probe_caches()
414 pr_warning("Failed to remove entries for %s\n", nd->s); in del_perf_probe_caches()
|
| /tools/perf/ui/ |
| D | browser.c | 141 struct rb_node *nd; in ui_browser__rb_tree_seek() local
145 nd = rb_first(root); in ui_browser__rb_tree_seek()
148 nd = browser->top; in ui_browser__rb_tree_seek()
151 nd = rb_last(root); in ui_browser__rb_tree_seek()
159 nd = rb_next(nd); in ui_browser__rb_tree_seek()
162 nd = rb_prev(nd); in ui_browser__rb_tree_seek()
165 browser->top = nd; in ui_browser__rb_tree_seek()
170 struct rb_node *nd; in ui_browser__rb_tree_refresh() local
176 nd = browser->top; in ui_browser__rb_tree_refresh()
178 while (nd != NULL) { in ui_browser__rb_tree_refresh()
[all …]
|
| /tools/perf/tests/ |
| D | vmlinux-kallsyms.c | 20 struct rb_node *nd; in test__vmlinux_matches_kallsyms() local
112 map__for_each_symbol(vmlinux_map, sym, nd) { in test__vmlinux_matches_kallsyms()
115 sym = rb_entry(nd, struct symbol, rb_node); in test__vmlinux_matches_kallsyms()
|
| /tools/perf/ui/stdio/ |
| D | hist.c | 798 struct rb_node *nd; in hists__fprintf() local
829 for (nd = rb_first_cached(&hists->entries); nd; in hists__fprintf()
830 nd = __rb_hierarchy_next(nd, HMD_FORCE_CHILD)) { in hists__fprintf()
831 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node); in hists__fprintf()
|