hists.c 17 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679
  1. #include "../evlist.h"
  2. #include "../cache.h"
  3. #include "../evsel.h"
  4. #include "../sort.h"
  5. #include "../hist.h"
  6. #include "../helpline.h"
  7. #include "../string2.h"
  8. #include "gtk.h"
  9. #include <signal.h>
  10. #define MAX_COLUMNS 32
  11. static int __percent_color_snprintf(struct perf_hpp *hpp, const char *fmt, ...)
  12. {
  13. int ret = 0;
  14. int len;
  15. va_list args;
  16. double percent;
  17. const char *markup;
  18. char *buf = hpp->buf;
  19. size_t size = hpp->size;
  20. va_start(args, fmt);
  21. len = va_arg(args, int);
  22. percent = va_arg(args, double);
  23. va_end(args);
  24. markup = perf_gtk__get_percent_color(percent);
  25. if (markup)
  26. ret += scnprintf(buf, size, markup);
  27. ret += scnprintf(buf + ret, size - ret, fmt, len, percent);
  28. if (markup)
  29. ret += scnprintf(buf + ret, size - ret, "</span>");
  30. return ret;
  31. }
  32. #define __HPP_COLOR_PERCENT_FN(_type, _field) \
  33. static u64 he_get_##_field(struct hist_entry *he) \
  34. { \
  35. return he->stat._field; \
  36. } \
  37. \
  38. static int perf_gtk__hpp_color_##_type(struct perf_hpp_fmt *fmt, \
  39. struct perf_hpp *hpp, \
  40. struct hist_entry *he) \
  41. { \
  42. return hpp__fmt(fmt, hpp, he, he_get_##_field, " %*.2f%%", \
  43. __percent_color_snprintf, true); \
  44. }
  45. #define __HPP_COLOR_ACC_PERCENT_FN(_type, _field) \
  46. static u64 he_get_acc_##_field(struct hist_entry *he) \
  47. { \
  48. return he->stat_acc->_field; \
  49. } \
  50. \
  51. static int perf_gtk__hpp_color_##_type(struct perf_hpp_fmt *fmt, \
  52. struct perf_hpp *hpp, \
  53. struct hist_entry *he) \
  54. { \
  55. return hpp__fmt_acc(fmt, hpp, he, he_get_acc_##_field, " %*.2f%%", \
  56. __percent_color_snprintf, true); \
  57. }
  58. __HPP_COLOR_PERCENT_FN(overhead, period)
  59. __HPP_COLOR_PERCENT_FN(overhead_sys, period_sys)
  60. __HPP_COLOR_PERCENT_FN(overhead_us, period_us)
  61. __HPP_COLOR_PERCENT_FN(overhead_guest_sys, period_guest_sys)
  62. __HPP_COLOR_PERCENT_FN(overhead_guest_us, period_guest_us)
  63. __HPP_COLOR_ACC_PERCENT_FN(overhead_acc, period)
  64. #undef __HPP_COLOR_PERCENT_FN
  65. void perf_gtk__init_hpp(void)
  66. {
  67. perf_hpp__format[PERF_HPP__OVERHEAD].color =
  68. perf_gtk__hpp_color_overhead;
  69. perf_hpp__format[PERF_HPP__OVERHEAD_SYS].color =
  70. perf_gtk__hpp_color_overhead_sys;
  71. perf_hpp__format[PERF_HPP__OVERHEAD_US].color =
  72. perf_gtk__hpp_color_overhead_us;
  73. perf_hpp__format[PERF_HPP__OVERHEAD_GUEST_SYS].color =
  74. perf_gtk__hpp_color_overhead_guest_sys;
  75. perf_hpp__format[PERF_HPP__OVERHEAD_GUEST_US].color =
  76. perf_gtk__hpp_color_overhead_guest_us;
  77. perf_hpp__format[PERF_HPP__OVERHEAD_ACC].color =
  78. perf_gtk__hpp_color_overhead_acc;
  79. }
  80. static void perf_gtk__add_callchain_flat(struct rb_root *root, GtkTreeStore *store,
  81. GtkTreeIter *parent, int col, u64 total)
  82. {
  83. struct rb_node *nd;
  84. bool has_single_node = (rb_first(root) == rb_last(root));
  85. for (nd = rb_first(root); nd; nd = rb_next(nd)) {
  86. struct callchain_node *node;
  87. struct callchain_list *chain;
  88. GtkTreeIter iter, new_parent;
  89. bool need_new_parent;
  90. node = rb_entry(nd, struct callchain_node, rb_node);
  91. new_parent = *parent;
  92. need_new_parent = !has_single_node;
  93. callchain_node__make_parent_list(node);
  94. list_for_each_entry(chain, &node->parent_val, list) {
  95. char buf[128];
  96. gtk_tree_store_append(store, &iter, &new_parent);
  97. callchain_node__scnprintf_value(node, buf, sizeof(buf), total);
  98. gtk_tree_store_set(store, &iter, 0, buf, -1);
  99. callchain_list__sym_name(chain, buf, sizeof(buf), false);
  100. gtk_tree_store_set(store, &iter, col, buf, -1);
  101. if (need_new_parent) {
  102. /*
  103. * Only show the top-most symbol in a callchain
  104. * if it's not the only callchain.
  105. */
  106. new_parent = iter;
  107. need_new_parent = false;
  108. }
  109. }
  110. list_for_each_entry(chain, &node->val, list) {
  111. char buf[128];
  112. gtk_tree_store_append(store, &iter, &new_parent);
  113. callchain_node__scnprintf_value(node, buf, sizeof(buf), total);
  114. gtk_tree_store_set(store, &iter, 0, buf, -1);
  115. callchain_list__sym_name(chain, buf, sizeof(buf), false);
  116. gtk_tree_store_set(store, &iter, col, buf, -1);
  117. if (need_new_parent) {
  118. /*
  119. * Only show the top-most symbol in a callchain
  120. * if it's not the only callchain.
  121. */
  122. new_parent = iter;
  123. need_new_parent = false;
  124. }
  125. }
  126. }
  127. }
  128. static void perf_gtk__add_callchain_folded(struct rb_root *root, GtkTreeStore *store,
  129. GtkTreeIter *parent, int col, u64 total)
  130. {
  131. struct rb_node *nd;
  132. for (nd = rb_first(root); nd; nd = rb_next(nd)) {
  133. struct callchain_node *node;
  134. struct callchain_list *chain;
  135. GtkTreeIter iter;
  136. char buf[64];
  137. char *str, *str_alloc = NULL;
  138. bool first = true;
  139. node = rb_entry(nd, struct callchain_node, rb_node);
  140. callchain_node__make_parent_list(node);
  141. list_for_each_entry(chain, &node->parent_val, list) {
  142. char name[1024];
  143. callchain_list__sym_name(chain, name, sizeof(name), false);
  144. if (asprintf(&str, "%s%s%s",
  145. first ? "" : str_alloc,
  146. first ? "" : symbol_conf.field_sep ?: "; ",
  147. name) < 0)
  148. return;
  149. first = false;
  150. free(str_alloc);
  151. str_alloc = str;
  152. }
  153. list_for_each_entry(chain, &node->val, list) {
  154. char name[1024];
  155. callchain_list__sym_name(chain, name, sizeof(name), false);
  156. if (asprintf(&str, "%s%s%s",
  157. first ? "" : str_alloc,
  158. first ? "" : symbol_conf.field_sep ?: "; ",
  159. name) < 0)
  160. return;
  161. first = false;
  162. free(str_alloc);
  163. str_alloc = str;
  164. }
  165. gtk_tree_store_append(store, &iter, parent);
  166. callchain_node__scnprintf_value(node, buf, sizeof(buf), total);
  167. gtk_tree_store_set(store, &iter, 0, buf, -1);
  168. gtk_tree_store_set(store, &iter, col, str, -1);
  169. free(str_alloc);
  170. }
  171. }
  172. static void perf_gtk__add_callchain_graph(struct rb_root *root, GtkTreeStore *store,
  173. GtkTreeIter *parent, int col, u64 total)
  174. {
  175. struct rb_node *nd;
  176. bool has_single_node = (rb_first(root) == rb_last(root));
  177. for (nd = rb_first(root); nd; nd = rb_next(nd)) {
  178. struct callchain_node *node;
  179. struct callchain_list *chain;
  180. GtkTreeIter iter, new_parent;
  181. bool need_new_parent;
  182. u64 child_total;
  183. node = rb_entry(nd, struct callchain_node, rb_node);
  184. new_parent = *parent;
  185. need_new_parent = !has_single_node && (node->val_nr > 1);
  186. list_for_each_entry(chain, &node->val, list) {
  187. char buf[128];
  188. gtk_tree_store_append(store, &iter, &new_parent);
  189. callchain_node__scnprintf_value(node, buf, sizeof(buf), total);
  190. gtk_tree_store_set(store, &iter, 0, buf, -1);
  191. callchain_list__sym_name(chain, buf, sizeof(buf), false);
  192. gtk_tree_store_set(store, &iter, col, buf, -1);
  193. if (need_new_parent) {
  194. /*
  195. * Only show the top-most symbol in a callchain
  196. * if it's not the only callchain.
  197. */
  198. new_parent = iter;
  199. need_new_parent = false;
  200. }
  201. }
  202. if (callchain_param.mode == CHAIN_GRAPH_REL)
  203. child_total = node->children_hit;
  204. else
  205. child_total = total;
  206. /* Now 'iter' contains info of the last callchain_list */
  207. perf_gtk__add_callchain_graph(&node->rb_root, store, &iter, col,
  208. child_total);
  209. }
  210. }
  211. static void perf_gtk__add_callchain(struct rb_root *root, GtkTreeStore *store,
  212. GtkTreeIter *parent, int col, u64 total)
  213. {
  214. if (callchain_param.mode == CHAIN_FLAT)
  215. perf_gtk__add_callchain_flat(root, store, parent, col, total);
  216. else if (callchain_param.mode == CHAIN_FOLDED)
  217. perf_gtk__add_callchain_folded(root, store, parent, col, total);
  218. else
  219. perf_gtk__add_callchain_graph(root, store, parent, col, total);
  220. }
  221. static void on_row_activated(GtkTreeView *view, GtkTreePath *path,
  222. GtkTreeViewColumn *col __maybe_unused,
  223. gpointer user_data __maybe_unused)
  224. {
  225. bool expanded = gtk_tree_view_row_expanded(view, path);
  226. if (expanded)
  227. gtk_tree_view_collapse_row(view, path);
  228. else
  229. gtk_tree_view_expand_row(view, path, FALSE);
  230. }
  231. static void perf_gtk__show_hists(GtkWidget *window, struct hists *hists,
  232. float min_pcnt)
  233. {
  234. struct perf_hpp_fmt *fmt;
  235. GType col_types[MAX_COLUMNS];
  236. GtkCellRenderer *renderer;
  237. GtkTreeStore *store;
  238. struct rb_node *nd;
  239. GtkWidget *view;
  240. int col_idx;
  241. int sym_col = -1;
  242. int nr_cols;
  243. char s[512];
  244. struct perf_hpp hpp = {
  245. .buf = s,
  246. .size = sizeof(s),
  247. };
  248. nr_cols = 0;
  249. hists__for_each_format(hists, fmt)
  250. col_types[nr_cols++] = G_TYPE_STRING;
  251. store = gtk_tree_store_newv(nr_cols, col_types);
  252. view = gtk_tree_view_new();
  253. renderer = gtk_cell_renderer_text_new();
  254. col_idx = 0;
  255. hists__for_each_format(hists, fmt) {
  256. if (perf_hpp__should_skip(fmt, hists))
  257. continue;
  258. /*
  259. * XXX no way to determine where symcol column is..
  260. * Just use last column for now.
  261. */
  262. if (perf_hpp__is_sort_entry(fmt))
  263. sym_col = col_idx;
  264. gtk_tree_view_insert_column_with_attributes(GTK_TREE_VIEW(view),
  265. -1, fmt->name,
  266. renderer, "markup",
  267. col_idx++, NULL);
  268. }
  269. for (col_idx = 0; col_idx < nr_cols; col_idx++) {
  270. GtkTreeViewColumn *column;
  271. column = gtk_tree_view_get_column(GTK_TREE_VIEW(view), col_idx);
  272. gtk_tree_view_column_set_resizable(column, TRUE);
  273. if (col_idx == sym_col) {
  274. gtk_tree_view_set_expander_column(GTK_TREE_VIEW(view),
  275. column);
  276. }
  277. }
  278. gtk_tree_view_set_model(GTK_TREE_VIEW(view), GTK_TREE_MODEL(store));
  279. g_object_unref(GTK_TREE_MODEL(store));
  280. for (nd = rb_first(&hists->entries); nd; nd = rb_next(nd)) {
  281. struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);
  282. GtkTreeIter iter;
  283. u64 total = hists__total_period(h->hists);
  284. float percent;
  285. if (h->filtered)
  286. continue;
  287. percent = hist_entry__get_percent_limit(h);
  288. if (percent < min_pcnt)
  289. continue;
  290. gtk_tree_store_append(store, &iter, NULL);
  291. col_idx = 0;
  292. hists__for_each_format(hists, fmt) {
  293. if (perf_hpp__should_skip(fmt, h->hists))
  294. continue;
  295. if (fmt->color)
  296. fmt->color(fmt, &hpp, h);
  297. else
  298. fmt->entry(fmt, &hpp, h);
  299. gtk_tree_store_set(store, &iter, col_idx++, s, -1);
  300. }
  301. if (symbol_conf.use_callchain && hists__has(hists, sym)) {
  302. if (callchain_param.mode == CHAIN_GRAPH_REL)
  303. total = symbol_conf.cumulate_callchain ?
  304. h->stat_acc->period : h->stat.period;
  305. perf_gtk__add_callchain(&h->sorted_chain, store, &iter,
  306. sym_col, total);
  307. }
  308. }
  309. gtk_tree_view_set_rules_hint(GTK_TREE_VIEW(view), TRUE);
  310. g_signal_connect(view, "row-activated",
  311. G_CALLBACK(on_row_activated), NULL);
  312. gtk_container_add(GTK_CONTAINER(window), view);
  313. }
  314. static void perf_gtk__add_hierarchy_entries(struct hists *hists,
  315. struct rb_root *root,
  316. GtkTreeStore *store,
  317. GtkTreeIter *parent,
  318. struct perf_hpp *hpp,
  319. float min_pcnt)
  320. {
  321. int col_idx = 0;
  322. struct rb_node *node;
  323. struct hist_entry *he;
  324. struct perf_hpp_fmt *fmt;
  325. struct perf_hpp_list_node *fmt_node;
  326. u64 total = hists__total_period(hists);
  327. int size;
  328. for (node = rb_first(root); node; node = rb_next(node)) {
  329. GtkTreeIter iter;
  330. float percent;
  331. char *bf;
  332. he = rb_entry(node, struct hist_entry, rb_node);
  333. if (he->filtered)
  334. continue;
  335. percent = hist_entry__get_percent_limit(he);
  336. if (percent < min_pcnt)
  337. continue;
  338. gtk_tree_store_append(store, &iter, parent);
  339. col_idx = 0;
  340. /* the first hpp_list_node is for overhead columns */
  341. fmt_node = list_first_entry(&hists->hpp_formats,
  342. struct perf_hpp_list_node, list);
  343. perf_hpp_list__for_each_format(&fmt_node->hpp, fmt) {
  344. if (fmt->color)
  345. fmt->color(fmt, hpp, he);
  346. else
  347. fmt->entry(fmt, hpp, he);
  348. gtk_tree_store_set(store, &iter, col_idx++, hpp->buf, -1);
  349. }
  350. bf = hpp->buf;
  351. size = hpp->size;
  352. perf_hpp_list__for_each_format(he->hpp_list, fmt) {
  353. int ret;
  354. if (fmt->color)
  355. ret = fmt->color(fmt, hpp, he);
  356. else
  357. ret = fmt->entry(fmt, hpp, he);
  358. snprintf(hpp->buf + ret, hpp->size - ret, " ");
  359. advance_hpp(hpp, ret + 2);
  360. }
  361. gtk_tree_store_set(store, &iter, col_idx, ltrim(rtrim(bf)), -1);
  362. if (!he->leaf) {
  363. hpp->buf = bf;
  364. hpp->size = size;
  365. perf_gtk__add_hierarchy_entries(hists, &he->hroot_out,
  366. store, &iter, hpp,
  367. min_pcnt);
  368. if (!hist_entry__has_hierarchy_children(he, min_pcnt)) {
  369. char buf[32];
  370. GtkTreeIter child;
  371. snprintf(buf, sizeof(buf), "no entry >= %.2f%%",
  372. min_pcnt);
  373. gtk_tree_store_append(store, &child, &iter);
  374. gtk_tree_store_set(store, &child, col_idx, buf, -1);
  375. }
  376. }
  377. if (symbol_conf.use_callchain && he->leaf) {
  378. if (callchain_param.mode == CHAIN_GRAPH_REL)
  379. total = symbol_conf.cumulate_callchain ?
  380. he->stat_acc->period : he->stat.period;
  381. perf_gtk__add_callchain(&he->sorted_chain, store, &iter,
  382. col_idx, total);
  383. }
  384. }
  385. }
  386. static void perf_gtk__show_hierarchy(GtkWidget *window, struct hists *hists,
  387. float min_pcnt)
  388. {
  389. struct perf_hpp_fmt *fmt;
  390. struct perf_hpp_list_node *fmt_node;
  391. GType col_types[MAX_COLUMNS];
  392. GtkCellRenderer *renderer;
  393. GtkTreeStore *store;
  394. GtkWidget *view;
  395. int col_idx;
  396. int nr_cols = 0;
  397. char s[512];
  398. char buf[512];
  399. bool first_node, first_col;
  400. struct perf_hpp hpp = {
  401. .buf = s,
  402. .size = sizeof(s),
  403. };
  404. hists__for_each_format(hists, fmt) {
  405. if (perf_hpp__is_sort_entry(fmt) ||
  406. perf_hpp__is_dynamic_entry(fmt))
  407. break;
  408. col_types[nr_cols++] = G_TYPE_STRING;
  409. }
  410. col_types[nr_cols++] = G_TYPE_STRING;
  411. store = gtk_tree_store_newv(nr_cols, col_types);
  412. view = gtk_tree_view_new();
  413. renderer = gtk_cell_renderer_text_new();
  414. col_idx = 0;
  415. /* the first hpp_list_node is for overhead columns */
  416. fmt_node = list_first_entry(&hists->hpp_formats,
  417. struct perf_hpp_list_node, list);
  418. perf_hpp_list__for_each_format(&fmt_node->hpp, fmt) {
  419. gtk_tree_view_insert_column_with_attributes(GTK_TREE_VIEW(view),
  420. -1, fmt->name,
  421. renderer, "markup",
  422. col_idx++, NULL);
  423. }
  424. /* construct merged column header since sort keys share single column */
  425. buf[0] = '\0';
  426. first_node = true;
  427. list_for_each_entry_continue(fmt_node, &hists->hpp_formats, list) {
  428. if (!first_node)
  429. strcat(buf, " / ");
  430. first_node = false;
  431. first_col = true;
  432. perf_hpp_list__for_each_format(&fmt_node->hpp ,fmt) {
  433. if (perf_hpp__should_skip(fmt, hists))
  434. continue;
  435. if (!first_col)
  436. strcat(buf, "+");
  437. first_col = false;
  438. fmt->header(fmt, &hpp, hists, 0, NULL);
  439. strcat(buf, ltrim(rtrim(hpp.buf)));
  440. }
  441. }
  442. gtk_tree_view_insert_column_with_attributes(GTK_TREE_VIEW(view),
  443. -1, buf,
  444. renderer, "markup",
  445. col_idx++, NULL);
  446. for (col_idx = 0; col_idx < nr_cols; col_idx++) {
  447. GtkTreeViewColumn *column;
  448. column = gtk_tree_view_get_column(GTK_TREE_VIEW(view), col_idx);
  449. gtk_tree_view_column_set_resizable(column, TRUE);
  450. if (col_idx == 0) {
  451. gtk_tree_view_set_expander_column(GTK_TREE_VIEW(view),
  452. column);
  453. }
  454. }
  455. gtk_tree_view_set_model(GTK_TREE_VIEW(view), GTK_TREE_MODEL(store));
  456. g_object_unref(GTK_TREE_MODEL(store));
  457. perf_gtk__add_hierarchy_entries(hists, &hists->entries, store,
  458. NULL, &hpp, min_pcnt);
  459. gtk_tree_view_set_rules_hint(GTK_TREE_VIEW(view), TRUE);
  460. g_signal_connect(view, "row-activated",
  461. G_CALLBACK(on_row_activated), NULL);
  462. gtk_container_add(GTK_CONTAINER(window), view);
  463. }
  464. int perf_evlist__gtk_browse_hists(struct perf_evlist *evlist,
  465. const char *help,
  466. struct hist_browser_timer *hbt __maybe_unused,
  467. float min_pcnt)
  468. {
  469. struct perf_evsel *pos;
  470. GtkWidget *vbox;
  471. GtkWidget *notebook;
  472. GtkWidget *info_bar;
  473. GtkWidget *statbar;
  474. GtkWidget *window;
  475. signal(SIGSEGV, perf_gtk__signal);
  476. signal(SIGFPE, perf_gtk__signal);
  477. signal(SIGINT, perf_gtk__signal);
  478. signal(SIGQUIT, perf_gtk__signal);
  479. signal(SIGTERM, perf_gtk__signal);
  480. window = gtk_window_new(GTK_WINDOW_TOPLEVEL);
  481. gtk_window_set_title(GTK_WINDOW(window), "perf report");
  482. g_signal_connect(window, "delete_event", gtk_main_quit, NULL);
  483. pgctx = perf_gtk__activate_context(window);
  484. if (!pgctx)
  485. return -1;
  486. vbox = gtk_vbox_new(FALSE, 0);
  487. notebook = gtk_notebook_new();
  488. gtk_box_pack_start(GTK_BOX(vbox), notebook, TRUE, TRUE, 0);
  489. info_bar = perf_gtk__setup_info_bar();
  490. if (info_bar)
  491. gtk_box_pack_start(GTK_BOX(vbox), info_bar, FALSE, FALSE, 0);
  492. statbar = perf_gtk__setup_statusbar();
  493. gtk_box_pack_start(GTK_BOX(vbox), statbar, FALSE, FALSE, 0);
  494. gtk_container_add(GTK_CONTAINER(window), vbox);
  495. evlist__for_each_entry(evlist, pos) {
  496. struct hists *hists = evsel__hists(pos);
  497. const char *evname = perf_evsel__name(pos);
  498. GtkWidget *scrolled_window;
  499. GtkWidget *tab_label;
  500. char buf[512];
  501. size_t size = sizeof(buf);
  502. if (symbol_conf.event_group) {
  503. if (!perf_evsel__is_group_leader(pos))
  504. continue;
  505. if (pos->nr_members > 1) {
  506. perf_evsel__group_desc(pos, buf, size);
  507. evname = buf;
  508. }
  509. }
  510. scrolled_window = gtk_scrolled_window_new(NULL, NULL);
  511. gtk_scrolled_window_set_policy(GTK_SCROLLED_WINDOW(scrolled_window),
  512. GTK_POLICY_AUTOMATIC,
  513. GTK_POLICY_AUTOMATIC);
  514. if (symbol_conf.report_hierarchy)
  515. perf_gtk__show_hierarchy(scrolled_window, hists, min_pcnt);
  516. else
  517. perf_gtk__show_hists(scrolled_window, hists, min_pcnt);
  518. tab_label = gtk_label_new(evname);
  519. gtk_notebook_append_page(GTK_NOTEBOOK(notebook), scrolled_window, tab_label);
  520. }
  521. gtk_widget_show_all(window);
  522. perf_gtk__resize_window(window);
  523. gtk_window_set_position(GTK_WINDOW(window), GTK_WIN_POS_CENTER);
  524. ui_helpline__push(help);
  525. gtk_main();
  526. perf_gtk__deactivate_context(&pgctx);
  527. return 0;
  528. }