Lines Matching refs:row
365 unsigned short row,
370 int first_row = row, width, offset = level * LEVEL_OFFSET_STEP;
421 if (ui_browser__is_current_entry(&self->b, row)) {
428 ui_browser__gotorc(&self->b, row, 0);
434 if (++row == self->b.height)
443 row += hist_browser__show_callchain_node_rb_tree(self, child, new_total,
444 new_level, row, row_offset,
447 if (row == self->b.height)
452 return row - first_row;
457 int level, unsigned short row,
462 int first_row = row,
479 if (ui_browser__is_current_entry(&self->b, row)) {
486 ui_browser__gotorc(&self->b, row, 0);
492 if (++row == self->b.height)
497 row += hist_browser__show_callchain_node_rb_tree(self, node,
499 level + 1, row,
503 return row - first_row;
508 int level, unsigned short row,
513 int first_row = row;
518 row += hist_browser__show_callchain_node(self, node, level,
519 row, row_offset,
521 if (row == self->b.height)
525 return row - first_row;
530 unsigned short row)
537 bool current_entry = ui_browser__is_current_entry(&self->b, row);
566 ui_browser__gotorc(&self->b, row, 0);
572 ++row;
577 if (folded_sign == '-' && row != self->b.height) {
579 1, row, &row_offset,
590 unsigned row = 0;
603 row += hist_browser__show_entry(hb, h, row);
604 if (row == self->height)
608 return row;
1007 void *entry, int row)
1012 bool current_entry = ui_browser__is_current_entry(browser, row);
