Commit | Line | Data |
---|---|---|
d1b4f249 ACM |
1 | #define _GNU_SOURCE |
2 | #include <stdio.h> | |
3 | #undef _GNU_SOURCE | |
4 | #include "../libslang.h" | |
5 | #include <stdlib.h> | |
6 | #include <string.h> | |
7 | #include <newt.h> | |
8 | #include <linux/rbtree.h> | |
9 | ||
e248de33 ACM |
10 | #include "../../evsel.h" |
11 | #include "../../evlist.h" | |
d1b4f249 ACM |
12 | #include "../../hist.h" |
13 | #include "../../pstack.h" | |
14 | #include "../../sort.h" | |
15 | #include "../../util.h" | |
16 | ||
17 | #include "../browser.h" | |
18 | #include "../helpline.h" | |
19 | #include "../util.h" | |
20 | #include "map.h" | |
21 | ||
d1b4f249 ACM |
22 | struct hist_browser { |
23 | struct ui_browser b; | |
24 | struct hists *hists; | |
25 | struct hist_entry *he_selection; | |
26 | struct map_symbol *selection; | |
724c9c9f | 27 | bool has_symbols; |
d1b4f249 ACM |
28 | }; |
29 | ||
81cce8de | 30 | static int hists__browser_title(struct hists *self, char *bf, size_t size, |
d7b76f09 | 31 | const char *ev_name); |
81cce8de | 32 | |
d1b4f249 ACM |
33 | static void hist_browser__refresh_dimensions(struct hist_browser *self) |
34 | { | |
35 | /* 3 == +/- toggle symbol before actual hist_entry rendering */ | |
36 | self->b.width = 3 + (hists__sort_list_width(self->hists) + | |
37 | sizeof("[k]")); | |
38 | } | |
39 | ||
40 | static void hist_browser__reset(struct hist_browser *self) | |
41 | { | |
42 | self->b.nr_entries = self->hists->nr_entries; | |
43 | hist_browser__refresh_dimensions(self); | |
44 | ui_browser__reset_index(&self->b); | |
45 | } | |
46 | ||
47 | static char tree__folded_sign(bool unfolded) | |
48 | { | |
49 | return unfolded ? '-' : '+'; | |
50 | } | |
51 | ||
52 | static char map_symbol__folded(const struct map_symbol *self) | |
53 | { | |
54 | return self->has_children ? tree__folded_sign(self->unfolded) : ' '; | |
55 | } | |
56 | ||
57 | static char hist_entry__folded(const struct hist_entry *self) | |
58 | { | |
59 | return map_symbol__folded(&self->ms); | |
60 | } | |
61 | ||
62 | static char callchain_list__folded(const struct callchain_list *self) | |
63 | { | |
64 | return map_symbol__folded(&self->ms); | |
65 | } | |
66 | ||
3c916cc2 ACM |
67 | static void map_symbol__set_folding(struct map_symbol *self, bool unfold) |
68 | { | |
69 | self->unfolded = unfold ? self->has_children : false; | |
70 | } | |
71 | ||
d1b4f249 ACM |
72 | static int callchain_node__count_rows_rb_tree(struct callchain_node *self) |
73 | { | |
74 | int n = 0; | |
75 | struct rb_node *nd; | |
76 | ||
77 | for (nd = rb_first(&self->rb_root); nd; nd = rb_next(nd)) { | |
78 | struct callchain_node *child = rb_entry(nd, struct callchain_node, rb_node); | |
79 | struct callchain_list *chain; | |
80 | char folded_sign = ' '; /* No children */ | |
81 | ||
82 | list_for_each_entry(chain, &child->val, list) { | |
83 | ++n; | |
84 | /* We need this because we may not have children */ | |
85 | folded_sign = callchain_list__folded(chain); | |
86 | if (folded_sign == '+') | |
87 | break; | |
88 | } | |
89 | ||
90 | if (folded_sign == '-') /* Have children and they're unfolded */ | |
91 | n += callchain_node__count_rows_rb_tree(child); | |
92 | } | |
93 | ||
94 | return n; | |
95 | } | |
96 | ||
97 | static int callchain_node__count_rows(struct callchain_node *node) | |
98 | { | |
99 | struct callchain_list *chain; | |
100 | bool unfolded = false; | |
101 | int n = 0; | |
102 | ||
103 | list_for_each_entry(chain, &node->val, list) { | |
104 | ++n; | |
105 | unfolded = chain->ms.unfolded; | |
106 | } | |
107 | ||
108 | if (unfolded) | |
109 | n += callchain_node__count_rows_rb_tree(node); | |
110 | ||
111 | return n; | |
112 | } | |
113 | ||
114 | static int callchain__count_rows(struct rb_root *chain) | |
115 | { | |
116 | struct rb_node *nd; | |
117 | int n = 0; | |
118 | ||
119 | for (nd = rb_first(chain); nd; nd = rb_next(nd)) { | |
120 | struct callchain_node *node = rb_entry(nd, struct callchain_node, rb_node); | |
121 | n += callchain_node__count_rows(node); | |
122 | } | |
123 | ||
124 | return n; | |
125 | } | |
126 | ||
127 | static bool map_symbol__toggle_fold(struct map_symbol *self) | |
128 | { | |
129 | if (!self->has_children) | |
130 | return false; | |
131 | ||
132 | self->unfolded = !self->unfolded; | |
133 | return true; | |
134 | } | |
135 | ||
136 | static void callchain_node__init_have_children_rb_tree(struct callchain_node *self) | |
137 | { | |
138 | struct rb_node *nd = rb_first(&self->rb_root); | |
139 | ||
140 | for (nd = rb_first(&self->rb_root); nd; nd = rb_next(nd)) { | |
141 | struct callchain_node *child = rb_entry(nd, struct callchain_node, rb_node); | |
142 | struct callchain_list *chain; | |
293db47f | 143 | bool first = true; |
d1b4f249 ACM |
144 | |
145 | list_for_each_entry(chain, &child->val, list) { | |
146 | if (first) { | |
147 | first = false; | |
148 | chain->ms.has_children = chain->list.next != &child->val || | |
293db47f | 149 | !RB_EMPTY_ROOT(&child->rb_root); |
d1b4f249 ACM |
150 | } else |
151 | chain->ms.has_children = chain->list.next == &child->val && | |
293db47f | 152 | !RB_EMPTY_ROOT(&child->rb_root); |
d1b4f249 ACM |
153 | } |
154 | ||
155 | callchain_node__init_have_children_rb_tree(child); | |
156 | } | |
157 | } | |
158 | ||
159 | static void callchain_node__init_have_children(struct callchain_node *self) | |
160 | { | |
161 | struct callchain_list *chain; | |
162 | ||
163 | list_for_each_entry(chain, &self->val, list) | |
293db47f | 164 | chain->ms.has_children = !RB_EMPTY_ROOT(&self->rb_root); |
d1b4f249 ACM |
165 | |
166 | callchain_node__init_have_children_rb_tree(self); | |
167 | } | |
168 | ||
169 | static void callchain__init_have_children(struct rb_root *self) | |
170 | { | |
171 | struct rb_node *nd; | |
172 | ||
173 | for (nd = rb_first(self); nd; nd = rb_next(nd)) { | |
174 | struct callchain_node *node = rb_entry(nd, struct callchain_node, rb_node); | |
175 | callchain_node__init_have_children(node); | |
176 | } | |
177 | } | |
178 | ||
179 | static void hist_entry__init_have_children(struct hist_entry *self) | |
180 | { | |
181 | if (!self->init_have_children) { | |
18b308d7 | 182 | self->ms.has_children = !RB_EMPTY_ROOT(&self->sorted_chain); |
d1b4f249 ACM |
183 | callchain__init_have_children(&self->sorted_chain); |
184 | self->init_have_children = true; | |
185 | } | |
186 | } | |
187 | ||
188 | static bool hist_browser__toggle_fold(struct hist_browser *self) | |
189 | { | |
190 | if (map_symbol__toggle_fold(self->selection)) { | |
191 | struct hist_entry *he = self->he_selection; | |
192 | ||
193 | hist_entry__init_have_children(he); | |
194 | self->hists->nr_entries -= he->nr_rows; | |
195 | ||
196 | if (he->ms.unfolded) | |
197 | he->nr_rows = callchain__count_rows(&he->sorted_chain); | |
198 | else | |
199 | he->nr_rows = 0; | |
200 | self->hists->nr_entries += he->nr_rows; | |
201 | self->b.nr_entries = self->hists->nr_entries; | |
202 | ||
203 | return true; | |
204 | } | |
205 | ||
206 | /* If it doesn't have children, no toggling performed */ | |
207 | return false; | |
208 | } | |
209 | ||
3c916cc2 ACM |
210 | static int callchain_node__set_folding_rb_tree(struct callchain_node *self, bool unfold) |
211 | { | |
212 | int n = 0; | |
213 | struct rb_node *nd; | |
214 | ||
215 | for (nd = rb_first(&self->rb_root); nd; nd = rb_next(nd)) { | |
216 | struct callchain_node *child = rb_entry(nd, struct callchain_node, rb_node); | |
217 | struct callchain_list *chain; | |
218 | bool has_children = false; | |
219 | ||
220 | list_for_each_entry(chain, &child->val, list) { | |
221 | ++n; | |
222 | map_symbol__set_folding(&chain->ms, unfold); | |
223 | has_children = chain->ms.has_children; | |
224 | } | |
225 | ||
226 | if (has_children) | |
227 | n += callchain_node__set_folding_rb_tree(child, unfold); | |
228 | } | |
229 | ||
230 | return n; | |
231 | } | |
232 | ||
233 | static int callchain_node__set_folding(struct callchain_node *node, bool unfold) | |
234 | { | |
235 | struct callchain_list *chain; | |
236 | bool has_children = false; | |
237 | int n = 0; | |
238 | ||
239 | list_for_each_entry(chain, &node->val, list) { | |
240 | ++n; | |
241 | map_symbol__set_folding(&chain->ms, unfold); | |
242 | has_children = chain->ms.has_children; | |
243 | } | |
244 | ||
245 | if (has_children) | |
246 | n += callchain_node__set_folding_rb_tree(node, unfold); | |
247 | ||
248 | return n; | |
249 | } | |
250 | ||
251 | static int callchain__set_folding(struct rb_root *chain, bool unfold) | |
252 | { | |
253 | struct rb_node *nd; | |
254 | int n = 0; | |
255 | ||
256 | for (nd = rb_first(chain); nd; nd = rb_next(nd)) { | |
257 | struct callchain_node *node = rb_entry(nd, struct callchain_node, rb_node); | |
258 | n += callchain_node__set_folding(node, unfold); | |
259 | } | |
260 | ||
261 | return n; | |
262 | } | |
263 | ||
264 | static void hist_entry__set_folding(struct hist_entry *self, bool unfold) | |
265 | { | |
266 | hist_entry__init_have_children(self); | |
267 | map_symbol__set_folding(&self->ms, unfold); | |
268 | ||
269 | if (self->ms.has_children) { | |
270 | int n = callchain__set_folding(&self->sorted_chain, unfold); | |
271 | self->nr_rows = unfold ? n : 0; | |
272 | } else | |
273 | self->nr_rows = 0; | |
274 | } | |
275 | ||
276 | static void hists__set_folding(struct hists *self, bool unfold) | |
277 | { | |
278 | struct rb_node *nd; | |
279 | ||
280 | self->nr_entries = 0; | |
281 | ||
282 | for (nd = rb_first(&self->entries); nd; nd = rb_next(nd)) { | |
283 | struct hist_entry *he = rb_entry(nd, struct hist_entry, rb_node); | |
284 | hist_entry__set_folding(he, unfold); | |
285 | self->nr_entries += 1 + he->nr_rows; | |
286 | } | |
287 | } | |
288 | ||
289 | static void hist_browser__set_folding(struct hist_browser *self, bool unfold) | |
290 | { | |
291 | hists__set_folding(self->hists, unfold); | |
292 | self->b.nr_entries = self->hists->nr_entries; | |
293 | /* Go to the start, we may be way after valid entries after a collapse */ | |
294 | ui_browser__reset_index(&self->b); | |
295 | } | |
296 | ||
81cce8de ACM |
297 | static int hist_browser__run(struct hist_browser *self, const char *ev_name, |
298 | void(*timer)(void *arg), void *arg, int delay_secs) | |
d1b4f249 | 299 | { |
b50e003d | 300 | int key; |
81cce8de | 301 | char title[160]; |
d1b4f249 ACM |
302 | |
303 | self->b.entries = &self->hists->entries; | |
304 | self->b.nr_entries = self->hists->nr_entries; | |
305 | ||
306 | hist_browser__refresh_dimensions(self); | |
d7b76f09 | 307 | hists__browser_title(self->hists, title, sizeof(title), ev_name); |
d1b4f249 | 308 | |
59e8fe32 ACM |
309 | if (ui_browser__show(&self->b, title, |
310 | "Press '?' for help on key bindings") < 0) | |
d1b4f249 ACM |
311 | return -1; |
312 | ||
d1b4f249 | 313 | while (1) { |
3af6e338 | 314 | key = ui_browser__run(&self->b, delay_secs); |
d1b4f249 | 315 | |
b50e003d | 316 | switch (key) { |
81cce8de ACM |
317 | case -1: |
318 | /* FIXME we need to check if it was es.reason == NEWT_EXIT_TIMER */ | |
319 | timer(arg); | |
900e14a8 | 320 | ui_browser__update_nr_entries(&self->b, self->hists->nr_entries); |
81cce8de | 321 | hists__browser_title(self->hists, title, sizeof(title), |
d7b76f09 | 322 | ev_name); |
81cce8de ACM |
323 | ui_browser__show_title(&self->b, title); |
324 | continue; | |
4694153c | 325 | case 'D': { /* Debug */ |
d1b4f249 ACM |
326 | static int seq; |
327 | struct hist_entry *h = rb_entry(self->b.top, | |
328 | struct hist_entry, rb_node); | |
329 | ui_helpline__pop(); | |
330 | ui_helpline__fpush("%d: nr_ent=(%d,%d), height=%d, idx=%d, fve: idx=%d, row_off=%d, nrows=%d", | |
331 | seq++, self->b.nr_entries, | |
332 | self->hists->nr_entries, | |
333 | self->b.height, | |
334 | self->b.index, | |
335 | self->b.top_idx, | |
336 | h->row_offset, h->nr_rows); | |
337 | } | |
3c916cc2 ACM |
338 | break; |
339 | case 'C': | |
340 | /* Collapse the whole world. */ | |
341 | hist_browser__set_folding(self, false); | |
342 | break; | |
343 | case 'E': | |
344 | /* Expand the whole world. */ | |
345 | hist_browser__set_folding(self, true); | |
346 | break; | |
d1b4f249 ACM |
347 | case NEWT_KEY_ENTER: |
348 | if (hist_browser__toggle_fold(self)) | |
349 | break; | |
350 | /* fall thru */ | |
351 | default: | |
b50e003d | 352 | goto out; |
d1b4f249 ACM |
353 | } |
354 | } | |
b50e003d | 355 | out: |
59e8fe32 | 356 | ui_browser__hide(&self->b); |
b50e003d | 357 | return key; |
d1b4f249 ACM |
358 | } |
359 | ||
360 | static char *callchain_list__sym_name(struct callchain_list *self, | |
361 | char *bf, size_t bfsize) | |
362 | { | |
363 | if (self->ms.sym) | |
364 | return self->ms.sym->name; | |
365 | ||
9486aa38 | 366 | snprintf(bf, bfsize, "%#" PRIx64, self->ip); |
d1b4f249 ACM |
367 | return bf; |
368 | } | |
369 | ||
370 | #define LEVEL_OFFSET_STEP 3 | |
371 | ||
372 | static int hist_browser__show_callchain_node_rb_tree(struct hist_browser *self, | |
373 | struct callchain_node *chain_node, | |
374 | u64 total, int level, | |
375 | unsigned short row, | |
376 | off_t *row_offset, | |
377 | bool *is_current_entry) | |
378 | { | |
379 | struct rb_node *node; | |
380 | int first_row = row, width, offset = level * LEVEL_OFFSET_STEP; | |
381 | u64 new_total, remaining; | |
382 | ||
383 | if (callchain_param.mode == CHAIN_GRAPH_REL) | |
384 | new_total = chain_node->children_hit; | |
385 | else | |
386 | new_total = total; | |
387 | ||
388 | remaining = new_total; | |
389 | node = rb_first(&chain_node->rb_root); | |
390 | while (node) { | |
391 | struct callchain_node *child = rb_entry(node, struct callchain_node, rb_node); | |
392 | struct rb_node *next = rb_next(node); | |
f08c3154 | 393 | u64 cumul = callchain_cumul_hits(child); |
d1b4f249 ACM |
394 | struct callchain_list *chain; |
395 | char folded_sign = ' '; | |
396 | int first = true; | |
397 | int extra_offset = 0; | |
398 | ||
399 | remaining -= cumul; | |
400 | ||
401 | list_for_each_entry(chain, &child->val, list) { | |
402 | char ipstr[BITS_PER_LONG / 4 + 1], *alloc_str; | |
403 | const char *str; | |
404 | int color; | |
405 | bool was_first = first; | |
406 | ||
163caed9 | 407 | if (first) |
d1b4f249 | 408 | first = false; |
163caed9 | 409 | else |
d1b4f249 | 410 | extra_offset = LEVEL_OFFSET_STEP; |
d1b4f249 ACM |
411 | |
412 | folded_sign = callchain_list__folded(chain); | |
413 | if (*row_offset != 0) { | |
414 | --*row_offset; | |
415 | goto do_next; | |
416 | } | |
417 | ||
418 | alloc_str = NULL; | |
419 | str = callchain_list__sym_name(chain, ipstr, sizeof(ipstr)); | |
420 | if (was_first) { | |
421 | double percent = cumul * 100.0 / new_total; | |
422 | ||
423 | if (asprintf(&alloc_str, "%2.2f%% %s", percent, str) < 0) | |
424 | str = "Not enough memory!"; | |
425 | else | |
426 | str = alloc_str; | |
427 | } | |
428 | ||
429 | color = HE_COLORSET_NORMAL; | |
430 | width = self->b.width - (offset + extra_offset + 2); | |
431 | if (ui_browser__is_current_entry(&self->b, row)) { | |
432 | self->selection = &chain->ms; | |
433 | color = HE_COLORSET_SELECTED; | |
434 | *is_current_entry = true; | |
435 | } | |
436 | ||
8f9bbc40 ACM |
437 | ui_browser__set_color(&self->b, color); |
438 | ui_browser__gotorc(&self->b, row, 0); | |
d1b4f249 ACM |
439 | slsmg_write_nstring(" ", offset + extra_offset); |
440 | slsmg_printf("%c ", folded_sign); | |
441 | slsmg_write_nstring(str, width); | |
442 | free(alloc_str); | |
443 | ||
444 | if (++row == self->b.height) | |
445 | goto out; | |
446 | do_next: | |
447 | if (folded_sign == '+') | |
448 | break; | |
449 | } | |
450 | ||
451 | if (folded_sign == '-') { | |
452 | const int new_level = level + (extra_offset ? 2 : 1); | |
453 | row += hist_browser__show_callchain_node_rb_tree(self, child, new_total, | |
454 | new_level, row, row_offset, | |
455 | is_current_entry); | |
456 | } | |
457 | if (row == self->b.height) | |
458 | goto out; | |
459 | node = next; | |
460 | } | |
461 | out: | |
462 | return row - first_row; | |
463 | } | |
464 | ||
465 | static int hist_browser__show_callchain_node(struct hist_browser *self, | |
466 | struct callchain_node *node, | |
467 | int level, unsigned short row, | |
468 | off_t *row_offset, | |
469 | bool *is_current_entry) | |
470 | { | |
471 | struct callchain_list *chain; | |
472 | int first_row = row, | |
473 | offset = level * LEVEL_OFFSET_STEP, | |
474 | width = self->b.width - offset; | |
475 | char folded_sign = ' '; | |
476 | ||
477 | list_for_each_entry(chain, &node->val, list) { | |
478 | char ipstr[BITS_PER_LONG / 4 + 1], *s; | |
479 | int color; | |
163caed9 | 480 | |
d1b4f249 ACM |
481 | folded_sign = callchain_list__folded(chain); |
482 | ||
483 | if (*row_offset != 0) { | |
484 | --*row_offset; | |
485 | continue; | |
486 | } | |
487 | ||
488 | color = HE_COLORSET_NORMAL; | |
489 | if (ui_browser__is_current_entry(&self->b, row)) { | |
490 | self->selection = &chain->ms; | |
491 | color = HE_COLORSET_SELECTED; | |
492 | *is_current_entry = true; | |
493 | } | |
494 | ||
495 | s = callchain_list__sym_name(chain, ipstr, sizeof(ipstr)); | |
8f9bbc40 ACM |
496 | ui_browser__gotorc(&self->b, row, 0); |
497 | ui_browser__set_color(&self->b, color); | |
d1b4f249 ACM |
498 | slsmg_write_nstring(" ", offset); |
499 | slsmg_printf("%c ", folded_sign); | |
500 | slsmg_write_nstring(s, width - 2); | |
501 | ||
502 | if (++row == self->b.height) | |
503 | goto out; | |
504 | } | |
505 | ||
506 | if (folded_sign == '-') | |
507 | row += hist_browser__show_callchain_node_rb_tree(self, node, | |
508 | self->hists->stats.total_period, | |
509 | level + 1, row, | |
510 | row_offset, | |
511 | is_current_entry); | |
512 | out: | |
513 | return row - first_row; | |
514 | } | |
515 | ||
516 | static int hist_browser__show_callchain(struct hist_browser *self, | |
517 | struct rb_root *chain, | |
518 | int level, unsigned short row, | |
519 | off_t *row_offset, | |
520 | bool *is_current_entry) | |
521 | { | |
522 | struct rb_node *nd; | |
523 | int first_row = row; | |
524 | ||
525 | for (nd = rb_first(chain); nd; nd = rb_next(nd)) { | |
526 | struct callchain_node *node = rb_entry(nd, struct callchain_node, rb_node); | |
527 | ||
528 | row += hist_browser__show_callchain_node(self, node, level, | |
529 | row, row_offset, | |
530 | is_current_entry); | |
531 | if (row == self->b.height) | |
532 | break; | |
533 | } | |
534 | ||
535 | return row - first_row; | |
536 | } | |
537 | ||
538 | static int hist_browser__show_entry(struct hist_browser *self, | |
539 | struct hist_entry *entry, | |
540 | unsigned short row) | |
541 | { | |
542 | char s[256]; | |
543 | double percent; | |
544 | int printed = 0; | |
f1cf602c | 545 | int width = self->b.width - 6; /* The percentage */ |
d1b4f249 ACM |
546 | char folded_sign = ' '; |
547 | bool current_entry = ui_browser__is_current_entry(&self->b, row); | |
548 | off_t row_offset = entry->row_offset; | |
549 | ||
550 | if (current_entry) { | |
551 | self->he_selection = entry; | |
552 | self->selection = &entry->ms; | |
553 | } | |
554 | ||
555 | if (symbol_conf.use_callchain) { | |
163caed9 | 556 | hist_entry__init_have_children(entry); |
d1b4f249 ACM |
557 | folded_sign = hist_entry__folded(entry); |
558 | } | |
559 | ||
560 | if (row_offset == 0) { | |
f1cf602c | 561 | hist_entry__snprintf(entry, s, sizeof(s), self->hists); |
d1b4f249 ACM |
562 | percent = (entry->period * 100.0) / self->hists->stats.total_period; |
563 | ||
c172f742 | 564 | ui_browser__set_percent_color(&self->b, percent, current_entry); |
8f9bbc40 | 565 | ui_browser__gotorc(&self->b, row, 0); |
d1b4f249 ACM |
566 | if (symbol_conf.use_callchain) { |
567 | slsmg_printf("%c ", folded_sign); | |
568 | width -= 2; | |
569 | } | |
c172f742 | 570 | |
f1cf602c ACM |
571 | slsmg_printf(" %5.2f%%", percent); |
572 | ||
c172f742 ACM |
573 | /* The scroll bar isn't being used */ |
574 | if (!self->b.navkeypressed) | |
575 | width += 1; | |
576 | ||
33f62b3f ACM |
577 | if (!current_entry || !self->b.navkeypressed) |
578 | ui_browser__set_color(&self->b, HE_COLORSET_NORMAL); | |
579 | ||
d1b4f249 ACM |
580 | slsmg_write_nstring(s, width); |
581 | ++row; | |
582 | ++printed; | |
583 | } else | |
584 | --row_offset; | |
585 | ||
586 | if (folded_sign == '-' && row != self->b.height) { | |
587 | printed += hist_browser__show_callchain(self, &entry->sorted_chain, | |
588 | 1, row, &row_offset, | |
589 | ¤t_entry); | |
590 | if (current_entry) | |
591 | self->he_selection = entry; | |
592 | } | |
593 | ||
594 | return printed; | |
595 | } | |
596 | ||
437cfe7a ACM |
597 | static void ui_browser__hists_init_top(struct ui_browser *browser) |
598 | { | |
599 | if (browser->top == NULL) { | |
600 | struct hist_browser *hb; | |
601 | ||
602 | hb = container_of(browser, struct hist_browser, b); | |
603 | browser->top = rb_first(&hb->hists->entries); | |
604 | } | |
605 | } | |
606 | ||
d1b4f249 ACM |
607 | static unsigned int hist_browser__refresh(struct ui_browser *self) |
608 | { | |
609 | unsigned row = 0; | |
610 | struct rb_node *nd; | |
611 | struct hist_browser *hb = container_of(self, struct hist_browser, b); | |
612 | ||
437cfe7a | 613 | ui_browser__hists_init_top(self); |
d1b4f249 ACM |
614 | |
615 | for (nd = self->top; nd; nd = rb_next(nd)) { | |
616 | struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node); | |
617 | ||
618 | if (h->filtered) | |
619 | continue; | |
620 | ||
621 | row += hist_browser__show_entry(hb, h, row); | |
622 | if (row == self->height) | |
623 | break; | |
624 | } | |
625 | ||
626 | return row; | |
627 | } | |
628 | ||
629 | static struct rb_node *hists__filter_entries(struct rb_node *nd) | |
630 | { | |
631 | while (nd != NULL) { | |
632 | struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node); | |
633 | if (!h->filtered) | |
634 | return nd; | |
635 | ||
636 | nd = rb_next(nd); | |
637 | } | |
638 | ||
639 | return NULL; | |
640 | } | |
641 | ||
642 | static struct rb_node *hists__filter_prev_entries(struct rb_node *nd) | |
643 | { | |
644 | while (nd != NULL) { | |
645 | struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node); | |
646 | if (!h->filtered) | |
647 | return nd; | |
648 | ||
649 | nd = rb_prev(nd); | |
650 | } | |
651 | ||
652 | return NULL; | |
653 | } | |
654 | ||
655 | static void ui_browser__hists_seek(struct ui_browser *self, | |
656 | off_t offset, int whence) | |
657 | { | |
658 | struct hist_entry *h; | |
659 | struct rb_node *nd; | |
660 | bool first = true; | |
661 | ||
60098917 ACM |
662 | if (self->nr_entries == 0) |
663 | return; | |
664 | ||
437cfe7a ACM |
665 | ui_browser__hists_init_top(self); |
666 | ||
d1b4f249 ACM |
667 | switch (whence) { |
668 | case SEEK_SET: | |
669 | nd = hists__filter_entries(rb_first(self->entries)); | |
670 | break; | |
671 | case SEEK_CUR: | |
672 | nd = self->top; | |
673 | goto do_offset; | |
674 | case SEEK_END: | |
675 | nd = hists__filter_prev_entries(rb_last(self->entries)); | |
676 | first = false; | |
677 | break; | |
678 | default: | |
679 | return; | |
680 | } | |
681 | ||
682 | /* | |
683 | * Moves not relative to the first visible entry invalidates its | |
684 | * row_offset: | |
685 | */ | |
686 | h = rb_entry(self->top, struct hist_entry, rb_node); | |
687 | h->row_offset = 0; | |
688 | ||
689 | /* | |
690 | * Here we have to check if nd is expanded (+), if it is we can't go | |
691 | * the next top level hist_entry, instead we must compute an offset of | |
692 | * what _not_ to show and not change the first visible entry. | |
693 | * | |
694 | * This offset increments when we are going from top to bottom and | |
695 | * decreases when we're going from bottom to top. | |
696 | * | |
697 | * As we don't have backpointers to the top level in the callchains | |
698 | * structure, we need to always print the whole hist_entry callchain, | |
699 | * skipping the first ones that are before the first visible entry | |
700 | * and stop when we printed enough lines to fill the screen. | |
701 | */ | |
702 | do_offset: | |
703 | if (offset > 0) { | |
704 | do { | |
705 | h = rb_entry(nd, struct hist_entry, rb_node); | |
706 | if (h->ms.unfolded) { | |
707 | u16 remaining = h->nr_rows - h->row_offset; | |
708 | if (offset > remaining) { | |
709 | offset -= remaining; | |
710 | h->row_offset = 0; | |
711 | } else { | |
712 | h->row_offset += offset; | |
713 | offset = 0; | |
714 | self->top = nd; | |
715 | break; | |
716 | } | |
717 | } | |
718 | nd = hists__filter_entries(rb_next(nd)); | |
719 | if (nd == NULL) | |
720 | break; | |
721 | --offset; | |
722 | self->top = nd; | |
723 | } while (offset != 0); | |
724 | } else if (offset < 0) { | |
725 | while (1) { | |
726 | h = rb_entry(nd, struct hist_entry, rb_node); | |
727 | if (h->ms.unfolded) { | |
728 | if (first) { | |
729 | if (-offset > h->row_offset) { | |
730 | offset += h->row_offset; | |
731 | h->row_offset = 0; | |
732 | } else { | |
733 | h->row_offset += offset; | |
734 | offset = 0; | |
735 | self->top = nd; | |
736 | break; | |
737 | } | |
738 | } else { | |
739 | if (-offset > h->nr_rows) { | |
740 | offset += h->nr_rows; | |
741 | h->row_offset = 0; | |
742 | } else { | |
743 | h->row_offset = h->nr_rows + offset; | |
744 | offset = 0; | |
745 | self->top = nd; | |
746 | break; | |
747 | } | |
748 | } | |
749 | } | |
750 | ||
751 | nd = hists__filter_prev_entries(rb_prev(nd)); | |
752 | if (nd == NULL) | |
753 | break; | |
754 | ++offset; | |
755 | self->top = nd; | |
756 | if (offset == 0) { | |
757 | /* | |
758 | * Last unfiltered hist_entry, check if it is | |
759 | * unfolded, if it is then we should have | |
760 | * row_offset at its last entry. | |
761 | */ | |
762 | h = rb_entry(nd, struct hist_entry, rb_node); | |
763 | if (h->ms.unfolded) | |
764 | h->row_offset = h->nr_rows; | |
765 | break; | |
766 | } | |
767 | first = false; | |
768 | } | |
769 | } else { | |
770 | self->top = nd; | |
771 | h = rb_entry(nd, struct hist_entry, rb_node); | |
772 | h->row_offset = 0; | |
773 | } | |
774 | } | |
775 | ||
776 | static struct hist_browser *hist_browser__new(struct hists *hists) | |
777 | { | |
778 | struct hist_browser *self = zalloc(sizeof(*self)); | |
779 | ||
780 | if (self) { | |
781 | self->hists = hists; | |
782 | self->b.refresh = hist_browser__refresh; | |
783 | self->b.seek = ui_browser__hists_seek; | |
c172f742 | 784 | self->b.use_navkeypressed = true, |
724c9c9f | 785 | self->has_symbols = sort_sym.list.next != NULL; |
d1b4f249 ACM |
786 | } |
787 | ||
788 | return self; | |
789 | } | |
790 | ||
791 | static void hist_browser__delete(struct hist_browser *self) | |
792 | { | |
d1b4f249 ACM |
793 | free(self); |
794 | } | |
795 | ||
796 | static struct hist_entry *hist_browser__selected_entry(struct hist_browser *self) | |
797 | { | |
798 | return self->he_selection; | |
799 | } | |
800 | ||
801 | static struct thread *hist_browser__selected_thread(struct hist_browser *self) | |
802 | { | |
803 | return self->he_selection->thread; | |
804 | } | |
805 | ||
469917ce | 806 | static int hists__browser_title(struct hists *self, char *bf, size_t size, |
d7b76f09 | 807 | const char *ev_name) |
d1b4f249 | 808 | { |
469917ce ACM |
809 | char unit; |
810 | int printed; | |
d7b76f09 ACM |
811 | const struct dso *dso = self->dso_filter; |
812 | const struct thread *thread = self->thread_filter; | |
469917ce ACM |
813 | unsigned long nr_events = self->stats.nr_events[PERF_RECORD_SAMPLE]; |
814 | ||
815 | nr_events = convert_unit(nr_events, &unit); | |
816 | printed = snprintf(bf, size, "Events: %lu%c %s", nr_events, unit, ev_name); | |
d1b4f249 ACM |
817 | |
818 | if (thread) | |
819 | printed += snprintf(bf + printed, size - printed, | |
469917ce ACM |
820 | ", Thread: %s(%d)", |
821 | (thread->comm_set ? thread->comm : ""), | |
d1b4f249 ACM |
822 | thread->pid); |
823 | if (dso) | |
824 | printed += snprintf(bf + printed, size - printed, | |
469917ce ACM |
825 | ", DSO: %s", dso->short_name); |
826 | return printed; | |
d1b4f249 ACM |
827 | } |
828 | ||
34958544 | 829 | static int perf_evsel__hists_browse(struct perf_evsel *evsel, int nr_events, |
7f0030b2 | 830 | const char *helpline, const char *ev_name, |
81cce8de ACM |
831 | bool left_exits, |
832 | void(*timer)(void *arg), void *arg, | |
833 | int delay_secs) | |
d1b4f249 | 834 | { |
7f0030b2 | 835 | struct hists *self = &evsel->hists; |
d1b4f249 ACM |
836 | struct hist_browser *browser = hist_browser__new(self); |
837 | struct pstack *fstack; | |
d1b4f249 ACM |
838 | int key = -1; |
839 | ||
840 | if (browser == NULL) | |
841 | return -1; | |
842 | ||
843 | fstack = pstack__new(2); | |
844 | if (fstack == NULL) | |
845 | goto out; | |
846 | ||
847 | ui_helpline__push(helpline); | |
848 | ||
d1b4f249 | 849 | while (1) { |
60098917 ACM |
850 | const struct thread *thread = NULL; |
851 | const struct dso *dso = NULL; | |
d1b4f249 ACM |
852 | char *options[16]; |
853 | int nr_options = 0, choice = 0, i, | |
854 | annotate = -2, zoom_dso = -2, zoom_thread = -2, | |
855 | browse_map = -2; | |
856 | ||
81cce8de | 857 | key = hist_browser__run(browser, ev_name, timer, arg, delay_secs); |
d1b4f249 | 858 | |
60098917 ACM |
859 | if (browser->he_selection != NULL) { |
860 | thread = hist_browser__selected_thread(browser); | |
861 | dso = browser->selection->map ? browser->selection->map->dso : NULL; | |
862 | } | |
d1b4f249 | 863 | |
b50e003d | 864 | switch (key) { |
b50e003d ACM |
865 | case NEWT_KEY_TAB: |
866 | case NEWT_KEY_UNTAB: | |
867 | /* | |
868 | * Exit the browser, let hists__browser_tree | |
869 | * go to the next or previous | |
870 | */ | |
871 | goto out_free_stack; | |
872 | case 'a': | |
60098917 | 873 | if (browser->selection == NULL || |
db9a9cbc | 874 | browser->selection->sym == NULL || |
b50e003d | 875 | browser->selection->map->dso->annotate_warned) |
d1b4f249 | 876 | continue; |
b50e003d ACM |
877 | goto do_annotate; |
878 | case 'd': | |
879 | goto zoom_dso; | |
880 | case 't': | |
881 | goto zoom_thread; | |
3c916cc2 | 882 | case NEWT_KEY_F1: |
b50e003d ACM |
883 | case 'h': |
884 | case '?': | |
2d5646c0 ACM |
885 | ui__help_window("h/?/F1 Show this window\n" |
886 | "UP/DOWN/PGUP\n" | |
887 | "PGDN/SPACE Navigate\n" | |
888 | "q/ESC/CTRL+C Exit browser\n\n" | |
889 | "For multiple event sessions:\n\n" | |
890 | "TAB/UNTAB Switch events\n\n" | |
724c9c9f | 891 | "For symbolic views (--sort has sym):\n\n" |
2d5646c0 ACM |
892 | "-> Zoom into DSO/Threads & Annotate current symbol\n" |
893 | "<- Zoom out\n" | |
894 | "a Annotate current symbol\n" | |
895 | "C Collapse all callchains\n" | |
896 | "E Expand all callchains\n" | |
897 | "d Zoom into current DSO\n" | |
898 | "t Zoom into current Thread\n"); | |
b50e003d ACM |
899 | continue; |
900 | case NEWT_KEY_ENTER: | |
901 | case NEWT_KEY_RIGHT: | |
902 | /* menu */ | |
903 | break; | |
904 | case NEWT_KEY_LEFT: { | |
905 | const void *top; | |
d1b4f249 | 906 | |
7f0030b2 ACM |
907 | if (pstack__empty(fstack)) { |
908 | /* | |
909 | * Go back to the perf_evsel_menu__run or other user | |
910 | */ | |
911 | if (left_exits) | |
912 | goto out_free_stack; | |
d1b4f249 | 913 | continue; |
7f0030b2 | 914 | } |
b50e003d | 915 | top = pstack__pop(fstack); |
d7b76f09 | 916 | if (top == &browser->hists->dso_filter) |
b50e003d | 917 | goto zoom_out_dso; |
d7b76f09 | 918 | if (top == &browser->hists->thread_filter) |
b50e003d ACM |
919 | goto zoom_out_thread; |
920 | continue; | |
921 | } | |
922 | case NEWT_KEY_ESCAPE: | |
7f0030b2 ACM |
923 | if (!left_exits && |
924 | !ui__dialog_yesno("Do you really want to exit?")) | |
b50e003d ACM |
925 | continue; |
926 | /* Fall thru */ | |
ed7e5662 ACM |
927 | case 'q': |
928 | case CTRL('c'): | |
b50e003d | 929 | goto out_free_stack; |
ed7e5662 ACM |
930 | default: |
931 | continue; | |
d1b4f249 ACM |
932 | } |
933 | ||
724c9c9f ACM |
934 | if (!browser->has_symbols) |
935 | goto add_exit_option; | |
936 | ||
60098917 ACM |
937 | if (browser->selection != NULL && |
938 | browser->selection->sym != NULL && | |
d1b4f249 ACM |
939 | !browser->selection->map->dso->annotate_warned && |
940 | asprintf(&options[nr_options], "Annotate %s", | |
941 | browser->selection->sym->name) > 0) | |
942 | annotate = nr_options++; | |
943 | ||
944 | if (thread != NULL && | |
945 | asprintf(&options[nr_options], "Zoom %s %s(%d) thread", | |
d7b76f09 | 946 | (browser->hists->thread_filter ? "out of" : "into"), |
d1b4f249 ACM |
947 | (thread->comm_set ? thread->comm : ""), |
948 | thread->pid) > 0) | |
949 | zoom_thread = nr_options++; | |
950 | ||
951 | if (dso != NULL && | |
952 | asprintf(&options[nr_options], "Zoom %s %s DSO", | |
d7b76f09 | 953 | (browser->hists->dso_filter ? "out of" : "into"), |
d1b4f249 ACM |
954 | (dso->kernel ? "the Kernel" : dso->short_name)) > 0) |
955 | zoom_dso = nr_options++; | |
956 | ||
60098917 ACM |
957 | if (browser->selection != NULL && |
958 | browser->selection->map != NULL && | |
d1b4f249 ACM |
959 | asprintf(&options[nr_options], "Browse map details") > 0) |
960 | browse_map = nr_options++; | |
724c9c9f | 961 | add_exit_option: |
d1b4f249 ACM |
962 | options[nr_options++] = (char *)"Exit"; |
963 | ||
1e6dd077 | 964 | choice = ui__popup_menu(nr_options, options); |
d1b4f249 ACM |
965 | |
966 | for (i = 0; i < nr_options - 1; ++i) | |
967 | free(options[i]); | |
968 | ||
969 | if (choice == nr_options - 1) | |
970 | break; | |
971 | ||
972 | if (choice == -1) | |
973 | continue; | |
974 | ||
975 | if (choice == annotate) { | |
976 | struct hist_entry *he; | |
977 | do_annotate: | |
d1b4f249 ACM |
978 | he = hist_browser__selected_entry(browser); |
979 | if (he == NULL) | |
980 | continue; | |
df71d95f ACM |
981 | /* |
982 | * Don't let this be freed, say, by hists__decay_entry. | |
983 | */ | |
984 | he->used = true; | |
34958544 | 985 | hist_entry__tui_annotate(he, evsel->idx, nr_events, |
81cce8de | 986 | timer, arg, delay_secs); |
df71d95f | 987 | he->used = false; |
900e14a8 | 988 | ui_browser__update_nr_entries(&browser->b, browser->hists->nr_entries); |
d1b4f249 ACM |
989 | } else if (choice == browse_map) |
990 | map__browse(browser->selection->map); | |
991 | else if (choice == zoom_dso) { | |
992 | zoom_dso: | |
d7b76f09 ACM |
993 | if (browser->hists->dso_filter) { |
994 | pstack__remove(fstack, &browser->hists->dso_filter); | |
d1b4f249 ACM |
995 | zoom_out_dso: |
996 | ui_helpline__pop(); | |
d7b76f09 | 997 | browser->hists->dso_filter = NULL; |
d1b4f249 ACM |
998 | } else { |
999 | if (dso == NULL) | |
1000 | continue; | |
1001 | ui_helpline__fpush("To zoom out press <- or -> + \"Zoom out of %s DSO\"", | |
1002 | dso->kernel ? "the Kernel" : dso->short_name); | |
d7b76f09 ACM |
1003 | browser->hists->dso_filter = dso; |
1004 | pstack__push(fstack, &browser->hists->dso_filter); | |
d1b4f249 | 1005 | } |
d7b76f09 | 1006 | hists__filter_by_dso(self); |
d1b4f249 ACM |
1007 | hist_browser__reset(browser); |
1008 | } else if (choice == zoom_thread) { | |
1009 | zoom_thread: | |
d7b76f09 ACM |
1010 | if (browser->hists->thread_filter) { |
1011 | pstack__remove(fstack, &browser->hists->thread_filter); | |
d1b4f249 ACM |
1012 | zoom_out_thread: |
1013 | ui_helpline__pop(); | |
d7b76f09 | 1014 | browser->hists->thread_filter = NULL; |
d1b4f249 ACM |
1015 | } else { |
1016 | ui_helpline__fpush("To zoom out press <- or -> + \"Zoom out of %s(%d) thread\"", | |
1017 | thread->comm_set ? thread->comm : "", | |
1018 | thread->pid); | |
d7b76f09 ACM |
1019 | browser->hists->thread_filter = thread; |
1020 | pstack__push(fstack, &browser->hists->thread_filter); | |
d1b4f249 | 1021 | } |
d7b76f09 | 1022 | hists__filter_by_thread(self); |
d1b4f249 ACM |
1023 | hist_browser__reset(browser); |
1024 | } | |
1025 | } | |
1026 | out_free_stack: | |
1027 | pstack__delete(fstack); | |
1028 | out: | |
1029 | hist_browser__delete(browser); | |
1030 | return key; | |
1031 | } | |
1032 | ||
7f0030b2 ACM |
1033 | struct perf_evsel_menu { |
1034 | struct ui_browser b; | |
1035 | struct perf_evsel *selection; | |
1036 | }; | |
1037 | ||
1038 | static void perf_evsel_menu__write(struct ui_browser *browser, | |
1039 | void *entry, int row) | |
1040 | { | |
1041 | struct perf_evsel_menu *menu = container_of(browser, | |
1042 | struct perf_evsel_menu, b); | |
1043 | struct perf_evsel *evsel = list_entry(entry, struct perf_evsel, node); | |
1044 | bool current_entry = ui_browser__is_current_entry(browser, row); | |
1045 | unsigned long nr_events = evsel->hists.stats.nr_events[PERF_RECORD_SAMPLE]; | |
1046 | const char *ev_name = event_name(evsel); | |
1047 | char bf[256], unit; | |
1048 | ||
1049 | ui_browser__set_color(browser, current_entry ? HE_COLORSET_SELECTED : | |
1050 | HE_COLORSET_NORMAL); | |
1051 | ||
1052 | nr_events = convert_unit(nr_events, &unit); | |
1053 | snprintf(bf, sizeof(bf), "%lu%c%s%s", nr_events, | |
1054 | unit, unit == ' ' ? "" : " ", ev_name); | |
1055 | slsmg_write_nstring(bf, browser->width); | |
1056 | ||
1057 | if (current_entry) | |
1058 | menu->selection = evsel; | |
1059 | } | |
1060 | ||
34958544 ACM |
1061 | static int perf_evsel_menu__run(struct perf_evsel_menu *menu, |
1062 | int nr_events, const char *help, | |
81cce8de | 1063 | void(*timer)(void *arg), void *arg, int delay_secs) |
d1b4f249 | 1064 | { |
7f0030b2 | 1065 | struct perf_evlist *evlist = menu->b.priv; |
e248de33 | 1066 | struct perf_evsel *pos; |
7f0030b2 ACM |
1067 | const char *ev_name, *title = "Available samples"; |
1068 | int key; | |
d1b4f249 | 1069 | |
7f0030b2 ACM |
1070 | if (ui_browser__show(&menu->b, title, |
1071 | "ESC: exit, ENTER|->: Browse histograms") < 0) | |
1072 | return -1; | |
1073 | ||
7f0030b2 | 1074 | while (1) { |
3af6e338 | 1075 | key = ui_browser__run(&menu->b, delay_secs); |
7f0030b2 ACM |
1076 | |
1077 | switch (key) { | |
81cce8de ACM |
1078 | case -1: |
1079 | /* FIXME we need to check if it was es.reason == NEWT_EXIT_TIMER */ | |
1080 | timer(arg); | |
1081 | continue; | |
7f0030b2 ACM |
1082 | case NEWT_KEY_RIGHT: |
1083 | case NEWT_KEY_ENTER: | |
1084 | if (!menu->selection) | |
1085 | continue; | |
1086 | pos = menu->selection; | |
1087 | browse_hists: | |
18eaf0b8 ACM |
1088 | perf_evlist__set_selected(evlist, pos); |
1089 | /* | |
1090 | * Give the calling tool a chance to populate the non | |
1091 | * default evsel resorted hists tree. | |
1092 | */ | |
1093 | if (timer) | |
1094 | timer(arg); | |
7f0030b2 | 1095 | ev_name = event_name(pos); |
34958544 ACM |
1096 | key = perf_evsel__hists_browse(pos, nr_events, help, |
1097 | ev_name, true, timer, | |
1098 | arg, delay_secs); | |
7f0030b2 | 1099 | ui_browser__show_title(&menu->b, title); |
18eaf0b8 ACM |
1100 | switch (key) { |
1101 | case NEWT_KEY_TAB: | |
1102 | if (pos->node.next == &evlist->entries) | |
1103 | pos = list_entry(evlist->entries.next, struct perf_evsel, node); | |
1104 | else | |
1105 | pos = list_entry(pos->node.next, struct perf_evsel, node); | |
1106 | goto browse_hists; | |
1107 | case NEWT_KEY_UNTAB: | |
1108 | if (pos->node.prev == &evlist->entries) | |
1109 | pos = list_entry(evlist->entries.prev, struct perf_evsel, node); | |
1110 | else | |
1111 | pos = list_entry(pos->node.prev, struct perf_evsel, node); | |
1112 | goto browse_hists; | |
1113 | case NEWT_KEY_ESCAPE: | |
1114 | if (!ui__dialog_yesno("Do you really want to exit?")) | |
1115 | continue; | |
1116 | /* Fall thru */ | |
1117 | case 'q': | |
1118 | case CTRL('c'): | |
1119 | goto out; | |
1120 | default: | |
1121 | continue; | |
1122 | } | |
7f0030b2 ACM |
1123 | case NEWT_KEY_LEFT: |
1124 | continue; | |
ed7e5662 ACM |
1125 | case NEWT_KEY_ESCAPE: |
1126 | if (!ui__dialog_yesno("Do you really want to exit?")) | |
1127 | continue; | |
1128 | /* Fall thru */ | |
7f0030b2 ACM |
1129 | case 'q': |
1130 | case CTRL('c'): | |
1131 | goto out; | |
d1b4f249 | 1132 | default: |
18eaf0b8 | 1133 | continue; |
d1b4f249 ACM |
1134 | } |
1135 | } | |
1136 | ||
7f0030b2 ACM |
1137 | out: |
1138 | ui_browser__hide(&menu->b); | |
1139 | return key; | |
1140 | } | |
1141 | ||
1142 | static int __perf_evlist__tui_browse_hists(struct perf_evlist *evlist, | |
81cce8de ACM |
1143 | const char *help, |
1144 | void(*timer)(void *arg), void *arg, | |
1145 | int delay_secs) | |
7f0030b2 ACM |
1146 | { |
1147 | struct perf_evsel *pos; | |
1148 | struct perf_evsel_menu menu = { | |
1149 | .b = { | |
1150 | .entries = &evlist->entries, | |
1151 | .refresh = ui_browser__list_head_refresh, | |
1152 | .seek = ui_browser__list_head_seek, | |
1153 | .write = perf_evsel_menu__write, | |
1154 | .nr_entries = evlist->nr_entries, | |
1155 | .priv = evlist, | |
1156 | }, | |
1157 | }; | |
1158 | ||
1159 | ui_helpline__push("Press ESC to exit"); | |
1160 | ||
1161 | list_for_each_entry(pos, &evlist->entries, node) { | |
1162 | const char *ev_name = event_name(pos); | |
1163 | size_t line_len = strlen(ev_name) + 7; | |
1164 | ||
1165 | if (menu.b.width < line_len) | |
1166 | menu.b.width = line_len; | |
1167 | /* | |
1168 | * Cache the evsel name, tracepoints have a _high_ cost per | |
1169 | * event_name() call. | |
1170 | */ | |
1171 | if (pos->name == NULL) | |
1172 | pos->name = strdup(ev_name); | |
1173 | } | |
1174 | ||
34958544 ACM |
1175 | return perf_evsel_menu__run(&menu, evlist->nr_entries, help, timer, |
1176 | arg, delay_secs); | |
7f0030b2 ACM |
1177 | } |
1178 | ||
81cce8de ACM |
1179 | int perf_evlist__tui_browse_hists(struct perf_evlist *evlist, const char *help, |
1180 | void(*timer)(void *arg), void *arg, | |
1181 | int delay_secs) | |
7f0030b2 ACM |
1182 | { |
1183 | ||
1184 | if (evlist->nr_entries == 1) { | |
1185 | struct perf_evsel *first = list_entry(evlist->entries.next, | |
1186 | struct perf_evsel, node); | |
1187 | const char *ev_name = event_name(first); | |
34958544 ACM |
1188 | return perf_evsel__hists_browse(first, evlist->nr_entries, help, |
1189 | ev_name, false, timer, arg, | |
1190 | delay_secs); | |
7f0030b2 ACM |
1191 | } |
1192 | ||
81cce8de ACM |
1193 | return __perf_evlist__tui_browse_hists(evlist, help, |
1194 | timer, arg, delay_secs); | |
d1b4f249 | 1195 | } |