]> git.cameronkatri.com Git - mandoc.git/blob - term.c
Use relative offsets instead of absolute pointers for the terminal
[mandoc.git] / term.c
1 /* $Id: term.c,v 1.244 2015/01/31 00:12:41 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 AUTHOR DISCLAIMS ALL WARRANTIES
11 * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
12 * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR 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 void *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
269 if ( ! (TERMP_NOBREAK & p->flags)) {
270 p->viscol = 0;
271 (*p->endline)(p);
272 return;
273 }
274
275 if (TERMP_HANG & p->flags) {
276 p->overstep += (int)(p->offset + vis - p->rmargin +
277 p->trailspace * (*p->width)(p, ' '));
278
279 /*
280 * If we have overstepped the margin, temporarily move
281 * it to the right and flag the rest of the line to be
282 * shorter.
283 * If there is a request to keep the columns together,
284 * allow negative overstep when the column is not full.
285 */
286 if (p->trailspace && p->overstep < 0)
287 p->overstep = 0;
288 return;
289
290 } else if (TERMP_DANGLE & p->flags)
291 return;
292
293 /* If the column was overrun, break the line. */
294 if (maxvis < vis + p->trailspace * (*p->width)(p, ' ')) {
295 (*p->endline)(p);
296 p->viscol = 0;
297 }
298 }
299
300 /*
301 * A newline only breaks an existing line; it won't assert vertical
302 * space. All data in the output buffer is flushed prior to the newline
303 * assertion.
304 */
305 void
306 term_newln(struct termp *p)
307 {
308
309 p->flags |= TERMP_NOSPACE;
310 if (p->col || p->viscol)
311 term_flushln(p);
312 }
313
314 /*
315 * Asserts a vertical space (a full, empty line-break between lines).
316 * Note that if used twice, this will cause two blank spaces and so on.
317 * All data in the output buffer is flushed prior to the newline
318 * assertion.
319 */
320 void
321 term_vspace(struct termp *p)
322 {
323
324 term_newln(p);
325 p->viscol = 0;
326 if (0 < p->skipvsp)
327 p->skipvsp--;
328 else
329 (*p->endline)(p);
330 }
331
332 /* Swap current and previous font; for \fP and .ft P */
333 void
334 term_fontlast(struct termp *p)
335 {
336 enum termfont f;
337
338 f = p->fontl;
339 p->fontl = p->fontq[p->fonti];
340 p->fontq[p->fonti] = f;
341 }
342
343 /* Set font, save current, discard previous; for \f, .ft, .B etc. */
344 void
345 term_fontrepl(struct termp *p, enum termfont f)
346 {
347
348 p->fontl = p->fontq[p->fonti];
349 p->fontq[p->fonti] = f;
350 }
351
352 /* Set font, save previous. */
353 void
354 term_fontpush(struct termp *p, enum termfont f)
355 {
356
357 p->fontl = p->fontq[p->fonti];
358 if (++p->fonti == p->fontsz) {
359 p->fontsz += 8;
360 p->fontq = mandoc_reallocarray(p->fontq,
361 p->fontsz, sizeof(enum termfont *));
362 }
363 p->fontq[p->fonti] = f;
364 }
365
366 /* Flush to make the saved pointer current again. */
367 void
368 term_fontpopq(struct termp *p, int i)
369 {
370
371 assert(i >= 0);
372 if (p->fonti > i)
373 p->fonti = i;
374 }
375
376 /* Pop one font off the stack. */
377 void
378 term_fontpop(struct termp *p)
379 {
380
381 assert(p->fonti);
382 p->fonti--;
383 }
384
385 /*
386 * Handle pwords, partial words, which may be either a single word or a
387 * phrase that cannot be broken down (such as a literal string). This
388 * handles word styling.
389 */
390 void
391 term_word(struct termp *p, const char *word)
392 {
393 const char nbrsp[2] = { ASCII_NBRSP, 0 };
394 const char *seq, *cp;
395 int sz, uc;
396 size_t ssz;
397 enum mandoc_esc esc;
398
399 if ( ! (TERMP_NOSPACE & p->flags)) {
400 if ( ! (TERMP_KEEP & p->flags)) {
401 bufferc(p, ' ');
402 if (TERMP_SENTENCE & p->flags)
403 bufferc(p, ' ');
404 } else
405 bufferc(p, ASCII_NBRSP);
406 }
407 if (TERMP_PREKEEP & p->flags)
408 p->flags |= TERMP_KEEP;
409
410 if ( ! (p->flags & TERMP_NONOSPACE))
411 p->flags &= ~TERMP_NOSPACE;
412 else
413 p->flags |= TERMP_NOSPACE;
414
415 p->flags &= ~(TERMP_SENTENCE | TERMP_NONEWLINE);
416
417 while ('\0' != *word) {
418 if ('\\' != *word) {
419 if (TERMP_SKIPCHAR & p->flags) {
420 p->flags &= ~TERMP_SKIPCHAR;
421 word++;
422 continue;
423 }
424 if (TERMP_NBRWORD & p->flags) {
425 if (' ' == *word) {
426 encode(p, nbrsp, 1);
427 word++;
428 continue;
429 }
430 ssz = strcspn(word, "\\ ");
431 } else
432 ssz = strcspn(word, "\\");
433 encode(p, word, ssz);
434 word += (int)ssz;
435 continue;
436 }
437
438 word++;
439 esc = mandoc_escape(&word, &seq, &sz);
440 if (ESCAPE_ERROR == esc)
441 continue;
442
443 switch (esc) {
444 case ESCAPE_UNICODE:
445 uc = mchars_num2uc(seq + 1, sz - 1);
446 break;
447 case ESCAPE_NUMBERED:
448 uc = mchars_num2char(seq, sz);
449 if (uc < 0)
450 continue;
451 break;
452 case ESCAPE_SPECIAL:
453 if (p->enc == TERMENC_ASCII) {
454 cp = mchars_spec2str(p->symtab,
455 seq, sz, &ssz);
456 if (cp != NULL)
457 encode(p, cp, ssz);
458 } else {
459 uc = mchars_spec2cp(p->symtab, seq, sz);
460 if (uc > 0)
461 encode1(p, uc);
462 }
463 continue;
464 case ESCAPE_FONTBOLD:
465 term_fontrepl(p, TERMFONT_BOLD);
466 continue;
467 case ESCAPE_FONTITALIC:
468 term_fontrepl(p, TERMFONT_UNDER);
469 continue;
470 case ESCAPE_FONTBI:
471 term_fontrepl(p, TERMFONT_BI);
472 continue;
473 case ESCAPE_FONT:
474 /* FALLTHROUGH */
475 case ESCAPE_FONTROMAN:
476 term_fontrepl(p, TERMFONT_NONE);
477 continue;
478 case ESCAPE_FONTPREV:
479 term_fontlast(p);
480 continue;
481 case ESCAPE_NOSPACE:
482 if (TERMP_SKIPCHAR & p->flags)
483 p->flags &= ~TERMP_SKIPCHAR;
484 else if ('\0' == *word)
485 p->flags |= (TERMP_NOSPACE | TERMP_NONEWLINE);
486 continue;
487 case ESCAPE_SKIPCHAR:
488 p->flags |= TERMP_SKIPCHAR;
489 continue;
490 case ESCAPE_OVERSTRIKE:
491 cp = seq + sz;
492 while (seq < cp) {
493 if (*seq == '\\') {
494 mandoc_escape(&seq, NULL, NULL);
495 continue;
496 }
497 encode1(p, *seq++);
498 if (seq < cp)
499 encode(p, "\b", 1);
500 }
501 default:
502 continue;
503 }
504
505 /*
506 * Common handling for Unicode and numbered
507 * character escape sequences.
508 */
509
510 if (p->enc == TERMENC_ASCII) {
511 cp = ascii_uc2str(uc);
512 encode(p, cp, strlen(cp));
513 } else {
514 if ((uc < 0x20 && uc != 0x09) ||
515 (uc > 0x7E && uc < 0xA0))
516 uc = 0xFFFD;
517 encode1(p, uc);
518 }
519 }
520 p->flags &= ~TERMP_NBRWORD;
521 }
522
523 static void
524 adjbuf(struct termp *p, size_t sz)
525 {
526
527 if (0 == p->maxcols)
528 p->maxcols = 1024;
529 while (sz >= p->maxcols)
530 p->maxcols <<= 2;
531
532 p->buf = mandoc_reallocarray(p->buf, p->maxcols, sizeof(int));
533 }
534
535 static void
536 bufferc(struct termp *p, char c)
537 {
538
539 if (p->col + 1 >= p->maxcols)
540 adjbuf(p, p->col + 1);
541
542 p->buf[p->col++] = c;
543 }
544
545 /*
546 * See encode().
547 * Do this for a single (probably unicode) value.
548 * Does not check for non-decorated glyphs.
549 */
550 static void
551 encode1(struct termp *p, int c)
552 {
553 enum termfont f;
554
555 if (TERMP_SKIPCHAR & p->flags) {
556 p->flags &= ~TERMP_SKIPCHAR;
557 return;
558 }
559
560 if (p->col + 6 >= p->maxcols)
561 adjbuf(p, p->col + 6);
562
563 f = p->fontq[p->fonti];
564
565 if (TERMFONT_UNDER == f || TERMFONT_BI == f) {
566 p->buf[p->col++] = '_';
567 p->buf[p->col++] = 8;
568 }
569 if (TERMFONT_BOLD == f || TERMFONT_BI == f) {
570 if (ASCII_HYPH == c)
571 p->buf[p->col++] = '-';
572 else
573 p->buf[p->col++] = c;
574 p->buf[p->col++] = 8;
575 }
576 p->buf[p->col++] = c;
577 }
578
579 static void
580 encode(struct termp *p, const char *word, size_t sz)
581 {
582 size_t i;
583
584 if (TERMP_SKIPCHAR & p->flags) {
585 p->flags &= ~TERMP_SKIPCHAR;
586 return;
587 }
588
589 /*
590 * Encode and buffer a string of characters. If the current
591 * font mode is unset, buffer directly, else encode then buffer
592 * character by character.
593 */
594
595 if (p->fontq[p->fonti] == TERMFONT_NONE) {
596 if (p->col + sz >= p->maxcols)
597 adjbuf(p, p->col + sz);
598 for (i = 0; i < sz; i++)
599 p->buf[p->col++] = word[i];
600 return;
601 }
602
603 /* Pre-buffer, assuming worst-case. */
604
605 if (p->col + 1 + (sz * 5) >= p->maxcols)
606 adjbuf(p, p->col + 1 + (sz * 5));
607
608 for (i = 0; i < sz; i++) {
609 if (ASCII_HYPH == word[i] ||
610 isgraph((unsigned char)word[i]))
611 encode1(p, word[i]);
612 else
613 p->buf[p->col++] = word[i];
614 }
615 }
616
617 void
618 term_setwidth(struct termp *p, const char *wstr)
619 {
620 struct roffsu su;
621 size_t width;
622 int iop;
623
624 iop = 0;
625 width = 0;
626 if (NULL != wstr) {
627 switch (*wstr) {
628 case '+':
629 iop = 1;
630 wstr++;
631 break;
632 case '-':
633 iop = -1;
634 wstr++;
635 break;
636 default:
637 break;
638 }
639 if (a2roffsu(wstr, &su, SCALE_MAX))
640 width = term_hspan(p, &su);
641 else
642 iop = 0;
643 }
644 (*p->setwidth)(p, iop, width);
645 }
646
647 size_t
648 term_len(const struct termp *p, size_t sz)
649 {
650
651 return((*p->width)(p, ' ') * sz);
652 }
653
654 static size_t
655 cond_width(const struct termp *p, int c, int *skip)
656 {
657
658 if (*skip) {
659 (*skip) = 0;
660 return(0);
661 } else
662 return((*p->width)(p, c));
663 }
664
665 size_t
666 term_strlen(const struct termp *p, const char *cp)
667 {
668 size_t sz, rsz, i;
669 int ssz, skip, uc;
670 const char *seq, *rhs;
671 enum mandoc_esc esc;
672 static const char rej[] = { '\\', ASCII_NBRSP, ASCII_HYPH,
673 ASCII_BREAK, '\0' };
674
675 /*
676 * Account for escaped sequences within string length
677 * calculations. This follows the logic in term_word() as we
678 * must calculate the width of produced strings.
679 */
680
681 sz = 0;
682 skip = 0;
683 while ('\0' != *cp) {
684 rsz = strcspn(cp, rej);
685 for (i = 0; i < rsz; i++)
686 sz += cond_width(p, *cp++, &skip);
687
688 switch (*cp) {
689 case '\\':
690 cp++;
691 esc = mandoc_escape(&cp, &seq, &ssz);
692 if (ESCAPE_ERROR == esc)
693 continue;
694
695 rhs = NULL;
696
697 switch (esc) {
698 case ESCAPE_UNICODE:
699 uc = mchars_num2uc(seq + 1, ssz - 1);
700 break;
701 case ESCAPE_NUMBERED:
702 uc = mchars_num2char(seq, ssz);
703 if (uc < 0)
704 continue;
705 break;
706 case ESCAPE_SPECIAL:
707 if (p->enc == TERMENC_ASCII) {
708 rhs = mchars_spec2str(p->symtab,
709 seq, ssz, &rsz);
710 if (rhs != NULL)
711 break;
712 } else {
713 uc = mchars_spec2cp(p->symtab,
714 seq, ssz);
715 if (uc > 0)
716 sz += cond_width(p, uc, &skip);
717 }
718 continue;
719 case ESCAPE_SKIPCHAR:
720 skip = 1;
721 continue;
722 case ESCAPE_OVERSTRIKE:
723 rsz = 0;
724 rhs = seq + ssz;
725 while (seq < rhs) {
726 if (*seq == '\\') {
727 mandoc_escape(&seq, NULL, NULL);
728 continue;
729 }
730 i = (*p->width)(p, *seq++);
731 if (rsz < i)
732 rsz = i;
733 }
734 sz += rsz;
735 continue;
736 default:
737 continue;
738 }
739
740 /*
741 * Common handling for Unicode and numbered
742 * character escape sequences.
743 */
744
745 if (rhs == NULL) {
746 if (p->enc == TERMENC_ASCII) {
747 rhs = ascii_uc2str(uc);
748 rsz = strlen(rhs);
749 } else {
750 if ((uc < 0x20 && uc != 0x09) ||
751 (uc > 0x7E && uc < 0xA0))
752 uc = 0xFFFD;
753 sz += cond_width(p, uc, &skip);
754 continue;
755 }
756 }
757
758 if (skip) {
759 skip = 0;
760 break;
761 }
762
763 /*
764 * Common handling for all escape sequences
765 * printing more than one character.
766 */
767
768 for (i = 0; i < rsz; i++)
769 sz += (*p->width)(p, *rhs++);
770 break;
771 case ASCII_NBRSP:
772 sz += cond_width(p, ' ', &skip);
773 cp++;
774 break;
775 case ASCII_HYPH:
776 sz += cond_width(p, '-', &skip);
777 cp++;
778 /* FALLTHROUGH */
779 case ASCII_BREAK:
780 break;
781 default:
782 break;
783 }
784 }
785
786 return(sz);
787 }
788
789 int
790 term_vspan(const struct termp *p, const struct roffsu *su)
791 {
792 double r;
793 int ri;
794
795 switch (su->unit) {
796 case SCALE_BU:
797 r = su->scale / 40.0;
798 break;
799 case SCALE_CM:
800 r = su->scale * 6.0 / 2.54;
801 break;
802 case SCALE_FS:
803 r = su->scale * 65536.0 / 40.0;
804 break;
805 case SCALE_IN:
806 r = su->scale * 6.0;
807 break;
808 case SCALE_MM:
809 r = su->scale * 0.006;
810 break;
811 case SCALE_PC:
812 r = su->scale;
813 break;
814 case SCALE_PT:
815 r = su->scale / 12.0;
816 break;
817 case SCALE_EN:
818 /* FALLTHROUGH */
819 case SCALE_EM:
820 r = su->scale * 0.6;
821 break;
822 case SCALE_VS:
823 r = su->scale;
824 break;
825 default:
826 abort();
827 /* NOTREACHED */
828 }
829 ri = r > 0.0 ? r + 0.4995 : r - 0.4995;
830 return(ri < 66 ? ri : 1);
831 }
832
833 int
834 term_hspan(const struct termp *p, const struct roffsu *su)
835 {
836 double v;
837
838 v = (*p->hspan)(p, su);
839 return(v > 0.0 ? v + 0.0005 : v - 0.0005);
840 }