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