Annotation of src/usr.bin/mandoc/term.c, Revision 1.77
1.77 ! schwarze 1: /* $Id: term.c,v 1.76 2013/12/31 18:07:06 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.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.73 schwarze 119: * small set of values.
120: *
121: * The following unsigned-signed subtractions look strange,
122: * but they are actually correct. If the int p->overstep
123: * is negative, it gets sign extended. Subtracting that
124: * very large size_t effectively adds a small number to dv.
1.1 kristaps 125: */
1.54 schwarze 126: assert (p->rmargin >= p->offset);
1.53 schwarze 127: dv = p->rmargin - p->offset;
128: maxvis = (int)dv > p->overstep ? dv - (size_t)p->overstep : 0;
129: dv = p->maxrmargin - p->offset;
130: mmax = (int)dv > p->overstep ? dv - (size_t)p->overstep : 0;
1.9 schwarze 131:
1.1 kristaps 132: bp = TERMP_NOBREAK & p->flags ? mmax : maxvis;
1.19 schwarze 133:
1.33 schwarze 134: /*
1.61 schwarze 135: * Calculate the required amount of padding.
1.33 schwarze 136: */
1.61 schwarze 137: vbl = p->offset + p->overstep > p->viscol ?
138: p->offset + p->overstep - p->viscol : 0;
1.33 schwarze 139:
1.53 schwarze 140: vis = vend = 0;
141: i = 0;
1.19 schwarze 142:
1.59 schwarze 143: while (i < p->col) {
1.22 schwarze 144: /*
1.42 schwarze 145: * Handle literal tab characters: collapse all
146: * subsequent tabs into a single huge set of spaces.
1.30 schwarze 147: */
1.66 schwarze 148: ntab = 0;
1.59 schwarze 149: while (i < p->col && '\t' == p->buf[i]) {
1.42 schwarze 150: vend = (vis / p->tabwidth + 1) * p->tabwidth;
1.30 schwarze 151: vbl += vend - vis;
152: vis = vend;
1.66 schwarze 153: ntab++;
1.49 schwarze 154: i++;
1.30 schwarze 155: }
1.22 schwarze 156:
1.1 kristaps 157: /*
158: * Count up visible word characters. Control sequences
159: * (starting with the CSI) aren't counted. A space
160: * generates a non-printing word, which is valid (the
161: * space is printed according to regular spacing rules).
162: */
163:
1.59 schwarze 164: for (j = i, jhy = 0; j < p->col; j++) {
1.69 schwarze 165: if (' ' == p->buf[j] || '\t' == p->buf[j])
1.1 kristaps 166: break;
1.42 schwarze 167:
168: /* Back over the the last printed character. */
169: if (8 == p->buf[j]) {
170: assert(j);
171: vend -= (*p->width)(p, p->buf[j - 1]);
172: continue;
173: }
174:
175: /* Regular word. */
176: /* Break at the hyphen point if we overrun. */
177: if (vend > vis && vend < bp &&
1.77 ! schwarze 178: (ASCII_HYPH == p->buf[j] ||
! 179: ASCII_BREAK == p->buf[j]))
1.42 schwarze 180: jhy = j;
181:
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.5 schwarze 193: if (TERMP_NOBREAK & p->flags) {
1.62 schwarze 194: vbl = p->rmargin;
1.22 schwarze 195: vend += p->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;
222: while (' ' == 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;
245: }
1.35 schwarze 246:
1.42 schwarze 247: if (ASCII_HYPH == p->buf[i]) {
1.37 schwarze 248: (*p->letter)(p, '-');
1.42 schwarze 249: p->viscol += (*p->width)(p, '-');
1.61 schwarze 250: continue;
251: }
252:
253: (*p->letter)(p, p->buf[i]);
254: if (8 == p->buf[i])
255: p->viscol -= (*p->width)(p, p->buf[i-1]);
256: else
1.42 schwarze 257: p->viscol += (*p->width)(p, p->buf[i]);
1.1 kristaps 258: }
1.22 schwarze 259: vis = vend;
1.1 kristaps 260: }
1.48 schwarze 261:
262: /*
263: * If there was trailing white space, it was not printed;
264: * so reset the cursor position accordingly.
265: */
1.61 schwarze 266: if (vis)
267: vis -= vbl;
1.18 schwarze 268:
1.9 schwarze 269: p->col = 0;
1.26 schwarze 270: p->overstep = 0;
1.1 kristaps 271:
1.9 schwarze 272: if ( ! (TERMP_NOBREAK & p->flags)) {
1.29 schwarze 273: p->viscol = 0;
1.37 schwarze 274: (*p->endline)(p);
1.1 kristaps 275: return;
276: }
277:
1.9 schwarze 278: if (TERMP_HANG & p->flags) {
1.72 schwarze 279: p->overstep = (int)(vis - maxvis +
280: p->trailspace * (*p->width)(p, ' '));
1.9 schwarze 281:
282: /*
283: * If we have overstepped the margin, temporarily move
284: * it to the right and flag the rest of the line to be
285: * shorter.
1.73 schwarze 286: * If there is a request to keep the columns together,
287: * allow negative overstep when the column is not full.
1.9 schwarze 288: */
1.73 schwarze 289: if (p->trailspace && p->overstep < 0)
1.26 schwarze 290: p->overstep = 0;
1.61 schwarze 291: return;
1.9 schwarze 292:
293: } else if (TERMP_DANGLE & p->flags)
294: return;
1.1 kristaps 295:
1.61 schwarze 296: /* If the column was overrun, break the line. */
1.72 schwarze 297: if (maxvis < vis + p->trailspace * (*p->width)(p, ' ')) {
1.37 schwarze 298: (*p->endline)(p);
1.61 schwarze 299: p->viscol = 0;
1.9 schwarze 300: }
1.1 kristaps 301: }
302:
303:
304: /*
305: * A newline only breaks an existing line; it won't assert vertical
306: * space. All data in the output buffer is flushed prior to the newline
307: * assertion.
308: */
309: void
310: term_newln(struct termp *p)
311: {
312:
313: p->flags |= TERMP_NOSPACE;
1.61 schwarze 314: if (p->col || p->viscol)
315: term_flushln(p);
1.1 kristaps 316: }
317:
318:
319: /*
320: * Asserts a vertical space (a full, empty line-break between lines).
321: * Note that if used twice, this will cause two blank spaces and so on.
322: * All data in the output buffer is flushed prior to the newline
323: * assertion.
324: */
325: void
326: term_vspace(struct termp *p)
327: {
328:
329: term_newln(p);
1.29 schwarze 330: p->viscol = 0;
1.63 schwarze 331: if (0 < p->skipvsp)
332: p->skipvsp--;
333: else
334: (*p->endline)(p);
1.1 kristaps 335: }
336:
1.20 schwarze 337: void
338: term_fontlast(struct termp *p)
339: {
340: enum termfont f;
1.11 schwarze 341:
1.20 schwarze 342: f = p->fontl;
343: p->fontl = p->fontq[p->fonti];
344: p->fontq[p->fonti] = f;
345: }
346:
347:
348: void
349: term_fontrepl(struct termp *p, enum termfont f)
350: {
351:
352: p->fontl = p->fontq[p->fonti];
353: p->fontq[p->fonti] = f;
1.1 kristaps 354: }
355:
356:
1.20 schwarze 357: void
358: term_fontpush(struct termp *p, enum termfont f)
1.1 kristaps 359: {
1.7 schwarze 360:
1.20 schwarze 361: assert(p->fonti + 1 < 10);
362: p->fontl = p->fontq[p->fonti];
363: p->fontq[++p->fonti] = f;
364: }
1.1 kristaps 365:
366:
1.20 schwarze 367: const void *
368: term_fontq(struct termp *p)
369: {
1.1 kristaps 370:
1.20 schwarze 371: return(&p->fontq[p->fonti]);
372: }
1.1 kristaps 373:
374:
1.20 schwarze 375: enum termfont
376: term_fonttop(struct termp *p)
377: {
1.1 kristaps 378:
1.20 schwarze 379: return(p->fontq[p->fonti]);
380: }
1.7 schwarze 381:
382:
1.20 schwarze 383: void
384: term_fontpopq(struct termp *p, const void *key)
385: {
1.1 kristaps 386:
1.67 schwarze 387: while (p->fonti >= 0 && key < (void *)(p->fontq + p->fonti))
1.20 schwarze 388: p->fonti--;
389: assert(p->fonti >= 0);
390: }
1.1 kristaps 391:
392:
1.20 schwarze 393: void
394: term_fontpop(struct termp *p)
395: {
1.1 kristaps 396:
1.20 schwarze 397: assert(p->fonti);
398: p->fonti--;
1.1 kristaps 399: }
400:
401: /*
402: * Handle pwords, partial words, which may be either a single word or a
403: * phrase that cannot be broken down (such as a literal string). This
404: * handles word styling.
405: */
1.7 schwarze 406: void
407: term_word(struct termp *p, const char *word)
1.1 kristaps 408: {
1.75 schwarze 409: const char nbrsp[2] = { ASCII_NBRSP, 0 };
1.59 schwarze 410: const char *seq, *cp;
411: char c;
412: int sz, uc;
1.20 schwarze 413: size_t ssz;
1.59 schwarze 414: enum mandoc_esc esc;
1.1 kristaps 415:
1.31 schwarze 416: if ( ! (TERMP_NOSPACE & p->flags)) {
1.40 schwarze 417: if ( ! (TERMP_KEEP & p->flags)) {
1.31 schwarze 418: bufferc(p, ' ');
1.40 schwarze 419: if (TERMP_SENTENCE & p->flags)
420: bufferc(p, ' ');
421: } else
422: bufferc(p, ASCII_NBRSP);
1.31 schwarze 423: }
1.68 schwarze 424: if (TERMP_PREKEEP & p->flags)
425: p->flags |= TERMP_KEEP;
1.1 kristaps 426:
427: if ( ! (p->flags & TERMP_NONOSPACE))
428: p->flags &= ~TERMP_NOSPACE;
1.46 schwarze 429: else
430: p->flags |= TERMP_NOSPACE;
1.1 kristaps 431:
1.74 schwarze 432: p->flags &= ~TERMP_SENTENCE;
1.31 schwarze 433:
1.59 schwarze 434: while ('\0' != *word) {
1.64 schwarze 435: if ('\\' != *word) {
436: if (TERMP_SKIPCHAR & p->flags) {
437: p->flags &= ~TERMP_SKIPCHAR;
438: word++;
439: continue;
440: }
1.75 schwarze 441: if (TERMP_NBRWORD & p->flags) {
442: if (' ' == *word) {
443: encode(p, nbrsp, 1);
444: word++;
445: continue;
446: }
447: ssz = strcspn(word, "\\ ");
448: } else
449: ssz = strcspn(word, "\\");
1.45 schwarze 450: encode(p, word, ssz);
1.64 schwarze 451: word += (int)ssz;
1.20 schwarze 452: continue;
1.64 schwarze 453: }
1.20 schwarze 454:
1.59 schwarze 455: word++;
456: esc = mandoc_escape(&word, &seq, &sz);
457: if (ESCAPE_ERROR == esc)
458: break;
459:
460: if (TERMENC_ASCII != p->enc)
461: switch (esc) {
462: case (ESCAPE_UNICODE):
463: uc = mchars_num2uc(seq + 1, sz - 1);
464: if ('\0' == uc)
465: break;
466: encode1(p, uc);
467: continue;
468: case (ESCAPE_SPECIAL):
469: uc = mchars_spec2cp(p->symtab, seq, sz);
470: if (uc <= 0)
471: break;
472: encode1(p, uc);
473: continue;
474: default:
475: break;
476: }
1.20 schwarze 477:
1.59 schwarze 478: switch (esc) {
479: case (ESCAPE_UNICODE):
480: encode1(p, '?');
1.56 schwarze 481: break;
1.59 schwarze 482: case (ESCAPE_NUMBERED):
483: c = mchars_num2char(seq, sz);
484: if ('\0' != c)
485: encode(p, &c, 1);
1.20 schwarze 486: break;
1.59 schwarze 487: case (ESCAPE_SPECIAL):
488: cp = mchars_spec2str(p->symtab, seq, sz, &ssz);
489: if (NULL != cp)
490: encode(p, cp, ssz);
491: else if (1 == ssz)
492: encode(p, seq, sz);
1.20 schwarze 493: break;
1.59 schwarze 494: case (ESCAPE_FONTBOLD):
1.20 schwarze 495: term_fontrepl(p, TERMFONT_BOLD);
496: break;
1.59 schwarze 497: case (ESCAPE_FONTITALIC):
1.20 schwarze 498: term_fontrepl(p, TERMFONT_UNDER);
499: break;
1.70 schwarze 500: case (ESCAPE_FONTBI):
501: term_fontrepl(p, TERMFONT_BI);
502: break;
1.59 schwarze 503: case (ESCAPE_FONT):
504: /* FALLTHROUGH */
505: case (ESCAPE_FONTROMAN):
1.20 schwarze 506: term_fontrepl(p, TERMFONT_NONE);
507: break;
1.59 schwarze 508: case (ESCAPE_FONTPREV):
1.20 schwarze 509: term_fontlast(p);
510: break;
1.59 schwarze 511: case (ESCAPE_NOSPACE):
1.64 schwarze 512: if (TERMP_SKIPCHAR & p->flags)
513: p->flags &= ~TERMP_SKIPCHAR;
514: else if ('\0' == *word)
1.59 schwarze 515: p->flags |= TERMP_NOSPACE;
516: break;
1.64 schwarze 517: case (ESCAPE_SKIPCHAR):
518: p->flags |= TERMP_SKIPCHAR;
519: break;
1.20 schwarze 520: default:
521: break;
522: }
523: }
1.75 schwarze 524: p->flags &= ~TERMP_NBRWORD;
1.1 kristaps 525: }
526:
527: static void
1.71 schwarze 528: adjbuf(struct termp *p, size_t sz)
1.1 kristaps 529: {
530:
1.20 schwarze 531: if (0 == p->maxcols)
532: p->maxcols = 1024;
533: while (sz >= p->maxcols)
534: p->maxcols <<= 2;
535:
1.71 schwarze 536: p->buf = mandoc_realloc(p->buf, sizeof(int) * p->maxcols);
1.1 kristaps 537: }
538:
1.4 schwarze 539: static void
1.20 schwarze 540: bufferc(struct termp *p, char c)
541: {
542:
543: if (p->col + 1 >= p->maxcols)
544: adjbuf(p, p->col + 1);
545:
1.59 schwarze 546: p->buf[p->col++] = c;
1.20 schwarze 547: }
548:
1.59 schwarze 549: /*
550: * See encode().
551: * Do this for a single (probably unicode) value.
552: * Does not check for non-decorated glyphs.
553: */
554: static void
555: encode1(struct termp *p, int c)
556: {
557: enum termfont f;
558:
1.64 schwarze 559: if (TERMP_SKIPCHAR & p->flags) {
560: p->flags &= ~TERMP_SKIPCHAR;
561: return;
562: }
563:
1.70 schwarze 564: if (p->col + 6 >= p->maxcols)
565: adjbuf(p, p->col + 6);
1.59 schwarze 566:
567: f = term_fonttop(p);
568:
1.70 schwarze 569: if (TERMFONT_UNDER == f || TERMFONT_BI == f) {
1.59 schwarze 570: p->buf[p->col++] = '_';
1.70 schwarze 571: p->buf[p->col++] = 8;
572: }
573: if (TERMFONT_BOLD == f || TERMFONT_BI == f) {
574: if (ASCII_HYPH == c)
575: p->buf[p->col++] = '-';
576: else
577: p->buf[p->col++] = c;
578: p->buf[p->col++] = 8;
579: }
1.59 schwarze 580: p->buf[p->col++] = c;
581: }
1.20 schwarze 582:
583: static void
584: encode(struct termp *p, const char *word, size_t sz)
1.4 schwarze 585: {
1.71 schwarze 586: size_t i;
1.59 schwarze 587:
1.64 schwarze 588: if (TERMP_SKIPCHAR & p->flags) {
589: p->flags &= ~TERMP_SKIPCHAR;
590: return;
591: }
592:
1.20 schwarze 593: /*
594: * Encode and buffer a string of characters. If the current
595: * font mode is unset, buffer directly, else encode then buffer
596: * character by character.
597: */
598:
1.70 schwarze 599: if (TERMFONT_NONE == term_fonttop(p)) {
1.71 schwarze 600: if (p->col + sz >= p->maxcols)
601: adjbuf(p, p->col + sz);
602: for (i = 0; i < sz; i++)
1.59 schwarze 603: p->buf[p->col++] = word[i];
1.20 schwarze 604: return;
605: }
606:
1.46 schwarze 607: /* Pre-buffer, assuming worst-case. */
608:
1.71 schwarze 609: if (p->col + 1 + (sz * 5) >= p->maxcols)
610: adjbuf(p, p->col + 1 + (sz * 5));
1.46 schwarze 611:
1.71 schwarze 612: for (i = 0; i < sz; i++) {
1.70 schwarze 613: if (ASCII_HYPH == word[i] ||
614: isgraph((unsigned char)word[i]))
615: encode1(p, word[i]);
1.20 schwarze 616: else
1.59 schwarze 617: p->buf[p->col++] = word[i];
1.4 schwarze 618: }
619: }
1.16 schwarze 620:
621: size_t
1.39 schwarze 622: term_len(const struct termp *p, size_t sz)
623: {
624:
625: return((*p->width)(p, ' ') * sz);
626: }
627:
1.64 schwarze 628: static size_t
629: cond_width(const struct termp *p, int c, int *skip)
630: {
631:
632: if (*skip) {
633: (*skip) = 0;
634: return(0);
635: } else
636: return((*p->width)(p, c));
637: }
1.39 schwarze 638:
639: size_t
640: term_strlen(const struct termp *p, const char *cp)
641: {
1.59 schwarze 642: size_t sz, rsz, i;
1.64 schwarze 643: int ssz, skip, c;
1.50 schwarze 644: const char *seq, *rhs;
1.59 schwarze 645: enum mandoc_esc esc;
1.77 ! schwarze 646: static const char rej[] = { '\\', ASCII_NBRSP, ASCII_HYPH,
! 647: ASCII_BREAK, '\0' };
1.59 schwarze 648:
649: /*
650: * Account for escaped sequences within string length
651: * calculations. This follows the logic in term_word() as we
652: * must calculate the width of produced strings.
653: */
654:
655: sz = 0;
1.64 schwarze 656: skip = 0;
1.59 schwarze 657: while ('\0' != *cp) {
658: rsz = strcspn(cp, rej);
659: for (i = 0; i < rsz; i++)
1.64 schwarze 660: sz += cond_width(p, *cp++, &skip);
1.59 schwarze 661:
662: switch (*cp) {
663: case ('\\'):
664: cp++;
665: esc = mandoc_escape(&cp, &seq, &ssz);
666: if (ESCAPE_ERROR == esc)
667: return(sz);
668:
669: if (TERMENC_ASCII != p->enc)
670: switch (esc) {
671: case (ESCAPE_UNICODE):
672: c = mchars_num2uc
673: (seq + 1, ssz - 1);
674: if ('\0' == c)
675: break;
1.64 schwarze 676: sz += cond_width(p, c, &skip);
1.59 schwarze 677: continue;
678: case (ESCAPE_SPECIAL):
679: c = mchars_spec2cp
680: (p->symtab, seq, ssz);
681: if (c <= 0)
682: break;
1.64 schwarze 683: sz += cond_width(p, c, &skip);
1.59 schwarze 684: continue;
685: default:
686: break;
687: }
688:
689: rhs = NULL;
1.50 schwarze 690:
1.59 schwarze 691: switch (esc) {
692: case (ESCAPE_UNICODE):
1.64 schwarze 693: sz += cond_width(p, '?', &skip);
1.59 schwarze 694: break;
695: case (ESCAPE_NUMBERED):
696: c = mchars_num2char(seq, ssz);
697: if ('\0' != c)
1.64 schwarze 698: sz += cond_width(p, c, &skip);
1.50 schwarze 699: break;
1.59 schwarze 700: case (ESCAPE_SPECIAL):
701: rhs = mchars_spec2str
1.50 schwarze 702: (p->symtab, seq, ssz, &rsz);
703:
1.59 schwarze 704: if (ssz != 1 || rhs)
1.50 schwarze 705: break;
706:
707: rhs = seq;
708: rsz = ssz;
709: break;
1.64 schwarze 710: case (ESCAPE_SKIPCHAR):
711: skip = 1;
712: break;
1.50 schwarze 713: default:
714: break;
715: }
1.39 schwarze 716:
1.59 schwarze 717: if (NULL == rhs)
718: break;
719:
1.64 schwarze 720: if (skip) {
721: skip = 0;
722: break;
723: }
724:
1.59 schwarze 725: for (i = 0; i < rsz; i++)
726: sz += (*p->width)(p, *rhs++);
727: break;
728: case (ASCII_NBRSP):
1.64 schwarze 729: sz += cond_width(p, ' ', &skip);
1.55 schwarze 730: cp++;
1.59 schwarze 731: break;
732: case (ASCII_HYPH):
1.64 schwarze 733: sz += cond_width(p, '-', &skip);
1.55 schwarze 734: cp++;
1.77 ! schwarze 735: /* FALLTHROUGH */
! 736: case (ASCII_BREAK):
1.59 schwarze 737: break;
738: default:
739: break;
740: }
741: }
1.39 schwarze 742:
743: return(sz);
744: }
745:
1.44 schwarze 746: /* ARGSUSED */
1.39 schwarze 747: size_t
748: term_vspan(const struct termp *p, const struct roffsu *su)
1.16 schwarze 749: {
750: double r;
751:
752: switch (su->unit) {
753: case (SCALE_CM):
754: r = su->scale * 2;
755: break;
756: case (SCALE_IN):
757: r = su->scale * 6;
758: break;
759: case (SCALE_PC):
760: r = su->scale;
761: break;
762: case (SCALE_PT):
763: r = su->scale / 8;
764: break;
765: case (SCALE_MM):
766: r = su->scale / 1000;
767: break;
768: case (SCALE_VS):
769: r = su->scale;
770: break;
771: default:
772: r = su->scale - 1;
773: break;
774: }
775:
776: if (r < 0.0)
777: r = 0.0;
778: return(/* LINTED */(size_t)
779: r);
780: }
781:
782: size_t
1.39 schwarze 783: term_hspan(const struct termp *p, const struct roffsu *su)
1.16 schwarze 784: {
1.44 schwarze 785: double v;
1.16 schwarze 786:
1.44 schwarze 787: v = ((*p->hspan)(p, su));
788: if (v < 0.0)
789: v = 0.0;
790: return((size_t) /* LINTED */
791: v);
1.16 schwarze 792: }