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)
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 */
42 struct word words
[NWORDS
];
45 struct line lines
[NLINES
];
47 /* for paragraph adjustment */
52 int gap
; /* space before the next word */
53 int nls
; /* newlines before the next word */
54 int nls_sup
; /* suppressed newlines */
55 int li
, ll
; /* current line indentation and length */
56 int filled
; /* filled all words in the last fmt_fill() */
57 int eos
; /* last word ends a sentence */
58 int fillreq
; /* fill after the last word (\p) */
61 /* .ll, .in and .ti are delayed until the partial line is output */
62 static void fmt_confupdate(struct fmt
*f
)
65 f
->li
= n_ti
>= 0 ? n_ti
: n_i
;
69 static int fmt_confchanged(struct fmt
*f
)
71 return f
->ll
!= n_l
|| f
->li
!= (n_ti
>= 0 ? n_ti
: n_i
);
74 /* move words inside an fmt struct */
75 static void fmt_movewords(struct fmt
*a
, int dst
, int src
, int len
)
77 memmove(a
->words
+ dst
, a
->words
+ src
, len
* sizeof(a
->words
[0]));
80 /* move words from the buffer to s */
81 static int fmt_wordscopy(struct fmt
*f
, int beg
, int end
,
82 struct sbuf
*s
, int *els_neg
, int *els_pos
)
89 for (i
= beg
; i
< end
; i
++) {
91 sbuf_printf(s
, "%ch'%du'", c_ec
, wcur
->gap
);
92 sbuf_append(s
, wcur
->s
);
93 w
+= wcur
->wid
+ wcur
->gap
;
94 if (wcur
->elsn
< *els_neg
)
95 *els_neg
= wcur
->elsn
;
96 if (wcur
->elsp
> *els_pos
)
97 *els_pos
= wcur
->elsp
;
101 wcur
= &f
->words
[end
- 1];
103 sbuf_append(s
, "\\(hy");
109 static int fmt_nlines(struct fmt
*f
)
111 if (f
->l_tail
<= f
->l_head
)
112 return f
->l_head
- f
->l_tail
;
113 return NLINES
- f
->l_tail
+ f
->l_head
;
116 /* the total width of the specified words in f->words[] */
117 static int fmt_wordslen(struct fmt
*f
, int beg
, int end
)
120 for (i
= beg
; i
< end
; i
++)
121 w
+= f
->words
[i
].wid
+ f
->words
[i
].gap
;
122 return beg
< end
? w
+ f
->words
[end
- 1].hy
: 0;
125 /* the number of stretchable spaces in f */
126 static int fmt_spaces(struct fmt
*f
, int beg
, int end
)
129 for (i
= beg
+ 1; i
< end
; i
++)
135 /* the amount of stretchable spaces in f */
136 static int fmt_spacessum(struct fmt
*f
, int beg
, int end
)
139 for (i
= beg
+ 1; i
< end
; i
++)
141 n
+= f
->words
[i
].gap
;
145 /* return the next line in the buffer */
146 int fmt_nextline(struct fmt
*f
, struct sbuf
*sbuf
, int *w
,
147 int *li
, int *ll
, int *els_neg
, int *els_pos
)
150 l
= &f
->lines
[f
->l_tail
];
151 if (f
->l_head
== f
->l_tail
)
158 sbuf_append(sbuf
, sbuf_buf(&l
->sbuf
));
160 f
->l_tail
= (f
->l_tail
+ 1) % NLINES
;
164 static struct line
*fmt_mkline(struct fmt
*f
)
166 struct line
*l
= &f
->lines
[f
->l_head
];
167 if ((f
->l_head
+ 1) % NLINES
== f
->l_tail
)
169 f
->l_head
= (f
->l_head
+ 1) % NLINES
;
176 static int fmt_extractline(struct fmt
*f
, int beg
, int end
, int llen
, int spread
)
178 int fmt_div
, fmt_rem
;
181 if (!(l
= fmt_mkline(f
)))
183 w
= fmt_wordslen(f
, beg
, end
);
184 nspc
= fmt_spaces(f
, beg
, end
);
185 /* stretch if (spread & 1) and shrink if (spread & 2) */
186 if (nspc
&& ((spread
& 1 && w
< llen
) || (spread
& 2 && w
> llen
))) {
187 fmt_div
= (llen
- w
) / nspc
;
188 fmt_rem
= (llen
- w
) % nspc
;
193 for (i
= beg
+ 1; i
< end
; i
++)
195 f
->words
[i
].gap
+= fmt_div
+ (fmt_rem
-- > 0);
197 l
->wid
= fmt_wordscopy(f
, beg
, end
, &l
->sbuf
, &l
->elsn
, &l
->elsp
);
201 static int fmt_sp(struct fmt
*f
)
203 if (fmt_fillwords(f
, 1))
205 if (fmt_extractline(f
, 0, f
->nwords
, FMT_LLEN(f
) * n_pmll
/ 100,
206 FMT_ADJ(f
) && n_j
& AD_P
))
216 /* fill as many lines as possible; if br, put the remaining words in a line */
217 int fmt_fill(struct fmt
*f
, int br
)
219 if (fmt_fillwords(f
, br
))
230 void fmt_space(struct fmt
*fmt
)
232 fmt
->gap
+= font_swid(dev_font(n_f
), n_s
, n_ss
);
235 int fmt_newline(struct fmt
*f
)
246 if (f
->nls
== 0 && !f
->filled
&& !f
->nwords
)
252 /* format the paragraph after the next word (\p) */
253 int fmt_fillreq(struct fmt
*f
)
256 if (fmt_fillwords(f
, 0))
258 f
->fillreq
= f
->nwords
+ 1;
262 static void fmt_wb2word(struct fmt
*f
, struct word
*word
, struct wb
*wb
,
263 int hy
, int str
, int gap
)
265 int len
= strlen(wb_buf(wb
));
266 word
->s
= xmalloc(len
+ 1);
267 memcpy(word
->s
, wb_buf(wb
), len
+ 1);
268 word
->wid
= wb_wid(wb
);
269 word
->elsn
= wb
->els_neg
;
270 word
->elsp
= wb
->els_pos
;
271 word
->hy
= hy
? wb_dashwid(wb
) : 0;
276 /* find explicit hyphenation positions: dashes, \: and \% */
277 static int fmt_hyphmarks(char *word
, int *hyidx
, int *hyins
)
282 while ((c
= escread(&s
, d
)) > 0)
284 if (c
< 0 || !strcmp(c_hc
, d
))
286 while ((c
= escread(&s
, d
)) >= 0 && n
< NHYPHSWORD
) {
287 if (!c
&& !strcmp(c_hc
, d
)) {
289 hyidx
[n
++] = s
- word
;
291 if (!c
&& (!strcmp(c_bp
, d
) || c_isdash(d
))) {
293 hyidx
[n
++] = s
- word
;
299 static void fmt_insertword(struct fmt
*f
, struct wb
*wb
, int gap
)
301 int hyidx
[NHYPHSWORD
];
302 int hyins
[NHYPHSWORD
] = {0};
303 char *src
= wb_buf(wb
);
309 n
= fmt_hyphmarks(src
, hyidx
, hyins
);
311 fmt_wb2word(f
, &f
->words
[f
->nwords
++], wb
, 0, 1, gap
);
315 for (i
= 0; i
<= n
; i
++) {
316 beg
= src
+ (i
> 0 ? hyidx
[i
- 1] : 0);
317 end
= src
+ (i
< n
? hyidx
[i
] : strlen(src
));
318 wb_catstr(&wbc
, beg
, end
);
319 fmt_wb2word(f
, &f
->words
[f
->nwords
++], &wbc
,
320 i
< n
&& hyins
[i
], i
== 0, i
== 0 ? gap
: 0);
322 wb_fnszget(&wbc
, &cs
, &cf
, &cm
);
324 wb_fnszset(&wbc
, cs
, cf
, cm
);
329 /* the amount of space necessary before the next word */
330 static int fmt_wordgap(struct fmt
*f
)
332 int nls
= f
->nls
|| f
->nls_sup
;
333 int swid
= font_swid(dev_font(n_f
), n_s
, n_ss
);
334 if (f
->eos
&& f
->nwords
)
335 if ((nls
&& !f
->gap
) || (!nls
&& f
->gap
== 2 * swid
))
336 return swid
+ font_swid(dev_font(n_f
), n_s
, n_sss
);
337 return (nls
&& !f
->gap
&& f
->nwords
) ? swid
: f
->gap
;
340 /* insert wb into fmt */
341 int fmt_word(struct fmt
*f
, struct wb
*wb
)
345 if (f
->nwords
+ NHYPHSWORD
>= NWORDS
|| fmt_confchanged(f
))
346 if (fmt_fillwords(f
, 0))
348 if (FMT_FILL(f
) && f
->nls
&& f
->gap
)
351 if (!f
->nwords
) /* apply the new .l and .i */
353 f
->gap
= fmt_wordgap(f
);
355 fmt_insertword(f
, wb
, f
->filled
? 0 : f
->gap
);
363 /* the cost of putting lwid words in a line of length llen */
364 static long FMT_COST(int llen
, int lwid
, int swid
, int nspc
)
366 /* the ratio that the stretchable spaces of the line should be spread */
367 long ratio
= abs((llen
- lwid
) * 100l / (swid
? swid
: 1));
368 /* assigning a cost of 100 to each space stretching 100 percent */
369 return (ratio
< 4000 ? ratio
* ratio
: 16000000) / 100l * (nspc
? nspc
: 4);
372 /* the cost of formatting last lines; should prevent widows */
373 static long FMT_LCOST(int llen
, int lwid
, int swid
, int nspc
)
375 if (!n_pmll
|| lwid
>= llen
* n_pmll
/ 100)
377 return FMT_COST(llen
, llen
* (100 - n_pmll
) / 100 + lwid
, swid
, nspc
);
380 /* the cost of putting a line break before word pos */
381 static long fmt_findcost(struct fmt
*f
, int pos
)
385 int llen
= MAX(1, FMT_LLEN(f
));
386 int lwid
= 0; /* current line length */
387 int swid
= 0; /* amount of stretchable spaces */
388 int nspc
= 0; /* number of stretchable spaces */
391 if (f
->best_pos
[pos
] >= 0)
395 if (f
->words
[i
].hy
) /* the last word is hyphenated */
396 lwid
+= f
->words
[i
].hy
;
400 lwid
+= f
->words
[i
].wid
;
402 lwid
+= f
->words
[i
+ 1].gap
;
403 if (i
+ 1 < pos
&& f
->words
[i
+ 1].str
) {
404 swid
+= f
->words
[i
+ 1].gap
;
407 if (lwid
- (swid
* n_ssh
/ 100) > llen
)
410 cur
= fmt_findcost(f
, i
) + FMT_COST(llen
, lwid
, swid
, nspc
) +
411 pen
* (nspc
? nspc
: 1);
412 if (f
->best_pos
[pos
] < 0 || cur
< f
->best
[pos
]) {
413 f
->best_pos
[pos
] = i
;
414 f
->best_dep
[pos
] = f
->best_dep
[i
] + 1;
422 static int fmt_bestpos(struct fmt
*f
, int pos
)
424 fmt_findcost(f
, pos
);
425 return MAX(0, f
->best_pos
[pos
]);
428 static int fmt_bestdep(struct fmt
*f
, int pos
)
430 fmt_findcost(f
, pos
);
431 return MAX(0, f
->best_dep
[pos
]);
434 /* return the last filled word */
435 static int fmt_breakparagraph(struct fmt
*f
, int pos
, int br
)
439 long cost
, best_cost
= 0;
440 int llen
= FMT_LLEN(f
);
441 int lwid
= 0; /* current line length */
442 int swid
= 0; /* amount of stretchable spaces */
443 int nspc
= 0; /* number of stretchable spaces */
444 if (f
->fillreq
> 0 && f
->fillreq
<= f
->nwords
) {
445 fmt_findcost(f
, f
->fillreq
);
448 if (pos
> 0 && f
->words
[pos
- 1].wid
>= llen
) {
449 fmt_findcost(f
, pos
);
454 if (f
->words
[i
].hy
) /* the last word is hyphenated */
455 lwid
+= f
->words
[i
].hy
;
457 lwid
+= f
->words
[i
].wid
;
459 lwid
+= f
->words
[i
+ 1].gap
;
460 if (i
+ 1 < pos
&& f
->words
[i
+ 1].str
) {
461 swid
+= f
->words
[i
+ 1].gap
;
464 if (lwid
> llen
&& i
+ 1 < pos
)
466 cost
= fmt_findcost(f
, i
) +
467 (br
? FMT_LCOST(llen
, lwid
, swid
, nspc
) : 0);
468 if (best
< 0 || cost
< best_cost
) {
477 /* extract the first nreq formatted lines before the word at pos */
478 static int fmt_head(struct fmt
*f
, int nreq
, int pos
)
480 int best
= pos
; /* best line break for nreq-th line */
481 int prev
, next
; /* best line breaks without hyphenation */
482 if (nreq
<= 0 || fmt_bestdep(f
, pos
) < nreq
)
484 /* finding the optimal line break for nreq-th line */
485 while (best
> 0 && fmt_bestdep(f
, best
) > nreq
)
486 best
= fmt_bestpos(f
, best
);
489 /* finding closest line breaks without hyphenation */
490 while (prev
> 1 && f
->words
[prev
- 1].hy
&&
491 fmt_bestdep(f
, prev
- 1) == nreq
)
493 while (next
< pos
&& f
->words
[next
- 1].hy
&&
494 fmt_bestdep(f
, next
+ 1) == nreq
)
496 /* choosing the best of them */
497 if (!f
->words
[prev
- 1].hy
&& !f
->words
[next
- 1].hy
)
498 return fmt_findcost(f
, prev
) <= fmt_findcost(f
, next
) ? prev
: next
;
499 if (!f
->words
[prev
- 1].hy
)
501 if (!f
->words
[next
- 1].hy
)
506 /* break f->words[0..end] into lines according to fmt_bestpos() */
507 static int fmt_break(struct fmt
*f
, int end
)
510 beg
= fmt_bestpos(f
, end
);
512 ret
+= fmt_break(f
, beg
);
513 f
->words
[beg
].gap
= 0;
514 if (fmt_extractline(f
, beg
, end
, FMT_LLEN(f
), FMT_ADJ(f
) ? 3 : 0))
518 return ret
+ (end
- beg
);
521 /* estimated number of lines until traps or the end of a page */
522 static int fmt_safelines(void)
524 int lnht
= MAX(1, n_L
) * n_v
;
525 return (f_nexttrap() + lnht
- 1) / lnht
;
528 /* fill the words collected in the buffer */
529 static int fmt_fillwords(struct fmt
*f
, int br
)
531 int nreq
; /* the number of lines until a trap */
532 int end
; /* the final line ends before this word */
533 int end_head
; /* like end, but only the first nreq lines included */
534 int head
= 0; /* only nreq first lines have been formatted */
535 int llen
; /* line length, taking shrinkable spaces into account */
539 llen
= fmt_wordslen(f
, 0, f
->nwords
) -
540 fmt_spacessum(f
, 0, f
->nwords
) * n_ssh
/ 100;
541 /* not enough words to fill */
542 if ((f
->fillreq
<= 0 || f
->nwords
< f
->fillreq
) && llen
<= FMT_LLEN(f
))
544 nreq
= (n_hy
& HY_LAST
) ? fmt_safelines() : 0;
545 if (nreq
> 0 && nreq
<= fmt_nlines(f
))
547 /* resetting positions */
548 for (i
= 0; i
< f
->nwords
+ 1; i
++)
550 end
= fmt_breakparagraph(f
, f
->nwords
, br
);
552 end_head
= fmt_head(f
, nreq
- fmt_nlines(f
), end
);
553 head
= end_head
< end
;
556 /* recursively add lines */
557 n
= fmt_break(f
, end
);
560 fmt_movewords(f
, 0, n
, f
->nwords
);
561 f
->filled
= n
&& !f
->nwords
;
564 if (f
->nwords
) /* apply the new .l and .i */
566 return head
|| n
!= end
;
569 struct fmt
*fmt_alloc(void)
571 struct fmt
*fmt
= xmalloc(sizeof(*fmt
));
572 memset(fmt
, 0, sizeof(*fmt
));
576 void fmt_free(struct fmt
*fmt
)
581 int fmt_wid(struct fmt
*fmt
)
583 return fmt_wordslen(fmt
, 0, fmt
->nwords
) + fmt_wordgap(fmt
);
586 int fmt_morewords(struct fmt
*fmt
)
588 return fmt_morelines(fmt
) || fmt
->nwords
;
591 int fmt_morelines(struct fmt
*fmt
)
593 return fmt
->l_head
!= fmt
->l_tail
;
596 /* suppress the last newline */
597 void fmt_suppressnl(struct fmt
*fmt
)