Annotation of src/usr.bin/mandoc/term.c, Revision 1.121
1.121 ! schwarze 1: /* $OpenBSD: term.c,v 1.120 2017/05/07 17:30:58 schwarze Exp $ */
1.1 kristaps 2: /*
1.59 schwarze 3: * Copyright (c) 2008, 2009, 2010, 2011 Kristaps Dzonsons <kristaps@bsd.lv>
1.119 schwarze 4: * Copyright (c) 2010-2017 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.106 schwarze 10: * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHORS DISCLAIM ALL WARRANTIES
1.2 schwarze 11: * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
1.106 schwarze 12: * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHORS BE LIABLE FOR
1.2 schwarze 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.106 schwarze 50: term_margin foot, const struct roff_meta *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.
1.110 schwarze 79: * - TERMP_BRTRSP: Consider trailing whitespace significant
80: * when deciding whether the chunk fits or not.
1.82 schwarze 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.
1.1 kristaps 90: */
91: void
92: term_flushln(struct termp *p)
93: {
1.71 schwarze 94: size_t i; /* current input position in p->buf */
1.66 schwarze 95: int ntab; /* number of tabs to prepend */
1.19 schwarze 96: size_t vis; /* current visual position on output */
97: size_t vbl; /* number of blanks to prepend to output */
1.33 schwarze 98: size_t vend; /* end of word visual position on output */
1.19 schwarze 99: size_t bp; /* visual right border position */
1.51 schwarze 100: size_t dv; /* temporary for visual pos calculations */
1.71 schwarze 101: size_t j; /* temporary loop index for p->buf */
102: size_t jhy; /* last hyph before overflow w/r/t j */
1.42 schwarze 103: size_t maxvis; /* output position of visible boundary */
1.1 kristaps 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
1.73 schwarze 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.
1.1 kristaps 115: */
1.100 schwarze 116: dv = p->rmargin > p->offset ? p->rmargin - p->offset : 0;
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.120 schwarze 142: while (i < p->col && p->buf[i] == '\t') {
143: vend = term_tab_next(vis);
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:
1.117 krw 161: /* Back over the last printed character. */
1.42 schwarze 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.66 schwarze 193:
1.120 schwarze 194: /* Use pending tabs on the new line. */
195:
196: vbl = 0;
197: while (ntab--)
198: vbl = term_tab_next(vbl);
199:
200: /* Re-establish indentation. */
1.66 schwarze 201:
1.120 schwarze 202: if (p->flags & TERMP_BRIND) {
203: vbl += p->rmargin;
204: vend += p->rmargin - p->offset;
205: } else
206: vbl += p->offset;
1.33 schwarze 207:
1.73 schwarze 208: /*
209: * Remove the p->overstep width.
210: * Again, if p->overstep is negative,
211: * sign extension does the right thing.
212: */
1.33 schwarze 213:
1.53 schwarze 214: bp += (size_t)p->overstep;
1.26 schwarze 215: p->overstep = 0;
1.1 kristaps 216: }
1.30 schwarze 217:
1.33 schwarze 218: /* Write out the [remaining] word. */
1.59 schwarze 219: for ( ; i < p->col; i++) {
1.25 schwarze 220: if (vend > bp && jhy > 0 && i > jhy)
1.30 schwarze 221: break;
222: if ('\t' == p->buf[i])
1.1 kristaps 223: break;
1.22 schwarze 224: if (' ' == p->buf[i]) {
1.46 schwarze 225: j = i;
1.88 schwarze 226: while (i < p->col && ' ' == p->buf[i])
1.33 schwarze 227: i++;
1.71 schwarze 228: dv = (i - j) * (*p->width)(p, ' ');
1.51 schwarze 229: vbl += dv;
230: vend += dv;
1.22 schwarze 231: break;
232: }
1.33 schwarze 233: if (ASCII_NBRSP == p->buf[i]) {
1.42 schwarze 234: vbl += (*p->width)(p, ' ');
1.33 schwarze 235: continue;
236: }
1.77 schwarze 237: if (ASCII_BREAK == p->buf[i])
238: continue;
1.33 schwarze 239:
240: /*
241: * Now we definitely know there will be
242: * printable characters to output,
243: * so write preceding white space now.
244: */
245: if (vbl) {
1.37 schwarze 246: (*p->advance)(p, vbl);
1.33 schwarze 247: p->viscol += vbl;
248: vbl = 0;
1.61 schwarze 249: }
250:
251: (*p->letter)(p, p->buf[i]);
252: if (8 == p->buf[i])
253: p->viscol -= (*p->width)(p, p->buf[i-1]);
1.83 schwarze 254: else
1.42 schwarze 255: p->viscol += (*p->width)(p, p->buf[i]);
1.1 kristaps 256: }
1.22 schwarze 257: vis = vend;
1.1 kristaps 258: }
1.48 schwarze 259:
260: /*
261: * If there was trailing white space, it was not printed;
262: * so reset the cursor position accordingly.
263: */
1.95 schwarze 264: if (vis > vbl)
1.61 schwarze 265: vis -= vbl;
1.95 schwarze 266: else
267: vis = 0;
1.18 schwarze 268:
1.9 schwarze 269: p->col = 0;
1.26 schwarze 270: p->overstep = 0;
1.108 schwarze 271: p->flags &= ~(TERMP_BACKAFTER | TERMP_BACKBEFORE);
1.1 kristaps 272:
1.9 schwarze 273: if ( ! (TERMP_NOBREAK & p->flags)) {
1.29 schwarze 274: p->viscol = 0;
1.37 schwarze 275: (*p->endline)(p);
1.1 kristaps 276: return;
277: }
278:
1.9 schwarze 279: if (TERMP_HANG & p->flags) {
1.102 schwarze 280: p->overstep += (int)(p->offset + vis - p->rmargin +
1.83 schwarze 281: p->trailspace * (*p->width)(p, ' '));
1.9 schwarze 282:
283: /*
284: * If we have overstepped the margin, temporarily move
285: * it to the right and flag the rest of the line to be
286: * shorter.
1.73 schwarze 287: * If there is a request to keep the columns together,
288: * allow negative overstep when the column is not full.
1.9 schwarze 289: */
1.73 schwarze 290: if (p->trailspace && p->overstep < 0)
1.26 schwarze 291: p->overstep = 0;
1.61 schwarze 292: return;
1.9 schwarze 293:
294: } else if (TERMP_DANGLE & p->flags)
295: return;
1.110 schwarze 296:
297: /* Trailing whitespace is significant in some columns. */
298: if (vis && vbl && (TERMP_BRTRSP & p->flags))
299: vis += vbl;
1.1 kristaps 300:
1.61 schwarze 301: /* If the column was overrun, break the line. */
1.72 schwarze 302: if (maxvis < vis + p->trailspace * (*p->width)(p, ' ')) {
1.37 schwarze 303: (*p->endline)(p);
1.61 schwarze 304: p->viscol = 0;
1.9 schwarze 305: }
1.1 kristaps 306: }
307:
1.83 schwarze 308: /*
1.1 kristaps 309: * A newline only breaks an existing line; it won't assert vertical
310: * space. All data in the output buffer is flushed prior to the newline
311: * assertion.
312: */
313: void
314: term_newln(struct termp *p)
315: {
316:
317: p->flags |= TERMP_NOSPACE;
1.61 schwarze 318: if (p->col || p->viscol)
319: term_flushln(p);
1.1 kristaps 320: }
321:
322: /*
323: * Asserts a vertical space (a full, empty line-break between lines).
324: * Note that if used twice, this will cause two blank spaces and so on.
325: * All data in the output buffer is flushed prior to the newline
326: * assertion.
327: */
328: void
329: term_vspace(struct termp *p)
330: {
331:
332: term_newln(p);
1.29 schwarze 333: p->viscol = 0;
1.63 schwarze 334: if (0 < p->skipvsp)
335: p->skipvsp--;
336: else
337: (*p->endline)(p);
1.1 kristaps 338: }
339:
1.98 schwarze 340: /* Swap current and previous font; for \fP and .ft P */
1.20 schwarze 341: void
342: term_fontlast(struct termp *p)
343: {
344: enum termfont f;
1.11 schwarze 345:
1.20 schwarze 346: f = p->fontl;
347: p->fontl = p->fontq[p->fonti];
348: p->fontq[p->fonti] = f;
349: }
350:
1.98 schwarze 351: /* Set font, save current, discard previous; for \f, .ft, .B etc. */
1.20 schwarze 352: void
353: term_fontrepl(struct termp *p, enum termfont f)
354: {
355:
356: p->fontl = p->fontq[p->fonti];
357: p->fontq[p->fonti] = f;
1.1 kristaps 358: }
359:
1.98 schwarze 360: /* Set font, save previous. */
1.20 schwarze 361: void
362: term_fontpush(struct termp *p, enum termfont f)
1.1 kristaps 363: {
1.7 schwarze 364:
1.20 schwarze 365: p->fontl = p->fontq[p->fonti];
1.98 schwarze 366: if (++p->fonti == p->fontsz) {
367: p->fontsz += 8;
368: p->fontq = mandoc_reallocarray(p->fontq,
1.116 schwarze 369: p->fontsz, sizeof(*p->fontq));
1.98 schwarze 370: }
371: p->fontq[p->fonti] = f;
1.20 schwarze 372: }
1.1 kristaps 373:
1.98 schwarze 374: /* Flush to make the saved pointer current again. */
1.20 schwarze 375: void
1.104 schwarze 376: term_fontpopq(struct termp *p, int i)
1.20 schwarze 377: {
1.1 kristaps 378:
1.104 schwarze 379: assert(i >= 0);
380: if (p->fonti > i)
381: p->fonti = i;
1.20 schwarze 382: }
1.1 kristaps 383:
1.98 schwarze 384: /* Pop one font off the stack. */
1.20 schwarze 385: void
386: term_fontpop(struct termp *p)
387: {
1.1 kristaps 388:
1.20 schwarze 389: assert(p->fonti);
390: p->fonti--;
1.1 kristaps 391: }
392:
393: /*
394: * Handle pwords, partial words, which may be either a single word or a
395: * phrase that cannot be broken down (such as a literal string). This
396: * handles word styling.
397: */
1.7 schwarze 398: void
399: term_word(struct termp *p, const char *word)
1.1 kristaps 400: {
1.121 ! schwarze 401: struct roffsu su;
1.75 schwarze 402: const char nbrsp[2] = { ASCII_NBRSP, 0 };
1.59 schwarze 403: const char *seq, *cp;
404: int sz, uc;
1.20 schwarze 405: size_t ssz;
1.59 schwarze 406: enum mandoc_esc esc;
1.1 kristaps 407:
1.31 schwarze 408: if ( ! (TERMP_NOSPACE & p->flags)) {
1.40 schwarze 409: if ( ! (TERMP_KEEP & p->flags)) {
1.31 schwarze 410: bufferc(p, ' ');
1.40 schwarze 411: if (TERMP_SENTENCE & p->flags)
412: bufferc(p, ' ');
413: } else
414: bufferc(p, ASCII_NBRSP);
1.31 schwarze 415: }
1.68 schwarze 416: if (TERMP_PREKEEP & p->flags)
417: p->flags |= TERMP_KEEP;
1.1 kristaps 418:
419: if ( ! (p->flags & TERMP_NONOSPACE))
420: p->flags &= ~TERMP_NOSPACE;
1.46 schwarze 421: else
422: p->flags |= TERMP_NOSPACE;
1.1 kristaps 423:
1.97 schwarze 424: p->flags &= ~(TERMP_SENTENCE | TERMP_NONEWLINE);
1.105 schwarze 425: p->skipvsp = 0;
1.31 schwarze 426:
1.59 schwarze 427: while ('\0' != *word) {
1.64 schwarze 428: if ('\\' != *word) {
1.75 schwarze 429: if (TERMP_NBRWORD & p->flags) {
430: if (' ' == *word) {
431: encode(p, nbrsp, 1);
432: word++;
433: continue;
434: }
435: ssz = strcspn(word, "\\ ");
436: } else
437: ssz = strcspn(word, "\\");
1.45 schwarze 438: encode(p, word, ssz);
1.64 schwarze 439: word += (int)ssz;
1.20 schwarze 440: continue;
1.64 schwarze 441: }
1.20 schwarze 442:
1.59 schwarze 443: word++;
444: esc = mandoc_escape(&word, &seq, &sz);
445: if (ESCAPE_ERROR == esc)
1.85 schwarze 446: continue;
1.59 schwarze 447:
448: switch (esc) {
1.83 schwarze 449: case ESCAPE_UNICODE:
1.89 schwarze 450: uc = mchars_num2uc(seq + 1, sz - 1);
1.56 schwarze 451: break;
1.83 schwarze 452: case ESCAPE_NUMBERED:
1.93 schwarze 453: uc = mchars_num2char(seq, sz);
454: if (uc < 0)
455: continue;
1.20 schwarze 456: break;
1.83 schwarze 457: case ESCAPE_SPECIAL:
1.89 schwarze 458: if (p->enc == TERMENC_ASCII) {
1.114 schwarze 459: cp = mchars_spec2str(seq, sz, &ssz);
1.92 schwarze 460: if (cp != NULL)
1.89 schwarze 461: encode(p, cp, ssz);
462: } else {
1.114 schwarze 463: uc = mchars_spec2cp(seq, sz);
1.90 schwarze 464: if (uc > 0)
465: encode1(p, uc);
1.89 schwarze 466: }
1.93 schwarze 467: continue;
1.83 schwarze 468: case ESCAPE_FONTBOLD:
1.20 schwarze 469: term_fontrepl(p, TERMFONT_BOLD);
1.93 schwarze 470: continue;
1.83 schwarze 471: case ESCAPE_FONTITALIC:
1.20 schwarze 472: term_fontrepl(p, TERMFONT_UNDER);
1.93 schwarze 473: continue;
1.83 schwarze 474: case ESCAPE_FONTBI:
1.70 schwarze 475: term_fontrepl(p, TERMFONT_BI);
1.93 schwarze 476: continue;
1.83 schwarze 477: case ESCAPE_FONT:
478: case ESCAPE_FONTROMAN:
1.20 schwarze 479: term_fontrepl(p, TERMFONT_NONE);
1.93 schwarze 480: continue;
1.83 schwarze 481: case ESCAPE_FONTPREV:
1.20 schwarze 482: term_fontlast(p);
1.93 schwarze 483: continue;
1.83 schwarze 484: case ESCAPE_NOSPACE:
1.108 schwarze 485: if (p->flags & TERMP_BACKAFTER)
486: p->flags &= ~TERMP_BACKAFTER;
487: else if (*word == '\0')
1.97 schwarze 488: p->flags |= (TERMP_NOSPACE | TERMP_NONEWLINE);
1.121 ! schwarze 489: continue;
! 490: case ESCAPE_HORIZ:
! 491: if (a2roffsu(seq, &su, SCALE_EM) == 0)
! 492: continue;
! 493: uc = term_hspan(p, &su) / 24;
! 494: if (uc > 0)
! 495: while (uc-- > 0)
! 496: bufferc(p, ASCII_NBRSP);
! 497: else if (p->col > (size_t)(-uc))
! 498: p->col += uc;
! 499: else {
! 500: uc += p->col;
! 501: p->col = 0;
! 502: if (p->offset > (size_t)(-uc)) {
! 503: p->ti += uc;
! 504: p->offset += uc;
! 505: } else {
! 506: p->ti -= p->offset;
! 507: p->offset = 0;
! 508: }
! 509: }
1.93 schwarze 510: continue;
1.83 schwarze 511: case ESCAPE_SKIPCHAR:
1.108 schwarze 512: p->flags |= TERMP_BACKAFTER;
1.93 schwarze 513: continue;
1.103 schwarze 514: case ESCAPE_OVERSTRIKE:
515: cp = seq + sz;
516: while (seq < cp) {
517: if (*seq == '\\') {
518: mandoc_escape(&seq, NULL, NULL);
519: continue;
520: }
521: encode1(p, *seq++);
1.108 schwarze 522: if (seq < cp) {
523: if (p->flags & TERMP_BACKBEFORE)
524: p->flags |= TERMP_BACKAFTER;
525: else
526: p->flags |= TERMP_BACKBEFORE;
527: }
1.103 schwarze 528: }
1.109 schwarze 529: /* Trim trailing backspace/blank pair. */
1.118 schwarze 530: if (p->col > 2 &&
531: (p->buf[p->col - 1] == ' ' ||
532: p->buf[p->col - 1] == '\t'))
1.109 schwarze 533: p->col -= 2;
1.108 schwarze 534: continue;
1.20 schwarze 535: default:
1.93 schwarze 536: continue;
537: }
538:
539: /*
540: * Common handling for Unicode and numbered
541: * character escape sequences.
542: */
543:
544: if (p->enc == TERMENC_ASCII) {
545: cp = ascii_uc2str(uc);
546: encode(p, cp, strlen(cp));
547: } else {
548: if ((uc < 0x20 && uc != 0x09) ||
549: (uc > 0x7E && uc < 0xA0))
550: uc = 0xFFFD;
551: encode1(p, uc);
1.20 schwarze 552: }
553: }
1.75 schwarze 554: p->flags &= ~TERMP_NBRWORD;
1.1 kristaps 555: }
556:
557: static void
1.71 schwarze 558: adjbuf(struct termp *p, size_t sz)
1.1 kristaps 559: {
560:
1.20 schwarze 561: if (0 == p->maxcols)
562: p->maxcols = 1024;
563: while (sz >= p->maxcols)
564: p->maxcols <<= 2;
565:
1.84 schwarze 566: p->buf = mandoc_reallocarray(p->buf, p->maxcols, sizeof(int));
1.1 kristaps 567: }
568:
1.4 schwarze 569: static void
1.20 schwarze 570: bufferc(struct termp *p, char c)
571: {
572:
573: if (p->col + 1 >= p->maxcols)
574: adjbuf(p, p->col + 1);
575:
1.59 schwarze 576: p->buf[p->col++] = c;
1.20 schwarze 577: }
578:
1.59 schwarze 579: /*
580: * See encode().
581: * Do this for a single (probably unicode) value.
582: * Does not check for non-decorated glyphs.
583: */
584: static void
585: encode1(struct termp *p, int c)
586: {
587: enum termfont f;
588:
1.108 schwarze 589: if (p->col + 7 >= p->maxcols)
590: adjbuf(p, p->col + 7);
1.59 schwarze 591:
1.115 schwarze 592: f = (c == ASCII_HYPH || c > 127 || isgraph(c)) ?
1.108 schwarze 593: p->fontq[p->fonti] : TERMFONT_NONE;
1.59 schwarze 594:
1.108 schwarze 595: if (p->flags & TERMP_BACKBEFORE) {
1.118 schwarze 596: if (p->buf[p->col - 1] == ' ' || p->buf[p->col - 1] == '\t')
1.109 schwarze 597: p->col--;
598: else
599: p->buf[p->col++] = 8;
1.108 schwarze 600: p->flags &= ~TERMP_BACKBEFORE;
601: }
1.70 schwarze 602: if (TERMFONT_UNDER == f || TERMFONT_BI == f) {
1.59 schwarze 603: p->buf[p->col++] = '_';
1.70 schwarze 604: p->buf[p->col++] = 8;
605: }
606: if (TERMFONT_BOLD == f || TERMFONT_BI == f) {
607: if (ASCII_HYPH == c)
608: p->buf[p->col++] = '-';
609: else
610: p->buf[p->col++] = c;
611: p->buf[p->col++] = 8;
612: }
1.59 schwarze 613: p->buf[p->col++] = c;
1.108 schwarze 614: if (p->flags & TERMP_BACKAFTER) {
615: p->flags |= TERMP_BACKBEFORE;
616: p->flags &= ~TERMP_BACKAFTER;
617: }
1.59 schwarze 618: }
1.20 schwarze 619:
620: static void
621: encode(struct termp *p, const char *word, size_t sz)
1.4 schwarze 622: {
1.71 schwarze 623: size_t i;
1.59 schwarze 624:
1.108 schwarze 625: if (p->col + 2 + (sz * 5) >= p->maxcols)
626: adjbuf(p, p->col + 2 + (sz * 5));
1.46 schwarze 627:
1.71 schwarze 628: for (i = 0; i < sz; i++) {
1.70 schwarze 629: if (ASCII_HYPH == word[i] ||
630: isgraph((unsigned char)word[i]))
631: encode1(p, word[i]);
1.119 schwarze 632: else {
1.59 schwarze 633: p->buf[p->col++] = word[i];
1.119 schwarze 634:
635: /*
636: * Postpone the effect of \z while handling
637: * an overstrike sequence from ascii_uc2str().
638: */
639:
640: if (word[i] == '\b' &&
641: (p->flags & TERMP_BACKBEFORE)) {
642: p->flags &= ~TERMP_BACKBEFORE;
643: p->flags |= TERMP_BACKAFTER;
644: }
645: }
1.4 schwarze 646: }
1.80 schwarze 647: }
648:
649: void
650: term_setwidth(struct termp *p, const char *wstr)
651: {
652: struct roffsu su;
1.107 schwarze 653: int iop, width;
1.80 schwarze 654:
1.81 schwarze 655: iop = 0;
656: width = 0;
1.80 schwarze 657: if (NULL != wstr) {
658: switch (*wstr) {
1.83 schwarze 659: case '+':
1.80 schwarze 660: iop = 1;
661: wstr++;
662: break;
1.83 schwarze 663: case '-':
1.80 schwarze 664: iop = -1;
665: wstr++;
666: break;
667: default:
668: break;
669: }
1.81 schwarze 670: if (a2roffsu(wstr, &su, SCALE_MAX))
671: width = term_hspan(p, &su);
672: else
1.80 schwarze 673: iop = 0;
674: }
675: (*p->setwidth)(p, iop, width);
1.4 schwarze 676: }
1.16 schwarze 677:
678: size_t
1.39 schwarze 679: term_len(const struct termp *p, size_t sz)
680: {
681:
1.112 schwarze 682: return (*p->width)(p, ' ') * sz;
1.39 schwarze 683: }
684:
1.64 schwarze 685: static size_t
686: cond_width(const struct termp *p, int c, int *skip)
687: {
688:
689: if (*skip) {
690: (*skip) = 0;
1.112 schwarze 691: return 0;
1.64 schwarze 692: } else
1.112 schwarze 693: return (*p->width)(p, c);
1.64 schwarze 694: }
1.39 schwarze 695:
696: size_t
697: term_strlen(const struct termp *p, const char *cp)
698: {
1.59 schwarze 699: size_t sz, rsz, i;
1.93 schwarze 700: int ssz, skip, uc;
1.50 schwarze 701: const char *seq, *rhs;
1.59 schwarze 702: enum mandoc_esc esc;
1.77 schwarze 703: static const char rej[] = { '\\', ASCII_NBRSP, ASCII_HYPH,
704: ASCII_BREAK, '\0' };
1.59 schwarze 705:
706: /*
707: * Account for escaped sequences within string length
708: * calculations. This follows the logic in term_word() as we
709: * must calculate the width of produced strings.
710: */
711:
712: sz = 0;
1.64 schwarze 713: skip = 0;
1.59 schwarze 714: while ('\0' != *cp) {
715: rsz = strcspn(cp, rej);
716: for (i = 0; i < rsz; i++)
1.64 schwarze 717: sz += cond_width(p, *cp++, &skip);
1.59 schwarze 718:
719: switch (*cp) {
1.83 schwarze 720: case '\\':
1.59 schwarze 721: cp++;
722: esc = mandoc_escape(&cp, &seq, &ssz);
723: if (ESCAPE_ERROR == esc)
1.85 schwarze 724: continue;
1.59 schwarze 725:
726: rhs = NULL;
1.50 schwarze 727:
1.59 schwarze 728: switch (esc) {
1.83 schwarze 729: case ESCAPE_UNICODE:
1.94 schwarze 730: uc = mchars_num2uc(seq + 1, ssz - 1);
1.59 schwarze 731: break;
1.83 schwarze 732: case ESCAPE_NUMBERED:
1.93 schwarze 733: uc = mchars_num2char(seq, ssz);
734: if (uc < 0)
735: continue;
1.50 schwarze 736: break;
1.83 schwarze 737: case ESCAPE_SPECIAL:
1.93 schwarze 738: if (p->enc == TERMENC_ASCII) {
1.114 schwarze 739: rhs = mchars_spec2str(seq, ssz, &rsz);
1.93 schwarze 740: if (rhs != NULL)
741: break;
742: } else {
1.114 schwarze 743: uc = mchars_spec2cp(seq, ssz);
1.93 schwarze 744: if (uc > 0)
745: sz += cond_width(p, uc, &skip);
1.89 schwarze 746: }
1.93 schwarze 747: continue;
1.83 schwarze 748: case ESCAPE_SKIPCHAR:
1.64 schwarze 749: skip = 1;
1.103 schwarze 750: continue;
751: case ESCAPE_OVERSTRIKE:
752: rsz = 0;
753: rhs = seq + ssz;
754: while (seq < rhs) {
755: if (*seq == '\\') {
756: mandoc_escape(&seq, NULL, NULL);
757: continue;
758: }
759: i = (*p->width)(p, *seq++);
760: if (rsz < i)
761: rsz = i;
762: }
763: sz += rsz;
1.93 schwarze 764: continue;
1.50 schwarze 765: default:
1.93 schwarze 766: continue;
1.50 schwarze 767: }
1.39 schwarze 768:
1.93 schwarze 769: /*
770: * Common handling for Unicode and numbered
771: * character escape sequences.
772: */
773:
774: if (rhs == NULL) {
775: if (p->enc == TERMENC_ASCII) {
776: rhs = ascii_uc2str(uc);
777: rsz = strlen(rhs);
778: } else {
779: if ((uc < 0x20 && uc != 0x09) ||
780: (uc > 0x7E && uc < 0xA0))
781: uc = 0xFFFD;
782: sz += cond_width(p, uc, &skip);
783: continue;
784: }
785: }
1.59 schwarze 786:
1.64 schwarze 787: if (skip) {
788: skip = 0;
789: break;
790: }
1.93 schwarze 791:
792: /*
793: * Common handling for all escape sequences
794: * printing more than one character.
795: */
1.64 schwarze 796:
1.59 schwarze 797: for (i = 0; i < rsz; i++)
798: sz += (*p->width)(p, *rhs++);
799: break;
1.83 schwarze 800: case ASCII_NBRSP:
1.64 schwarze 801: sz += cond_width(p, ' ', &skip);
1.55 schwarze 802: cp++;
1.59 schwarze 803: break;
1.83 schwarze 804: case ASCII_HYPH:
1.64 schwarze 805: sz += cond_width(p, '-', &skip);
1.55 schwarze 806: cp++;
1.59 schwarze 807: break;
808: default:
809: break;
810: }
811: }
1.39 schwarze 812:
1.112 schwarze 813: return sz;
1.39 schwarze 814: }
815:
1.100 schwarze 816: int
1.39 schwarze 817: term_vspan(const struct termp *p, const struct roffsu *su)
1.16 schwarze 818: {
819: double r;
1.101 schwarze 820: int ri;
1.16 schwarze 821:
822: switch (su->unit) {
1.99 schwarze 823: case SCALE_BU:
824: r = su->scale / 40.0;
825: break;
1.83 schwarze 826: case SCALE_CM:
1.99 schwarze 827: r = su->scale * 6.0 / 2.54;
828: break;
829: case SCALE_FS:
830: r = su->scale * 65536.0 / 40.0;
1.16 schwarze 831: break;
1.83 schwarze 832: case SCALE_IN:
1.86 schwarze 833: r = su->scale * 6.0;
1.16 schwarze 834: break;
1.99 schwarze 835: case SCALE_MM:
836: r = su->scale * 0.006;
837: break;
1.83 schwarze 838: case SCALE_PC:
1.16 schwarze 839: r = su->scale;
840: break;
1.83 schwarze 841: case SCALE_PT:
1.99 schwarze 842: r = su->scale / 12.0;
1.16 schwarze 843: break;
1.99 schwarze 844: case SCALE_EN:
845: case SCALE_EM:
846: r = su->scale * 0.6;
1.16 schwarze 847: break;
1.83 schwarze 848: case SCALE_VS:
1.16 schwarze 849: r = su->scale;
850: break;
851: default:
1.99 schwarze 852: abort();
1.16 schwarze 853: }
1.101 schwarze 854: ri = r > 0.0 ? r + 0.4995 : r - 0.4995;
1.112 schwarze 855: return ri < 66 ? ri : 1;
1.16 schwarze 856: }
857:
1.107 schwarze 858: /*
859: * Convert a scaling width to basic units, rounding down.
860: */
1.100 schwarze 861: int
1.39 schwarze 862: term_hspan(const struct termp *p, const struct roffsu *su)
1.16 schwarze 863: {
864:
1.112 schwarze 865: return (*p->hspan)(p, su);
1.16 schwarze 866: }
![[BACK]](/icons/back.gif){kind=icon}
Return to term.c CVS log ![[TXT]](/icons/text.gif){kind=icon}
![[DIR]](/icons/dir.gif){kind=icon}
Up to [local] / src / usr.bin / mandoc