• Home
  • Raw
  • Download

Lines Matching refs:row

103 static void hist_browser__gotorc(struct hist_browser *browser, int row, int column)  in hist_browser__gotorc()  argument
110 ui_browser__gotorc(&browser->b, row + header_offset, column); in hist_browser__gotorc()
674 unsigned short row,
680 unsigned short row, in hist_browser__show_callchain_entry() argument
689 if (ui_browser__is_current_entry(&browser->b, row)) { in hist_browser__show_callchain_entry()
696 hist_browser__gotorc(browser, row, 0); in hist_browser__show_callchain_entry()
706 unsigned short row __maybe_unused, in hist_browser__fprintf_callchain_entry()
716 unsigned short row);
719 unsigned short row) in hist_browser__check_output_full() argument
721 return browser->b.rows == row; in hist_browser__check_output_full()
725 unsigned short row __maybe_unused) in hist_browser__check_dump_full()
735 unsigned short row, u64 total, in hist_browser__show_callchain_list() argument
764 print(browser, chain, str, offset, row, arg); in hist_browser__show_callchain_list()
786 unsigned short row, u64 total, in hist_browser__show_callchain_flat() argument
793 int first_row = row, offset = LEVEL_OFFSET_STEP; in hist_browser__show_callchain_flat()
817 row += hist_browser__show_callchain_list(browser, child, in hist_browser__show_callchain_flat()
818 chain, row, total, in hist_browser__show_callchain_flat()
823 if (is_output_full(browser, row)) in hist_browser__show_callchain_flat()
840 row += hist_browser__show_callchain_list(browser, child, in hist_browser__show_callchain_flat()
841 chain, row, total, in hist_browser__show_callchain_flat()
846 if (is_output_full(browser, row)) in hist_browser__show_callchain_flat()
854 if (is_output_full(browser, row)) in hist_browser__show_callchain_flat()
859 return row - first_row; in hist_browser__show_callchain_flat()
890 unsigned short row, u64 total, in hist_browser__show_callchain_folded() argument
897 int first_row = row, offset = LEVEL_OFFSET_STEP; in hist_browser__show_callchain_folded()
960 print(browser, first_chain, chain_str, offset, row++, arg); in hist_browser__show_callchain_folded()
965 if (is_output_full(browser, row)) in hist_browser__show_callchain_folded()
970 return row - first_row; in hist_browser__show_callchain_folded()
975 unsigned short row, u64 total, in hist_browser__show_callchain_graph() argument
982 int first_row = row, offset = level * LEVEL_OFFSET_STEP; in hist_browser__show_callchain_graph()
1010 row += hist_browser__show_callchain_list(browser, child, in hist_browser__show_callchain_graph()
1011 chain, row, percent_total, in hist_browser__show_callchain_graph()
1016 if (is_output_full(browser, row)) in hist_browser__show_callchain_graph()
1026 row += hist_browser__show_callchain_graph(browser, &child->rb_root, in hist_browser__show_callchain_graph()
1027 new_level, row, total, in hist_browser__show_callchain_graph()
1031 if (is_output_full(browser, row)) in hist_browser__show_callchain_graph()
1036 return row - first_row; in hist_browser__show_callchain_graph()
1041 unsigned short row, in hist_browser__show_callchain() argument
1057 &entry->sorted_chain, row, in hist_browser__show_callchain()
1062 &entry->sorted_chain, row, in hist_browser__show_callchain()
1067 &entry->sorted_chain, level, row, in hist_browser__show_callchain()
1171 unsigned short row) in hist_browser__show_entry() argument
1176 bool current_entry = ui_browser__is_current_entry(&browser->b, row); in hist_browser__show_entry()
1199 hist_browser__gotorc(browser, row, 0); in hist_browser__show_entry()
1253 ++row; in hist_browser__show_entry()
1258 if (folded_sign == '-' && row != browser->b.rows) { in hist_browser__show_entry()
1264 printed += hist_browser__show_callchain(browser, entry, 1, row, in hist_browser__show_entry()
1274 unsigned short row, in hist_browser__show_hierarchy_entry() argument
1280 bool current_entry = ui_browser__is_current_entry(&browser->b, row); in hist_browser__show_hierarchy_entry()
1306 hist_browser__gotorc(browser, row, 0); in hist_browser__show_hierarchy_entry()
1420 ++row; in hist_browser__show_hierarchy_entry()
1424 if (entry->leaf && folded_sign == '-' && row != browser->b.rows) { in hist_browser__show_hierarchy_entry()
1430 level + 1, row, in hist_browser__show_hierarchy_entry()
1439 unsigned short row, int level) in hist_browser__show_no_entry() argument
1442 bool current_entry = ui_browser__is_current_entry(&browser->b, row); in hist_browser__show_no_entry()
1455 hist_browser__gotorc(browser, row, 0); in hist_browser__show_no_entry()
1687 unsigned row = 0; in hist_browser__refresh() local
1719 row += hist_browser__show_hierarchy_entry(hb, h, row, in hist_browser__refresh()
1721 if (row == browser->rows) in hist_browser__refresh()
1725 hist_browser__show_no_entry(hb, row, h->depth + 1); in hist_browser__refresh()
1726 row++; in hist_browser__refresh()
1729 row += hist_browser__show_entry(hb, h, row); in hist_browser__refresh()
1732 if (row == browser->rows) in hist_browser__refresh()
1736 return row + header_offset; in hist_browser__refresh()
3080 void *entry, int row) in perf_evsel_menu__write() argument
3086 bool current_entry = ui_browser__is_current_entry(browser, row); in perf_evsel_menu__write()