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