Annotation of src/usr.bin/mandoc/term.c, Revision 1.72
1.72 ! schwarze 1: /* $Id: term.c,v 1.71 2013/08/21 21:19:47 schwarze Exp $ */
1.1 kristaps 2: /*
1.59 schwarze 3: * Copyright (c) 2008, 2009, 2010, 2011 Kristaps Dzonsons <kristaps@bsd.lv>
1.70 schwarze 4: * Copyright (c) 2010, 2011, 2012, 2013 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.16 schwarze 28: #include "out.h"
1.1 kristaps 29: #include "term.h"
1.16 schwarze 30: #include "main.h"
1.1 kristaps 31:
1.64 schwarze 32: static size_t cond_width(const struct termp *, int, int *);
1.71 schwarze 33: static void adjbuf(struct termp *p, size_t);
1.59 schwarze 34: static void bufferc(struct termp *, char);
35: static void encode(struct termp *, const char *, size_t);
36: static void encode1(struct termp *, int);
1.1 kristaps 37:
1.37 schwarze 38: void
39: term_free(struct termp *p)
1.1 kristaps 40: {
41:
1.37 schwarze 42: if (p->buf)
43: free(p->buf);
44: if (p->symtab)
1.59 schwarze 45: mchars_free(p->symtab);
1.37 schwarze 46:
47: free(p);
1.1 kristaps 48: }
49:
50:
1.13 schwarze 51: void
1.37 schwarze 52: term_begin(struct termp *p, term_margin head,
53: term_margin foot, const void *arg)
1.1 kristaps 54: {
55:
1.37 schwarze 56: p->headf = head;
57: p->footf = foot;
58: p->argf = arg;
59: (*p->begin)(p);
1.1 kristaps 60: }
61:
62:
1.37 schwarze 63: void
64: term_end(struct termp *p)
1.1 kristaps 65: {
66:
1.37 schwarze 67: (*p->end)(p);
1.1 kristaps 68: }
69:
70: /*
71: * Flush a line of text. A "line" is loosely defined as being something
72: * that should be followed by a newline, regardless of whether it's
73: * broken apart by newlines getting there. A line can also be a
1.27 schwarze 74: * fragment of a columnar list (`Bl -tag' or `Bl -column'), which does
75: * not have a trailing newline.
1.1 kristaps 76: *
1.27 schwarze 77: * The following flags may be specified:
1.1 kristaps 78: *
79: * - TERMP_NOBREAK: this is the most important and is used when making
1.61 schwarze 80: * columns. In short: don't print a newline and instead expect the
81: * next call to do the padding up to the start of the next column.
1.72 ! schwarze 82: * p->trailspace may be set to 0, 1, or 2, depending on how many
! 83: * space characters are required at the end of the column.
1.9 schwarze 84: *
1.6 schwarze 85: * - TERMP_DANGLE: don't newline when TERMP_NOBREAK is specified and
86: * the line is overrun, and don't pad-right if it's underrun.
87: *
88: * - TERMP_HANG: like TERMP_DANGLE, but doesn't newline when
1.61 schwarze 89: * overrunning, instead save the position and continue at that point
1.6 schwarze 90: * when the next invocation.
1.1 kristaps 91: *
92: * In-line line breaking:
93: *
94: * If TERMP_NOBREAK is specified and the line overruns the right
95: * margin, it will break and pad-right to the right margin after
96: * writing. If maxrmargin is violated, it will break and continue
1.19 schwarze 97: * writing from the right-margin, which will lead to the above scenario
98: * upon exit. Otherwise, the line will break at the right margin.
1.1 kristaps 99: */
100: void
101: term_flushln(struct termp *p)
102: {
1.71 schwarze 103: size_t i; /* current input position in p->buf */
1.66 schwarze 104: int ntab; /* number of tabs to prepend */
1.19 schwarze 105: size_t vis; /* current visual position on output */
106: size_t vbl; /* number of blanks to prepend to output */
1.33 schwarze 107: size_t vend; /* end of word visual position on output */
1.19 schwarze 108: size_t bp; /* visual right border position */
1.51 schwarze 109: size_t dv; /* temporary for visual pos calculations */
1.71 schwarze 110: size_t j; /* temporary loop index for p->buf */
111: size_t jhy; /* last hyph before overflow w/r/t j */
1.42 schwarze 112: size_t maxvis; /* output position of visible boundary */
113: size_t mmax; /* used in calculating bp */
1.1 kristaps 114:
115: /*
116: * First, establish the maximum columns of "visible" content.
117: * This is usually the difference between the right-margin and
118: * an indentation, but can be, for tagged lists or columns, a
1.19 schwarze 119: * small set of values.
1.1 kristaps 120: */
1.54 schwarze 121: assert (p->rmargin >= p->offset);
1.53 schwarze 122: dv = p->rmargin - p->offset;
123: maxvis = (int)dv > p->overstep ? dv - (size_t)p->overstep : 0;
124: dv = p->maxrmargin - p->offset;
125: mmax = (int)dv > p->overstep ? dv - (size_t)p->overstep : 0;
1.9 schwarze 126:
1.1 kristaps 127: bp = TERMP_NOBREAK & p->flags ? mmax : maxvis;
1.19 schwarze 128:
1.33 schwarze 129: /*
1.61 schwarze 130: * Calculate the required amount of padding.
1.33 schwarze 131: */
1.61 schwarze 132: vbl = p->offset + p->overstep > p->viscol ?
133: p->offset + p->overstep - p->viscol : 0;
1.33 schwarze 134:
1.53 schwarze 135: vis = vend = 0;
136: i = 0;
1.19 schwarze 137:
1.59 schwarze 138: while (i < p->col) {
1.22 schwarze 139: /*
1.42 schwarze 140: * Handle literal tab characters: collapse all
141: * subsequent tabs into a single huge set of spaces.
1.30 schwarze 142: */
1.66 schwarze 143: ntab = 0;
1.59 schwarze 144: while (i < p->col && '\t' == p->buf[i]) {
1.42 schwarze 145: vend = (vis / p->tabwidth + 1) * p->tabwidth;
1.30 schwarze 146: vbl += vend - vis;
147: vis = vend;
1.66 schwarze 148: ntab++;
1.49 schwarze 149: i++;
1.30 schwarze 150: }
1.22 schwarze 151:
1.1 kristaps 152: /*
153: * Count up visible word characters. Control sequences
154: * (starting with the CSI) aren't counted. A space
155: * generates a non-printing word, which is valid (the
156: * space is printed according to regular spacing rules).
157: */
158:
1.59 schwarze 159: for (j = i, jhy = 0; j < p->col; j++) {
1.69 schwarze 160: if (' ' == p->buf[j] || '\t' == p->buf[j])
1.1 kristaps 161: break;
1.42 schwarze 162:
163: /* Back over the the last printed character. */
164: if (8 == p->buf[j]) {
165: assert(j);
166: vend -= (*p->width)(p, p->buf[j - 1]);
167: continue;
168: }
169:
170: /* Regular word. */
171: /* Break at the hyphen point if we overrun. */
172: if (vend > vis && vend < bp &&
173: ASCII_HYPH == p->buf[j])
174: jhy = j;
175:
176: vend += (*p->width)(p, p->buf[j]);
1.1 kristaps 177: }
178:
179: /*
1.5 schwarze 180: * Find out whether we would exceed the right margin.
1.33 schwarze 181: * If so, break to the next line.
1.5 schwarze 182: */
1.33 schwarze 183: if (vend > bp && 0 == jhy && vis > 0) {
1.22 schwarze 184: vend -= vis;
1.37 schwarze 185: (*p->endline)(p);
1.62 schwarze 186: p->viscol = 0;
1.5 schwarze 187: if (TERMP_NOBREAK & p->flags) {
1.62 schwarze 188: vbl = p->rmargin;
1.22 schwarze 189: vend += p->rmargin - p->offset;
1.62 schwarze 190: } else
1.33 schwarze 191: vbl = p->offset;
1.66 schwarze 192:
193: /* use pending tabs on the new line */
194:
195: if (0 < ntab)
196: vbl += ntab * p->tabwidth;
1.33 schwarze 197:
1.26 schwarze 198: /* Remove the p->overstep width. */
1.33 schwarze 199:
1.53 schwarze 200: bp += (size_t)p->overstep;
1.26 schwarze 201: p->overstep = 0;
1.1 kristaps 202: }
1.30 schwarze 203:
1.33 schwarze 204: /* Write out the [remaining] word. */
1.59 schwarze 205: for ( ; i < p->col; i++) {
1.25 schwarze 206: if (vend > bp && jhy > 0 && i > jhy)
1.30 schwarze 207: break;
208: if ('\t' == p->buf[i])
1.1 kristaps 209: break;
1.22 schwarze 210: if (' ' == p->buf[i]) {
1.46 schwarze 211: j = i;
212: while (' ' == p->buf[i])
1.33 schwarze 213: i++;
1.71 schwarze 214: dv = (i - j) * (*p->width)(p, ' ');
1.51 schwarze 215: vbl += dv;
216: vend += dv;
1.22 schwarze 217: break;
218: }
1.33 schwarze 219: if (ASCII_NBRSP == p->buf[i]) {
1.42 schwarze 220: vbl += (*p->width)(p, ' ');
1.33 schwarze 221: continue;
222: }
223:
224: /*
225: * Now we definitely know there will be
226: * printable characters to output,
227: * so write preceding white space now.
228: */
229: if (vbl) {
1.37 schwarze 230: (*p->advance)(p, vbl);
1.33 schwarze 231: p->viscol += vbl;
232: vbl = 0;
233: }
1.35 schwarze 234:
1.42 schwarze 235: if (ASCII_HYPH == p->buf[i]) {
1.37 schwarze 236: (*p->letter)(p, '-');
1.42 schwarze 237: p->viscol += (*p->width)(p, '-');
1.61 schwarze 238: continue;
239: }
240:
241: (*p->letter)(p, p->buf[i]);
242: if (8 == p->buf[i])
243: p->viscol -= (*p->width)(p, p->buf[i-1]);
244: else
1.42 schwarze 245: p->viscol += (*p->width)(p, p->buf[i]);
1.1 kristaps 246: }
1.22 schwarze 247: vis = vend;
1.1 kristaps 248: }
1.48 schwarze 249:
250: /*
251: * If there was trailing white space, it was not printed;
252: * so reset the cursor position accordingly.
253: */
1.61 schwarze 254: if (vis)
255: vis -= vbl;
1.18 schwarze 256:
1.9 schwarze 257: p->col = 0;
1.26 schwarze 258: p->overstep = 0;
1.1 kristaps 259:
1.9 schwarze 260: if ( ! (TERMP_NOBREAK & p->flags)) {
1.29 schwarze 261: p->viscol = 0;
1.37 schwarze 262: (*p->endline)(p);
1.1 kristaps 263: return;
264: }
265:
1.9 schwarze 266: if (TERMP_HANG & p->flags) {
1.72 ! schwarze 267: p->overstep = (int)(vis - maxvis +
! 268: p->trailspace * (*p->width)(p, ' '));
1.9 schwarze 269:
270: /*
271: * If we have overstepped the margin, temporarily move
272: * it to the right and flag the rest of the line to be
273: * shorter.
274: */
1.65 schwarze 275: if (p->overstep < 0)
1.26 schwarze 276: p->overstep = 0;
1.61 schwarze 277: return;
1.9 schwarze 278:
279: } else if (TERMP_DANGLE & p->flags)
280: return;
1.1 kristaps 281:
1.61 schwarze 282: /* If the column was overrun, break the line. */
1.72 ! schwarze 283: if (maxvis < vis + p->trailspace * (*p->width)(p, ' ')) {
1.37 schwarze 284: (*p->endline)(p);
1.61 schwarze 285: p->viscol = 0;
1.9 schwarze 286: }
1.1 kristaps 287: }
288:
289:
290: /*
291: * A newline only breaks an existing line; it won't assert vertical
292: * space. All data in the output buffer is flushed prior to the newline
293: * assertion.
294: */
295: void
296: term_newln(struct termp *p)
297: {
298:
299: p->flags |= TERMP_NOSPACE;
1.61 schwarze 300: if (p->col || p->viscol)
301: term_flushln(p);
1.1 kristaps 302: }
303:
304:
305: /*
306: * Asserts a vertical space (a full, empty line-break between lines).
307: * Note that if used twice, this will cause two blank spaces and so on.
308: * All data in the output buffer is flushed prior to the newline
309: * assertion.
310: */
311: void
312: term_vspace(struct termp *p)
313: {
314:
315: term_newln(p);
1.29 schwarze 316: p->viscol = 0;
1.63 schwarze 317: if (0 < p->skipvsp)
318: p->skipvsp--;
319: else
320: (*p->endline)(p);
1.1 kristaps 321: }
322:
1.20 schwarze 323: void
324: term_fontlast(struct termp *p)
325: {
326: enum termfont f;
1.11 schwarze 327:
1.20 schwarze 328: f = p->fontl;
329: p->fontl = p->fontq[p->fonti];
330: p->fontq[p->fonti] = f;
331: }
332:
333:
334: void
335: term_fontrepl(struct termp *p, enum termfont f)
336: {
337:
338: p->fontl = p->fontq[p->fonti];
339: p->fontq[p->fonti] = f;
1.1 kristaps 340: }
341:
342:
1.20 schwarze 343: void
344: term_fontpush(struct termp *p, enum termfont f)
1.1 kristaps 345: {
1.7 schwarze 346:
1.20 schwarze 347: assert(p->fonti + 1 < 10);
348: p->fontl = p->fontq[p->fonti];
349: p->fontq[++p->fonti] = f;
350: }
1.1 kristaps 351:
352:
1.20 schwarze 353: const void *
354: term_fontq(struct termp *p)
355: {
1.1 kristaps 356:
1.20 schwarze 357: return(&p->fontq[p->fonti]);
358: }
1.1 kristaps 359:
360:
1.20 schwarze 361: enum termfont
362: term_fonttop(struct termp *p)
363: {
1.1 kristaps 364:
1.20 schwarze 365: return(p->fontq[p->fonti]);
366: }
1.7 schwarze 367:
368:
1.20 schwarze 369: void
370: term_fontpopq(struct termp *p, const void *key)
371: {
1.1 kristaps 372:
1.67 schwarze 373: while (p->fonti >= 0 && key < (void *)(p->fontq + p->fonti))
1.20 schwarze 374: p->fonti--;
375: assert(p->fonti >= 0);
376: }
1.1 kristaps 377:
378:
1.20 schwarze 379: void
380: term_fontpop(struct termp *p)
381: {
1.1 kristaps 382:
1.20 schwarze 383: assert(p->fonti);
384: p->fonti--;
1.1 kristaps 385: }
386:
387: /*
388: * Handle pwords, partial words, which may be either a single word or a
389: * phrase that cannot be broken down (such as a literal string). This
390: * handles word styling.
391: */
1.7 schwarze 392: void
393: term_word(struct termp *p, const char *word)
1.1 kristaps 394: {
1.59 schwarze 395: const char *seq, *cp;
396: char c;
397: int sz, uc;
1.20 schwarze 398: size_t ssz;
1.59 schwarze 399: enum mandoc_esc esc;
1.1 kristaps 400:
1.31 schwarze 401: if ( ! (TERMP_NOSPACE & p->flags)) {
1.40 schwarze 402: if ( ! (TERMP_KEEP & p->flags)) {
1.31 schwarze 403: bufferc(p, ' ');
1.40 schwarze 404: if (TERMP_SENTENCE & p->flags)
405: bufferc(p, ' ');
406: } else
407: bufferc(p, ASCII_NBRSP);
1.31 schwarze 408: }
1.68 schwarze 409: if (TERMP_PREKEEP & p->flags)
410: p->flags |= TERMP_KEEP;
1.1 kristaps 411:
412: if ( ! (p->flags & TERMP_NONOSPACE))
413: p->flags &= ~TERMP_NOSPACE;
1.46 schwarze 414: else
415: p->flags |= TERMP_NOSPACE;
1.1 kristaps 416:
1.52 schwarze 417: p->flags &= ~(TERMP_SENTENCE | TERMP_IGNDELIM);
1.31 schwarze 418:
1.59 schwarze 419: while ('\0' != *word) {
1.64 schwarze 420: if ('\\' != *word) {
421: if (TERMP_SKIPCHAR & p->flags) {
422: p->flags &= ~TERMP_SKIPCHAR;
423: word++;
424: continue;
425: }
426: ssz = strcspn(word, "\\");
1.45 schwarze 427: encode(p, word, ssz);
1.64 schwarze 428: word += (int)ssz;
1.20 schwarze 429: continue;
1.64 schwarze 430: }
1.20 schwarze 431:
1.59 schwarze 432: word++;
433: esc = mandoc_escape(&word, &seq, &sz);
434: if (ESCAPE_ERROR == esc)
435: break;
436:
437: if (TERMENC_ASCII != p->enc)
438: switch (esc) {
439: case (ESCAPE_UNICODE):
440: uc = mchars_num2uc(seq + 1, sz - 1);
441: if ('\0' == uc)
442: break;
443: encode1(p, uc);
444: continue;
445: case (ESCAPE_SPECIAL):
446: uc = mchars_spec2cp(p->symtab, seq, sz);
447: if (uc <= 0)
448: break;
449: encode1(p, uc);
450: continue;
451: default:
452: break;
453: }
1.20 schwarze 454:
1.59 schwarze 455: switch (esc) {
456: case (ESCAPE_UNICODE):
457: encode1(p, '?');
1.56 schwarze 458: break;
1.59 schwarze 459: case (ESCAPE_NUMBERED):
460: c = mchars_num2char(seq, sz);
461: if ('\0' != c)
462: encode(p, &c, 1);
1.20 schwarze 463: break;
1.59 schwarze 464: case (ESCAPE_SPECIAL):
465: cp = mchars_spec2str(p->symtab, seq, sz, &ssz);
466: if (NULL != cp)
467: encode(p, cp, ssz);
468: else if (1 == ssz)
469: encode(p, seq, sz);
1.20 schwarze 470: break;
1.59 schwarze 471: case (ESCAPE_FONTBOLD):
1.20 schwarze 472: term_fontrepl(p, TERMFONT_BOLD);
473: break;
1.59 schwarze 474: case (ESCAPE_FONTITALIC):
1.20 schwarze 475: term_fontrepl(p, TERMFONT_UNDER);
476: break;
1.70 schwarze 477: case (ESCAPE_FONTBI):
478: term_fontrepl(p, TERMFONT_BI);
479: break;
1.59 schwarze 480: case (ESCAPE_FONT):
481: /* FALLTHROUGH */
482: case (ESCAPE_FONTROMAN):
1.20 schwarze 483: term_fontrepl(p, TERMFONT_NONE);
484: break;
1.59 schwarze 485: case (ESCAPE_FONTPREV):
1.20 schwarze 486: term_fontlast(p);
487: break;
1.59 schwarze 488: case (ESCAPE_NOSPACE):
1.64 schwarze 489: if (TERMP_SKIPCHAR & p->flags)
490: p->flags &= ~TERMP_SKIPCHAR;
491: else if ('\0' == *word)
1.59 schwarze 492: p->flags |= TERMP_NOSPACE;
493: break;
1.64 schwarze 494: case (ESCAPE_SKIPCHAR):
495: p->flags |= TERMP_SKIPCHAR;
496: break;
1.20 schwarze 497: default:
498: break;
499: }
500: }
1.1 kristaps 501: }
502:
503: static void
1.71 schwarze 504: adjbuf(struct termp *p, size_t sz)
1.1 kristaps 505: {
506:
1.20 schwarze 507: if (0 == p->maxcols)
508: p->maxcols = 1024;
509: while (sz >= p->maxcols)
510: p->maxcols <<= 2;
511:
1.71 schwarze 512: p->buf = mandoc_realloc(p->buf, sizeof(int) * p->maxcols);
1.1 kristaps 513: }
514:
1.4 schwarze 515: static void
1.20 schwarze 516: bufferc(struct termp *p, char c)
517: {
518:
519: if (p->col + 1 >= p->maxcols)
520: adjbuf(p, p->col + 1);
521:
1.59 schwarze 522: p->buf[p->col++] = c;
1.20 schwarze 523: }
524:
1.59 schwarze 525: /*
526: * See encode().
527: * Do this for a single (probably unicode) value.
528: * Does not check for non-decorated glyphs.
529: */
530: static void
531: encode1(struct termp *p, int c)
532: {
533: enum termfont f;
534:
1.64 schwarze 535: if (TERMP_SKIPCHAR & p->flags) {
536: p->flags &= ~TERMP_SKIPCHAR;
537: return;
538: }
539:
1.70 schwarze 540: if (p->col + 6 >= p->maxcols)
541: adjbuf(p, p->col + 6);
1.59 schwarze 542:
543: f = term_fonttop(p);
544:
1.70 schwarze 545: if (TERMFONT_UNDER == f || TERMFONT_BI == f) {
1.59 schwarze 546: p->buf[p->col++] = '_';
1.70 schwarze 547: p->buf[p->col++] = 8;
548: }
549: if (TERMFONT_BOLD == f || TERMFONT_BI == f) {
550: if (ASCII_HYPH == c)
551: p->buf[p->col++] = '-';
552: else
553: p->buf[p->col++] = c;
554: p->buf[p->col++] = 8;
555: }
1.59 schwarze 556: p->buf[p->col++] = c;
557: }
1.20 schwarze 558:
559: static void
560: encode(struct termp *p, const char *word, size_t sz)
1.4 schwarze 561: {
1.71 schwarze 562: size_t i;
1.59 schwarze 563:
1.64 schwarze 564: if (TERMP_SKIPCHAR & p->flags) {
565: p->flags &= ~TERMP_SKIPCHAR;
566: return;
567: }
568:
1.20 schwarze 569: /*
570: * Encode and buffer a string of characters. If the current
571: * font mode is unset, buffer directly, else encode then buffer
572: * character by character.
573: */
574:
1.70 schwarze 575: if (TERMFONT_NONE == term_fonttop(p)) {
1.71 schwarze 576: if (p->col + sz >= p->maxcols)
577: adjbuf(p, p->col + sz);
578: for (i = 0; i < sz; i++)
1.59 schwarze 579: p->buf[p->col++] = word[i];
1.20 schwarze 580: return;
581: }
582:
1.46 schwarze 583: /* Pre-buffer, assuming worst-case. */
584:
1.71 schwarze 585: if (p->col + 1 + (sz * 5) >= p->maxcols)
586: adjbuf(p, p->col + 1 + (sz * 5));
1.46 schwarze 587:
1.71 schwarze 588: for (i = 0; i < sz; i++) {
1.70 schwarze 589: if (ASCII_HYPH == word[i] ||
590: isgraph((unsigned char)word[i]))
591: encode1(p, word[i]);
1.20 schwarze 592: else
1.59 schwarze 593: p->buf[p->col++] = word[i];
1.4 schwarze 594: }
595: }
1.16 schwarze 596:
597: size_t
1.39 schwarze 598: term_len(const struct termp *p, size_t sz)
599: {
600:
601: return((*p->width)(p, ' ') * sz);
602: }
603:
1.64 schwarze 604: static size_t
605: cond_width(const struct termp *p, int c, int *skip)
606: {
607:
608: if (*skip) {
609: (*skip) = 0;
610: return(0);
611: } else
612: return((*p->width)(p, c));
613: }
1.39 schwarze 614:
615: size_t
616: term_strlen(const struct termp *p, const char *cp)
617: {
1.59 schwarze 618: size_t sz, rsz, i;
1.64 schwarze 619: int ssz, skip, c;
1.50 schwarze 620: const char *seq, *rhs;
1.59 schwarze 621: enum mandoc_esc esc;
622: static const char rej[] = { '\\', ASCII_HYPH, ASCII_NBRSP, '\0' };
623:
624: /*
625: * Account for escaped sequences within string length
626: * calculations. This follows the logic in term_word() as we
627: * must calculate the width of produced strings.
628: */
629:
630: sz = 0;
1.64 schwarze 631: skip = 0;
1.59 schwarze 632: while ('\0' != *cp) {
633: rsz = strcspn(cp, rej);
634: for (i = 0; i < rsz; i++)
1.64 schwarze 635: sz += cond_width(p, *cp++, &skip);
1.59 schwarze 636:
637: c = 0;
638: switch (*cp) {
639: case ('\\'):
640: cp++;
641: esc = mandoc_escape(&cp, &seq, &ssz);
642: if (ESCAPE_ERROR == esc)
643: return(sz);
644:
645: if (TERMENC_ASCII != p->enc)
646: switch (esc) {
647: case (ESCAPE_UNICODE):
648: c = mchars_num2uc
649: (seq + 1, ssz - 1);
650: if ('\0' == c)
651: break;
1.64 schwarze 652: sz += cond_width(p, c, &skip);
1.59 schwarze 653: continue;
654: case (ESCAPE_SPECIAL):
655: c = mchars_spec2cp
656: (p->symtab, seq, ssz);
657: if (c <= 0)
658: break;
1.64 schwarze 659: sz += cond_width(p, c, &skip);
1.59 schwarze 660: continue;
661: default:
662: break;
663: }
664:
665: rhs = NULL;
1.50 schwarze 666:
1.59 schwarze 667: switch (esc) {
668: case (ESCAPE_UNICODE):
1.64 schwarze 669: sz += cond_width(p, '?', &skip);
1.59 schwarze 670: break;
671: case (ESCAPE_NUMBERED):
672: c = mchars_num2char(seq, ssz);
673: if ('\0' != c)
1.64 schwarze 674: sz += cond_width(p, c, &skip);
1.50 schwarze 675: break;
1.59 schwarze 676: case (ESCAPE_SPECIAL):
677: rhs = mchars_spec2str
1.50 schwarze 678: (p->symtab, seq, ssz, &rsz);
679:
1.59 schwarze 680: if (ssz != 1 || rhs)
1.50 schwarze 681: break;
682:
683: rhs = seq;
684: rsz = ssz;
685: break;
1.64 schwarze 686: case (ESCAPE_SKIPCHAR):
687: skip = 1;
688: break;
1.50 schwarze 689: default:
690: break;
691: }
1.39 schwarze 692:
1.59 schwarze 693: if (NULL == rhs)
694: break;
695:
1.64 schwarze 696: if (skip) {
697: skip = 0;
698: break;
699: }
700:
1.59 schwarze 701: for (i = 0; i < rsz; i++)
702: sz += (*p->width)(p, *rhs++);
703: break;
704: case (ASCII_NBRSP):
1.64 schwarze 705: sz += cond_width(p, ' ', &skip);
1.55 schwarze 706: cp++;
1.59 schwarze 707: break;
708: case (ASCII_HYPH):
1.64 schwarze 709: sz += cond_width(p, '-', &skip);
1.55 schwarze 710: cp++;
1.59 schwarze 711: break;
712: default:
713: break;
714: }
715: }
1.39 schwarze 716:
717: return(sz);
718: }
719:
1.44 schwarze 720: /* ARGSUSED */
1.39 schwarze 721: size_t
722: term_vspan(const struct termp *p, const struct roffsu *su)
1.16 schwarze 723: {
724: double r;
725:
726: switch (su->unit) {
727: case (SCALE_CM):
728: r = su->scale * 2;
729: break;
730: case (SCALE_IN):
731: r = su->scale * 6;
732: break;
733: case (SCALE_PC):
734: r = su->scale;
735: break;
736: case (SCALE_PT):
737: r = su->scale / 8;
738: break;
739: case (SCALE_MM):
740: r = su->scale / 1000;
741: break;
742: case (SCALE_VS):
743: r = su->scale;
744: break;
745: default:
746: r = su->scale - 1;
747: break;
748: }
749:
750: if (r < 0.0)
751: r = 0.0;
752: return(/* LINTED */(size_t)
753: r);
754: }
755:
756: size_t
1.39 schwarze 757: term_hspan(const struct termp *p, const struct roffsu *su)
1.16 schwarze 758: {
1.44 schwarze 759: double v;
1.16 schwarze 760:
1.44 schwarze 761: v = ((*p->hspan)(p, su));
762: if (v < 0.0)
763: v = 0.0;
764: return((size_t) /* LINTED */
765: v);
1.16 schwarze 766: }