]> git.cameronkatri.com Git - mandoc.git/blob - term.c
git.ckatri.com / mandoc.git / blob
? search:
summary | shortlog | log | commit | commitdiff | tree
history | raw | HEAD
If we have to reparse the text line because we spring an input line trap,
[mandoc.git] / term.c
1 /* $Id: term.c,v 1.248 2015/04/29 18:35:00 schwarze Exp $ */
2 /*
3 * Copyright (c) 2008, 2009, 2010, 2011 Kristaps Dzonsons <kristaps@bsd.lv>
4 * Copyright (c) 2010-2015 Ingo Schwarze <schwarze@openbsd.org>
5 *
6 * Permission to use, copy, modify, and distribute this software for any
7 * purpose with or without fee is hereby granted, provided that the above
8 * copyright notice and this permission notice appear in all copies.
9 *
10 * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHORS DISCLAIM ALL WARRANTIES
11 * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
12 * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHORS BE LIABLE FOR
13 * ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
14 * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
15 * ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
16 * OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
17 */
18 #include "config.h"
19
20 #include <sys/types.h>
21
22 #include <assert.h>
23 #include <ctype.h>
24 #include <stdio.h>
25 #include <stdlib.h>
26 #include <string.h>
27
28 #include "mandoc.h"
29 #include "mandoc_aux.h"
30 #include "out.h"
31 #include "term.h"
32 #include "main.h"
33
34 static size_t cond_width(const struct termp *, int, int *);
35 static void adjbuf(struct termp *p, size_t);
36 static void bufferc(struct termp *, char);
37 static void encode(struct termp *, const char *, size_t);
38 static void encode1(struct termp *, int);
39
40
41 void
42 term_free(struct termp *p)
43 {
44
45 free(p->buf);
46 free(p->fontq);
47 free(p);
48 }
49
50 void
51 term_begin(struct termp *p, term_margin head,
52 term_margin foot, const struct roff_meta *arg)
53 {
54
55 p->headf = head;
56 p->footf = foot;
57 p->argf = arg;
58 (*p->begin)(p);
59 }
60
61 void
62 term_end(struct termp *p)
63 {
64
65 (*p->end)(p);
66 }
67
68 /*
69 * Flush a chunk of text. By default, break the output line each time
70 * the right margin is reached, and continue output on the next line
71 * at the same offset as the chunk itself. By default, also break the
72 * output line at the end of the chunk.
73 * The following flags may be specified:
74 *
75 * - TERMP_NOBREAK: Do not break the output line at the right margin,
76 * but only at the max right margin. Also, do not break the output
77 * line at the end of the chunk, such that the next call can pad to
78 * the next column. However, if less than p->trailspace blanks,
79 * which can be 0, 1, or 2, remain to the right margin, the line
80 * will be broken.
81 * - TERMP_BRIND: If the chunk does not fit and the output line has
82 * to be broken, start the next line at the right margin instead
83 * of at the offset. Used together with TERMP_NOBREAK for the tags
84 * in various kinds of tagged lists.
85 * - TERMP_DANGLE: Do not break the output line at the right margin,
86 * append the next chunk after it even if this one is too long.
87 * To be used together with TERMP_NOBREAK.
88 * - TERMP_HANG: Like TERMP_DANGLE, and also suppress padding before
89 * the next chunk if this column is not full.
90 */
91 void
92 term_flushln(struct termp *p)
93 {
94 size_t i; /* current input position in p->buf */
95 int ntab; /* number of tabs to prepend */
96 size_t vis; /* current visual position on output */
97 size_t vbl; /* number of blanks to prepend to output */
98 size_t vend; /* end of word visual position on output */
99 size_t bp; /* visual right border position */
100 size_t dv; /* temporary for visual pos calculations */
101 size_t j; /* temporary loop index for p->buf */
102 size_t jhy; /* last hyph before overflow w/r/t j */
103 size_t maxvis; /* output position of visible boundary */
104
105 /*
106 * First, establish the maximum columns of "visible" content.
107 * This is usually the difference between the right-margin and
108 * an indentation, but can be, for tagged lists or columns, a
109 * small set of values.
110 *
111 * The following unsigned-signed subtractions look strange,
112 * but they are actually correct. If the int p->overstep
113 * is negative, it gets sign extended. Subtracting that
114 * very large size_t effectively adds a small number to dv.
115 */
116 dv = p->rmargin > p->offset ? p->rmargin - p->offset : 0;
117 maxvis = (int)dv > p->overstep ? dv - (size_t)p->overstep : 0;
118
119 if (p->flags & TERMP_NOBREAK) {
120 dv = p->maxrmargin > p->offset ?
121 p->maxrmargin - p->offset : 0;
122 bp = (int)dv > p->overstep ?
123 dv - (size_t)p->overstep : 0;
124 } else
125 bp = maxvis;
126
127 /*
128 * Calculate the required amount of padding.
129 */
130 vbl = p->offset + p->overstep > p->viscol ?
131 p->offset + p->overstep - p->viscol : 0;
132
133 vis = vend = 0;
134 i = 0;
135
136 while (i < p->col) {
137 /*
138 * Handle literal tab characters: collapse all
139 * subsequent tabs into a single huge set of spaces.
140 */
141 ntab = 0;
142 while (i < p->col && '\t' == p->buf[i]) {
143 vend = (vis / p->tabwidth + 1) * p->tabwidth;
144 vbl += vend - vis;
145 vis = vend;
146 ntab++;
147 i++;
148 }
149
150 /*
151 * Count up visible word characters. Control sequences
152 * (starting with the CSI) aren't counted. A space
153 * generates a non-printing word, which is valid (the
154 * space is printed according to regular spacing rules).
155 */
156
157 for (j = i, jhy = 0; j < p->col; j++) {
158 if (' ' == p->buf[j] || '\t' == p->buf[j])
159 break;
160
161 /* Back over the the last printed character. */
162 if (8 == p->buf[j]) {
163 assert(j);
164 vend -= (*p->width)(p, p->buf[j - 1]);
165 continue;
166 }
167
168 /* Regular word. */
169 /* Break at the hyphen point if we overrun. */
170 if (vend > vis && vend < bp &&
171 (ASCII_HYPH == p->buf[j] ||
172 ASCII_BREAK == p->buf[j]))
173 jhy = j;
174
175 /*
176 * Hyphenation now decided, put back a real
177 * hyphen such that we get the correct width.
178 */
179 if (ASCII_HYPH == p->buf[j])
180 p->buf[j] = '-';
181
182 vend += (*p->width)(p, p->buf[j]);
183 }
184
185 /*
186 * Find out whether we would exceed the right margin.
187 * If so, break to the next line.
188 */
189 if (vend > bp && 0 == jhy && vis > 0) {
190 vend -= vis;
191 (*p->endline)(p);
192 p->viscol = 0;
193 if (TERMP_BRIND & p->flags) {
194 vbl = p->rmargin;
195 vend += p->rmargin;
196 vend -= p->offset;
197 } else
198 vbl = p->offset;
199
200 /* use pending tabs on the new line */
201
202 if (0 < ntab)
203 vbl += ntab * p->tabwidth;
204
205 /*
206 * Remove the p->overstep width.
207 * Again, if p->overstep is negative,
208 * sign extension does the right thing.
209 */
210
211 bp += (size_t)p->overstep;
212 p->overstep = 0;
213 }
214
215 /* Write out the [remaining] word. */
216 for ( ; i < p->col; i++) {
217 if (vend > bp && jhy > 0 && i > jhy)
218 break;
219 if ('\t' == p->buf[i])
220 break;
221 if (' ' == p->buf[i]) {
222 j = i;
223 while (i < p->col && ' ' == p->buf[i])
224 i++;
225 dv = (i - j) * (*p->width)(p, ' ');
226 vbl += dv;
227 vend += dv;
228 break;
229 }
230 if (ASCII_NBRSP == p->buf[i]) {
231 vbl += (*p->width)(p, ' ');
232 continue;
233 }
234 if (ASCII_BREAK == p->buf[i])
235 continue;
236
237 /*
238 * Now we definitely know there will be
239 * printable characters to output,
240 * so write preceding white space now.
241 */
242 if (vbl) {
243 (*p->advance)(p, vbl);
244 p->viscol += vbl;
245 vbl = 0;
246 }
247
248 (*p->letter)(p, p->buf[i]);
249 if (8 == p->buf[i])
250 p->viscol -= (*p->width)(p, p->buf[i-1]);
251 else
252 p->viscol += (*p->width)(p, p->buf[i]);
253 }
254 vis = vend;
255 }
256
257 /*
258 * If there was trailing white space, it was not printed;
259 * so reset the cursor position accordingly.
260 */
261 if (vis > vbl)
262 vis -= vbl;
263 else
264 vis = 0;
265
266 p->col = 0;
267 p->overstep = 0;
268 p->flags &= ~(TERMP_BACKAFTER | TERMP_BACKBEFORE);
269
270 if ( ! (TERMP_NOBREAK & p->flags)) {
271 p->viscol = 0;
272 (*p->endline)(p);
273 return;
274 }
275
276 if (TERMP_HANG & p->flags) {
277 p->overstep += (int)(p->offset + vis - p->rmargin +
278 p->trailspace * (*p->width)(p, ' '));
279
280 /*
281 * If we have overstepped the margin, temporarily move
282 * it to the right and flag the rest of the line to be
283 * shorter.
284 * If there is a request to keep the columns together,
285 * allow negative overstep when the column is not full.
286 */
287 if (p->trailspace && p->overstep < 0)
288 p->overstep = 0;
289 return;
290
291 } else if (TERMP_DANGLE & p->flags)
292 return;
293
294 /* If the column was overrun, break the line. */
295 if (maxvis < vis + p->trailspace * (*p->width)(p, ' ')) {
296 (*p->endline)(p);
297 p->viscol = 0;
298 }
299 }
300
301 /*
302 * A newline only breaks an existing line; it won't assert vertical
303 * space. All data in the output buffer is flushed prior to the newline
304 * assertion.
305 */
306 void
307 term_newln(struct termp *p)
308 {
309
310 p->flags |= TERMP_NOSPACE;
311 if (p->col || p->viscol)
312 term_flushln(p);
313 }
314
315 /*
316 * Asserts a vertical space (a full, empty line-break between lines).
317 * Note that if used twice, this will cause two blank spaces and so on.
318 * All data in the output buffer is flushed prior to the newline
319 * assertion.
320 */
321 void
322 term_vspace(struct termp *p)
323 {
324
325 term_newln(p);
326 p->viscol = 0;
327 if (0 < p->skipvsp)
328 p->skipvsp--;
329 else
330 (*p->endline)(p);
331 }
332
333 /* Swap current and previous font; for \fP and .ft P */
334 void
335 term_fontlast(struct termp *p)
336 {
337 enum termfont f;
338
339 f = p->fontl;
340 p->fontl = p->fontq[p->fonti];
341 p->fontq[p->fonti] = f;
342 }
343
344 /* Set font, save current, discard previous; for \f, .ft, .B etc. */
345 void
346 term_fontrepl(struct termp *p, enum termfont f)
347 {
348
349 p->fontl = p->fontq[p->fonti];
350 p->fontq[p->fonti] = f;
351 }
352
353 /* Set font, save previous. */
354 void
355 term_fontpush(struct termp *p, enum termfont f)
356 {
357
358 p->fontl = p->fontq[p->fonti];
359 if (++p->fonti == p->fontsz) {
360 p->fontsz += 8;
361 p->fontq = mandoc_reallocarray(p->fontq,
362 p->fontsz, sizeof(enum termfont *));
363 }
364 p->fontq[p->fonti] = f;
365 }
366
367 /* Flush to make the saved pointer current again. */
368 void
369 term_fontpopq(struct termp *p, int i)
370 {
371
372 assert(i >= 0);
373 if (p->fonti > i)
374 p->fonti = i;
375 }
376
377 /* Pop one font off the stack. */
378 void
379 term_fontpop(struct termp *p)
380 {
381
382 assert(p->fonti);
383 p->fonti--;
384 }
385
386 /*
387 * Handle pwords, partial words, which may be either a single word or a
388 * phrase that cannot be broken down (such as a literal string). This
389 * handles word styling.
390 */
391 void
392 term_word(struct termp *p, const char *word)
393 {
394 const char nbrsp[2] = { ASCII_NBRSP, 0 };
395 const char *seq, *cp;
396 int sz, uc;
397 size_t ssz;
398 enum mandoc_esc esc;
399
400 if ( ! (TERMP_NOSPACE & p->flags)) {
401 if ( ! (TERMP_KEEP & p->flags)) {
402 bufferc(p, ' ');
403 if (TERMP_SENTENCE & p->flags)
404 bufferc(p, ' ');
405 } else
406 bufferc(p, ASCII_NBRSP);
407 }
408 if (TERMP_PREKEEP & p->flags)
409 p->flags |= TERMP_KEEP;
410
411 if ( ! (p->flags & TERMP_NONOSPACE))
412 p->flags &= ~TERMP_NOSPACE;
413 else
414 p->flags |= TERMP_NOSPACE;
415
416 p->flags &= ~(TERMP_SENTENCE | TERMP_NONEWLINE);
417 p->skipvsp = 0;
418
419 while ('\0' != *word) {
420 if ('\\' != *word) {
421 if (TERMP_NBRWORD & p->flags) {
422 if (' ' == *word) {
423 encode(p, nbrsp, 1);
424 word++;
425 continue;
426 }
427 ssz = strcspn(word, "\\ ");
428 } else
429 ssz = strcspn(word, "\\");
430 encode(p, word, ssz);
431 word += (int)ssz;
432 continue;
433 }
434
435 word++;
436 esc = mandoc_escape(&word, &seq, &sz);
437 if (ESCAPE_ERROR == esc)
438 continue;
439
440 switch (esc) {
441 case ESCAPE_UNICODE:
442 uc = mchars_num2uc(seq + 1, sz - 1);
443 break;
444 case ESCAPE_NUMBERED:
445 uc = mchars_num2char(seq, sz);
446 if (uc < 0)
447 continue;
448 break;
449 case ESCAPE_SPECIAL:
450 if (p->enc == TERMENC_ASCII) {
451 cp = mchars_spec2str(p->symtab,
452 seq, sz, &ssz);
453 if (cp != NULL)
454 encode(p, cp, ssz);
455 } else {
456 uc = mchars_spec2cp(p->symtab, seq, sz);
457 if (uc > 0)
458 encode1(p, uc);
459 }
460 continue;
461 case ESCAPE_FONTBOLD:
462 term_fontrepl(p, TERMFONT_BOLD);
463 continue;
464 case ESCAPE_FONTITALIC:
465 term_fontrepl(p, TERMFONT_UNDER);
466 continue;
467 case ESCAPE_FONTBI:
468 term_fontrepl(p, TERMFONT_BI);
469 continue;
470 case ESCAPE_FONT:
471 /* FALLTHROUGH */
472 case ESCAPE_FONTROMAN:
473 term_fontrepl(p, TERMFONT_NONE);
474 continue;
475 case ESCAPE_FONTPREV:
476 term_fontlast(p);
477 continue;
478 case ESCAPE_NOSPACE:
479 if (p->flags & TERMP_BACKAFTER)
480 p->flags &= ~TERMP_BACKAFTER;
481 else if (*word == '\0')
482 p->flags |= (TERMP_NOSPACE | TERMP_NONEWLINE);
483 continue;
484 case ESCAPE_SKIPCHAR:
485 p->flags |= TERMP_BACKAFTER;
486 continue;
487 case ESCAPE_OVERSTRIKE:
488 cp = seq + sz;
489 while (seq < cp) {
490 if (*seq == '\\') {
491 mandoc_escape(&seq, NULL, NULL);
492 continue;
493 }
494 encode1(p, *seq++);
495 if (seq < cp) {
496 if (p->flags & TERMP_BACKBEFORE)
497 p->flags |= TERMP_BACKAFTER;
498 else
499 p->flags |= TERMP_BACKBEFORE;
500 }
501 }
502 continue;
503 default:
504 continue;
505 }
506
507 /*
508 * Common handling for Unicode and numbered
509 * character escape sequences.
510 */
511
512 if (p->enc == TERMENC_ASCII) {
513 cp = ascii_uc2str(uc);
514 encode(p, cp, strlen(cp));
515 } else {
516 if ((uc < 0x20 && uc != 0x09) ||
517 (uc > 0x7E && uc < 0xA0))
518 uc = 0xFFFD;
519 encode1(p, uc);
520 }
521 }
522 p->flags &= ~TERMP_NBRWORD;
523 }
524
525 static void
526 adjbuf(struct termp *p, size_t sz)
527 {
528
529 if (0 == p->maxcols)
530 p->maxcols = 1024;
531 while (sz >= p->maxcols)
532 p->maxcols <<= 2;
533
534 p->buf = mandoc_reallocarray(p->buf, p->maxcols, sizeof(int));
535 }
536
537 static void
538 bufferc(struct termp *p, char c)
539 {
540
541 if (p->col + 1 >= p->maxcols)
542 adjbuf(p, p->col + 1);
543
544 p->buf[p->col++] = c;
545 }
546
547 /*
548 * See encode().
549 * Do this for a single (probably unicode) value.
550 * Does not check for non-decorated glyphs.
551 */
552 static void
553 encode1(struct termp *p, int c)
554 {
555 enum termfont f;
556
557 if (p->col + 7 >= p->maxcols)
558 adjbuf(p, p->col + 7);
559
560 f = (c == ASCII_HYPH || isgraph(c)) ?
561 p->fontq[p->fonti] : TERMFONT_NONE;
562
563 if (p->flags & TERMP_BACKBEFORE) {
564 p->buf[p->col++] = 8;
565 p->flags &= ~TERMP_BACKBEFORE;
566 }
567 if (TERMFONT_UNDER == f || TERMFONT_BI == f) {
568 p->buf[p->col++] = '_';
569 p->buf[p->col++] = 8;
570 }
571 if (TERMFONT_BOLD == f || TERMFONT_BI == f) {
572 if (ASCII_HYPH == c)
573 p->buf[p->col++] = '-';
574 else
575 p->buf[p->col++] = c;
576 p->buf[p->col++] = 8;
577 }
578 p->buf[p->col++] = c;
579 if (p->flags & TERMP_BACKAFTER) {
580 p->flags |= TERMP_BACKBEFORE;
581 p->flags &= ~TERMP_BACKAFTER;
582 }
583 }
584
585 static void
586 encode(struct termp *p, const char *word, size_t sz)
587 {
588 size_t i;
589
590 if (p->col + 2 + (sz * 5) >= p->maxcols)
591 adjbuf(p, p->col + 2 + (sz * 5));
592
593 for (i = 0; i < sz; i++) {
594 if (ASCII_HYPH == word[i] ||
595 isgraph((unsigned char)word[i]))
596 encode1(p, word[i]);
597 else
598 p->buf[p->col++] = word[i];
599 }
600 }
601
602 void
603 term_setwidth(struct termp *p, const char *wstr)
604 {
605 struct roffsu su;
606 int iop, width;
607
608 iop = 0;
609 width = 0;
610 if (NULL != wstr) {
611 switch (*wstr) {
612 case '+':
613 iop = 1;
614 wstr++;
615 break;
616 case '-':
617 iop = -1;
618 wstr++;
619 break;
620 default:
621 break;
622 }
623 if (a2roffsu(wstr, &su, SCALE_MAX))
624 width = term_hspan(p, &su);
625 else
626 iop = 0;
627 }
628 (*p->setwidth)(p, iop, width);
629 }
630
631 size_t
632 term_len(const struct termp *p, size_t sz)
633 {
634
635 return((*p->width)(p, ' ') * sz);
636 }
637
638 static size_t
639 cond_width(const struct termp *p, int c, int *skip)
640 {
641
642 if (*skip) {
643 (*skip) = 0;
644 return(0);
645 } else
646 return((*p->width)(p, c));
647 }
648
649 size_t
650 term_strlen(const struct termp *p, const char *cp)
651 {
652 size_t sz, rsz, i;
653 int ssz, skip, uc;
654 const char *seq, *rhs;
655 enum mandoc_esc esc;
656 static const char rej[] = { '\\', ASCII_NBRSP, ASCII_HYPH,
657 ASCII_BREAK, '\0' };
658
659 /*
660 * Account for escaped sequences within string length
661 * calculations. This follows the logic in term_word() as we
662 * must calculate the width of produced strings.
663 */
664
665 sz = 0;
666 skip = 0;
667 while ('\0' != *cp) {
668 rsz = strcspn(cp, rej);
669 for (i = 0; i < rsz; i++)
670 sz += cond_width(p, *cp++, &skip);
671
672 switch (*cp) {
673 case '\\':
674 cp++;
675 esc = mandoc_escape(&cp, &seq, &ssz);
676 if (ESCAPE_ERROR == esc)
677 continue;
678
679 rhs = NULL;
680
681 switch (esc) {
682 case ESCAPE_UNICODE:
683 uc = mchars_num2uc(seq + 1, ssz - 1);
684 break;
685 case ESCAPE_NUMBERED:
686 uc = mchars_num2char(seq, ssz);
687 if (uc < 0)
688 continue;
689 break;
690 case ESCAPE_SPECIAL:
691 if (p->enc == TERMENC_ASCII) {
692 rhs = mchars_spec2str(p->symtab,
693 seq, ssz, &rsz);
694 if (rhs != NULL)
695 break;
696 } else {
697 uc = mchars_spec2cp(p->symtab,
698 seq, ssz);
699 if (uc > 0)
700 sz += cond_width(p, uc, &skip);
701 }
702 continue;
703 case ESCAPE_SKIPCHAR:
704 skip = 1;
705 continue;
706 case ESCAPE_OVERSTRIKE:
707 rsz = 0;
708 rhs = seq + ssz;
709 while (seq < rhs) {
710 if (*seq == '\\') {
711 mandoc_escape(&seq, NULL, NULL);
712 continue;
713 }
714 i = (*p->width)(p, *seq++);
715 if (rsz < i)
716 rsz = i;
717 }
718 sz += rsz;
719 continue;
720 default:
721 continue;
722 }
723
724 /*
725 * Common handling for Unicode and numbered
726 * character escape sequences.
727 */
728
729 if (rhs == NULL) {
730 if (p->enc == TERMENC_ASCII) {
731 rhs = ascii_uc2str(uc);
732 rsz = strlen(rhs);
733 } else {
734 if ((uc < 0x20 && uc != 0x09) ||
735 (uc > 0x7E && uc < 0xA0))
736 uc = 0xFFFD;
737 sz += cond_width(p, uc, &skip);
738 continue;
739 }
740 }
741
742 if (skip) {
743 skip = 0;
744 break;
745 }
746
747 /*
748 * Common handling for all escape sequences
749 * printing more than one character.
750 */
751
752 for (i = 0; i < rsz; i++)
753 sz += (*p->width)(p, *rhs++);
754 break;
755 case ASCII_NBRSP:
756 sz += cond_width(p, ' ', &skip);
757 cp++;
758 break;
759 case ASCII_HYPH:
760 sz += cond_width(p, '-', &skip);
761 cp++;
762 /* FALLTHROUGH */
763 case ASCII_BREAK:
764 break;
765 default:
766 break;
767 }
768 }
769
770 return(sz);
771 }
772
773 int
774 term_vspan(const struct termp *p, const struct roffsu *su)
775 {
776 double r;
777 int ri;
778
779 switch (su->unit) {
780 case SCALE_BU:
781 r = su->scale / 40.0;
782 break;
783 case SCALE_CM:
784 r = su->scale * 6.0 / 2.54;
785 break;
786 case SCALE_FS:
787 r = su->scale * 65536.0 / 40.0;
788 break;
789 case SCALE_IN:
790 r = su->scale * 6.0;
791 break;
792 case SCALE_MM:
793 r = su->scale * 0.006;
794 break;
795 case SCALE_PC:
796 r = su->scale;
797 break;
798 case SCALE_PT:
799 r = su->scale / 12.0;
800 break;
801 case SCALE_EN:
802 /* FALLTHROUGH */
803 case SCALE_EM:
804 r = su->scale * 0.6;
805 break;
806 case SCALE_VS:
807 r = su->scale;
808 break;
809 default:
810 abort();
811 /* NOTREACHED */
812 }
813 ri = r > 0.0 ? r + 0.4995 : r - 0.4995;
814 return(ri < 66 ? ri : 1);
815 }
816
817 /*
818 * Convert a scaling width to basic units, rounding down.
819 */
820 int
821 term_hspan(const struct termp *p, const struct roffsu *su)
822 {
823
824 return((*p->hspan)(p, su));
825 }
A git conversion mirror of mandoc.bsd.lv