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. */
493 for (d[b] = 0; d[b] < table->n[b]; d[b]++)
494 rules |= 1u << table_get_rule (table, a, d[H], d[V]);
496 /* Turn off TAL_NONE because it has width 0 and we needn't bother. However,
497 if the device doesn't support margins, make sure that there is at least a
498 small gap between cells (but we don't need any at the left or right edge
500 if (rules & (1u << TAL_NONE))
502 rules &= ~(1u << TAL_NONE);
503 if (z > 0 && z < table->n[a] && !params->supports_margins && a == H)
504 rules |= 1u << TAL_SOLID;
507 /* Calculate maximum width of the rules that are present. */
509 for (size_t i = 0; i < N_LINES; i++)
510 if (rules & (1u << i))
511 width = MAX (width, params->line_widths[a][rule_to_render_type (i)]);
515 /* Allocates and returns a new render_page using PARAMS and TABLE. Allocates
516 space for all of the members of the new page, but the caller must initialize
517 the 'cp' member itself. */
518 static struct render_page *
519 render_page_allocate (const struct render_params *params,
522 struct render_page *page;
525 page = xmalloc (sizeof *page);
526 page->params = params;
529 page->n[H] = table->n[H];
530 page->n[V] = table->n[V];
531 page->h[H][0] = table->h[H][0];
532 page->h[H][1] = table->h[H][1];
533 page->h[V][0] = table->h[V][0];
534 page->h[V][1] = table->h[V][1];
536 for (i = 0; i < TABLE_N_AXES; i++)
538 page->cp[i] = xmalloc ((2 * page->n[i] + 2) * sizeof *page->cp[i]);
539 page->join_crossing[i] = xzalloc ((page->n[i] + 1) * sizeof *page->join_crossing[i]);
542 hmap_init (&page->overflows);
543 memset (page->is_edge_cutoff, 0, sizeof page->is_edge_cutoff);
548 /* Allocates and returns a new render_page for PARAMS and TABLE, initializing
549 cp[H] in the new page from ROWS and RULES. The caller must still initialize
551 static struct render_page *
552 create_page_with_exact_widths (const struct render_params *params,
554 const struct render_row *rows, int *rules)
556 struct render_page *page = render_page_allocate (params, table);
557 accumulate_row_widths (page, H, rows, rules);
561 /* Allocates and returns a new render_page for PARAMS and TABLE.
563 Initializes cp[H] in the new page by setting the width of each row 'i' to
564 somewhere between the minimum cell width ROW_MIN[i].width and the maximum
565 ROW_MAX[i].width. Sets the width of rules to those in RULES.
567 W_MIN is the sum of ROWS_MIN[].width.
569 W_MAX is the sum of ROWS_MAX[].width.
571 The caller must still initialize cp[V]. */
572 static struct render_page *
573 create_page_with_interpolated_widths (const struct render_params *params,
575 const struct render_row *rows_min,
576 const struct render_row *rows_max,
577 int w_min, int w_max, const int *rules)
579 const int n = table->n[H];
580 const long long int avail = params->size[H] - w_min;
581 const long long int wanted = w_max - w_min;
585 struct render_page *page = render_page_allocate (params, table);
587 int *cph = page->cp[H];
589 long long int w = wanted / 2;
590 for (int x = 0; x < n; x++)
592 w += avail * (rows_max[x].width - rows_min[x].width);
593 int extra = w / wanted;
596 cph[1] = cph[0] + rules[x];
597 cph[2] = cph[1] + rows_min[x].width + extra;
600 cph[1] = cph[0] + rules[n];
602 assert (page->cp[H][n * 2 + 1] == params->size[H]);
608 set_join_crossings (struct render_page *page, enum table_axis axis,
609 const struct table_cell *cell, int *rules)
613 for (z = cell->d[axis][0] + 1; z <= cell->d[axis][1] - 1; z++)
614 page->join_crossing[axis][z] = rules[z];
617 /* Creates and returns a new render_page for rendering TABLE on a device
620 The new render_page will be suitable for rendering on a device whose page
621 size is PARAMS->size, but the caller is responsible for actually breaking it
622 up to fit on such a device, using the render_break abstraction. */
623 static struct render_page *
624 render_page_create (const struct render_params *params, struct table *table)
626 struct render_page *page;
628 struct render_row *columns[2];
629 struct render_row *rows;
631 int *rules[TABLE_N_AXES];
635 enum table_axis axis;
637 nc = table_nc (table);
638 nr = table_nr (table);
640 /* Figure out rule widths. */
641 for (axis = 0; axis < TABLE_N_AXES; axis++)
643 int n = table->n[axis] + 1;
646 rules[axis] = xnmalloc (n, sizeof *rules);
647 for (z = 0; z < n; z++)
648 rules[axis][z] = measure_rule (params, table, axis, z);
651 /* Calculate minimum and maximum widths of cells that do not
652 span multiple columns. */
653 for (i = 0; i < 2; i++)
654 columns[i] = xzalloc (nc * sizeof *columns[i]);
655 for (y = 0; y < nr; y++)
656 for (x = 0; x < nc; )
658 struct table_cell cell;
660 table_get_cell (table, x, y, &cell);
661 if (y == cell.d[V][0])
663 if (table_cell_colspan (&cell) == 1)
668 params->measure_cell_width (params->aux, &cell,
670 for (i = 0; i < 2; i++)
671 if (columns[i][x].unspanned < w[i])
672 columns[i][x].unspanned = w[i];
676 table_cell_free (&cell);
679 /* Distribute widths of spanned columns. */
680 for (i = 0; i < 2; i++)
681 for (x = 0; x < nc; x++)
682 columns[i][x].width = columns[i][x].unspanned;
683 for (y = 0; y < nr; y++)
684 for (x = 0; x < nc; )
686 struct table_cell cell;
688 table_get_cell (table, x, y, &cell);
689 if (y == cell.d[V][0] && table_cell_colspan (&cell) > 1)
693 params->measure_cell_width (params->aux, &cell, &w[MIN], &w[MAX]);
694 for (i = 0; i < 2; i++)
695 distribute_spanned_width (w[i], &columns[i][cell.d[H][0]],
696 rules[H], table_cell_colspan (&cell));
699 table_cell_free (&cell);
702 /* In pathological cases, spans can cause the minimum width of a column to
703 exceed the maximum width. This bollixes our interpolation algorithm
704 later, so fix it up. */
705 for (i = 0; i < nc; i++)
706 if (columns[MIN][i].width > columns[MAX][i].width)
707 columns[MAX][i].width = columns[MIN][i].width;
709 /* Decide final column widths. */
710 for (i = 0; i < 2; i++)
711 table_widths[i] = calculate_table_width (table_nc (table),
712 columns[i], rules[H]);
713 if (table_widths[MAX] <= params->size[H])
715 /* Fits even with maximum widths. Use them. */
716 page = create_page_with_exact_widths (params, table, columns[MAX],
719 else if (table_widths[MIN] <= params->size[H])
721 /* Fits with minimum widths, so distribute the leftover space. */
722 page = create_page_with_interpolated_widths (
723 params, table, columns[MIN], columns[MAX],
724 table_widths[MIN], table_widths[MAX], rules[H]);
728 /* Doesn't fit even with minimum widths. Assign minimums for now, and
729 later we can break it horizontally into multiple pages. */
730 page = create_page_with_exact_widths (params, table, columns[MIN],
734 /* Calculate heights of cells that do not span multiple rows. */
735 rows = xzalloc (nr * sizeof *rows);
736 for (y = 0; y < nr; y++)
738 for (x = 0; x < nc; )
740 struct render_row *r = &rows[y];
741 struct table_cell cell;
743 table_get_cell (table, x, y, &cell);
744 if (y == cell.d[V][0])
746 if (table_cell_rowspan (&cell) == 1)
748 int w = joined_width (page, H, cell.d[H][0], cell.d[H][1]);
749 int h = params->measure_cell_height (params->aux, &cell, w);
750 if (h > r->unspanned)
751 r->unspanned = r->width = h;
754 set_join_crossings (page, V, &cell, rules[V]);
756 if (table_cell_colspan (&cell) > 1)
757 set_join_crossings (page, H, &cell, rules[H]);
760 table_cell_free (&cell);
763 for (i = 0; i < 2; i++)
766 /* Distribute heights of spanned rows. */
767 for (y = 0; y < nr; y++)
768 for (x = 0; x < nc; )
770 struct table_cell cell;
772 table_get_cell (table, x, y, &cell);
773 if (y == cell.d[V][0] && table_cell_rowspan (&cell) > 1)
775 int w = joined_width (page, H, cell.d[H][0], cell.d[H][1]);
776 int h = params->measure_cell_height (params->aux, &cell, w);
777 distribute_spanned_width (h, &rows[cell.d[V][0]], rules[V],
778 table_cell_rowspan (&cell));
781 table_cell_free (&cell);
784 /* Decide final row heights. */
785 accumulate_row_widths (page, V, rows, rules[V]);
788 /* Measure headers. If they are "too big", get rid of them. */
789 for (axis = 0; axis < TABLE_N_AXES; axis++)
791 int hw = headers_width (page, axis);
792 if (hw * 2 >= page->params->size[axis]
793 || hw + max_cell_width (page, axis) > page->params->size[axis])
795 page->table = table_unshare (page->table);
796 page->table->h[axis][0] = page->table->h[axis][1] = 0;
797 page->h[axis][0] = page->h[axis][1] = 0;
807 /* Increases PAGE's reference count. */
809 render_page_ref (const struct render_page *page_)
811 struct render_page *page = CONST_CAST (struct render_page *, page_);
816 /* Decreases PAGE's reference count and destroys PAGE if this causes the
817 reference count to fall to zero. */
819 render_page_unref (struct render_page *page)
821 if (page != NULL && --page->ref_cnt == 0)
824 struct render_overflow *overflow, *next;
826 HMAP_FOR_EACH_SAFE (overflow, next, struct render_overflow, node,
829 hmap_destroy (&page->overflows);
831 table_unref (page->table);
833 for (i = 0; i < TABLE_N_AXES; ++i)
835 free (page->join_crossing[i]);
843 /* Returns the size of PAGE along AXIS. (This might be larger than the page
844 size specified in the parameters passed to render_page_create(). Use a
845 render_break to break up a render_page into page-sized chunks.) */
847 render_page_get_size (const struct render_page *page, enum table_axis axis)
849 return page->cp[axis][page->n[axis] * 2 + 1];
853 render_page_get_best_breakpoint (const struct render_page *page, int height)
857 /* If there's no room for at least the top row and the rules above and below
858 it, don't include any of the table. */
859 if (page->cp[V][3] > height)
862 /* Otherwise include as many rows and rules as we can. */
863 for (y = 5; y <= 2 * page->n[V] + 1; y += 2)
864 if (page->cp[V][y] > height)
865 return page->cp[V][y - 2];
869 /* Drawing render_pages. */
871 static inline enum render_line_style
872 get_rule (const struct render_page *page, enum table_axis axis,
873 const int d[TABLE_N_AXES])
875 return rule_to_render_type (table_get_rule (page->table,
876 axis, d[H] / 2, d[V] / 2));
886 render_direction_rtl (void)
888 /* TRANSLATORS: Do not translate this string. If the script of your language
889 reads from right to left (eg Persian, Arabic, Hebrew etc), then replace
890 this string with "output-direction-rtl". Otherwise either leave it
891 untranslated or copy it verbatim. */
892 const char *dir = _("output-direction-ltr");
893 if ( 0 == strcmp ("output-direction-rtl", dir))
896 if ( 0 != strcmp ("output-direction-ltr", dir))
897 fprintf (stderr, "This localisation has been incorrectly translated. Complain to the translator.\n");
903 render_rule (const struct render_page *page, const int ofs[TABLE_N_AXES],
904 const int d[TABLE_N_AXES])
906 enum render_line_style styles[TABLE_N_AXES][2];
909 for (a = 0; a < TABLE_N_AXES; a++)
911 enum table_axis b = !a;
913 styles[a][0] = styles[a][1] = RENDER_LINE_NONE;
916 || (page->is_edge_cutoff[a][0] && d[a] == 0)
917 || (page->is_edge_cutoff[a][1] && d[a] == page->n[a] * 2))
928 styles[a][0] = get_rule (page, a, e);
931 if (d[b] / 2 < page->table->n[b])
932 styles[a][1] = get_rule (page, a, d);
935 styles[a][0] = styles[a][1] = get_rule (page, a, d);
938 if (styles[H][0] != RENDER_LINE_NONE || styles[H][1] != RENDER_LINE_NONE
939 || styles[V][0] != RENDER_LINE_NONE || styles[V][1] != RENDER_LINE_NONE)
941 int bb[TABLE_N_AXES][2];
943 bb[H][0] = ofs[H] + page->cp[H][d[H]];
944 bb[H][1] = ofs[H] + page->cp[H][d[H] + 1];
945 if (render_direction_rtl ())
948 bb[H][0] = render_page_get_size (page, H) - bb[H][1];
949 bb[H][1] = render_page_get_size (page, H) - temp;
951 bb[V][0] = ofs[V] + page->cp[V][d[V]];
952 bb[V][1] = ofs[V] + page->cp[V][d[V] + 1];
953 page->params->draw_line (page->params->aux, bb, styles);
958 render_cell (const struct render_page *page, const int ofs[TABLE_N_AXES],
959 const struct table_cell *cell)
961 const struct render_overflow *of;
962 int bb[TABLE_N_AXES][2];
963 int clip[TABLE_N_AXES][2];
965 bb[H][0] = clip[H][0] = ofs[H] + page->cp[H][cell->d[H][0] * 2 + 1];
966 bb[H][1] = clip[H][1] = ofs[H] + page->cp[H][cell->d[H][1] * 2];
967 if (render_direction_rtl ())
970 bb[H][0] = clip[H][0] = render_page_get_size (page, H) - bb[H][1];
971 bb[H][1] = clip[H][1] = render_page_get_size (page, H) - temp;
973 bb[V][0] = clip[V][0] = ofs[V] + page->cp[V][cell->d[V][0] * 2 + 1];
974 bb[V][1] = clip[V][1] = ofs[V] + page->cp[V][cell->d[V][1] * 2];
976 int valign = (cell->n_contents
977 ? cell->contents->options & TAB_VALIGN
979 if (valign != TAB_TOP)
981 int height = page->params->measure_cell_height (
982 page->params->aux, cell, bb[H][1] - bb[H][0]);
983 int extra = bb[V][1] - bb[V][0] - height;
986 if (valign == TAB_MIDDLE)
992 of = find_overflow (page, cell->d[H][0], cell->d[V][0]);
995 enum table_axis axis;
997 for (axis = 0; axis < TABLE_N_AXES; axis++)
999 if (of->overflow[axis][0])
1001 bb[axis][0] -= of->overflow[axis][0];
1002 if (cell->d[axis][0] == 0 && !page->is_edge_cutoff[axis][0])
1003 clip[axis][0] = ofs[axis] + page->cp[axis][cell->d[axis][0] * 2];
1005 if (of->overflow[axis][1])
1007 bb[axis][1] += of->overflow[axis][1];
1008 if (cell->d[axis][1] == page->n[axis] && !page->is_edge_cutoff[axis][1])
1009 clip[axis][1] = ofs[axis] + page->cp[axis][cell->d[axis][1] * 2 + 1];
1014 int spill[TABLE_N_AXES][2];
1015 for (enum table_axis axis = 0; axis < TABLE_N_AXES; axis++)
1017 spill[axis][0] = rule_width (page, axis, cell->d[axis][0]) / 2;
1018 spill[axis][1] = rule_width (page, axis, cell->d[axis][1]) / 2;
1021 page->params->draw_cell (page->params->aux, cell, bb, spill, clip);
1024 /* Draws the cells of PAGE indicated in BB. */
1026 render_page_draw_cells (const struct render_page *page,
1027 int ofs[TABLE_N_AXES], int bb[TABLE_N_AXES][2])
1029 for (int y = bb[V][0]; y < bb[V][1]; y++)
1030 for (int x = bb[H][0]; x < bb[H][1]; )
1031 if (!is_rule (x) && !is_rule (y))
1033 struct table_cell cell;
1035 table_get_cell (page->table, x / 2, y / 2, &cell);
1036 if (y / 2 == bb[V][0] / 2 || y / 2 == cell.d[V][0])
1037 render_cell (page, ofs, &cell);
1038 x = rule_ofs (cell.d[H][1]);
1039 table_cell_free (&cell);
1044 for (int y = bb[V][0]; y < bb[V][1]; y++)
1045 for (int x = bb[H][0]; x < bb[H][1]; x++)
1046 if (is_rule (x) || is_rule (y))
1048 int d[TABLE_N_AXES];
1051 render_rule (page, ofs, d);
1055 /* Renders PAGE, by calling the 'draw_line' and 'draw_cell' functions from the
1056 render_params provided to render_page_create(). */
1058 render_page_draw (const struct render_page *page, int ofs[TABLE_N_AXES])
1060 int bb[TABLE_N_AXES][2];
1063 bb[H][1] = page->n[H] * 2 + 1;
1065 bb[V][1] = page->n[V] * 2 + 1;
1067 render_page_draw_cells (page, ofs, bb);
1070 /* Returns the greatest value i, 0 <= i < n, such that cp[i] <= x0. */
1072 get_clip_min_extent (int x0, const int cp[], int n)
1074 int low, high, best;
1081 int middle = low + (high - low) / 2;
1083 if (cp[middle] <= x0)
1095 /* Returns the least value i, 0 <= i < n, such that cp[i] >= x1. */
1097 get_clip_max_extent (int x1, const int cp[], int n)
1099 int low, high, best;
1106 int middle = low + (high - low) / 2;
1108 if (cp[middle] >= x1)
1109 best = high = middle;
1114 while (best > 0 && cp[best - 1] == cp[best])
1120 /* Renders the cells of PAGE that intersect (X,Y)-(X+W,Y+H), by calling the
1121 'draw_line' and 'draw_cell' functions from the render_params provided to
1122 render_page_create(). */
1124 render_page_draw_region (const struct render_page *page,
1125 int ofs[TABLE_N_AXES], int clip[TABLE_N_AXES][2])
1127 int bb[TABLE_N_AXES][2];
1129 bb[H][0] = get_clip_min_extent (clip[H][0], page->cp[H], page->n[H] * 2 + 1);
1130 bb[H][1] = get_clip_max_extent (clip[H][1], page->cp[H], page->n[H] * 2 + 1);
1131 bb[V][0] = get_clip_min_extent (clip[V][0], page->cp[V], page->n[V] * 2 + 1);
1132 bb[V][1] = get_clip_max_extent (clip[V][1], page->cp[V], page->n[V] * 2 + 1);
1134 render_page_draw_cells (page, ofs, bb);
1137 /* Breaking up tables to fit on a page. */
1139 /* An iterator for breaking render_pages into smaller chunks. */
1142 struct render_page *page; /* Page being broken up. */
1143 enum table_axis axis; /* Axis along which 'page' is being broken. */
1144 int z; /* Next cell along 'axis'. */
1145 int pixel; /* Pixel offset within cell 'z' (usually 0). */
1146 int hw; /* Width of headers of 'page' along 'axis'. */
1149 static int needed_size (const struct render_break *, int cell);
1150 static bool cell_is_breakable (const struct render_break *, int cell);
1151 static struct render_page *render_page_select (const struct render_page *,
1156 /* Initializes render_break B for breaking PAGE along AXIS.
1157 Takes ownership of PAGE. */
1159 render_break_init (struct render_break *b, struct render_page *page,
1160 enum table_axis axis)
1164 b->z = page->h[axis][0];
1166 b->hw = headers_width (page, axis);
1169 /* Initializes B as a render_break structure for which
1170 render_break_has_next() always returns false. */
1172 render_break_init_empty (struct render_break *b)
1175 b->axis = TABLE_HORZ;
1181 /* Frees B and unrefs the render_page that it owns. */
1183 render_break_destroy (struct render_break *b)
1187 render_page_unref (b->page);
1192 /* Returns true if B still has cells that are yet to be returned,
1193 false if all of B's page has been processed. */
1195 render_break_has_next (const struct render_break *b)
1197 const struct render_page *page = b->page;
1198 enum table_axis axis = b->axis;
1200 return page != NULL && b->z < page->n[axis] - page->h[axis][1];
1203 /* Returns a new render_page that is up to SIZE pixels wide along B's axis.
1204 Returns a null pointer if B has already been completely broken up, or if
1205 SIZE is too small to reasonably render any cells. The latter will never
1206 happen if SIZE is at least as large as the page size passed to
1207 render_page_create() along B's axis. */
1208 static struct render_page *
1209 render_break_next (struct render_break *b, int size)
1211 const struct render_page *page = b->page;
1212 enum table_axis axis = b->axis;
1213 struct render_page *subpage;
1216 if (!render_break_has_next (b))
1220 for (z = b->z; z < page->n[axis] - page->h[axis][1]; z++)
1222 int needed = needed_size (b, z + 1);
1225 if (cell_is_breakable (b, z))
1227 /* If there is no right header and we render a partial cell on
1228 the right side of the body, then we omit the rightmost rule of
1229 the body. Otherwise the rendering is deceptive because it
1230 looks like the whole cell is present instead of a partial
1233 This is similar to code for the left side in needed_size(). */
1234 int rule_allowance = (page->h[axis][1]
1236 : rule_width (page, axis, z));
1238 /* The amount that, if we added cell 'z', the rendering would
1239 overfill the allocated 'size'. */
1240 int overhang = needed - size - rule_allowance;
1242 /* The width of cell 'z'. */
1243 int cell_size = cell_width (page, axis, z);
1245 /* The amount trimmed off the left side of 'z',
1246 and the amount left to render. */
1247 int cell_ofs = z == b->z ? b->pixel : 0;
1248 int cell_left = cell_size - cell_ofs;
1250 /* A small but visible width. */
1251 int em = page->params->font_size[axis];
1253 /* If some of the cell remains to render,
1254 and there would still be some of the cell left afterward,
1255 then partially render that much of the cell. */
1256 pixel = (cell_left && cell_left > overhang
1257 ? cell_left - overhang + cell_ofs
1260 /* If there would be only a tiny amount of the cell left after
1261 rendering it partially, reduce the amount rendered slightly
1262 to make the output look a little better. */
1263 if (pixel + em > cell_size)
1264 pixel = MAX (pixel - em, 0);
1266 /* If we're breaking vertically, then consider whether the cells
1267 being broken have a better internal breakpoint than the exact
1268 number of pixels available, which might look bad e.g. because
1269 it breaks in the middle of a line of text. */
1270 if (axis == TABLE_VERT && page->params->adjust_break)
1274 for (x = 0; x < page->n[H]; )
1276 struct table_cell cell;
1280 table_get_cell (page->table, x, z, &cell);
1281 w = joined_width (page, H, cell.d[H][0], cell.d[H][1]);
1282 better_pixel = page->params->adjust_break (
1283 page->params->aux, &cell, w, pixel);
1285 table_cell_free (&cell);
1287 if (better_pixel < pixel)
1289 if (better_pixel > (z == b->z ? b->pixel : 0))
1291 pixel = better_pixel;
1294 else if (better_pixel == 0 && z != b->z)
1307 if (z == b->z && !pixel)
1310 subpage = render_page_select (page, axis, b->z, b->pixel,
1312 pixel ? cell_width (page, axis, z) - pixel
1319 /* Returns the width that would be required along B's axis to render a page
1320 from B's current position up to but not including CELL. */
1322 needed_size (const struct render_break *b, int cell)
1324 const struct render_page *page = b->page;
1325 enum table_axis axis = b->axis;
1328 /* Width of left header not including its rightmost rule. */
1329 size = axis_width (page, axis, 0, rule_ofs (page->h[axis][0]));
1331 /* If we have a pixel offset and there is no left header, then we omit the
1332 leftmost rule of the body. Otherwise the rendering is deceptive because
1333 it looks like the whole cell is present instead of a partial cell.
1335 Otherwise (if there are headers) we will be merging two rules: the
1336 rightmost rule in the header and the leftmost rule in the body. We assume
1337 that the width of a merged rule is the larger of the widths of either rule
1339 if (b->pixel == 0 || page->h[axis][0])
1340 size += MAX (rule_width (page, axis, page->h[axis][0]),
1341 rule_width (page, axis, b->z));
1343 /* Width of body, minus any pixel offset in the leftmost cell. */
1344 size += joined_width (page, axis, b->z, cell) - b->pixel;
1346 /* Width of rightmost rule in body merged with leftmost rule in headers. */
1347 size += MAX (rule_width_r (page, axis, page->h[axis][1]),
1348 rule_width (page, axis, cell));
1350 /* Width of right header not including its leftmost rule. */
1351 size += axis_width (page, axis, rule_ofs_r (page, axis, page->h[axis][1]),
1352 rule_ofs_r (page, axis, 0));
1354 /* Join crossing. */
1355 if (page->h[axis][0] && page->h[axis][1])
1356 size += page->join_crossing[axis][b->z];
1361 /* Returns true if CELL along B's axis may be broken across a page boundary.
1363 This is just a heuristic. Breaking cells across page boundaries can save
1364 space, but it looks ugly. */
1366 cell_is_breakable (const struct render_break *b, int cell)
1368 const struct render_page *page = b->page;
1369 enum table_axis axis = b->axis;
1371 return cell_width (page, axis, cell) >= page->params->min_break[axis];
1378 const struct render_params *params;
1380 struct render_page **pages;
1381 size_t n_pages, allocated_pages;
1384 struct render_break x_break;
1385 struct render_break y_break;
1388 static const struct render_page *
1389 render_pager_add_table (struct render_pager *p, struct table *table)
1391 struct render_page *page;
1393 if (p->n_pages >= p->allocated_pages)
1394 p->pages = x2nrealloc (p->pages, &p->allocated_pages, sizeof *p->pages);
1395 page = p->pages[p->n_pages++] = render_page_create (p->params, table);
1400 render_pager_start_page (struct render_pager *p)
1402 render_break_init (&p->x_break, render_page_ref (p->pages[p->cur_page++]),
1404 render_break_init_empty (&p->y_break);
1408 add_footnote_page (struct render_pager *p, const struct table_item *item)
1410 const struct footnote **f;
1411 size_t n_footnotes = table_collect_footnotes (item, &f);
1415 struct tab_table *t = tab_create (2, n_footnotes);
1417 for (size_t i = 0; i < n_footnotes; i++)
1420 tab_text_format (t, 0, i, TAB_LEFT, "%s.", f[i]->marker);
1421 tab_text (t, 1, i, TAB_LEFT, f[i]->content);
1423 render_pager_add_table (p, &t->table);
1429 add_text_page (struct render_pager *p, const struct table_item_text *t)
1434 struct tab_table *tab = tab_create (1, 1);
1435 tab_text (tab, 0, 0, TAB_LEFT, t->content);
1436 for (size_t i = 0; i < t->n_footnotes; i++)
1437 tab_add_footnote (tab, 0, 0, t->footnotes[i]);
1440 tab->styles[0] = pool_clone (tab->container, t->style, sizeof *t->style);
1442 tab->styles[0]->font = pool_strdup (tab->container, t->style->font);
1444 render_pager_add_table (p, &tab->table);
1447 /* Creates and returns a new render_pager for rendering TABLE_ITEM on the
1448 device with the given PARAMS. */
1449 struct render_pager *
1450 render_pager_create (const struct render_params *params,
1451 const struct table_item *table_item)
1453 struct render_pager *p;
1455 p = xzalloc (sizeof *p);
1459 add_text_page (p, table_item_get_title (table_item));
1462 render_pager_add_table (p, table_ref (table_item_get_table (table_item)));
1465 add_text_page (p, table_item_get_caption (table_item));
1468 add_footnote_page (p, table_item);
1470 render_pager_start_page (p);
1477 render_pager_destroy (struct render_pager *p)
1483 render_break_destroy (&p->x_break);
1484 render_break_destroy (&p->y_break);
1485 for (i = 0; i < p->n_pages; i++)
1486 render_page_unref (p->pages[i]);
1492 /* Returns true if P has content remaining to render, false if rendering is
1495 render_pager_has_next (const struct render_pager *p_)
1497 struct render_pager *p = CONST_CAST (struct render_pager *, p_);
1499 while (!render_break_has_next (&p->y_break))
1501 render_break_destroy (&p->y_break);
1502 if (!render_break_has_next (&p->x_break))
1504 render_break_destroy (&p->x_break);
1505 if (p->cur_page >= p->n_pages)
1507 render_break_init_empty (&p->x_break);
1508 render_break_init_empty (&p->y_break);
1511 render_pager_start_page (p);
1514 render_break_init (&p->y_break,
1515 render_break_next (&p->x_break, p->params->size[H]), V);
1520 /* Draws a chunk of content from P to fit in a space that has vertical size
1521 SPACE and the horizontal size specified in the render_params passed to
1522 render_page_create(). Returns the amount of space actually used by the
1523 rendered chunk, which will be 0 if SPACE is too small to render anything or
1524 if no content remains (use render_pager_has_next() to distinguish these
1527 render_pager_draw_next (struct render_pager *p, int space)
1529 int ofs[TABLE_N_AXES] = { 0, 0 };
1530 size_t start_page = SIZE_MAX;
1532 while (render_pager_has_next (p))
1534 struct render_page *page;
1536 if (start_page == p->cur_page)
1538 start_page = p->cur_page;
1540 page = render_break_next (&p->y_break, space - ofs[V]);
1544 render_page_draw (page, ofs);
1545 ofs[V] += render_page_get_size (page, V);
1546 render_page_unref (page);
1551 /* Draws all of P's content. */
1553 render_pager_draw (const struct render_pager *p)
1555 render_pager_draw_region (p, 0, 0, INT_MAX, INT_MAX);
1558 /* Draws the region of P's content that lies in the region (X,Y)-(X+W,Y+H).
1559 Some extra content might be drawn; the device should perform clipping as
1562 render_pager_draw_region (const struct render_pager *p,
1563 int x, int y, int w, int h)
1565 int ofs[TABLE_N_AXES] = { 0, 0 };
1566 int clip[TABLE_N_AXES][2];
1571 for (i = 0; i < p->n_pages; i++)
1573 const struct render_page *page = p->pages[i];
1574 int size = render_page_get_size (page, V);
1576 clip[V][0] = MAX (y, ofs[V]) - ofs[V];
1577 clip[V][1] = MIN (y + h, ofs[V] + size) - ofs[V];
1578 if (clip[V][1] > clip[V][0])
1579 render_page_draw_region (page, ofs, clip);
1585 /* Returns the size of P's content along AXIS; i.e. the content's width if AXIS
1586 is TABLE_HORZ and its length if AXIS is TABLE_VERT. */
1588 render_pager_get_size (const struct render_pager *p, enum table_axis axis)
1593 for (i = 0; i < p->n_pages; i++)
1595 int subsize = render_page_get_size (p->pages[i], axis);
1596 size = axis == H ? MAX (size, subsize) : size + subsize;
1603 render_pager_get_best_breakpoint (const struct render_pager *p, int height)
1608 for (i = 0; i < p->n_pages; i++)
1610 int size = render_page_get_size (p->pages[i], V);
1611 if (y + size >= height)
1612 return render_page_get_best_breakpoint (p->pages[i], height - y) + y;
1619 /* render_page_select() and helpers. */
1621 struct render_page_selection
1623 const struct render_page *page; /* Page whose slice we are selecting. */
1624 struct render_page *subpage; /* New page under construction. */
1625 enum table_axis a; /* Axis of 'page' along which 'subpage' is a slice. */
1626 enum table_axis b; /* The opposite of 'a'. */
1627 int z0; /* First cell along 'a' being selected. */
1628 int z1; /* Last cell being selected, plus 1. */
1629 int p0; /* Number of pixels to trim off left side of z0. */
1630 int p1; /* Number of pixels to trim off right side of z1-1. */
1633 static void cell_to_subpage (struct render_page_selection *,
1634 const struct table_cell *,
1635 int subcell[TABLE_N_AXES]);
1636 static const struct render_overflow *find_overflow_for_cell (
1637 struct render_page_selection *, const struct table_cell *);
1638 static struct render_overflow *insert_overflow (struct render_page_selection *,
1639 const struct table_cell *);
1641 /* Creates and returns a new render_page whose contents are a subregion of
1642 PAGE's contents. The new render_page includes cells Z0 through Z1
1643 (exclusive) along AXIS, plus any headers on AXIS.
1645 If P0 is nonzero, then it is a number of pixels to exclude from the left or
1646 top (according to AXIS) of cell Z0. Similarly, P1 is a number of pixels to
1647 exclude from the right or bottom of cell Z1 - 1. (P0 and P1 are used to
1648 render cells that are too large to fit on a single page.)
1650 The whole of axis !AXIS is included. (The caller may follow up with another
1651 call to render_page_select() to select on !AXIS to select on that axis as
1654 The caller retains ownership of PAGE, which is not modified. */
1655 static struct render_page *
1656 render_page_select (const struct render_page *page, enum table_axis axis,
1657 int z0, int p0, int z1, int p1)
1659 struct render_page_selection s;
1660 enum table_axis a = axis;
1661 enum table_axis b = !a;
1662 struct render_page *subpage;
1663 struct render_overflow *ro;
1669 /* Optimize case where all of PAGE is selected by just incrementing the
1671 if (z0 == page->h[a][0] && p0 == 0
1672 && z1 == page->n[a] - page->h[a][1] && p1 == 0)
1674 struct render_page *page_rw = CONST_CAST (struct render_page *, page);
1679 /* Allocate subpage. */
1680 subpage = render_page_allocate (page->params,
1681 table_select_slice (
1682 table_ref (page->table),
1685 /* An edge is cut off if it was cut off in PAGE or if we're trimming pixels
1686 off that side of the page and there are no headers. */
1687 subpage->is_edge_cutoff[a][0] =
1688 subpage->h[a][0] == 0 && (p0 || (z0 == 0 && page->is_edge_cutoff[a][0]));
1689 subpage->is_edge_cutoff[a][1] =
1690 subpage->h[a][1] == 0 && (p1 || (z1 == page->n[a]
1691 && page->is_edge_cutoff[a][1]));
1692 subpage->is_edge_cutoff[b][0] = page->is_edge_cutoff[b][0];
1693 subpage->is_edge_cutoff[b][1] = page->is_edge_cutoff[b][1];
1695 /* Select join crossings from PAGE into subpage. */
1696 jc = subpage->join_crossing[a];
1697 for (z = 0; z < page->h[a][0]; z++)
1698 *jc++ = page->join_crossing[a][z];
1699 for (z = z0; z <= z1; z++)
1700 *jc++ = page->join_crossing[a][z];
1701 for (z = page->n[a] - page->h[a][1]; z < page->n[a]; z++)
1702 *jc++ = page->join_crossing[a][z];
1703 assert (jc == &subpage->join_crossing[a][subpage->n[a] + 1]);
1705 memcpy (subpage->join_crossing[b], page->join_crossing[b],
1706 (subpage->n[b] + 1) * sizeof **subpage->join_crossing);
1708 /* Select widths from PAGE into subpage. */
1710 dcp = subpage->cp[a];
1712 for (z = 0; z <= rule_ofs (subpage->h[a][0]); z++, dcp++)
1714 if (z == 0 && subpage->is_edge_cutoff[a][0])
1717 dcp[1] = dcp[0] + (scp[z + 1] - scp[z]);
1719 for (z = cell_ofs (z0); z <= cell_ofs (z1 - 1); z++, dcp++)
1721 dcp[1] = dcp[0] + (scp[z + 1] - scp[z]);
1722 if (z == cell_ofs (z0))
1725 if (page->h[a][0] && page->h[a][1])
1726 dcp[1] += page->join_crossing[a][z / 2];
1728 if (z == cell_ofs (z1 - 1))
1731 for (z = rule_ofs_r (page, a, subpage->h[a][1]);
1732 z <= rule_ofs_r (page, a, 0); z++, dcp++)
1734 if (z == rule_ofs_r (page, a, 0) && subpage->is_edge_cutoff[a][1])
1737 dcp[1] = dcp[0] + (scp[z + 1] - scp[z]);
1739 assert (dcp == &subpage->cp[a][2 * subpage->n[a] + 1]);
1741 for (z = 0; z < page->n[b] * 2 + 2; z++)
1742 subpage->cp[b][z] = page->cp[b][z];
1744 /* Add new overflows. */
1752 s.subpage = subpage;
1754 if (!page->h[a][0] || z0 > page->h[a][0] || p0)
1755 for (z = 0; z < page->n[b]; )
1757 struct table_cell cell;
1758 int d[TABLE_N_AXES];
1765 table_get_cell (page->table, d[H], d[V], &cell);
1766 overflow0 = p0 || cell.d[a][0] < z0;
1767 overflow1 = cell.d[a][1] > z1 || (cell.d[a][1] == z1 && p1);
1768 if (overflow0 || overflow1)
1770 ro = insert_overflow (&s, &cell);
1774 ro->overflow[a][0] += p0 + axis_width (
1775 page, a, cell_ofs (cell.d[a][0]), cell_ofs (z0));
1776 if (page->h[a][0] && page->h[a][1])
1777 ro->overflow[a][0] -= page->join_crossing[a][cell.d[a][0]
1783 ro->overflow[a][1] += p1 + axis_width (
1784 page, a, cell_ofs (z1), cell_ofs (cell.d[a][1]));
1785 if (page->h[a][0] && page->h[a][1])
1786 ro->overflow[a][1] -= page->join_crossing[a][cell.d[a][1]];
1790 table_cell_free (&cell);
1793 if (!page->h[a][1] || z1 < page->n[a] - page->h[a][1] || p1)
1794 for (z = 0; z < page->n[b]; )
1796 struct table_cell cell;
1797 int d[TABLE_N_AXES];
1801 table_get_cell (page->table, d[H], d[V], &cell);
1802 if ((cell.d[a][1] > z1 || (cell.d[a][1] == z1 && p1))
1803 && find_overflow_for_cell (&s, &cell) == NULL)
1805 ro = insert_overflow (&s, &cell);
1806 ro->overflow[a][1] += p1 + axis_width (page, a, cell_ofs (z1),
1807 cell_ofs (cell.d[a][1]));
1810 table_cell_free (&cell);
1813 /* Copy overflows from PAGE into subpage. */
1814 HMAP_FOR_EACH (ro, struct render_overflow, node, &page->overflows)
1816 struct table_cell cell;
1818 table_get_cell (page->table, ro->d[H], ro->d[V], &cell);
1819 if (cell.d[a][1] > z0 && cell.d[a][0] < z1
1820 && find_overflow_for_cell (&s, &cell) == NULL)
1821 insert_overflow (&s, &cell);
1822 table_cell_free (&cell);
1828 /* Given CELL, a table_cell within S->page, stores in SUBCELL the (x,y)
1829 coordinates of the top-left cell as it will appear in S->subpage.
1831 CELL must actually intersect the region of S->page that is being selected
1832 by render_page_select() or the results will not make any sense. */
1834 cell_to_subpage (struct render_page_selection *s,
1835 const struct table_cell *cell, int subcell[TABLE_N_AXES])
1837 enum table_axis a = s->a;
1838 enum table_axis b = s->b;
1839 int ha0 = s->subpage->h[a][0];
1841 subcell[a] = MAX (cell->d[a][0] - s->z0 + ha0, ha0);
1842 subcell[b] = cell->d[b][0];
1845 /* Given CELL, a table_cell within S->page, returns the render_overflow for
1846 that cell in S->subpage, if there is one, and a null pointer otherwise.
1848 CELL must actually intersect the region of S->page that is being selected
1849 by render_page_select() or the results will not make any sense. */
1850 static const struct render_overflow *
1851 find_overflow_for_cell (struct render_page_selection *s,
1852 const struct table_cell *cell)
1856 cell_to_subpage (s, cell, subcell);
1857 return find_overflow (s->subpage, subcell[H], subcell[V]);
1860 /* Given CELL, a table_cell within S->page, inserts a render_overflow for that
1861 cell in S->subpage (which must not already exist). Initializes the new
1862 render_overflow's 'overflow' member from the overflow for CELL in S->page,
1865 CELL must actually intersect the region of S->page that is being selected
1866 by render_page_select() or the results will not make any sense. */
1867 static struct render_overflow *
1868 insert_overflow (struct render_page_selection *s,
1869 const struct table_cell *cell)
1871 const struct render_overflow *old;
1872 struct render_overflow *of;
1874 of = xzalloc (sizeof *of);
1875 cell_to_subpage (s, cell, of->d);
1876 hmap_insert (&s->subpage->overflows, &of->node,
1877 hash_cell (of->d[H], of->d[V]));
1879 old = find_overflow (s->page, cell->d[H][0], cell->d[V][0]);
1881 memcpy (of->overflow, old->overflow, sizeof of->overflow);