1 /* PSPP - a program for statistical analysis.
2 Copyright (C) 2009, 2010, 2011, 2013, 2014, 2016 Free Software Foundation, Inc.
4 This program is free software: you can redistribute it and/or modify
5 it under the terms of the GNU General Public License as published by
6 the Free Software Foundation, either version 3 of the License, or
7 (at your option) any later version.
9 This program is distributed in the hope that it will be useful,
10 but WITHOUT ANY WARRANTY; without even the implied warranty of
11 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
12 GNU General Public License for more details.
14 You should have received a copy of the GNU General Public License
15 along with this program. If not, see <http://www.gnu.org/licenses/>. */
25 #include "libpspp/assertion.h"
26 #include "libpspp/hash-functions.h"
27 #include "libpspp/hmap.h"
28 #include "libpspp/pool.h"
29 #include "output/render.h"
30 #include "output/tab.h"
31 #include "output/table-item.h"
32 #include "output/table.h"
34 #include "gl/minmax.h"
35 #include "gl/xalloc.h"
38 #define _(msgid) gettext (msgid)
40 /* This file uses TABLE_HORZ and TABLE_VERT enough to warrant abbreviating. */
44 /* A layout for rendering a specific table on a specific device.
46 May represent the layout of an entire table presented to
47 render_page_create(), or a rectangular subregion of a table broken out using
48 render_break_next() to allow a table to be broken across multiple pages.
50 A page's size is not limited to the size passed in as part of render_params.
51 render_pager breaks a render_page into smaller render_pages that will fit in
52 the available space. */
55 const struct render_params *params; /* Parameters of the target device. */
56 struct table *table; /* Table rendered. */
59 /* Local copies of table->n and table->h, for convenience. */
61 int h[TABLE_N_AXES][2];
65 cp[H] represents x positions within the table.
67 cp[H][1] = the width of the leftmost vertical rule.
68 cp[H][2] = cp[H][1] + the width of the leftmost column.
69 cp[H][3] = cp[H][2] + the width of the second-from-left vertical rule.
71 cp[H][2 * nc] = x position of the rightmost vertical rule.
72 cp[H][2 * nc + 1] = total table width including all rules.
74 Similarly, cp[V] represents y positions within the table.
76 cp[V][1] = the height of the topmost horizontal rule.
77 cp[V][2] = cp[V][1] + the height of the topmost row.
78 cp[V][3] = cp[V][2] + the height of the second-from-top horizontal rule.
80 cp[V][2 * nr] = y position of the bottommost horizontal rule.
81 cp[V][2 * nr + 1] = total table height including all rules.
83 Rules and columns can have width or height 0, in which case consecutive
84 values in this array are equal. */
85 int *cp[TABLE_N_AXES];
87 /* render_break_next() can break a table such that some cells are not fully
88 contained within a render_page. This will happen if a cell is too wide
89 or two tall to fit on a single page, or if a cell spans multiple rows or
90 columns and the page only includes some of those rows or columns.
92 This hash table contains "struct render_overflow"s that represents each
93 such cell that doesn't completely fit on this page.
95 Each overflow cell borders at least one header edge of the table and may
96 border more. (A single table cell that is so large that it fills the
97 entire page can overflow on all four sides!) */
98 struct hmap overflows;
100 /* If a single column (or row) is too wide (or tall) to fit on a page
101 reasonably, then render_break_next() will split a single row or column
102 across multiple render_pages. This member indicates when this has
105 is_edge_cutoff[H][0] is true if pixels have been cut off the left side
106 of the leftmost column in this page, and false otherwise.
108 is_edge_cutoff[H][1] is true if pixels have been cut off the right side
109 of the rightmost column in this page, and false otherwise.
111 is_edge_cutoff[V][0] and is_edge_cutoff[V][1] are similar for the top
112 and bottom of the table.
114 The effect of is_edge_cutoff is to prevent rules along the edge in
115 question from being rendered.
117 When is_edge_cutoff is true for a given edge, the 'overflows' hmap will
118 contain a node for each cell along that edge. */
119 bool is_edge_cutoff[TABLE_N_AXES][2];
121 /* If part of a joined cell would be cut off by breaking a table along
122 'axis' at the rule with offset 'z' (where 0 <= z <= n[axis]), then
123 join_crossing[axis][z] is the thickness of the rule that would be cut
126 This is used to know to allocate extra space for breaking at such a
127 position, so that part of the cell's content is not lost.
129 This affects breaking a table only when headers are present. When
130 headers are not present, the rule's thickness is used for cell content,
131 so no part of the cell's content is lost (and in fact it is duplicated
132 across both pages). */
133 int *join_crossing[TABLE_N_AXES];
136 static struct render_page *render_page_create (const struct render_params *,
139 struct render_page *render_page_ref (const struct render_page *page_);
140 static void render_page_unref (struct render_page *);
142 /* Returns the offset in struct render_page's cp[axis] array of the rule with
143 index RULE_IDX. That is, if RULE_IDX is 0, then the offset is that of the
144 leftmost or topmost rule; if RULE_IDX is 1, then the offset is that of the
145 next rule to the right (or below); and so on. */
147 rule_ofs (int rule_idx)
152 /* Returns the offset in struct render_page's cp[axis] array of the rule with
153 index RULE_IDX_R, which counts from the right side (or bottom) of the page
154 left (or up), according to whether AXIS is H or V, respectively. That is,
155 if RULE_IDX_R is 0, then the offset is that of the rightmost or bottommost
156 rule; if RULE_IDX is 1, then the offset is that of the next rule to the left
157 (or above); and so on. */
159 rule_ofs_r (const struct render_page *page, int axis, int rule_idx_r)
161 return (page->n[axis] - rule_idx_r) * 2;
164 /* Returns the offset in struct render_page's cp[axis] array of the cell with
165 index CELL_IDX. That is, if CELL_IDX is 0, then the offset is that of the
166 leftmost or topmost cell; if CELL_IDX is 1, then the offset is that of the
167 next cell to the right (or below); and so on. */
169 cell_ofs (int cell_idx)
171 return cell_idx * 2 + 1;
174 /* Returns the width of PAGE along AXIS from OFS0 to OFS1, exclusive. */
176 axis_width (const struct render_page *page, int axis, int ofs0, int ofs1)
178 return page->cp[axis][ofs1] - page->cp[axis][ofs0];
181 /* Returns the width of the headers in PAGE along AXIS. */
183 headers_width (const struct render_page *page, int axis)
185 int h0 = page->h[axis][0];
186 int w0 = axis_width (page, axis, rule_ofs (0), cell_ofs (h0));
187 int n = page->n[axis];
188 int h1 = page->h[axis][1];
189 int w1 = axis_width (page, axis, rule_ofs_r (page, axis, h1), cell_ofs (n));
193 /* Returns the width of cell X along AXIS in PAGE. */
195 cell_width (const struct render_page *page, int axis, int x)
197 return axis_width (page, axis, cell_ofs (x), cell_ofs (x) + 1);
200 /* Returns the width of rule X along AXIS in PAGE. */
202 rule_width (const struct render_page *page, int axis, int x)
204 return axis_width (page, axis, rule_ofs (x), rule_ofs (x) + 1);
207 /* Returns the width of rule X along AXIS in PAGE. */
209 rule_width_r (const struct render_page *page, int axis, int x)
211 int ofs = rule_ofs_r (page, axis, x);
212 return axis_width (page, axis, ofs, ofs + 1);
215 /* Returns the width of cells X0 through X1, exclusive, along AXIS in PAGE. */
217 joined_width (const struct render_page *page, int axis, int x0, int x1)
219 return axis_width (page, axis, cell_ofs (x0), cell_ofs (x1) - 1);
222 /* Returns the width of the widest cell, excluding headers, along AXIS in
225 max_cell_width (const struct render_page *page, int axis)
227 int n = page->n[axis];
228 int x0 = page->h[axis][0];
229 int x1 = n - page->h[axis][1];
233 for (x = x0; x < x1; x++)
235 int w = cell_width (page, axis, x);
242 /* A cell that doesn't completely fit on the render_page. */
243 struct render_overflow
245 struct hmap_node node; /* In render_page's 'overflows' hmap. */
247 /* Occupied region of page.
249 d[H][0] is the leftmost column.
250 d[H][1] is the rightmost column, plus 1.
251 d[V][0] is the top row.
252 d[V][1] is the bottom row, plus 1.
254 The cell in its original table might occupy a larger region. This
255 member reflects the size of the cell in the current render_page, after
256 trimming off any rows or columns due to page-breaking. */
259 /* The space that has been trimmed off the cell:
261 overflow[H][0]: space trimmed off its left side.
262 overflow[H][1]: space trimmed off its right side.
263 overflow[V][0]: space trimmed off its top.
264 overflow[V][1]: space trimmed off its bottom.
266 During rendering, this information is used to position the rendered
267 portion of the cell within the available space.
269 When a cell is rendered, sometimes it is permitted to spill over into
270 space that is ordinarily reserved for rules. Either way, this space is
271 still included in overflow values.
273 Suppose, for example, that a cell that joins 2 columns has a width of 60
274 pixels and content "abcdef", that the 2 columns that it joins have
275 widths of 20 and 30 pixels, respectively, and that therefore the rule
276 between the two joined columns has a width of 10 (20 + 10 + 30 = 60).
277 It might render like this, if each character is 10x10, and showing a few
278 extra table cells for context:
286 If this render_page is broken at the rule that separates "gh" from
287 "ijk", then the page that contains the left side of the "abcdef" cell
288 will have overflow[H][1] of 10 + 30 = 40 for its portion of the cell,
289 and the page that contains the right side of the cell will have
290 overflow[H][0] of 20 + 10 = 30. The two resulting pages would look like
308 int overflow[TABLE_N_AXES][2];
311 /* Returns a hash value for (,Y). */
313 hash_cell (int x, int y)
315 return hash_int (x + (y << 16), 0);
318 /* Searches PAGE's set of render_overflow for one whose top-left cell is
319 (X,Y). Returns it, if there is one, otherwise a null pointer. */
320 static const struct render_overflow *
321 find_overflow (const struct render_page *page, int x, int y)
323 if (!hmap_is_empty (&page->overflows))
325 const struct render_overflow *of;
327 HMAP_FOR_EACH_WITH_HASH (of, struct render_overflow, node,
328 hash_cell (x, y), &page->overflows)
329 if (x == of->d[H] && y == of->d[V])
336 /* Row or column dimensions. Used to figure the size of a table in
337 render_page_create() and discarded after that. */
340 /* Width without considering rows (or columns) that span more than one (or
344 /* Width taking spanned rows (or columns) into consideration. */
348 /* Modifies the 'width' members of the N elements of ROWS so that their sum,
349 when added to rule widths RULES[1] through RULES[N - 1] inclusive, is at
352 distribute_spanned_width (int width,
353 struct render_row *rows, const int *rules, int n)
355 /* Sum up the unspanned widths of the N rows for use as weights. */
356 int total_unspanned = 0;
357 for (int x = 0; x < n; x++)
358 total_unspanned += rows[x].unspanned;
359 for (int x = 0; x < n - 1; x++)
360 total_unspanned += rules[x + 1];
361 if (total_unspanned >= width)
364 /* The algorithm used here is based on the following description from HTML 4:
366 For cells that span multiple columns, a simple approach consists of
367 apportioning the min/max widths evenly to each of the constituent
368 columns. A slightly more complex approach is to use the min/max
369 widths of unspanned cells to weight how spanned widths are
370 apportioned. Experiments suggest that a blend of the two approaches
371 gives good results for a wide range of tables.
373 We blend the two approaches half-and-half, except that we cannot use the
374 unspanned weights when 'total_unspanned' is 0 (because that would cause a
377 The calculation we want to do is this:
380 w1 = width * (column's unspanned width) / (total unspanned width)
381 (column's width) = (w0 + w1) / 2
383 We implement it as a precise calculation in integers by multiplying w0 and
384 w1 by the common denominator of all three calculations (d), dividing that
385 out in the column width calculation, and then keeping the remainder for
388 (We actually compute the unspanned width of a column as twice the
389 unspanned width, plus the width of the rule on the left, plus the width of
390 the rule on the right. That way each rule contributes to both the cell on
391 its left and on its right.)
393 long long int d0 = n;
394 long long int d1 = 2LL * MAX (total_unspanned, 1);
395 long long int d = d0 * d1;
396 if (total_unspanned > 0)
398 long long int w = d / 2;
399 for (int x = 0; x < n; x++)
402 if (total_unspanned > 0)
404 long long int unspanned = rows[x].unspanned * 2LL;
406 unspanned += rules[x + 1];
408 unspanned += rules[x];
409 w += width * unspanned * d0;
412 rows[x].width = MAX (rows[x].width, w / d);
413 w -= rows[x].width * d;
417 /* Initializes PAGE->cp[AXIS] from the row widths in ROWS and the rule widths
420 accumulate_row_widths (const struct render_page *page, enum table_axis axis,
421 const struct render_row *rows, const int *rules)
423 int n = page->n[axis];
429 for (z = 0; z < n; z++)
431 cp[1] = cp[0] + rules[z];
432 cp[2] = cp[1] + rows[z].width;
435 cp[1] = cp[0] + rules[n];
438 /* Returns the sum of widths of the N ROWS and N+1 RULES. */
440 calculate_table_width (int n, const struct render_row *rows, int *rules)
446 for (x = 0; x < n; x++)
447 width += rows[x].width;
448 for (x = 0; x <= n; x++)
454 /* Rendering utility functions. */
456 /* Returns the line style to use for drawing a rule of the given TYPE. */
457 static enum render_line_style
458 rule_to_render_type (unsigned char type)
463 return RENDER_LINE_NONE;
465 return RENDER_LINE_SINGLE;
467 return RENDER_LINE_DASHED;
469 return RENDER_LINE_THICK;
471 return RENDER_LINE_THIN;
473 return RENDER_LINE_DOUBLE;
479 /* Returns the width of the rule in TABLE that is at offset Z along axis A, if
480 rendered with PARAMS. */
482 measure_rule (const struct render_params *params, const struct table *table,
483 enum table_axis a, int z)
485 enum table_axis b = !a;
489 /* Determine all types of rules that are present, as a bitmap in 'rules'
490 where rule type 't' is present if bit 2**t is set. */
491 struct cell_color color;
494 for (d[b] = 0; d[b] < table->n[b]; d[b]++)
495 rules |= 1u << table_get_rule (table, a, d[H], d[V], &color);
497 /* Turn off TAL_NONE because it has width 0 and we needn't bother. However,
498 if the device doesn't support margins, make sure that there is at least a
499 small gap between cells (but we don't need any at the left or right edge
501 if (rules & (1u << TAL_NONE))
503 rules &= ~(1u << TAL_NONE);
504 if (z > 0 && z < table->n[a] && !params->supports_margins && a == H)
505 rules |= 1u << TAL_SOLID;
508 /* Calculate maximum width of the rules that are present. */
510 for (size_t i = 0; i < N_LINES; i++)
511 if (rules & (1u << i))
512 width = MAX (width, params->line_widths[a][rule_to_render_type (i)]);
516 /* Allocates and returns a new render_page using PARAMS and TABLE. Allocates
517 space for all of the members of the new page, but the caller must initialize
518 the 'cp' member itself. */
519 static struct render_page *
520 render_page_allocate (const struct render_params *params,
523 struct render_page *page;
526 page = xmalloc (sizeof *page);
527 page->params = params;
530 page->n[H] = table->n[H];
531 page->n[V] = table->n[V];
532 page->h[H][0] = table->h[H][0];
533 page->h[H][1] = table->h[H][1];
534 page->h[V][0] = table->h[V][0];
535 page->h[V][1] = table->h[V][1];
537 for (i = 0; i < TABLE_N_AXES; i++)
539 page->cp[i] = xmalloc ((2 * page->n[i] + 2) * sizeof *page->cp[i]);
540 page->join_crossing[i] = xzalloc ((page->n[i] + 1) * sizeof *page->join_crossing[i]);
543 hmap_init (&page->overflows);
544 memset (page->is_edge_cutoff, 0, sizeof page->is_edge_cutoff);
549 /* Allocates and returns a new render_page for PARAMS and TABLE, initializing
550 cp[H] in the new page from ROWS and RULES. The caller must still initialize
552 static struct render_page *
553 create_page_with_exact_widths (const struct render_params *params,
555 const struct render_row *rows, int *rules)
557 struct render_page *page = render_page_allocate (params, table);
558 accumulate_row_widths (page, H, rows, rules);
562 /* Allocates and returns a new render_page for PARAMS and TABLE.
564 Initializes cp[H] in the new page by setting the width of each row 'i' to
565 somewhere between the minimum cell width ROW_MIN[i].width and the maximum
566 ROW_MAX[i].width. Sets the width of rules to those in RULES.
568 W_MIN is the sum of ROWS_MIN[].width.
570 W_MAX is the sum of ROWS_MAX[].width.
572 The caller must still initialize cp[V]. */
573 static struct render_page *
574 create_page_with_interpolated_widths (const struct render_params *params,
576 const struct render_row *rows_min,
577 const struct render_row *rows_max,
578 int w_min, int w_max, const int *rules)
580 const int n = table->n[H];
581 const long long int avail = params->size[H] - w_min;
582 const long long int wanted = w_max - w_min;
586 struct render_page *page = render_page_allocate (params, table);
588 int *cph = page->cp[H];
590 long long int w = wanted / 2;
591 for (int x = 0; x < n; x++)
593 w += avail * (rows_max[x].width - rows_min[x].width);
594 int extra = w / wanted;
597 cph[1] = cph[0] + rules[x];
598 cph[2] = cph[1] + rows_min[x].width + extra;
601 cph[1] = cph[0] + rules[n];
603 assert (page->cp[H][n * 2 + 1] == params->size[H]);
609 set_join_crossings (struct render_page *page, enum table_axis axis,
610 const struct table_cell *cell, int *rules)
614 for (z = cell->d[axis][0] + 1; z <= cell->d[axis][1] - 1; z++)
615 page->join_crossing[axis][z] = rules[z];
618 /* Creates and returns a new render_page for rendering TABLE on a device
621 The new render_page will be suitable for rendering on a device whose page
622 size is PARAMS->size, but the caller is responsible for actually breaking it
623 up to fit on such a device, using the render_break abstraction. */
624 static struct render_page *
625 render_page_create (const struct render_params *params, struct table *table)
627 struct render_page *page;
629 struct render_row *columns[2];
630 struct render_row *rows;
632 int *rules[TABLE_N_AXES];
636 enum table_axis axis;
638 nc = table_nc (table);
639 nr = table_nr (table);
641 /* Figure out rule widths. */
642 for (axis = 0; axis < TABLE_N_AXES; axis++)
644 int n = table->n[axis] + 1;
647 rules[axis] = xnmalloc (n, sizeof *rules);
648 for (z = 0; z < n; z++)
649 rules[axis][z] = measure_rule (params, table, axis, z);
652 /* Calculate minimum and maximum widths of cells that do not
653 span multiple columns. */
654 for (i = 0; i < 2; i++)
655 columns[i] = xzalloc (nc * sizeof *columns[i]);
656 for (y = 0; y < nr; y++)
657 for (x = 0; x < nc; )
659 struct table_cell cell;
661 table_get_cell (table, x, y, &cell);
662 if (y == cell.d[V][0])
664 if (table_cell_colspan (&cell) == 1)
669 params->measure_cell_width (params->aux, &cell,
671 for (i = 0; i < 2; i++)
672 if (columns[i][x].unspanned < w[i])
673 columns[i][x].unspanned = w[i];
677 table_cell_free (&cell);
680 /* Distribute widths of spanned columns. */
681 for (i = 0; i < 2; i++)
682 for (x = 0; x < nc; x++)
683 columns[i][x].width = columns[i][x].unspanned;
684 for (y = 0; y < nr; y++)
685 for (x = 0; x < nc; )
687 struct table_cell cell;
689 table_get_cell (table, x, y, &cell);
690 if (y == cell.d[V][0] && table_cell_colspan (&cell) > 1)
694 params->measure_cell_width (params->aux, &cell, &w[MIN], &w[MAX]);
695 for (i = 0; i < 2; i++)
696 distribute_spanned_width (w[i], &columns[i][cell.d[H][0]],
697 rules[H], table_cell_colspan (&cell));
700 table_cell_free (&cell);
703 /* In pathological cases, spans can cause the minimum width of a column to
704 exceed the maximum width. This bollixes our interpolation algorithm
705 later, so fix it up. */
706 for (i = 0; i < nc; i++)
707 if (columns[MIN][i].width > columns[MAX][i].width)
708 columns[MAX][i].width = columns[MIN][i].width;
710 /* Decide final column widths. */
711 for (i = 0; i < 2; i++)
712 table_widths[i] = calculate_table_width (table_nc (table),
713 columns[i], rules[H]);
714 if (table_widths[MAX] <= params->size[H])
716 /* Fits even with maximum widths. Use them. */
717 page = create_page_with_exact_widths (params, table, columns[MAX],
720 else if (table_widths[MIN] <= params->size[H])
722 /* Fits with minimum widths, so distribute the leftover space. */
723 page = create_page_with_interpolated_widths (
724 params, table, columns[MIN], columns[MAX],
725 table_widths[MIN], table_widths[MAX], rules[H]);
729 /* Doesn't fit even with minimum widths. Assign minimums for now, and
730 later we can break it horizontally into multiple pages. */
731 page = create_page_with_exact_widths (params, table, columns[MIN],
735 /* Calculate heights of cells that do not span multiple rows. */
736 rows = xzalloc (nr * sizeof *rows);
737 for (y = 0; y < nr; y++)
739 for (x = 0; x < nc; )
741 struct render_row *r = &rows[y];
742 struct table_cell cell;
744 table_get_cell (table, x, y, &cell);
745 if (y == cell.d[V][0])
747 if (table_cell_rowspan (&cell) == 1)
749 int w = joined_width (page, H, cell.d[H][0], cell.d[H][1]);
750 int h = params->measure_cell_height (params->aux, &cell, w);
751 if (h > r->unspanned)
752 r->unspanned = r->width = h;
755 set_join_crossings (page, V, &cell, rules[V]);
757 if (table_cell_colspan (&cell) > 1)
758 set_join_crossings (page, H, &cell, rules[H]);
761 table_cell_free (&cell);
764 for (i = 0; i < 2; i++)
767 /* Distribute heights of spanned rows. */
768 for (y = 0; y < nr; y++)
769 for (x = 0; x < nc; )
771 struct table_cell cell;
773 table_get_cell (table, x, y, &cell);
774 if (y == cell.d[V][0] && table_cell_rowspan (&cell) > 1)
776 int w = joined_width (page, H, cell.d[H][0], cell.d[H][1]);
777 int h = params->measure_cell_height (params->aux, &cell, w);
778 distribute_spanned_width (h, &rows[cell.d[V][0]], rules[V],
779 table_cell_rowspan (&cell));
782 table_cell_free (&cell);
785 /* Decide final row heights. */
786 accumulate_row_widths (page, V, rows, rules[V]);
789 /* Measure headers. If they are "too big", get rid of them. */
790 for (axis = 0; axis < TABLE_N_AXES; axis++)
792 int hw = headers_width (page, axis);
793 if (hw * 2 >= page->params->size[axis]
794 || hw + max_cell_width (page, axis) > page->params->size[axis])
796 page->table = table_unshare (page->table);
797 page->table->h[axis][0] = page->table->h[axis][1] = 0;
798 page->h[axis][0] = page->h[axis][1] = 0;
808 /* Increases PAGE's reference count. */
810 render_page_ref (const struct render_page *page_)
812 struct render_page *page = CONST_CAST (struct render_page *, page_);
817 /* Decreases PAGE's reference count and destroys PAGE if this causes the
818 reference count to fall to zero. */
820 render_page_unref (struct render_page *page)
822 if (page != NULL && --page->ref_cnt == 0)
825 struct render_overflow *overflow, *next;
827 HMAP_FOR_EACH_SAFE (overflow, next, struct render_overflow, node,
830 hmap_destroy (&page->overflows);
832 table_unref (page->table);
834 for (i = 0; i < TABLE_N_AXES; ++i)
836 free (page->join_crossing[i]);
844 /* Returns the size of PAGE along AXIS. (This might be larger than the page
845 size specified in the parameters passed to render_page_create(). Use a
846 render_break to break up a render_page into page-sized chunks.) */
848 render_page_get_size (const struct render_page *page, enum table_axis axis)
850 return page->cp[axis][page->n[axis] * 2 + 1];
854 render_page_get_best_breakpoint (const struct render_page *page, int height)
858 /* If there's no room for at least the top row and the rules above and below
859 it, don't include any of the table. */
860 if (page->cp[V][3] > height)
863 /* Otherwise include as many rows and rules as we can. */
864 for (y = 5; y <= 2 * page->n[V] + 1; y += 2)
865 if (page->cp[V][y] > height)
866 return page->cp[V][y - 2];
870 /* Drawing render_pages. */
872 static inline enum render_line_style
873 get_rule (const struct render_page *page, enum table_axis axis,
874 const int d[TABLE_N_AXES], struct cell_color *color)
876 return rule_to_render_type (table_get_rule (page->table,
877 axis, d[H] / 2, d[V] / 2,
888 render_direction_rtl (void)
890 /* TRANSLATORS: Do not translate this string. If the script of your language
891 reads from right to left (eg Persian, Arabic, Hebrew etc), then replace
892 this string with "output-direction-rtl". Otherwise either leave it
893 untranslated or copy it verbatim. */
894 const char *dir = _("output-direction-ltr");
895 if ( 0 == strcmp ("output-direction-rtl", dir))
898 if ( 0 != strcmp ("output-direction-ltr", dir))
899 fprintf (stderr, "This localisation has been incorrectly translated. Complain to the translator.\n");
905 render_rule (const struct render_page *page, const int ofs[TABLE_N_AXES],
906 const int d[TABLE_N_AXES])
908 enum render_line_style styles[TABLE_N_AXES][2];
909 struct cell_color colors[TABLE_N_AXES][2];
912 for (a = 0; a < TABLE_N_AXES; a++)
914 enum table_axis b = !a;
916 styles[a][0] = styles[a][1] = RENDER_LINE_NONE;
919 || (page->is_edge_cutoff[a][0] && d[a] == 0)
920 || (page->is_edge_cutoff[a][1] && d[a] == page->n[a] * 2))
931 styles[a][0] = get_rule (page, a, e, &colors[a][0]);
934 if (d[b] / 2 < page->table->n[b])
935 styles[a][1] = get_rule (page, a, d, &colors[a][1]);
939 styles[a][0] = styles[a][1] = get_rule (page, a, d, &colors[a][0]);
940 colors[a][1] = colors[a][0];
944 if (styles[H][0] != RENDER_LINE_NONE || styles[H][1] != RENDER_LINE_NONE
945 || styles[V][0] != RENDER_LINE_NONE || styles[V][1] != RENDER_LINE_NONE)
947 int bb[TABLE_N_AXES][2];
949 bb[H][0] = ofs[H] + page->cp[H][d[H]];
950 bb[H][1] = ofs[H] + page->cp[H][d[H] + 1];
951 if (render_direction_rtl ())
954 bb[H][0] = render_page_get_size (page, H) - bb[H][1];
955 bb[H][1] = render_page_get_size (page, H) - temp;
957 bb[V][0] = ofs[V] + page->cp[V][d[V]];
958 bb[V][1] = ofs[V] + page->cp[V][d[V] + 1];
959 page->params->draw_line (page->params->aux, bb, styles, colors);
964 render_cell (const struct render_page *page, const int ofs[TABLE_N_AXES],
965 const struct table_cell *cell)
967 const struct render_overflow *of;
968 int bb[TABLE_N_AXES][2];
969 int clip[TABLE_N_AXES][2];
971 bb[H][0] = clip[H][0] = ofs[H] + page->cp[H][cell->d[H][0] * 2 + 1];
972 bb[H][1] = clip[H][1] = ofs[H] + page->cp[H][cell->d[H][1] * 2];
973 if (render_direction_rtl ())
976 bb[H][0] = clip[H][0] = render_page_get_size (page, H) - bb[H][1];
977 bb[H][1] = clip[H][1] = render_page_get_size (page, H) - temp;
979 bb[V][0] = clip[V][0] = ofs[V] + page->cp[V][cell->d[V][0] * 2 + 1];
980 bb[V][1] = clip[V][1] = ofs[V] + page->cp[V][cell->d[V][1] * 2];
982 int valign = (cell->n_contents
983 ? cell->contents->options & TAB_VALIGN
985 if (valign != TAB_TOP)
987 int height = page->params->measure_cell_height (
988 page->params->aux, cell, bb[H][1] - bb[H][0]);
989 int extra = bb[V][1] - bb[V][0] - height;
992 if (valign == TAB_MIDDLE)
998 of = find_overflow (page, cell->d[H][0], cell->d[V][0]);
1001 enum table_axis axis;
1003 for (axis = 0; axis < TABLE_N_AXES; axis++)
1005 if (of->overflow[axis][0])
1007 bb[axis][0] -= of->overflow[axis][0];
1008 if (cell->d[axis][0] == 0 && !page->is_edge_cutoff[axis][0])
1009 clip[axis][0] = ofs[axis] + page->cp[axis][cell->d[axis][0] * 2];
1011 if (of->overflow[axis][1])
1013 bb[axis][1] += of->overflow[axis][1];
1014 if (cell->d[axis][1] == page->n[axis] && !page->is_edge_cutoff[axis][1])
1015 clip[axis][1] = ofs[axis] + page->cp[axis][cell->d[axis][1] * 2 + 1];
1020 int spill[TABLE_N_AXES][2];
1021 for (enum table_axis axis = 0; axis < TABLE_N_AXES; axis++)
1023 spill[axis][0] = rule_width (page, axis, cell->d[axis][0]) / 2;
1024 spill[axis][1] = rule_width (page, axis, cell->d[axis][1]) / 2;
1027 page->params->draw_cell (page->params->aux, cell, bb, spill, clip);
1030 /* Draws the cells of PAGE indicated in BB. */
1032 render_page_draw_cells (const struct render_page *page,
1033 int ofs[TABLE_N_AXES], int bb[TABLE_N_AXES][2])
1035 for (int y = bb[V][0]; y < bb[V][1]; y++)
1036 for (int x = bb[H][0]; x < bb[H][1]; )
1037 if (!is_rule (x) && !is_rule (y))
1039 struct table_cell cell;
1041 table_get_cell (page->table, x / 2, y / 2, &cell);
1042 if (y / 2 == bb[V][0] / 2 || y / 2 == cell.d[V][0])
1043 render_cell (page, ofs, &cell);
1044 x = rule_ofs (cell.d[H][1]);
1045 table_cell_free (&cell);
1050 for (int y = bb[V][0]; y < bb[V][1]; y++)
1051 for (int x = bb[H][0]; x < bb[H][1]; x++)
1052 if (is_rule (x) || is_rule (y))
1054 int d[TABLE_N_AXES];
1057 render_rule (page, ofs, d);
1061 /* Renders PAGE, by calling the 'draw_line' and 'draw_cell' functions from the
1062 render_params provided to render_page_create(). */
1064 render_page_draw (const struct render_page *page, int ofs[TABLE_N_AXES])
1066 int bb[TABLE_N_AXES][2];
1069 bb[H][1] = page->n[H] * 2 + 1;
1071 bb[V][1] = page->n[V] * 2 + 1;
1073 render_page_draw_cells (page, ofs, bb);
1076 /* Returns the greatest value i, 0 <= i < n, such that cp[i] <= x0. */
1078 get_clip_min_extent (int x0, const int cp[], int n)
1080 int low, high, best;
1087 int middle = low + (high - low) / 2;
1089 if (cp[middle] <= x0)
1101 /* Returns the least value i, 0 <= i < n, such that cp[i] >= x1. */
1103 get_clip_max_extent (int x1, const int cp[], int n)
1105 int low, high, best;
1112 int middle = low + (high - low) / 2;
1114 if (cp[middle] >= x1)
1115 best = high = middle;
1120 while (best > 0 && cp[best - 1] == cp[best])
1126 /* Renders the cells of PAGE that intersect (X,Y)-(X+W,Y+H), by calling the
1127 'draw_line' and 'draw_cell' functions from the render_params provided to
1128 render_page_create(). */
1130 render_page_draw_region (const struct render_page *page,
1131 int ofs[TABLE_N_AXES], int clip[TABLE_N_AXES][2])
1133 int bb[TABLE_N_AXES][2];
1135 bb[H][0] = get_clip_min_extent (clip[H][0], page->cp[H], page->n[H] * 2 + 1);
1136 bb[H][1] = get_clip_max_extent (clip[H][1], page->cp[H], page->n[H] * 2 + 1);
1137 bb[V][0] = get_clip_min_extent (clip[V][0], page->cp[V], page->n[V] * 2 + 1);
1138 bb[V][1] = get_clip_max_extent (clip[V][1], page->cp[V], page->n[V] * 2 + 1);
1140 render_page_draw_cells (page, ofs, bb);
1143 /* Breaking up tables to fit on a page. */
1145 /* An iterator for breaking render_pages into smaller chunks. */
1148 struct render_page *page; /* Page being broken up. */
1149 enum table_axis axis; /* Axis along which 'page' is being broken. */
1150 int z; /* Next cell along 'axis'. */
1151 int pixel; /* Pixel offset within cell 'z' (usually 0). */
1152 int hw; /* Width of headers of 'page' along 'axis'. */
1155 static int needed_size (const struct render_break *, int cell);
1156 static bool cell_is_breakable (const struct render_break *, int cell);
1157 static struct render_page *render_page_select (const struct render_page *,
1162 /* Initializes render_break B for breaking PAGE along AXIS.
1163 Takes ownership of PAGE. */
1165 render_break_init (struct render_break *b, struct render_page *page,
1166 enum table_axis axis)
1170 b->z = page->h[axis][0];
1172 b->hw = headers_width (page, axis);
1175 /* Initializes B as a render_break structure for which
1176 render_break_has_next() always returns false. */
1178 render_break_init_empty (struct render_break *b)
1181 b->axis = TABLE_HORZ;
1187 /* Frees B and unrefs the render_page that it owns. */
1189 render_break_destroy (struct render_break *b)
1193 render_page_unref (b->page);
1198 /* Returns true if B still has cells that are yet to be returned,
1199 false if all of B's page has been processed. */
1201 render_break_has_next (const struct render_break *b)
1203 const struct render_page *page = b->page;
1204 enum table_axis axis = b->axis;
1206 return page != NULL && b->z < page->n[axis] - page->h[axis][1];
1209 /* Returns a new render_page that is up to SIZE pixels wide along B's axis.
1210 Returns a null pointer if B has already been completely broken up, or if
1211 SIZE is too small to reasonably render any cells. The latter will never
1212 happen if SIZE is at least as large as the page size passed to
1213 render_page_create() along B's axis. */
1214 static struct render_page *
1215 render_break_next (struct render_break *b, int size)
1217 const struct render_page *page = b->page;
1218 enum table_axis axis = b->axis;
1219 struct render_page *subpage;
1222 if (!render_break_has_next (b))
1226 for (z = b->z; z < page->n[axis] - page->h[axis][1]; z++)
1228 int needed = needed_size (b, z + 1);
1231 if (cell_is_breakable (b, z))
1233 /* If there is no right header and we render a partial cell on
1234 the right side of the body, then we omit the rightmost rule of
1235 the body. Otherwise the rendering is deceptive because it
1236 looks like the whole cell is present instead of a partial
1239 This is similar to code for the left side in needed_size(). */
1240 int rule_allowance = (page->h[axis][1]
1242 : rule_width (page, axis, z));
1244 /* The amount that, if we added cell 'z', the rendering would
1245 overfill the allocated 'size'. */
1246 int overhang = needed - size - rule_allowance;
1248 /* The width of cell 'z'. */
1249 int cell_size = cell_width (page, axis, z);
1251 /* The amount trimmed off the left side of 'z',
1252 and the amount left to render. */
1253 int cell_ofs = z == b->z ? b->pixel : 0;
1254 int cell_left = cell_size - cell_ofs;
1256 /* A small but visible width. */
1257 int em = page->params->font_size[axis];
1259 /* If some of the cell remains to render,
1260 and there would still be some of the cell left afterward,
1261 then partially render that much of the cell. */
1262 pixel = (cell_left && cell_left > overhang
1263 ? cell_left - overhang + cell_ofs
1266 /* If there would be only a tiny amount of the cell left after
1267 rendering it partially, reduce the amount rendered slightly
1268 to make the output look a little better. */
1269 if (pixel + em > cell_size)
1270 pixel = MAX (pixel - em, 0);
1272 /* If we're breaking vertically, then consider whether the cells
1273 being broken have a better internal breakpoint than the exact
1274 number of pixels available, which might look bad e.g. because
1275 it breaks in the middle of a line of text. */
1276 if (axis == TABLE_VERT && page->params->adjust_break)
1280 for (x = 0; x < page->n[H]; )
1282 struct table_cell cell;
1286 table_get_cell (page->table, x, z, &cell);
1287 w = joined_width (page, H, cell.d[H][0], cell.d[H][1]);
1288 better_pixel = page->params->adjust_break (
1289 page->params->aux, &cell, w, pixel);
1291 table_cell_free (&cell);
1293 if (better_pixel < pixel)
1295 if (better_pixel > (z == b->z ? b->pixel : 0))
1297 pixel = better_pixel;
1300 else if (better_pixel == 0 && z != b->z)
1313 if (z == b->z && !pixel)
1316 subpage = render_page_select (page, axis, b->z, b->pixel,
1318 pixel ? cell_width (page, axis, z) - pixel
1325 /* Returns the width that would be required along B's axis to render a page
1326 from B's current position up to but not including CELL. */
1328 needed_size (const struct render_break *b, int cell)
1330 const struct render_page *page = b->page;
1331 enum table_axis axis = b->axis;
1334 /* Width of left header not including its rightmost rule. */
1335 size = axis_width (page, axis, 0, rule_ofs (page->h[axis][0]));
1337 /* If we have a pixel offset and there is no left header, then we omit the
1338 leftmost rule of the body. Otherwise the rendering is deceptive because
1339 it looks like the whole cell is present instead of a partial cell.
1341 Otherwise (if there are headers) we will be merging two rules: the
1342 rightmost rule in the header and the leftmost rule in the body. We assume
1343 that the width of a merged rule is the larger of the widths of either rule
1345 if (b->pixel == 0 || page->h[axis][0])
1346 size += MAX (rule_width (page, axis, page->h[axis][0]),
1347 rule_width (page, axis, b->z));
1349 /* Width of body, minus any pixel offset in the leftmost cell. */
1350 size += joined_width (page, axis, b->z, cell) - b->pixel;
1352 /* Width of rightmost rule in body merged with leftmost rule in headers. */
1353 size += MAX (rule_width_r (page, axis, page->h[axis][1]),
1354 rule_width (page, axis, cell));
1356 /* Width of right header not including its leftmost rule. */
1357 size += axis_width (page, axis, rule_ofs_r (page, axis, page->h[axis][1]),
1358 rule_ofs_r (page, axis, 0));
1360 /* Join crossing. */
1361 if (page->h[axis][0] && page->h[axis][1])
1362 size += page->join_crossing[axis][b->z];
1367 /* Returns true if CELL along B's axis may be broken across a page boundary.
1369 This is just a heuristic. Breaking cells across page boundaries can save
1370 space, but it looks ugly. */
1372 cell_is_breakable (const struct render_break *b, int cell)
1374 const struct render_page *page = b->page;
1375 enum table_axis axis = b->axis;
1377 return cell_width (page, axis, cell) >= page->params->min_break[axis];
1384 const struct render_params *params;
1386 struct render_page **pages;
1387 size_t n_pages, allocated_pages;
1390 struct render_break x_break;
1391 struct render_break y_break;
1394 static const struct render_page *
1395 render_pager_add_table (struct render_pager *p, struct table *table)
1397 struct render_page *page;
1399 if (p->n_pages >= p->allocated_pages)
1400 p->pages = x2nrealloc (p->pages, &p->allocated_pages, sizeof *p->pages);
1401 page = p->pages[p->n_pages++] = render_page_create (p->params, table);
1406 render_pager_start_page (struct render_pager *p)
1408 render_break_init (&p->x_break, render_page_ref (p->pages[p->cur_page++]),
1410 render_break_init_empty (&p->y_break);
1414 add_footnote_page (struct render_pager *p, const struct table_item *item)
1416 const struct footnote **f;
1417 size_t n_footnotes = table_collect_footnotes (item, &f);
1421 struct tab_table *t = tab_create (2, n_footnotes);
1423 for (size_t i = 0; i < n_footnotes; i++)
1426 tab_text_format (t, 0, i, TAB_LEFT, "%s.", f[i]->marker);
1427 tab_text (t, 1, i, TAB_LEFT, f[i]->content);
1430 tab_add_style (t, 0, i, f[i]->style);
1431 tab_add_style (t, 1, i, f[i]->style);
1434 render_pager_add_table (p, &t->table);
1440 add_text_page (struct render_pager *p, const struct table_item_text *t)
1445 struct tab_table *tab = tab_create (1, 1);
1446 tab_text (tab, 0, 0, TAB_LEFT, t->content);
1447 for (size_t i = 0; i < t->n_footnotes; i++)
1448 tab_add_footnote (tab, 0, 0, t->footnotes[i]);
1451 tab->styles[0] = pool_clone (tab->container, t->style, sizeof *t->style);
1453 tab->styles[0]->font = pool_strdup (tab->container, t->style->font);
1455 render_pager_add_table (p, &tab->table);
1458 /* Creates and returns a new render_pager for rendering TABLE_ITEM on the
1459 device with the given PARAMS. */
1460 struct render_pager *
1461 render_pager_create (const struct render_params *params,
1462 const struct table_item *table_item)
1464 struct render_pager *p;
1466 p = xzalloc (sizeof *p);
1470 add_text_page (p, table_item_get_title (table_item));
1473 render_pager_add_table (p, table_ref (table_item_get_table (table_item)));
1476 add_text_page (p, table_item_get_caption (table_item));
1479 add_footnote_page (p, table_item);
1481 render_pager_start_page (p);
1488 render_pager_destroy (struct render_pager *p)
1494 render_break_destroy (&p->x_break);
1495 render_break_destroy (&p->y_break);
1496 for (i = 0; i < p->n_pages; i++)
1497 render_page_unref (p->pages[i]);
1503 /* Returns true if P has content remaining to render, false if rendering is
1506 render_pager_has_next (const struct render_pager *p_)
1508 struct render_pager *p = CONST_CAST (struct render_pager *, p_);
1510 while (!render_break_has_next (&p->y_break))
1512 render_break_destroy (&p->y_break);
1513 if (!render_break_has_next (&p->x_break))
1515 render_break_destroy (&p->x_break);
1516 if (p->cur_page >= p->n_pages)
1518 render_break_init_empty (&p->x_break);
1519 render_break_init_empty (&p->y_break);
1522 render_pager_start_page (p);
1525 render_break_init (&p->y_break,
1526 render_break_next (&p->x_break, p->params->size[H]), V);
1531 /* Draws a chunk of content from P to fit in a space that has vertical size
1532 SPACE and the horizontal size specified in the render_params passed to
1533 render_page_create(). Returns the amount of space actually used by the
1534 rendered chunk, which will be 0 if SPACE is too small to render anything or
1535 if no content remains (use render_pager_has_next() to distinguish these
1538 render_pager_draw_next (struct render_pager *p, int space)
1540 int ofs[TABLE_N_AXES] = { 0, 0 };
1541 size_t start_page = SIZE_MAX;
1543 while (render_pager_has_next (p))
1545 struct render_page *page;
1547 if (start_page == p->cur_page)
1549 start_page = p->cur_page;
1551 page = render_break_next (&p->y_break, space - ofs[V]);
1555 render_page_draw (page, ofs);
1556 ofs[V] += render_page_get_size (page, V);
1557 render_page_unref (page);
1562 /* Draws all of P's content. */
1564 render_pager_draw (const struct render_pager *p)
1566 render_pager_draw_region (p, 0, 0, INT_MAX, INT_MAX);
1569 /* Draws the region of P's content that lies in the region (X,Y)-(X+W,Y+H).
1570 Some extra content might be drawn; the device should perform clipping as
1573 render_pager_draw_region (const struct render_pager *p,
1574 int x, int y, int w, int h)
1576 int ofs[TABLE_N_AXES] = { 0, 0 };
1577 int clip[TABLE_N_AXES][2];
1582 for (i = 0; i < p->n_pages; i++)
1584 const struct render_page *page = p->pages[i];
1585 int size = render_page_get_size (page, V);
1587 clip[V][0] = MAX (y, ofs[V]) - ofs[V];
1588 clip[V][1] = MIN (y + h, ofs[V] + size) - ofs[V];
1589 if (clip[V][1] > clip[V][0])
1590 render_page_draw_region (page, ofs, clip);
1596 /* Returns the size of P's content along AXIS; i.e. the content's width if AXIS
1597 is TABLE_HORZ and its length if AXIS is TABLE_VERT. */
1599 render_pager_get_size (const struct render_pager *p, enum table_axis axis)
1604 for (i = 0; i < p->n_pages; i++)
1606 int subsize = render_page_get_size (p->pages[i], axis);
1607 size = axis == H ? MAX (size, subsize) : size + subsize;
1614 render_pager_get_best_breakpoint (const struct render_pager *p, int height)
1619 for (i = 0; i < p->n_pages; i++)
1621 int size = render_page_get_size (p->pages[i], V);
1622 if (y + size >= height)
1623 return render_page_get_best_breakpoint (p->pages[i], height - y) + y;
1630 /* render_page_select() and helpers. */
1632 struct render_page_selection
1634 const struct render_page *page; /* Page whose slice we are selecting. */
1635 struct render_page *subpage; /* New page under construction. */
1636 enum table_axis a; /* Axis of 'page' along which 'subpage' is a slice. */
1637 enum table_axis b; /* The opposite of 'a'. */
1638 int z0; /* First cell along 'a' being selected. */
1639 int z1; /* Last cell being selected, plus 1. */
1640 int p0; /* Number of pixels to trim off left side of z0. */
1641 int p1; /* Number of pixels to trim off right side of z1-1. */
1644 static void cell_to_subpage (struct render_page_selection *,
1645 const struct table_cell *,
1646 int subcell[TABLE_N_AXES]);
1647 static const struct render_overflow *find_overflow_for_cell (
1648 struct render_page_selection *, const struct table_cell *);
1649 static struct render_overflow *insert_overflow (struct render_page_selection *,
1650 const struct table_cell *);
1652 /* Creates and returns a new render_page whose contents are a subregion of
1653 PAGE's contents. The new render_page includes cells Z0 through Z1
1654 (exclusive) along AXIS, plus any headers on AXIS.
1656 If P0 is nonzero, then it is a number of pixels to exclude from the left or
1657 top (according to AXIS) of cell Z0. Similarly, P1 is a number of pixels to
1658 exclude from the right or bottom of cell Z1 - 1. (P0 and P1 are used to
1659 render cells that are too large to fit on a single page.)
1661 The whole of axis !AXIS is included. (The caller may follow up with another
1662 call to render_page_select() to select on !AXIS to select on that axis as
1665 The caller retains ownership of PAGE, which is not modified. */
1666 static struct render_page *
1667 render_page_select (const struct render_page *page, enum table_axis axis,
1668 int z0, int p0, int z1, int p1)
1670 struct render_page_selection s;
1671 enum table_axis a = axis;
1672 enum table_axis b = !a;
1673 struct render_page *subpage;
1674 struct render_overflow *ro;
1680 /* Optimize case where all of PAGE is selected by just incrementing the
1682 if (z0 == page->h[a][0] && p0 == 0
1683 && z1 == page->n[a] - page->h[a][1] && p1 == 0)
1685 struct render_page *page_rw = CONST_CAST (struct render_page *, page);
1690 /* Allocate subpage. */
1691 subpage = render_page_allocate (page->params,
1692 table_select_slice (
1693 table_ref (page->table),
1696 /* An edge is cut off if it was cut off in PAGE or if we're trimming pixels
1697 off that side of the page and there are no headers. */
1698 subpage->is_edge_cutoff[a][0] =
1699 subpage->h[a][0] == 0 && (p0 || (z0 == 0 && page->is_edge_cutoff[a][0]));
1700 subpage->is_edge_cutoff[a][1] =
1701 subpage->h[a][1] == 0 && (p1 || (z1 == page->n[a]
1702 && page->is_edge_cutoff[a][1]));
1703 subpage->is_edge_cutoff[b][0] = page->is_edge_cutoff[b][0];
1704 subpage->is_edge_cutoff[b][1] = page->is_edge_cutoff[b][1];
1706 /* Select join crossings from PAGE into subpage. */
1707 jc = subpage->join_crossing[a];
1708 for (z = 0; z < page->h[a][0]; z++)
1709 *jc++ = page->join_crossing[a][z];
1710 for (z = z0; z <= z1; z++)
1711 *jc++ = page->join_crossing[a][z];
1712 for (z = page->n[a] - page->h[a][1]; z < page->n[a]; z++)
1713 *jc++ = page->join_crossing[a][z];
1714 assert (jc == &subpage->join_crossing[a][subpage->n[a] + 1]);
1716 memcpy (subpage->join_crossing[b], page->join_crossing[b],
1717 (subpage->n[b] + 1) * sizeof **subpage->join_crossing);
1719 /* Select widths from PAGE into subpage. */
1721 dcp = subpage->cp[a];
1723 for (z = 0; z <= rule_ofs (subpage->h[a][0]); z++, dcp++)
1725 if (z == 0 && subpage->is_edge_cutoff[a][0])
1728 dcp[1] = dcp[0] + (scp[z + 1] - scp[z]);
1730 for (z = cell_ofs (z0); z <= cell_ofs (z1 - 1); z++, dcp++)
1732 dcp[1] = dcp[0] + (scp[z + 1] - scp[z]);
1733 if (z == cell_ofs (z0))
1736 if (page->h[a][0] && page->h[a][1])
1737 dcp[1] += page->join_crossing[a][z / 2];
1739 if (z == cell_ofs (z1 - 1))
1742 for (z = rule_ofs_r (page, a, subpage->h[a][1]);
1743 z <= rule_ofs_r (page, a, 0); z++, dcp++)
1745 if (z == rule_ofs_r (page, a, 0) && subpage->is_edge_cutoff[a][1])
1748 dcp[1] = dcp[0] + (scp[z + 1] - scp[z]);
1750 assert (dcp == &subpage->cp[a][2 * subpage->n[a] + 1]);
1752 for (z = 0; z < page->n[b] * 2 + 2; z++)
1753 subpage->cp[b][z] = page->cp[b][z];
1755 /* Add new overflows. */
1763 s.subpage = subpage;
1765 if (!page->h[a][0] || z0 > page->h[a][0] || p0)
1766 for (z = 0; z < page->n[b]; )
1768 struct table_cell cell;
1769 int d[TABLE_N_AXES];
1776 table_get_cell (page->table, d[H], d[V], &cell);
1777 overflow0 = p0 || cell.d[a][0] < z0;
1778 overflow1 = cell.d[a][1] > z1 || (cell.d[a][1] == z1 && p1);
1779 if (overflow0 || overflow1)
1781 ro = insert_overflow (&s, &cell);
1785 ro->overflow[a][0] += p0 + axis_width (
1786 page, a, cell_ofs (cell.d[a][0]), cell_ofs (z0));
1787 if (page->h[a][0] && page->h[a][1])
1788 ro->overflow[a][0] -= page->join_crossing[a][cell.d[a][0]
1794 ro->overflow[a][1] += p1 + axis_width (
1795 page, a, cell_ofs (z1), cell_ofs (cell.d[a][1]));
1796 if (page->h[a][0] && page->h[a][1])
1797 ro->overflow[a][1] -= page->join_crossing[a][cell.d[a][1]];
1801 table_cell_free (&cell);
1804 if (!page->h[a][1] || z1 < page->n[a] - page->h[a][1] || p1)
1805 for (z = 0; z < page->n[b]; )
1807 struct table_cell cell;
1808 int d[TABLE_N_AXES];
1812 table_get_cell (page->table, d[H], d[V], &cell);
1813 if ((cell.d[a][1] > z1 || (cell.d[a][1] == z1 && p1))
1814 && find_overflow_for_cell (&s, &cell) == NULL)
1816 ro = insert_overflow (&s, &cell);
1817 ro->overflow[a][1] += p1 + axis_width (page, a, cell_ofs (z1),
1818 cell_ofs (cell.d[a][1]));
1821 table_cell_free (&cell);
1824 /* Copy overflows from PAGE into subpage. */
1825 HMAP_FOR_EACH (ro, struct render_overflow, node, &page->overflows)
1827 struct table_cell cell;
1829 table_get_cell (page->table, ro->d[H], ro->d[V], &cell);
1830 if (cell.d[a][1] > z0 && cell.d[a][0] < z1
1831 && find_overflow_for_cell (&s, &cell) == NULL)
1832 insert_overflow (&s, &cell);
1833 table_cell_free (&cell);
1839 /* Given CELL, a table_cell within S->page, stores in SUBCELL the (x,y)
1840 coordinates of the top-left cell as it will appear in S->subpage.
1842 CELL must actually intersect the region of S->page that is being selected
1843 by render_page_select() or the results will not make any sense. */
1845 cell_to_subpage (struct render_page_selection *s,
1846 const struct table_cell *cell, int subcell[TABLE_N_AXES])
1848 enum table_axis a = s->a;
1849 enum table_axis b = s->b;
1850 int ha0 = s->subpage->h[a][0];
1852 subcell[a] = MAX (cell->d[a][0] - s->z0 + ha0, ha0);
1853 subcell[b] = cell->d[b][0];
1856 /* Given CELL, a table_cell within S->page, returns the render_overflow for
1857 that cell in S->subpage, if there is one, and a null pointer otherwise.
1859 CELL must actually intersect the region of S->page that is being selected
1860 by render_page_select() or the results will not make any sense. */
1861 static const struct render_overflow *
1862 find_overflow_for_cell (struct render_page_selection *s,
1863 const struct table_cell *cell)
1867 cell_to_subpage (s, cell, subcell);
1868 return find_overflow (s->subpage, subcell[H], subcell[V]);
1871 /* Given CELL, a table_cell within S->page, inserts a render_overflow for that
1872 cell in S->subpage (which must not already exist). Initializes the new
1873 render_overflow's 'overflow' member from the overflow for CELL in S->page,
1876 CELL must actually intersect the region of S->page that is being selected
1877 by render_page_select() or the results will not make any sense. */
1878 static struct render_overflow *
1879 insert_overflow (struct render_page_selection *s,
1880 const struct table_cell *cell)
1882 const struct render_overflow *old;
1883 struct render_overflow *of;
1885 of = xzalloc (sizeof *of);
1886 cell_to_subpage (s, cell, of->d);
1887 hmap_insert (&s->subpage->overflows, &of->node,
1888 hash_cell (of->d[H], of->d[V]));
1890 old = find_overflow (s->page, cell->d[H][0], cell->d[V][0]);
1892 memcpy (of->overflow, old->overflow, sizeof of->overflow);