Lines Matching refs:start_row

147   int start_row;
332 start_row(-1), end_row(-1), start_col(-1), end_col(-1), mod(m)
402 if (start_row != end_row)
405 printfs(".sp |\\n[%1]u\n", row_start_reg(start_row));
410 printfs(".sp |\\n[%1]u\n", row_start_reg(start_row));
412 row_start_reg(start_row));
416 row_start_reg(start_row));
553 block_width_reg(start_row, start_col));
561 block_width_reg(start_row, start_col));
564 printfs(".nr %1 0\n", block_width_reg(start_row, start_col));
583 block_width_reg(start_row, start_col));
629 if (start_row != end_row)
632 printfs(".sp |\\n[%1]u\n", row_start_reg(start_row));
637 printfs(".sp |\\n[%1]u\n", row_start_reg(start_row));
639 row_start_reg(start_row),
640 block_height_reg(start_row, start_col));
644 row_start_reg(start_row),
645 block_height_reg(start_row, start_col));
663 printfs(".di %1\n", block_diversion_name(start_row, start_col));
706 printfs(".nr %1 \\n[dn]\n", block_height_reg(start_row, start_col));
707 printfs(".nr %1 \\n[dl]\n", block_width_reg(start_row, start_col));
723 row_start_reg(start_row),
724 block_height_reg(start_row, start_col));
735 printfs(".%1\n", block_diversion_name(start_row, start_col));
749 block_width_reg(start_row, start_col));
750 printfs(".%1\n", block_diversion_name(start_row, start_col));
764 block_width_reg(start_row, start_col));
765 printfs(".%1\n", block_diversion_name(start_row, start_col));
787 printfs(".%1\n", block_diversion_name(start_row, start_col));
1092 int start_row;
1106 : next(p), start_row(sr), end_row(er), col(c), is_double(dbl)
1117 as_string(start_row));
1123 as_string(start_row),
1124 row_top_reg(start_row));
1143 row_top_reg(start_row),
1151 as_string(start_row));
1162 as_string(start_row),
1163 row_top_reg(start_row));
1184 row_top_reg(start_row),
1193 as_string(start_row));
1348 assert(e->start_row <= r && r <= e->end_row
1350 && e->end_row - e->start_row > 0
1358 if (e->start_row != r) {
1379 assert(e->start_row <= r && r <= e->end_row
1381 && e->end_row - e->start_row > 0
1461 && lefte->start_row == r
1473 && lefte->start_row == r
1593 e->start_row = e->end_row = r;
1616 for (i = p->start_row; i <= p->end_row; i++)
1654 if (e->start_row == e->end_row) {
1989 // by reverse order of start_row. This ensures that if we divide
2154 && entry[r][start_col]->start_row != r)
2160 || entry[r][end_col]->start_row == r);
2203 && entry[r][start_col]->start_row != r)
2209 || entry[r][end_col]->start_row == r);
2252 void table::compute_vrule_top_adjust(int start_row, int col, string &result)
2254 if (row_is_all_lines[start_row] && start_row < nrows - 1) {
2255 if (row_is_all_lines[start_row] == 2)
2259 start_row++;
2263 if (start_row == 0)
2265 for (stuff *p = stuff_list; p && p->row <= start_row; p = p->next)
2266 if (p->row == start_row
2272 table_entry *e = entry[start_row-1][col-1];
2273 if (e && e->start_row == e->end_row) {
2282 table_entry *e = entry[start_row-1][col];
2283 if (e && e->start_row == e->end_row) {
2290 if (row_is_all_lines[start_row-1] == 0) {
2299 else if (row_is_all_lines[start_row-1] == 2) {
2336 if (e && e->start_row == e->end_row) {
2346 if (e && e->start_row == e->end_row) {
2370 void table::add_vertical_rule(int start_row, int end_row, int col, int is_double)
2372 vrule_list = new vertical_rule(start_row, end_row, col, is_double,
2374 compute_vrule_top_adjust(start_row, col, vrule_list->top_adjust);
2383 int start_row = 0;
2385 while (start_row < nrows && vline_spanned(start_row, col))
2386 start_row++;
2387 if (start_row >= nrows)
2389 int end_row = start_row;
2393 add_vertical_rule(start_row, end_row, col, 0);
2394 start_row = end_row + 1;
2409 int start_row;
2410 for (start_row = end_row - 1;
2411 start_row >= 0
2412 && vline[start_row][col] == vline[end_row][col]
2413 && !vline_spanned(start_row, col);
2414 start_row--)
2416 start_row++;
2417 add_vertical_rule(start_row, end_row, col, vline[end_row][col] > 1);
2421 for (int r = p->start_row; r <= p->end_row; r++) {
2424 int is_corner = r == p->start_row || r == p->end_row;
2429 int is_corner = r == p->start_row || r == p->end_row;
2489 if (entry[r][i] && entry[r][i]->start_row != r)
2546 if (e->start_row < first_start_row)
2547 first_start_row = e->start_row;
2568 if (e->end_row == e->start_row)
2586 if (e->end_row == r && e->start_row == i) {
2608 if (e->end_row == r && e->start_row == i) {
2611 if (e->end_row != e->start_row) {