Annotation of src/usr.bin/mandoc/term.c, Revision 1.44
1.44 ! schwarze 1: /* $Id: term.c,v 1.43 2010/07/03 15:59:05 schwarze Exp $ */
1.1 kristaps 2: /*
1.44 ! schwarze 3: * Copyright (c) 2008, 2009, 2010 Kristaps Dzonsons <kristaps@bsd.lv>
! 4: * Copyright (c) 2010 Ingo Schwarze <schwarze@openbsd.org>
1.1 kristaps 5: *
6: * Permission to use, copy, modify, and distribute this software for any
1.2 schwarze 7: * purpose with or without fee is hereby granted, provided that the above
8: * copyright notice and this permission notice appear in all copies.
1.1 kristaps 9: *
1.2 schwarze 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.
1.1 kristaps 17: */
1.20 schwarze 18: #include <sys/types.h>
19:
1.1 kristaps 20: #include <assert.h>
1.20 schwarze 21: #include <ctype.h>
1.36 schwarze 22: #include <stdint.h>
1.1 kristaps 23: #include <stdio.h>
24: #include <stdlib.h>
25: #include <string.h>
26:
1.34 schwarze 27: #include "mandoc.h"
1.15 schwarze 28: #include "chars.h"
1.16 schwarze 29: #include "out.h"
1.1 kristaps 30: #include "term.h"
1.16 schwarze 31: #include "main.h"
1.1 kristaps 32:
1.20 schwarze 33: static void spec(struct termp *, const char *, size_t);
34: static void res(struct termp *, const char *, size_t);
35: static void buffera(struct termp *, const char *, size_t);
36: static void bufferc(struct termp *, char);
37: static void adjbuf(struct termp *p, size_t);
38: static void encode(struct termp *, const char *, size_t);
1.1 kristaps 39:
40:
1.37 schwarze 41: void
42: term_free(struct termp *p)
1.1 kristaps 43: {
44:
1.37 schwarze 45: if (p->buf)
46: free(p->buf);
47: if (p->symtab)
48: chars_free(p->symtab);
49:
50: free(p);
1.1 kristaps 51: }
52:
53:
1.13 schwarze 54: void
1.37 schwarze 55: term_begin(struct termp *p, term_margin head,
56: term_margin foot, const void *arg)
1.1 kristaps 57: {
58:
1.37 schwarze 59: p->headf = head;
60: p->footf = foot;
61: p->argf = arg;
62: (*p->begin)(p);
1.1 kristaps 63: }
64:
65:
1.37 schwarze 66: void
67: term_end(struct termp *p)
1.1 kristaps 68: {
69:
1.37 schwarze 70: (*p->end)(p);
1.1 kristaps 71: }
72:
73:
1.37 schwarze 74: struct termp *
75: term_alloc(enum termenc enc)
1.1 kristaps 76: {
1.36 schwarze 77: struct termp *p;
1.1 kristaps 78:
1.19 schwarze 79: p = calloc(1, sizeof(struct termp));
80: if (NULL == p) {
81: perror(NULL);
82: exit(EXIT_FAILURE);
83: }
1.36 schwarze 84:
1.1 kristaps 85: p->enc = enc;
86: return(p);
87: }
88:
89:
90: /*
91: * Flush a line of text. A "line" is loosely defined as being something
92: * that should be followed by a newline, regardless of whether it's
93: * broken apart by newlines getting there. A line can also be a
1.27 schwarze 94: * fragment of a columnar list (`Bl -tag' or `Bl -column'), which does
95: * not have a trailing newline.
1.1 kristaps 96: *
1.27 schwarze 97: * The following flags may be specified:
1.1 kristaps 98: *
99: * - TERMP_NOLPAD: when beginning to write the line, don't left-pad the
100: * offset value. This is useful when doing columnar lists where the
101: * prior column has right-padded.
102: *
103: * - TERMP_NOBREAK: this is the most important and is used when making
104: * columns. In short: don't print a newline and instead pad to the
105: * right margin. Used in conjunction with TERMP_NOLPAD.
106: *
1.9 schwarze 107: * - TERMP_TWOSPACE: when padding, make sure there are at least two
108: * space characters of padding. Otherwise, rather break the line.
109: *
1.6 schwarze 110: * - TERMP_DANGLE: don't newline when TERMP_NOBREAK is specified and
111: * the line is overrun, and don't pad-right if it's underrun.
112: *
113: * - TERMP_HANG: like TERMP_DANGLE, but doesn't newline when
114: * overruning, instead save the position and continue at that point
115: * when the next invocation.
1.1 kristaps 116: *
117: * In-line line breaking:
118: *
119: * If TERMP_NOBREAK is specified and the line overruns the right
120: * margin, it will break and pad-right to the right margin after
121: * writing. If maxrmargin is violated, it will break and continue
1.19 schwarze 122: * writing from the right-margin, which will lead to the above scenario
123: * upon exit. Otherwise, the line will break at the right margin.
1.1 kristaps 124: */
125: void
126: term_flushln(struct termp *p)
127: {
1.19 schwarze 128: int i; /* current input position in p->buf */
129: size_t vis; /* current visual position on output */
130: size_t vbl; /* number of blanks to prepend to output */
1.33 schwarze 131: size_t vend; /* end of word visual position on output */
1.19 schwarze 132: size_t bp; /* visual right border position */
1.42 schwarze 133: int j; /* temporary loop index for p->buf */
134: int jhy; /* last hyph before overflow w/r/t j */
135: size_t maxvis; /* output position of visible boundary */
136: size_t mmax; /* used in calculating bp */
1.1 kristaps 137:
138: /*
139: * First, establish the maximum columns of "visible" content.
140: * This is usually the difference between the right-margin and
141: * an indentation, but can be, for tagged lists or columns, a
1.19 schwarze 142: * small set of values.
1.1 kristaps 143: */
144:
145: assert(p->offset < p->rmargin);
1.9 schwarze 146:
1.26 schwarze 147: maxvis = (int)(p->rmargin - p->offset) - p->overstep < 0 ?
1.19 schwarze 148: /* LINTED */
1.26 schwarze 149: 0 : p->rmargin - p->offset - p->overstep;
150: mmax = (int)(p->maxrmargin - p->offset) - p->overstep < 0 ?
1.19 schwarze 151: /* LINTED */
1.26 schwarze 152: 0 : p->maxrmargin - p->offset - p->overstep;
1.9 schwarze 153:
1.1 kristaps 154: bp = TERMP_NOBREAK & p->flags ? mmax : maxvis;
1.19 schwarze 155:
1.33 schwarze 156: /*
157: * Indent the first line of a paragraph.
158: */
159: vbl = p->flags & TERMP_NOLPAD ? 0 : p->offset;
160:
1.42 schwarze 161: vis = vend = i = 0;
1.19 schwarze 162:
1.22 schwarze 163: while (i < (int)p->col) {
164: /*
1.42 schwarze 165: * Handle literal tab characters: collapse all
166: * subsequent tabs into a single huge set of spaces.
1.30 schwarze 167: */
168: for (j = i; j < (int)p->col; j++) {
169: if ('\t' != p->buf[j])
170: break;
1.42 schwarze 171: vend = (vis / p->tabwidth + 1) * p->tabwidth;
1.30 schwarze 172: vbl += vend - vis;
173: vis = vend;
174: }
1.22 schwarze 175:
1.1 kristaps 176: /*
177: * Count up visible word characters. Control sequences
178: * (starting with the CSI) aren't counted. A space
179: * generates a non-printing word, which is valid (the
180: * space is printed according to regular spacing rules).
181: */
182:
183: /* LINTED */
1.30 schwarze 184: for (jhy = 0; j < (int)p->col; j++) {
185: if ((j && ' ' == p->buf[j]) || '\t' == p->buf[j])
1.1 kristaps 186: break;
1.42 schwarze 187:
188: /* Back over the the last printed character. */
189: if (8 == p->buf[j]) {
190: assert(j);
191: vend -= (*p->width)(p, p->buf[j - 1]);
192: continue;
193: }
194:
195: /* Regular word. */
196: /* Break at the hyphen point if we overrun. */
197: if (vend > vis && vend < bp &&
198: ASCII_HYPH == p->buf[j])
199: jhy = j;
200:
201: vend += (*p->width)(p, p->buf[j]);
1.1 kristaps 202: }
203:
204: /*
1.5 schwarze 205: * Find out whether we would exceed the right margin.
1.33 schwarze 206: * If so, break to the next line.
1.5 schwarze 207: */
1.33 schwarze 208: if (vend > bp && 0 == jhy && vis > 0) {
1.22 schwarze 209: vend -= vis;
1.37 schwarze 210: (*p->endline)(p);
1.5 schwarze 211: if (TERMP_NOBREAK & p->flags) {
1.29 schwarze 212: p->viscol = p->rmargin;
1.37 schwarze 213: (*p->advance)(p, p->rmargin);
1.22 schwarze 214: vend += p->rmargin - p->offset;
1.5 schwarze 215: } else {
1.33 schwarze 216: p->viscol = 0;
217: vbl = p->offset;
1.5 schwarze 218: }
1.33 schwarze 219:
1.26 schwarze 220: /* Remove the p->overstep width. */
1.33 schwarze 221:
1.18 schwarze 222: bp += (int)/* LINTED */
1.26 schwarze 223: p->overstep;
224: p->overstep = 0;
1.1 kristaps 225: }
226:
1.3 schwarze 227: /*
1.30 schwarze 228: * Skip leading tabs, they were handled above.
229: */
230: while (i < (int)p->col && '\t' == p->buf[i])
231: i++;
232:
1.33 schwarze 233: /* Write out the [remaining] word. */
1.1 kristaps 234: for ( ; i < (int)p->col; i++) {
1.25 schwarze 235: if (vend > bp && jhy > 0 && i > jhy)
1.30 schwarze 236: break;
237: if ('\t' == p->buf[i])
1.1 kristaps 238: break;
1.22 schwarze 239: if (' ' == p->buf[i]) {
1.33 schwarze 240: while (' ' == p->buf[i]) {
1.42 schwarze 241: vbl += (*p->width)(p, p->buf[i]);
1.33 schwarze 242: i++;
243: }
1.22 schwarze 244: break;
245: }
1.33 schwarze 246: if (ASCII_NBRSP == p->buf[i]) {
1.42 schwarze 247: vbl += (*p->width)(p, ' ');
1.33 schwarze 248: continue;
249: }
250:
251: /*
252: * Now we definitely know there will be
253: * printable characters to output,
254: * so write preceding white space now.
255: */
256: if (vbl) {
1.37 schwarze 257: (*p->advance)(p, vbl);
1.33 schwarze 258: p->viscol += vbl;
259: vbl = 0;
260: }
1.35 schwarze 261:
1.42 schwarze 262: if (ASCII_HYPH == p->buf[i]) {
1.37 schwarze 263: (*p->letter)(p, '-');
1.42 schwarze 264: p->viscol += (*p->width)(p, '-');
265: } else {
1.37 schwarze 266: (*p->letter)(p, p->buf[i]);
1.42 schwarze 267: p->viscol += (*p->width)(p, p->buf[i]);
268: }
1.1 kristaps 269: }
1.33 schwarze 270: vend += vbl;
1.22 schwarze 271: vis = vend;
1.1 kristaps 272: }
1.18 schwarze 273:
1.9 schwarze 274: p->col = 0;
1.26 schwarze 275: p->overstep = 0;
1.1 kristaps 276:
1.9 schwarze 277: if ( ! (TERMP_NOBREAK & p->flags)) {
1.29 schwarze 278: p->viscol = 0;
1.37 schwarze 279: (*p->endline)(p);
1.1 kristaps 280: return;
281: }
282:
1.9 schwarze 283: if (TERMP_HANG & p->flags) {
284: /* We need one blank after the tag. */
1.26 schwarze 285: p->overstep = /* LINTED */
1.42 schwarze 286: vis - maxvis + (*p->width)(p, ' ');
1.9 schwarze 287:
288: /*
289: * Behave exactly the same way as groff:
290: * If we have overstepped the margin, temporarily move
291: * it to the right and flag the rest of the line to be
292: * shorter.
293: * If we landed right at the margin, be happy.
294: * If we are one step before the margin, temporarily
295: * move it one step LEFT and flag the rest of the line
296: * to be longer.
297: */
1.26 schwarze 298: if (p->overstep >= -1) {
299: assert((int)maxvis + p->overstep >= 0);
1.9 schwarze 300: /* LINTED */
1.26 schwarze 301: maxvis += p->overstep;
1.9 schwarze 302: } else
1.26 schwarze 303: p->overstep = 0;
1.9 schwarze 304:
305: } else if (TERMP_DANGLE & p->flags)
306: return;
1.1 kristaps 307:
1.9 schwarze 308: /* Right-pad. */
309: if (maxvis > vis + /* LINTED */
1.42 schwarze 310: ((TERMP_TWOSPACE & p->flags) ?
311: (*p->width)(p, ' ') : 0)) {
1.29 schwarze 312: p->viscol += maxvis - vis;
1.37 schwarze 313: (*p->advance)(p, maxvis - vis);
314: vis += (maxvis - vis);
1.29 schwarze 315: } else { /* ...or newline break. */
1.37 schwarze 316: (*p->endline)(p);
1.29 schwarze 317: p->viscol = p->rmargin;
1.37 schwarze 318: (*p->advance)(p, p->rmargin);
1.9 schwarze 319: }
1.1 kristaps 320: }
321:
322:
323: /*
324: * A newline only breaks an existing line; it won't assert vertical
325: * space. All data in the output buffer is flushed prior to the newline
326: * assertion.
327: */
328: void
329: term_newln(struct termp *p)
330: {
331:
332: p->flags |= TERMP_NOSPACE;
1.29 schwarze 333: if (0 == p->col && 0 == p->viscol) {
1.1 kristaps 334: p->flags &= ~TERMP_NOLPAD;
335: return;
336: }
337: term_flushln(p);
338: p->flags &= ~TERMP_NOLPAD;
339: }
340:
341:
342: /*
343: * Asserts a vertical space (a full, empty line-break between lines).
344: * Note that if used twice, this will cause two blank spaces and so on.
345: * All data in the output buffer is flushed prior to the newline
346: * assertion.
347: */
348: void
349: term_vspace(struct termp *p)
350: {
351:
352: term_newln(p);
1.29 schwarze 353: p->viscol = 0;
1.37 schwarze 354: (*p->endline)(p);
1.1 kristaps 355: }
356:
357:
358: static void
1.20 schwarze 359: spec(struct termp *p, const char *word, size_t len)
1.1 kristaps 360: {
361: const char *rhs;
362: size_t sz;
363:
1.15 schwarze 364: rhs = chars_a2ascii(p->symtab, word, len, &sz);
1.20 schwarze 365: if (rhs)
366: encode(p, rhs, sz);
1.11 schwarze 367: }
368:
369:
370: static void
1.20 schwarze 371: res(struct termp *p, const char *word, size_t len)
1.11 schwarze 372: {
373: const char *rhs;
374: size_t sz;
375:
1.15 schwarze 376: rhs = chars_a2res(p->symtab, word, len, &sz);
1.20 schwarze 377: if (rhs)
378: encode(p, rhs, sz);
379: }
380:
381:
382: void
383: term_fontlast(struct termp *p)
384: {
385: enum termfont f;
1.11 schwarze 386:
1.20 schwarze 387: f = p->fontl;
388: p->fontl = p->fontq[p->fonti];
389: p->fontq[p->fonti] = f;
390: }
391:
392:
393: void
394: term_fontrepl(struct termp *p, enum termfont f)
395: {
396:
397: p->fontl = p->fontq[p->fonti];
398: p->fontq[p->fonti] = f;
1.1 kristaps 399: }
400:
401:
1.20 schwarze 402: void
403: term_fontpush(struct termp *p, enum termfont f)
1.1 kristaps 404: {
1.7 schwarze 405:
1.20 schwarze 406: assert(p->fonti + 1 < 10);
407: p->fontl = p->fontq[p->fonti];
408: p->fontq[++p->fonti] = f;
409: }
1.1 kristaps 410:
411:
1.20 schwarze 412: const void *
413: term_fontq(struct termp *p)
414: {
1.1 kristaps 415:
1.20 schwarze 416: return(&p->fontq[p->fonti]);
417: }
1.1 kristaps 418:
419:
1.20 schwarze 420: enum termfont
421: term_fonttop(struct termp *p)
422: {
1.1 kristaps 423:
1.20 schwarze 424: return(p->fontq[p->fonti]);
425: }
1.7 schwarze 426:
427:
1.20 schwarze 428: void
429: term_fontpopq(struct termp *p, const void *key)
430: {
1.1 kristaps 431:
1.20 schwarze 432: while (p->fonti >= 0 && key != &p->fontq[p->fonti])
433: p->fonti--;
434: assert(p->fonti >= 0);
435: }
1.1 kristaps 436:
437:
1.20 schwarze 438: void
439: term_fontpop(struct termp *p)
440: {
1.1 kristaps 441:
1.20 schwarze 442: assert(p->fonti);
443: p->fonti--;
1.1 kristaps 444: }
445:
446:
447: /*
448: * Handle pwords, partial words, which may be either a single word or a
449: * phrase that cannot be broken down (such as a literal string). This
450: * handles word styling.
451: */
1.7 schwarze 452: void
453: term_word(struct termp *p, const char *word)
1.1 kristaps 454: {
1.20 schwarze 455: const char *sv, *seq;
456: int sz;
457: size_t ssz;
458: enum roffdeco deco;
1.1 kristaps 459:
1.14 schwarze 460: sv = word;
461:
1.20 schwarze 462: if (word[0] && '\0' == word[1])
1.14 schwarze 463: switch (word[0]) {
464: case('.'):
465: /* FALLTHROUGH */
466: case(','):
467: /* FALLTHROUGH */
468: case(';'):
469: /* FALLTHROUGH */
470: case(':'):
471: /* FALLTHROUGH */
472: case('?'):
473: /* FALLTHROUGH */
474: case('!'):
475: /* FALLTHROUGH */
476: case(')'):
477: /* FALLTHROUGH */
478: case(']'):
479: if ( ! (TERMP_IGNDELIM & p->flags))
480: p->flags |= TERMP_NOSPACE;
481: break;
482: default:
483: break;
484: }
1.1 kristaps 485:
1.31 schwarze 486: if ( ! (TERMP_NOSPACE & p->flags)) {
1.40 schwarze 487: if ( ! (TERMP_KEEP & p->flags)) {
488: if (TERMP_PREKEEP & p->flags)
489: p->flags |= TERMP_KEEP;
1.31 schwarze 490: bufferc(p, ' ');
1.40 schwarze 491: if (TERMP_SENTENCE & p->flags)
492: bufferc(p, ' ');
493: } else
494: bufferc(p, ASCII_NBRSP);
1.31 schwarze 495: }
1.1 kristaps 496:
497: if ( ! (p->flags & TERMP_NONOSPACE))
498: p->flags &= ~TERMP_NOSPACE;
499:
1.31 schwarze 500: p->flags &= ~TERMP_SENTENCE;
501:
1.20 schwarze 502: /* FIXME: use strcspn. */
503:
504: while (*word) {
505: if ('\\' != *word) {
506: encode(p, word, 1);
507: word++;
508: continue;
509: }
510:
511: seq = ++word;
512: sz = a2roffdeco(&deco, &seq, &ssz);
513:
514: switch (deco) {
515: case (DECO_RESERVED):
516: res(p, seq, ssz);
517: break;
518: case (DECO_SPECIAL):
519: spec(p, seq, ssz);
520: break;
521: case (DECO_BOLD):
522: term_fontrepl(p, TERMFONT_BOLD);
523: break;
524: case (DECO_ITALIC):
525: term_fontrepl(p, TERMFONT_UNDER);
526: break;
527: case (DECO_ROMAN):
528: term_fontrepl(p, TERMFONT_NONE);
529: break;
530: case (DECO_PREVIOUS):
531: term_fontlast(p);
532: break;
533: default:
534: break;
535: }
536:
537: word += sz;
538: if (DECO_NOSPACE == deco && '\0' == *word)
539: p->flags |= TERMP_NOSPACE;
540: }
1.1 kristaps 541:
1.31 schwarze 542: /*
543: * Note that we don't process the pipe: the parser sees it as
544: * punctuation, but we don't in terms of typography.
545: */
1.14 schwarze 546: if (sv[0] && 0 == sv[1])
547: switch (sv[0]) {
548: case('('):
549: /* FALLTHROUGH */
550: case('['):
551: p->flags |= TERMP_NOSPACE;
552: break;
553: default:
554: break;
555: }
1.1 kristaps 556: }
557:
558:
559: static void
1.20 schwarze 560: adjbuf(struct termp *p, size_t sz)
1.1 kristaps 561: {
562:
1.20 schwarze 563: if (0 == p->maxcols)
564: p->maxcols = 1024;
565: while (sz >= p->maxcols)
566: p->maxcols <<= 2;
567:
568: p->buf = realloc(p->buf, p->maxcols);
569: if (NULL == p->buf) {
570: perror(NULL);
571: exit(EXIT_FAILURE);
1.1 kristaps 572: }
573: }
574:
1.4 schwarze 575:
576: static void
1.20 schwarze 577: buffera(struct termp *p, const char *word, size_t sz)
578: {
579:
580: if (p->col + sz >= p->maxcols)
581: adjbuf(p, p->col + sz);
582:
583: memcpy(&p->buf[(int)p->col], word, sz);
584: p->col += sz;
585: }
586:
587:
588: static void
589: bufferc(struct termp *p, char c)
590: {
591:
592: if (p->col + 1 >= p->maxcols)
593: adjbuf(p, p->col + 1);
594:
595: p->buf[(int)p->col++] = c;
596: }
597:
598:
599: static void
600: encode(struct termp *p, const char *word, size_t sz)
1.4 schwarze 601: {
1.20 schwarze 602: enum termfont f;
603: int i;
604:
605: /*
606: * Encode and buffer a string of characters. If the current
607: * font mode is unset, buffer directly, else encode then buffer
608: * character by character.
609: */
610:
1.38 schwarze 611: if (TERMFONT_NONE == (f = term_fonttop(p))) {
1.20 schwarze 612: buffera(p, word, sz);
613: return;
614: }
615:
616: for (i = 0; i < (int)sz; i++) {
617: if ( ! isgraph((u_char)word[i])) {
618: bufferc(p, word[i]);
619: continue;
1.4 schwarze 620: }
1.20 schwarze 621:
622: if (TERMFONT_UNDER == f)
623: bufferc(p, '_');
624: else
625: bufferc(p, word[i]);
626:
627: bufferc(p, 8);
628: bufferc(p, word[i]);
1.4 schwarze 629: }
630: }
1.16 schwarze 631:
632:
633: size_t
1.39 schwarze 634: term_len(const struct termp *p, size_t sz)
635: {
636:
637: return((*p->width)(p, ' ') * sz);
638: }
639:
640:
641: size_t
642: term_strlen(const struct termp *p, const char *cp)
643: {
644: size_t sz;
645:
646: for (sz = 0; *cp; cp++)
647: sz += (*p->width)(p, *cp);
648:
649: return(sz);
650: }
651:
652:
1.44 ! schwarze 653: /* ARGSUSED */
1.39 schwarze 654: size_t
655: term_vspan(const struct termp *p, const struct roffsu *su)
1.16 schwarze 656: {
657: double r;
658:
659: switch (su->unit) {
660: case (SCALE_CM):
661: r = su->scale * 2;
662: break;
663: case (SCALE_IN):
664: r = su->scale * 6;
665: break;
666: case (SCALE_PC):
667: r = su->scale;
668: break;
669: case (SCALE_PT):
670: r = su->scale / 8;
671: break;
672: case (SCALE_MM):
673: r = su->scale / 1000;
674: break;
675: case (SCALE_VS):
676: r = su->scale;
677: break;
678: default:
679: r = su->scale - 1;
680: break;
681: }
682:
683: if (r < 0.0)
684: r = 0.0;
685: return(/* LINTED */(size_t)
686: r);
687: }
688:
689:
690: size_t
1.39 schwarze 691: term_hspan(const struct termp *p, const struct roffsu *su)
1.16 schwarze 692: {
1.44 ! schwarze 693: double v;
1.16 schwarze 694:
1.44 ! schwarze 695: v = ((*p->hspan)(p, su));
! 696: if (v < 0.0)
! 697: v = 0.0;
! 698: return((size_t) /* LINTED */
! 699: v);
1.16 schwarze 700: }