tools/perf/builtin-kvm.c

27 #include "ui/browsers/hists.h"
84 	struct hists		hists;
115 		     struct hists *hists __maybe_unused);
120 	int width = fmt_width(fmt, hpp, he->hists);
162 	int width = fmt_width(fmt, hpp, he->hists);			\
212 	int width = fmt_width(fmt, hpp, he->hists);
260 	int width = fmt_width(fmt, hpp, he->hists);
293 	int width = fmt_width(fmt, hpp, he->hists);
336 		     struct hists *hists __maybe_unused)
345 		      struct hists *hists, int line __maybe_unused,
350 	int width = fmt_width(fmt, hpp, hists);
503 	__hists__init(&kvm_hists.hists, &kvm_hists.list);
518 	struct rb_node *nd = rb_first_cached(&hb->hists->entries);
541 perf_kvm_browser__new(struct hists *hists)
543 	struct hist_browser *browser = hist_browser__new(hists);
551 static int kvm__hists_browse(struct hists *hists)
556 	browser = perf_kvm_browser__new(hists);
587 		kvm__hists_browse(&kvm_hists.hists);
707 	if (hists__has(&kvm_hists.hists, need_collapse))
708 		root = &kvm_hists.hists.entries_collapsed;
710 		root = kvm_hists.hists.entries_in;
764 	hists__inc_nr_samples(&kvm_hists.hists, 0);
798 	he = hists__add_entry_ops(&kvm_hists.hists, &kvm_ev_entry_ops,
1070 	ui_progress__init(&prog, kvm_hists.hists.nr_entries, "Sorting...");
1071 	hists__collapse_resort(&kvm_hists.hists, NULL);
1072 	hists__output_resort_cb(&kvm_hists.hists, NULL, filter_cb);
1135 	for (nd = rb_first_cached(&kvm_hists.hists.entries); nd; nd = rb_next(nd)) {
1532 	hists__delete_entries(&kvm_hists.hists);
1696 	hists__delete_entries(&kvm_hists.hists);