2 * line formatting buffer for line adjustment and hyphenation
4 * The line formatting buffer does two main functions: breaking
5 * words into lines (possibly after breaking them at their
6 * hyphenation points), and, if requested, adjusting the space
7 * between words in a line. In this file the first step is
8 * referred to as filling.
10 * Functions like fmt_word() return nonzero on failure, which
11 * means the call should be repeated after fetching previously
12 * formatted lines via fmt_nextline().
19 #define FMT_LLEN(f) MAX(0, (f)->ll - (f)->li - (f)->lI)
20 #define FMT_FILL(f) (!n_ce && n_u)
21 #define FMT_ADJ(f) (n_u && !n_na && !n_ce && (n_j & AD_B) == AD_B)
23 static int fmt_fillwords(struct fmt
*f
, int br
);
27 int wid
; /* word's width */
28 int elsn
, elsp
; /* els_neg and els_pos */
29 int gap
; /* the space before this word */
30 int hy
; /* hyphen width if inserted after this word */
31 int str
; /* does the space before it stretch */
32 int cost
; /* the extra cost of line break after this word */
33 int swid
; /* space width after this word (i.e., \w' ') */
45 int words_n
, words_sz
;
48 int lines_head
, lines_tail
, lines_sz
;
49 /* for paragraph adjustment */
54 int gap
; /* space before the next word */
55 int nls
; /* newlines before the next word */
56 int nls_sup
; /* suppressed newlines */
57 int li
, ll
, lI
; /* current line indentation and length */
58 int filled
; /* filled all words in the last fmt_fill() */
59 int eos
; /* last word ends a sentence */
60 int fillreq
; /* fill after the last word (\p) */
63 /* .ll, .in and .ti are delayed until the partial line is output */
64 static void fmt_confupdate(struct fmt
*f
)
67 f
->li
= n_ti
>= 0 ? n_ti
: n_i
;
68 f
->lI
= n_tI
>= 0 ? n_tI
: n_I
;
73 static int fmt_confchanged(struct fmt
*f
)
75 return f
->ll
!= n_l
|| f
->li
!= (n_ti
>= 0 ? n_ti
: n_i
) ||
76 f
->lI
!= (n_tI
>= 0 ? n_tI
: n_I
);
79 /* move words inside an fmt struct */
80 static void fmt_movewords(struct fmt
*a
, int dst
, int src
, int len
)
82 memmove(a
->words
+ dst
, a
->words
+ src
, len
* sizeof(a
->words
[0]));
85 /* move words from the buffer to s */
86 static int fmt_wordscopy(struct fmt
*f
, int beg
, int end
,
87 struct sbuf
*s
, int *els_neg
, int *els_pos
)
94 for (i
= beg
; i
< end
; i
++) {
96 sbuf_printf(s
, "%ch'%du'", c_ec
, wcur
->gap
);
97 sbuf_append(s
, wcur
->s
);
98 w
+= wcur
->wid
+ wcur
->gap
;
99 if (wcur
->elsn
< *els_neg
)
100 *els_neg
= wcur
->elsn
;
101 if (wcur
->elsp
> *els_pos
)
102 *els_pos
= wcur
->elsp
;
106 wcur
= &f
->words
[end
- 1];
108 sbuf_append(s
, "\\(hy");
114 static int fmt_nlines(struct fmt
*f
)
116 return f
->lines_head
- f
->lines_tail
;
119 /* the total width of the specified words in f->words[] */
120 static int fmt_wordslen(struct fmt
*f
, int beg
, int end
)
123 for (i
= beg
; i
< end
; i
++)
124 w
+= f
->words
[i
].wid
+ f
->words
[i
].gap
;
125 return beg
< end
? w
+ f
->words
[end
- 1].hy
: 0;
128 /* the number of stretchable spaces in f */
129 static int fmt_spaces(struct fmt
*f
, int beg
, int end
)
132 for (i
= beg
+ 1; i
< end
; i
++)
138 /* the amount of stretchable spaces in f */
139 static int fmt_spacessum(struct fmt
*f
, int beg
, int end
)
142 for (i
= beg
+ 1; i
< end
; i
++)
144 n
+= f
->words
[i
].gap
;
148 /* return the next line in the buffer */
149 char *fmt_nextline(struct fmt
*f
, int *w
,
150 int *li
, int *lI
, int *ll
, int *els_neg
, int *els_pos
)
153 if (f
->lines_head
== f
->lines_tail
)
155 l
= &f
->lines
[f
->lines_tail
++];
162 return sbuf_out(&l
->sbuf
);
165 static struct line
*fmt_mkline(struct fmt
*f
)
168 if (f
->lines_head
== f
->lines_tail
) {
172 if (f
->lines_head
== f
->lines_sz
) {
174 f
->lines
= mextend(f
->lines
, f
->lines_head
,
175 f
->lines_sz
, sizeof(f
->lines
[0]));
177 l
= &f
->lines
[f
->lines_head
++];
185 /* extract words from beg to end; shrink or stretch spaces if needed */
186 static int fmt_extractline(struct fmt
*f
, int beg
, int end
, int str
)
188 int fmt_div
, fmt_rem
;
189 int w
, i
, nspc
, llen
;
191 if (!(l
= fmt_mkline(f
)))
194 w
= fmt_wordslen(f
, beg
, end
);
195 nspc
= fmt_spaces(f
, beg
, end
);
196 if (nspc
&& FMT_ADJ(f
) && (llen
< w
|| str
)) {
197 fmt_div
= (llen
- w
) / nspc
;
198 fmt_rem
= (llen
- w
) % nspc
;
203 for (i
= beg
+ 1; i
< end
; i
++)
205 f
->words
[i
].gap
+= fmt_div
+ (fmt_rem
-- > 0);
207 l
->wid
= fmt_wordscopy(f
, beg
, end
, &l
->sbuf
, &l
->elsn
, &l
->elsp
);
211 static int fmt_sp(struct fmt
*f
)
213 if (fmt_fillwords(f
, 1))
215 if (fmt_extractline(f
, 0, f
->words_n
, 0))
225 /* fill as many lines as possible; if br, put the remaining words in a line */
226 int fmt_fill(struct fmt
*f
, int br
)
228 if (fmt_fillwords(f
, br
))
239 void fmt_space(struct fmt
*fmt
)
241 fmt
->gap
+= font_swid(dev_font(n_f
), n_s
, n_ss
);
244 int fmt_newline(struct fmt
*f
)
255 if (f
->nls
== 0 && !f
->filled
&& !f
->words_n
)
261 /* format the paragraph after the next word (\p) */
262 int fmt_fillreq(struct fmt
*f
)
265 if (fmt_fillwords(f
, 0))
267 f
->fillreq
= f
->words_n
+ 1;
271 static void fmt_wb2word(struct fmt
*f
, struct word
*word
, struct wb
*wb
,
272 int hy
, int str
, int gap
, int cost
)
274 int len
= strlen(wb_buf(wb
));
275 word
->s
= xmalloc(len
+ 1);
276 memcpy(word
->s
, wb_buf(wb
), len
+ 1);
277 word
->wid
= wb_wid(wb
);
278 word
->elsn
= wb
->els_neg
;
279 word
->elsp
= wb
->els_pos
;
280 word
->hy
= hy
? wb_hywid(wb
) : 0;
284 word
->swid
= wb_swid(wb
);
287 /* find explicit break positions: dashes, \:, \%, and \~ */
288 static int fmt_hyphmarks(char *word
, int *hyidx
, int *hyins
, int *hygap
)
293 while ((c
= escread(&s
, &d
)) > 0)
295 if (c
< 0 || !strcmp(c_hc
, d
))
297 while ((c
= escread(&s
, &d
)) >= 0 && n
< NHYPHSWORD
) {
298 if (!c
&& !strcmp(c_hc
, d
)) {
300 hyidx
[n
++] = s
- word
;
302 if (!c
&& c_hydash(d
)) {
304 hyidx
[n
++] = s
- word
;
306 if (!c
&& !strcmp(c_nb
, d
)) {
308 hyidx
[n
++] = s
- word
;
314 static struct word
*fmt_mkword(struct fmt
*f
)
316 if (f
->words_n
== f
->words_sz
) {
318 f
->words
= mextend(f
->words
, f
->words_n
,
319 f
->words_sz
, sizeof(f
->words
[0]));
321 return &f
->words
[f
->words_n
++];
324 static void fmt_insertword(struct fmt
*f
, struct wb
*wb
, int gap
)
326 int hyidx
[NHYPHSWORD
]; /* sub-word boundaries */
327 int hyins
[NHYPHSWORD
] = {0}; /* insert dash */
328 int hygap
[NHYPHSWORD
] = {0}; /* stretchable no-break space */
329 char *src
= wb_buf(wb
);
335 n
= fmt_hyphmarks(src
, hyidx
, hyins
, hygap
);
337 fmt_wb2word(f
, fmt_mkword(f
), wb
, 0, 1, gap
, wb_cost(wb
));
340 /* update f->fillreq considering the new sub-words */
341 if (f
->fillreq
== f
->words_n
+ 1)
345 for (i
= 0; i
<= n
; i
++) {
346 int ihy
= i
< n
&& hyins
[i
]; /* dash width */
347 int istr
= i
== 0 || hygap
[i
- 1]; /* stretchable */
348 int igap
; /* gap width */
349 int icost
; /* hyphenation cost */
350 beg
= src
+ (i
> 0 ? hyidx
[i
- 1] : 0);
351 end
= src
+ (i
< n
? hyidx
[i
] : strlen(src
));
352 if (i
< n
&& hygap
[i
]) /* remove \~ */
354 wb_catstr(&wbc
, beg
, end
);
355 wb_fnszget(&wbc
, &cf
, &cs
, &cm
, &ccd
);
356 icost
= i
== n
? wb_cost(&wbc
) : hygap
[i
] * 10000000;
357 igap
= i
== 0 ? gap
: hygap
[i
- 1] * wb_swid(&wbc
);
358 fmt_wb2word(f
, fmt_mkword(f
), &wbc
, ihy
, istr
, igap
, icost
);
360 wb_fnszset(&wbc
, cf
, cs
, cm
, ccd
); /* restoring wbc */
365 /* the amount of space necessary before the next word */
366 static int fmt_wordgap(struct fmt
*f
)
368 int nls
= f
->nls
|| f
->nls_sup
;
369 int swid
= font_swid(dev_font(n_f
), n_s
, n_ss
);
370 if (f
->eos
&& f
->words_n
)
371 if ((nls
&& !f
->gap
) || (!nls
&& f
->gap
== 2 * swid
))
372 return swid
+ font_swid(dev_font(n_f
), n_s
, n_sss
);
373 return (nls
&& !f
->gap
&& f
->words_n
) ? swid
: f
->gap
;
376 /* insert wb into fmt */
377 int fmt_word(struct fmt
*f
, struct wb
*wb
)
381 if (fmt_confchanged(f
))
382 if (fmt_fillwords(f
, 0))
384 if (FMT_FILL(f
) && f
->nls
&& f
->gap
)
387 if (!f
->words_n
) /* apply the new .l and .i */
389 f
->gap
= fmt_wordgap(f
);
391 fmt_insertword(f
, wb
, f
->filled
? 0 : f
->gap
);
399 /* approximate 8 * sqrt(cost) */
400 static long scaledown(long cost
)
404 for (i
= 0; i
< 14; i
++)
405 ret
+= ((cost
>> (i
* 2)) & 3) << (i
+ 3);
406 return ret
< (1 << 13) ? ret
: (1 << 13);
409 /* the cost of putting lwid words in a line of length llen */
410 static long FMT_COST(int llen
, int lwid
, int swid
, int nspc
)
412 /* the ratio that the stretchable spaces of the line should be spread */
413 long ratio
= abs((llen
- lwid
) * 100l / (swid
? swid
: 1));
414 /* ratio too large; scaling it down */
416 ratio
= 4000 + scaledown(ratio
- 4000);
417 /* assigning a cost of 100 to each space stretching 100 percent */
418 return ratio
* ratio
/ 100l * (nspc
? nspc
: 1);
421 /* the number of hyphenations in consecutive lines ending at pos */
422 static int fmt_hydepth(struct fmt
*f
, int pos
)
425 while (pos
> 0 && f
->words
[pos
- 1].hy
&& ++n
< 5)
426 pos
= f
->best_pos
[pos
];
430 static long hycost(int depth
)
432 if (n_hlm
> 0 && depth
> n_hlm
)
435 return n_hycost
+ n_hycost2
+ n_hycost3
;
437 return n_hycost
+ n_hycost2
;
438 return depth
? n_hycost
: 0;
441 /* the cost of putting a line break before word pos */
442 static long fmt_findcost(struct fmt
*f
, int pos
)
446 int llen
= MAX(1, FMT_LLEN(f
));
447 int lwid
= 0; /* current line length */
448 int swid
= 0; /* amount of stretchable spaces */
449 int nspc
= 0; /* number of stretchable spaces */
450 int dwid
= 0; /* equal to swid, unless swid is zero */
453 if (f
->best_pos
[pos
] >= 0)
454 return f
->best
[pos
] + f
->words
[pos
- 1].cost
;
455 lwid
= f
->words
[pos
- 1].hy
; /* non-zero if the last word is hyphenated */
456 hyphenated
= f
->words
[pos
- 1].hy
!= 0;
459 lwid
+= f
->words
[i
].wid
;
461 lwid
+= f
->words
[i
+ 1].gap
;
462 if (i
+ 1 < pos
&& f
->words
[i
+ 1].str
) {
463 swid
+= f
->words
[i
+ 1].gap
;
466 if (lwid
> llen
+ swid
* n_ssh
/ 100 && i
+ 1 < pos
)
469 if (!dwid
&& i
> 0) /* no stretchable spaces */
470 dwid
= f
->words
[i
- 1].swid
;
471 cur
= fmt_findcost(f
, i
) + FMT_COST(llen
, lwid
, dwid
, nspc
);
473 cur
+= hycost(1 + fmt_hydepth(f
, i
));
474 if (f
->best_pos
[pos
] < 0 || cur
< f
->best
[pos
]) {
475 f
->best_pos
[pos
] = i
;
476 f
->best_dep
[pos
] = f
->best_dep
[i
] + 1;
481 return f
->best
[pos
] + f
->words
[pos
- 1].cost
;
484 static int fmt_bestpos(struct fmt
*f
, int pos
)
486 fmt_findcost(f
, pos
);
487 return MAX(0, f
->best_pos
[pos
]);
490 static int fmt_bestdep(struct fmt
*f
, int pos
)
492 fmt_findcost(f
, pos
);
493 return MAX(0, f
->best_dep
[pos
]);
496 /* return the last filled word */
497 static int fmt_breakparagraph(struct fmt
*f
, int pos
, int br
)
501 long cost
, best_cost
= 0;
502 int llen
= FMT_LLEN(f
);
503 int lwid
= 0; /* current line length */
504 int swid
= 0; /* amount of stretchable spaces */
505 int nspc
= 0; /* number of stretchable spaces */
506 if (f
->fillreq
> 0 && f
->fillreq
<= f
->words_n
) {
507 fmt_findcost(f
, f
->fillreq
);
510 if (pos
> 0 && f
->words
[pos
- 1].wid
>= llen
) {
511 fmt_findcost(f
, pos
);
516 if (f
->words
[i
].hy
) /* the last word is hyphenated */
517 lwid
+= f
->words
[i
].hy
;
519 lwid
+= f
->words
[i
].wid
;
521 lwid
+= f
->words
[i
+ 1].gap
;
522 if (i
+ 1 < pos
&& f
->words
[i
+ 1].str
) {
523 swid
+= f
->words
[i
+ 1].gap
;
526 if (lwid
> llen
&& i
+ 1 < pos
)
528 cost
= fmt_findcost(f
, i
);
529 /* the cost of formatting short lines; should prevent widows */
530 if (br
&& n_pmll
&& lwid
< llen
* n_pmll
/ 100) {
531 int pmll
= llen
* n_pmll
/ 100;
532 cost
+= (long) n_pmllcost
* (pmll
- lwid
) / pmll
;
534 if (best
< 0 || cost
< best_cost
) {
543 /* extract the first nreq formatted lines before the word at pos */
544 static int fmt_head(struct fmt
*f
, int nreq
, int pos
)
546 int best
= pos
; /* best line break for nreq-th line */
547 int prev
, next
; /* best line breaks without hyphenation */
548 if (nreq
<= 0 || fmt_bestdep(f
, pos
) < nreq
)
550 /* finding the optimal line break for nreq-th line */
551 while (best
> 0 && fmt_bestdep(f
, best
) > nreq
)
552 best
= fmt_bestpos(f
, best
);
555 /* finding closest line breaks without hyphenation */
556 while (prev
> 1 && f
->words
[prev
- 1].hy
&&
557 fmt_bestdep(f
, prev
- 1) == nreq
)
559 while (next
< pos
&& f
->words
[next
- 1].hy
&&
560 fmt_bestdep(f
, next
) == nreq
)
562 /* choosing the best of them */
563 if (!f
->words
[prev
- 1].hy
&& !f
->words
[next
- 1].hy
)
564 return fmt_findcost(f
, prev
) <= fmt_findcost(f
, next
) ? prev
: next
;
565 if (!f
->words
[prev
- 1].hy
)
567 if (!f
->words
[next
- 1].hy
)
572 /* break f->words[0..end] into lines according to fmt_bestpos() */
573 static int fmt_break(struct fmt
*f
, int end
)
576 beg
= fmt_bestpos(f
, end
);
578 ret
+= fmt_break(f
, beg
);
579 f
->words
[beg
].gap
= 0;
580 if (fmt_extractline(f
, beg
, end
, 1))
584 return ret
+ (end
- beg
);
587 /* estimated number of lines until traps or the end of a page */
588 static int fmt_safelines(void)
590 int lnht
= MAX(1, n_L
) * n_v
;
591 return (f_nexttrap() + lnht
- 1) / lnht
;
594 /* fill the words collected in the buffer */
595 static int fmt_fillwords(struct fmt
*f
, int br
)
597 int nreq
; /* the number of lines until a trap */
598 int end
; /* the final line ends before this word */
599 int end_head
; /* like end, but only the first nreq lines included */
600 int head
= 0; /* only nreq first lines have been formatted */
601 int llen
; /* line length, taking shrinkable spaces into account */
605 llen
= fmt_wordslen(f
, 0, f
->words_n
) -
606 fmt_spacessum(f
, 0, f
->words_n
) * n_ssh
/ 100;
607 /* not enough words to fill */
608 if ((f
->fillreq
<= 0 || f
->words_n
< f
->fillreq
) && llen
<= FMT_LLEN(f
))
610 nreq
= (n_hy
& HY_LAST
) ? fmt_safelines() : 0;
611 if (nreq
> 0 && nreq
<= fmt_nlines(f
))
613 /* resetting positions */
614 f
->best
= malloc((f
->words_n
+ 1) * sizeof(f
->best
[0]));
615 f
->best_pos
= malloc((f
->words_n
+ 1) * sizeof(f
->best_pos
[0]));
616 f
->best_dep
= malloc((f
->words_n
+ 1) * sizeof(f
->best_dep
[0]));
617 memset(f
->best
, 0, (f
->words_n
+ 1) * sizeof(f
->best
[0]));
618 memset(f
->best_dep
, 0, (f
->words_n
+ 1) * sizeof(f
->best_dep
[0]));
619 for (i
= 0; i
< f
->words_n
+ 1; i
++)
621 end
= fmt_breakparagraph(f
, f
->words_n
, br
);
623 end_head
= fmt_head(f
, nreq
- fmt_nlines(f
), end
);
624 head
= end_head
< end
;
627 /* recursively add lines */
628 n
= end
> 0 ? fmt_break(f
, end
) : 0;
631 fmt_movewords(f
, 0, n
, f
->words_n
);
632 f
->filled
= n
&& !f
->words_n
;
635 if (f
->words_n
) /* apply the new .l and .i */
643 return head
|| n
!= end
;
646 struct fmt
*fmt_alloc(void)
648 struct fmt
*fmt
= xmalloc(sizeof(*fmt
));
649 memset(fmt
, 0, sizeof(*fmt
));
653 void fmt_free(struct fmt
*fmt
)
660 int fmt_wid(struct fmt
*fmt
)
662 return fmt_wordslen(fmt
, 0, fmt
->words_n
) + fmt_wordgap(fmt
);
665 int fmt_morewords(struct fmt
*fmt
)
667 return fmt_morelines(fmt
) || fmt
->words_n
;
670 int fmt_morelines(struct fmt
*fmt
)
672 return fmt
->lines_head
!= fmt
->lines_tail
;
675 /* suppress the last newline */
676 void fmt_suppressnl(struct fmt
*fmt
)