Home
last modified time | relevance | path

Searched refs:row (Results 1 – 14 of 14) sorted by relevance

/tools/perf/scripts/python/
Devent_analyzing_sample.py134 for row in commq:
135 print "%16s %8d %s" % (row[0], row[1], num2sym(row[1]))
140 for row in symbolq:
141 print "%32s %8d %s" % (row[0], row[1], num2sym(row[1]))
146 for row in dsoq:
147 print "%40s %8d %s" % (row[0], row[1], num2sym(row[1]))
167 for row in commq:
168 print "%16s %8d %s" % (row[0], row[1], num2sym(row[1]))
173 for row in symbolq:
174 print "%32s %8d %s" % (row[0], row[1], num2sym(row[1]))
[all …]
Dcall-graph-from-postgresql.py64 def __init__(self, db, row, parent_item): argument
66 self.row = row
115 def getChildItem(self, row): argument
116 return self.child_items[row]
122 return self.row
255 def index(self, row, column, parent): argument
260 child_item = parent_item.getChildItem(row)
261 return self.createIndex(row, column, child_item)
/tools/perf/ui/
Dbrowser.c158 int row = 0; in ui_browser__rb_tree_refresh() local
166 ui_browser__gotorc(browser, row, 0); in ui_browser__rb_tree_refresh()
167 browser->write(browser, nd, row); in ui_browser__rb_tree_refresh()
168 if (++row == browser->rows) in ui_browser__rb_tree_refresh()
173 return row; in ui_browser__rb_tree_refresh()
176 bool ui_browser__is_current_entry(struct ui_browser *browser, unsigned row) in ui_browser__is_current_entry() argument
178 return browser->top_idx + row == browser->index; in ui_browser__is_current_entry()
300 row = 0; in ui_browser__scrollbar_set() local
310 ui_browser__gotorc(browser, row++, col); in ui_browser__scrollbar_set()
320 int row; in __ui_browser__refresh() local
[all …]
Dbrowser.h24 void (*write)(struct ui_browser *browser, void *entry, int row);
35 bool ui_browser__is_current_entry(struct ui_browser *browser, unsigned row);
/tools/perf/ui/browsers/
Dhists.c115 static void hist_browser__gotorc(struct hist_browser *browser, int row, int column) in hist_browser__gotorc() argument
119 ui_browser__gotorc(&browser->b, row + header_offset, column); in hist_browser__gotorc()
522 unsigned short row,
528 unsigned short row, in hist_browser__show_callchain_entry() argument
537 if (ui_browser__is_current_entry(&browser->b, row)) { in hist_browser__show_callchain_entry()
544 hist_browser__gotorc(browser, row, 0); in hist_browser__show_callchain_entry()
554 unsigned short row __maybe_unused, in hist_browser__fprintf_callchain_entry()
564 unsigned short row);
567 unsigned short row) in hist_browser__check_output_full() argument
569 return browser->b.rows == row; in hist_browser__check_output_full()
[all …]
Dheader.c12 void *entry, int row) in ui_browser__argv_write() argument
17 bool current_entry = ui_browser__is_current_entry(browser, row); in ui_browser__argv_write()
Dmap.c20 static void map_browser__write(struct ui_browser *browser, void *nd, int row) in map_browser__write() argument
24 bool current_entry = ui_browser__is_current_entry(browser, row); in map_browser__write()
Dscripts.c76 void *entry, int row) in script_browser__write() argument
79 bool current_entry = ui_browser__is_current_entry(browser, row); in script_browser__write()
Dannotate.c111 static void annotate_browser__write(struct ui_browser *browser, void *entry, int row) in annotate_browser__write() argument
116 bool current_entry = ui_browser__is_current_entry(browser, row); in annotate_browser__write()
/tools/perf/ui/tui/
Dutil.c17 void *entry, int row) in ui_browser__argv_write() argument
20 bool current_entry = ui_browser__is_current_entry(browser, row); in ui_browser__argv_write()
/tools/perf/util/
Dsvghelper.h27 extern void svg_interrupt(u64 start, int row, const char *backtrace);
Dsvghelper.c582 void svg_interrupt(u64 start, int row, const char *backtrace) in svg_interrupt() argument
595 time2pixels(start), row * SLOT_MULT); in svg_interrupt()
597 time2pixels(start), row * SLOT_MULT + SLOT_HEIGHT); in svg_interrupt()
Dhist.c188 int row = 0; in hists__output_recalc_col_len() local
192 while (next && row++ < max_rows) { in hists__output_recalc_col_len()
/tools/power/cpupower/bench/
DREADME-BENCH35 will be run X time in a row (cycles):