Annotation of src/usr.bin/mandoc/roff.c, Revision 1.30
1.30 ! schwarze 1: /* $Id: roff.c,v 1.29 2011/01/12 20:56:40 schwarze Exp $ */
1.1 schwarze 2: /*
1.27 schwarze 3: * Copyright (c) 2010, 2011 Kristaps Dzonsons <kristaps@bsd.lv>
1.25 schwarze 4: * Copyright (c) 2010, 2011 Ingo Schwarze <schwarze@openbsd.org>
1.1 schwarze 5: *
6: * Permission to use, copy, modify, and distribute this software for any
7: * purpose with or without fee is hereby granted, provided that the above
8: * copyright notice and this permission notice appear in all copies.
9: *
1.16 schwarze 10: * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHORS DISCLAIM ALL WARRANTIES
1.1 schwarze 11: * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
1.16 schwarze 12: * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHORS BE LIABLE FOR
1.1 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.
17: */
18: #include <assert.h>
1.6 schwarze 19: #include <errno.h>
1.3 schwarze 20: #include <ctype.h>
1.6 schwarze 21: #include <limits.h>
1.1 schwarze 22: #include <stdlib.h>
23: #include <string.h>
1.2 schwarze 24: #include <stdio.h>
1.1 schwarze 25:
26: #include "mandoc.h"
27: #include "roff.h"
1.27 schwarze 28: #include "libroff.h"
1.8 schwarze 29: #include "libmandoc.h"
1.1 schwarze 30:
1.2 schwarze 31: #define RSTACK_MAX 128
32:
33: #define ROFF_CTL(c) \
34: ('.' == (c) || '\'' == (c))
35:
1.1 schwarze 36: enum rofft {
1.20 schwarze 37: ROFF_ad,
1.2 schwarze 38: ROFF_am,
39: ROFF_ami,
40: ROFF_am1,
1.1 schwarze 41: ROFF_de,
42: ROFF_dei,
1.2 schwarze 43: ROFF_de1,
44: ROFF_ds,
45: ROFF_el,
1.20 schwarze 46: ROFF_hy,
1.2 schwarze 47: ROFF_ie,
48: ROFF_if,
1.1 schwarze 49: ROFF_ig,
1.30 ! schwarze 50: ROFF_it,
1.20 schwarze 51: ROFF_ne,
52: ROFF_nh,
1.14 schwarze 53: ROFF_nr,
1.2 schwarze 54: ROFF_rm,
1.14 schwarze 55: ROFF_so,
1.2 schwarze 56: ROFF_tr,
1.27 schwarze 57: ROFF_TS,
58: ROFF_TE,
59: ROFF_T_,
1.2 schwarze 60: ROFF_cblock,
1.13 schwarze 61: ROFF_ccond, /* FIXME: remove this. */
1.16 schwarze 62: ROFF_USERDEF,
1.1 schwarze 63: ROFF_MAX
64: };
65:
1.2 schwarze 66: enum roffrule {
67: ROFFRULE_ALLOW,
68: ROFFRULE_DENY
69: };
70:
1.8 schwarze 71: struct roffstr {
72: char *name; /* key of symbol */
73: char *string; /* current value */
74: struct roffstr *next; /* next in list */
75: };
76:
1.1 schwarze 77: struct roff {
78: struct roffnode *last; /* leaf of stack */
79: mandocmsg msg; /* err/warn/fatal messages */
80: void *data; /* privdata for messages */
1.2 schwarze 81: enum roffrule rstack[RSTACK_MAX]; /* stack of !`ie' rules */
82: int rstackpos; /* position in rstack */
1.6 schwarze 83: struct regset *regs; /* read/writable registers */
1.16 schwarze 84: struct roffstr *first_string; /* user-defined strings & macros */
85: const char *current_string; /* value of last called user macro */
1.27 schwarze 86: struct tbl_node *first_tbl; /* first table parsed */
87: struct tbl_node *last_tbl; /* last table parsed */
88: struct tbl_node *tbl; /* current table being parsed */
1.1 schwarze 89: };
90:
91: struct roffnode {
92: enum rofft tok; /* type of node */
93: struct roffnode *parent; /* up one in stack */
94: int line; /* parse line */
95: int col; /* parse col */
1.16 schwarze 96: char *name; /* node name, e.g. macro name */
1.2 schwarze 97: char *end; /* end-rules: custom token */
98: int endspan; /* end-rules: next-line or infty */
99: enum roffrule rule; /* current evaluation rule */
1.1 schwarze 100: };
101:
102: #define ROFF_ARGS struct roff *r, /* parse ctx */ \
103: enum rofft tok, /* tok of macro */ \
104: char **bufp, /* input buffer */ \
105: size_t *szp, /* size of input buffer */ \
106: int ln, /* parse line */ \
1.2 schwarze 107: int ppos, /* original pos in buffer */ \
108: int pos, /* current pos in buffer */ \
109: int *offs /* reset offset of buffer data */
1.1 schwarze 110:
111: typedef enum rofferr (*roffproc)(ROFF_ARGS);
112:
113: struct roffmac {
114: const char *name; /* macro name */
1.2 schwarze 115: roffproc proc; /* process new macro */
116: roffproc text; /* process as child text of macro */
117: roffproc sub; /* process as child of macro */
118: int flags;
119: #define ROFFMAC_STRUCT (1 << 0) /* always interpret */
1.3 schwarze 120: struct roffmac *next;
1.1 schwarze 121: };
122:
1.2 schwarze 123: static enum rofferr roff_block(ROFF_ARGS);
124: static enum rofferr roff_block_text(ROFF_ARGS);
125: static enum rofferr roff_block_sub(ROFF_ARGS);
126: static enum rofferr roff_cblock(ROFF_ARGS);
127: static enum rofferr roff_ccond(ROFF_ARGS);
128: static enum rofferr roff_cond(ROFF_ARGS);
129: static enum rofferr roff_cond_text(ROFF_ARGS);
130: static enum rofferr roff_cond_sub(ROFF_ARGS);
1.7 schwarze 131: static enum rofferr roff_ds(ROFF_ARGS);
1.8 schwarze 132: static enum roffrule roff_evalcond(const char *, int *);
133: static void roff_freestr(struct roff *);
1.28 schwarze 134: static char *roff_getname(struct roff *, char **, int, int);
1.8 schwarze 135: static const char *roff_getstrn(const struct roff *,
136: const char *, size_t);
1.21 schwarze 137: static enum rofferr roff_line_ignore(ROFF_ARGS);
1.6 schwarze 138: static enum rofferr roff_nr(ROFF_ARGS);
1.9 schwarze 139: static int roff_res(struct roff *,
140: char **, size_t *, int);
1.29 schwarze 141: static enum rofferr roff_rm(ROFF_ARGS);
1.8 schwarze 142: static void roff_setstr(struct roff *,
1.16 schwarze 143: const char *, const char *, int);
1.14 schwarze 144: static enum rofferr roff_so(ROFF_ARGS);
1.27 schwarze 145: static enum rofferr roff_TE(ROFF_ARGS);
146: static enum rofferr roff_TS(ROFF_ARGS);
147: static enum rofferr roff_T_(ROFF_ARGS);
1.16 schwarze 148: static enum rofferr roff_userdef(ROFF_ARGS);
1.1 schwarze 149:
1.3 schwarze 150: /* See roff_hash_find() */
151:
152: #define ASCII_HI 126
153: #define ASCII_LO 33
154: #define HASHWIDTH (ASCII_HI - ASCII_LO + 1)
155:
156: static struct roffmac *hash[HASHWIDTH];
157:
158: static struct roffmac roffs[ROFF_MAX] = {
1.21 schwarze 159: { "ad", roff_line_ignore, NULL, NULL, 0, NULL },
1.3 schwarze 160: { "am", roff_block, roff_block_text, roff_block_sub, 0, NULL },
161: { "ami", roff_block, roff_block_text, roff_block_sub, 0, NULL },
162: { "am1", roff_block, roff_block_text, roff_block_sub, 0, NULL },
163: { "de", roff_block, roff_block_text, roff_block_sub, 0, NULL },
164: { "dei", roff_block, roff_block_text, roff_block_sub, 0, NULL },
165: { "de1", roff_block, roff_block_text, roff_block_sub, 0, NULL },
1.7 schwarze 166: { "ds", roff_ds, NULL, NULL, 0, NULL },
1.3 schwarze 167: { "el", roff_cond, roff_cond_text, roff_cond_sub, ROFFMAC_STRUCT, NULL },
1.21 schwarze 168: { "hy", roff_line_ignore, NULL, NULL, 0, NULL },
1.3 schwarze 169: { "ie", roff_cond, roff_cond_text, roff_cond_sub, ROFFMAC_STRUCT, NULL },
170: { "if", roff_cond, roff_cond_text, roff_cond_sub, ROFFMAC_STRUCT, NULL },
171: { "ig", roff_block, roff_block_text, roff_block_sub, 0, NULL },
1.30 ! schwarze 172: { "it", roff_line_ignore, NULL, NULL, 0, NULL },
1.21 schwarze 173: { "ne", roff_line_ignore, NULL, NULL, 0, NULL },
174: { "nh", roff_line_ignore, NULL, NULL, 0, NULL },
1.14 schwarze 175: { "nr", roff_nr, NULL, NULL, 0, NULL },
1.29 schwarze 176: { "rm", roff_rm, NULL, NULL, 0, NULL },
1.14 schwarze 177: { "so", roff_so, NULL, NULL, 0, NULL },
1.21 schwarze 178: { "tr", roff_line_ignore, NULL, NULL, 0, NULL },
1.27 schwarze 179: { "TS", roff_TS, NULL, NULL, 0, NULL },
180: { "TE", roff_TE, NULL, NULL, 0, NULL },
181: { "T&", roff_T_, NULL, NULL, 0, NULL },
1.3 schwarze 182: { ".", roff_cblock, NULL, NULL, 0, NULL },
183: { "\\}", roff_ccond, NULL, NULL, 0, NULL },
1.16 schwarze 184: { NULL, roff_userdef, NULL, NULL, 0, NULL },
1.1 schwarze 185: };
186:
187: static void roff_free1(struct roff *);
1.16 schwarze 188: static enum rofft roff_hash_find(const char *, size_t);
1.3 schwarze 189: static void roff_hash_init(void);
1.2 schwarze 190: static void roffnode_cleanscope(struct roff *);
1.16 schwarze 191: static void roffnode_push(struct roff *, enum rofft,
192: const char *, int, int);
1.1 schwarze 193: static void roffnode_pop(struct roff *);
1.16 schwarze 194: static enum rofft roff_parse(struct roff *, const char *, int *);
1.6 schwarze 195: static int roff_parse_nat(const char *, unsigned int *);
1.1 schwarze 196:
1.3 schwarze 197: /* See roff_hash_find() */
198: #define ROFF_HASH(p) (p[0] - ASCII_LO)
199:
200: static void
201: roff_hash_init(void)
202: {
203: struct roffmac *n;
204: int buc, i;
205:
1.16 schwarze 206: for (i = 0; i < (int)ROFF_USERDEF; i++) {
1.3 schwarze 207: assert(roffs[i].name[0] >= ASCII_LO);
208: assert(roffs[i].name[0] <= ASCII_HI);
209:
210: buc = ROFF_HASH(roffs[i].name);
211:
212: if (NULL != (n = hash[buc])) {
213: for ( ; n->next; n = n->next)
214: /* Do nothing. */ ;
215: n->next = &roffs[i];
216: } else
217: hash[buc] = &roffs[i];
218: }
219: }
220:
1.1 schwarze 221:
222: /*
223: * Look up a roff token by its name. Returns ROFF_MAX if no macro by
224: * the nil-terminated string name could be found.
225: */
226: static enum rofft
1.16 schwarze 227: roff_hash_find(const char *p, size_t s)
1.1 schwarze 228: {
1.3 schwarze 229: int buc;
230: struct roffmac *n;
1.1 schwarze 231:
1.3 schwarze 232: /*
233: * libroff has an extremely simple hashtable, for the time
234: * being, which simply keys on the first character, which must
235: * be printable, then walks a chain. It works well enough until
236: * optimised.
237: */
238:
239: if (p[0] < ASCII_LO || p[0] > ASCII_HI)
240: return(ROFF_MAX);
241:
242: buc = ROFF_HASH(p);
243:
244: if (NULL == (n = hash[buc]))
245: return(ROFF_MAX);
246: for ( ; n; n = n->next)
1.16 schwarze 247: if (0 == strncmp(n->name, p, s) && '\0' == n->name[(int)s])
1.3 schwarze 248: return((enum rofft)(n - roffs));
1.1 schwarze 249:
250: return(ROFF_MAX);
251: }
252:
253:
254: /*
255: * Pop the current node off of the stack of roff instructions currently
256: * pending.
257: */
258: static void
259: roffnode_pop(struct roff *r)
260: {
261: struct roffnode *p;
262:
1.2 schwarze 263: assert(r->last);
264: p = r->last;
265:
266: if (ROFF_el == p->tok)
267: if (r->rstackpos > -1)
268: r->rstackpos--;
269:
270: r->last = r->last->parent;
1.16 schwarze 271: free(p->name);
272: free(p->end);
1.1 schwarze 273: free(p);
274: }
275:
276:
277: /*
278: * Push a roff node onto the instruction stack. This must later be
279: * removed with roffnode_pop().
280: */
1.11 schwarze 281: static void
1.16 schwarze 282: roffnode_push(struct roff *r, enum rofft tok, const char *name,
283: int line, int col)
1.1 schwarze 284: {
285: struct roffnode *p;
286:
1.11 schwarze 287: p = mandoc_calloc(1, sizeof(struct roffnode));
1.1 schwarze 288: p->tok = tok;
1.16 schwarze 289: if (name)
290: p->name = mandoc_strdup(name);
1.1 schwarze 291: p->parent = r->last;
292: p->line = line;
293: p->col = col;
1.2 schwarze 294: p->rule = p->parent ? p->parent->rule : ROFFRULE_DENY;
1.1 schwarze 295:
296: r->last = p;
297: }
298:
299:
300: static void
301: roff_free1(struct roff *r)
302: {
1.27 schwarze 303: struct tbl_node *t;
304:
305: while (r->first_tbl) {
306: t = r->first_tbl;
307: r->first_tbl = t->next;
308: tbl_free(t);
309: }
310:
311: r->first_tbl = r->last_tbl = r->tbl = NULL;
1.1 schwarze 312:
313: while (r->last)
314: roffnode_pop(r);
1.27 schwarze 315:
1.8 schwarze 316: roff_freestr(r);
1.1 schwarze 317: }
318:
319:
320: void
321: roff_reset(struct roff *r)
322: {
323:
324: roff_free1(r);
325: }
326:
327:
328: void
329: roff_free(struct roff *r)
330: {
331:
332: roff_free1(r);
333: free(r);
334: }
335:
336:
337: struct roff *
1.11 schwarze 338: roff_alloc(struct regset *regs, void *data, const mandocmsg msg)
1.1 schwarze 339: {
340: struct roff *r;
341:
1.11 schwarze 342: r = mandoc_calloc(1, sizeof(struct roff));
1.6 schwarze 343: r->regs = regs;
1.1 schwarze 344: r->msg = msg;
345: r->data = data;
1.2 schwarze 346: r->rstackpos = -1;
1.3 schwarze 347:
348: roff_hash_init();
1.1 schwarze 349: return(r);
350: }
351:
352:
1.8 schwarze 353: /*
354: * Pre-filter each and every line for reserved words (one beginning with
355: * `\*', e.g., `\*(ab'). These must be handled before the actual line
356: * is processed.
357: */
358: static int
1.9 schwarze 359: roff_res(struct roff *r, char **bufp, size_t *szp, int pos)
1.8 schwarze 360: {
1.23 schwarze 361: const char *stesc; /* start of an escape sequence ('\\') */
362: const char *stnam; /* start of the name, after "[(*" */
363: const char *cp; /* end of the name, e.g. before ']' */
364: const char *res; /* the string to be substituted */
1.8 schwarze 365: int i, maxl;
366: size_t nsz;
367: char *n;
368:
1.24 schwarze 369: /* Search for a leading backslash and save a pointer to it. */
1.23 schwarze 370:
1.24 schwarze 371: cp = *bufp + pos;
372: while (NULL != (cp = strchr(cp, '\\'))) {
373: stesc = cp++;
1.23 schwarze 374:
375: /*
376: * The second character must be an asterisk.
377: * If it isn't, skip it anyway: It is escaped,
378: * so it can't start another escape sequence.
379: */
380:
1.24 schwarze 381: if ('\0' == *cp)
382: return(1);
383: if ('*' != *cp++)
1.23 schwarze 384: continue;
385:
386: /*
387: * The third character decides the length
388: * of the name of the string.
389: * Save a pointer to the name.
390: */
391:
1.24 schwarze 392: switch (*cp) {
393: case ('\0'):
394: return(1);
1.8 schwarze 395: case ('('):
396: cp++;
397: maxl = 2;
398: break;
399: case ('['):
400: cp++;
401: maxl = 0;
402: break;
403: default:
404: maxl = 1;
405: break;
406: }
1.23 schwarze 407: stnam = cp;
1.8 schwarze 408:
1.23 schwarze 409: /* Advance to the end of the name. */
1.8 schwarze 410:
411: for (i = 0; 0 == maxl || i < maxl; i++, cp++) {
412: if ('\0' == *cp)
413: return(1); /* Error. */
414: if (0 == maxl && ']' == *cp)
415: break;
416: }
417:
1.23 schwarze 418: /*
419: * Retrieve the replacement string; if it is
420: * undefined, resume searching for escapes.
421: */
422:
423: res = roff_getstrn(r, stnam, (size_t)i);
1.8 schwarze 424:
425: if (NULL == res) {
426: cp -= maxl ? 1 : 0;
427: continue;
428: }
429:
1.23 schwarze 430: /* Replace the escape sequence by the string. */
431:
1.8 schwarze 432: nsz = *szp + strlen(res) + 1;
433: n = mandoc_malloc(nsz);
434:
1.23 schwarze 435: strlcpy(n, *bufp, (size_t)(stesc - *bufp + 1));
1.8 schwarze 436: strlcat(n, res, nsz);
437: strlcat(n, cp + (maxl ? 0 : 1), nsz);
438:
439: free(*bufp);
440:
441: *bufp = n;
442: *szp = nsz;
443: return(0);
444: }
445:
446: return(1);
447: }
448:
449:
1.1 schwarze 450: enum rofferr
1.6 schwarze 451: roff_parseln(struct roff *r, int ln, char **bufp,
452: size_t *szp, int pos, int *offs)
1.1 schwarze 453: {
454: enum rofft t;
1.27 schwarze 455: enum rofferr e;
1.1 schwarze 456: int ppos;
457:
1.2 schwarze 458: /*
1.8 schwarze 459: * Run the reserved-word filter only if we have some reserved
460: * words to fill in.
461: */
462:
1.9 schwarze 463: if (r->first_string && ! roff_res(r, bufp, szp, pos))
1.16 schwarze 464: return(ROFF_REPARSE);
1.8 schwarze 465:
466: /*
1.2 schwarze 467: * First, if a scope is open and we're not a macro, pass the
468: * text through the macro's filter. If a scope isn't open and
469: * we're not a macro, just let it through.
470: */
471:
472: if (r->last && ! ROFF_CTL((*bufp)[pos])) {
473: t = r->last->tok;
474: assert(roffs[t].text);
1.27 schwarze 475: e = (*roffs[t].text)
476: (r, t, bufp, szp, ln, pos, pos, offs);
477: assert(ROFF_IGN == e || ROFF_CONT == e);
478: if (ROFF_CONT == e && r->tbl)
479: return(tbl_read(r->tbl, ln, *bufp, *offs));
480: return(e);
481: } else if ( ! ROFF_CTL((*bufp)[pos])) {
482: if (r->tbl)
483: return(tbl_read(r->tbl, ln, *bufp, *offs));
1.2 schwarze 484: return(ROFF_CONT);
1.27 schwarze 485: }
1.2 schwarze 486:
487: /*
488: * If a scope is open, go to the child handler for that macro,
489: * as it may want to preprocess before doing anything with it.
490: */
491:
492: if (r->last) {
1.1 schwarze 493: t = r->last->tok;
494: assert(roffs[t].sub);
1.2 schwarze 495: return((*roffs[t].sub)
1.8 schwarze 496: (r, t, bufp, szp,
497: ln, pos, pos, offs));
1.2 schwarze 498: }
499:
500: /*
501: * Lastly, as we've no scope open, try to look up and execute
502: * the new macro. If no macro is found, simply return and let
503: * the compilers handle it.
504: */
505:
506: ppos = pos;
1.16 schwarze 507: if (ROFF_MAX == (t = roff_parse(r, *bufp, &pos)))
1.1 schwarze 508: return(ROFF_CONT);
509:
1.2 schwarze 510: assert(roffs[t].proc);
511: return((*roffs[t].proc)
1.8 schwarze 512: (r, t, bufp, szp,
513: ln, ppos, pos, offs));
1.2 schwarze 514: }
515:
1.1 schwarze 516:
1.27 schwarze 517: void
1.2 schwarze 518: roff_endparse(struct roff *r)
519: {
1.1 schwarze 520:
1.27 schwarze 521: if (r->last)
522: (*r->msg)(MANDOCERR_SCOPEEXIT, r->data,
523: r->last->line, r->last->col, NULL);
524:
525: if (r->tbl) {
526: (*r->msg)(MANDOCERR_SCOPEEXIT, r->data,
527: r->tbl->line, r->tbl->pos, NULL);
528: tbl_end(r->tbl);
529: r->tbl = NULL;
530: }
1.1 schwarze 531: }
532:
533:
534: /*
535: * Parse a roff node's type from the input buffer. This must be in the
536: * form of ".foo xxx" in the usual way.
537: */
538: static enum rofft
1.16 schwarze 539: roff_parse(struct roff *r, const char *buf, int *pos)
1.1 schwarze 540: {
1.16 schwarze 541: const char *mac;
542: size_t maclen;
1.1 schwarze 543: enum rofft t;
544:
1.2 schwarze 545: assert(ROFF_CTL(buf[*pos]));
546: (*pos)++;
1.1 schwarze 547:
1.16 schwarze 548: while (' ' == buf[*pos] || '\t' == buf[*pos])
1.1 schwarze 549: (*pos)++;
550:
551: if ('\0' == buf[*pos])
552: return(ROFF_MAX);
553:
1.16 schwarze 554: mac = buf + *pos;
555: maclen = strcspn(mac, " \\\t\0");
1.1 schwarze 556:
1.16 schwarze 557: t = (r->current_string = roff_getstrn(r, mac, maclen))
558: ? ROFF_USERDEF : roff_hash_find(mac, maclen);
1.1 schwarze 559:
1.16 schwarze 560: *pos += maclen;
1.1 schwarze 561: while (buf[*pos] && ' ' == buf[*pos])
562: (*pos)++;
563:
564: return(t);
565: }
566:
567:
1.6 schwarze 568: static int
569: roff_parse_nat(const char *buf, unsigned int *res)
570: {
571: char *ep;
572: long lval;
573:
574: errno = 0;
575: lval = strtol(buf, &ep, 10);
576: if (buf[0] == '\0' || *ep != '\0')
577: return(0);
578: if ((errno == ERANGE &&
579: (lval == LONG_MAX || lval == LONG_MIN)) ||
580: (lval > INT_MAX || lval < 0))
581: return(0);
582:
583: *res = (unsigned int)lval;
584: return(1);
585: }
586:
587:
1.1 schwarze 588: /* ARGSUSED */
589: static enum rofferr
1.2 schwarze 590: roff_cblock(ROFF_ARGS)
1.1 schwarze 591: {
592:
1.2 schwarze 593: /*
594: * A block-close `..' should only be invoked as a child of an
595: * ignore macro, otherwise raise a warning and just ignore it.
596: */
597:
598: if (NULL == r->last) {
1.27 schwarze 599: (*r->msg)(MANDOCERR_NOSCOPE, r->data, ln, ppos, NULL);
1.2 schwarze 600: return(ROFF_IGN);
601: }
1.1 schwarze 602:
1.2 schwarze 603: switch (r->last->tok) {
604: case (ROFF_am):
605: /* FALLTHROUGH */
606: case (ROFF_ami):
607: /* FALLTHROUGH */
608: case (ROFF_am1):
609: /* FALLTHROUGH */
610: case (ROFF_de):
1.23 schwarze 611: /* ROFF_de1 is remapped to ROFF_de in roff_block(). */
1.2 schwarze 612: /* FALLTHROUGH */
613: case (ROFF_dei):
614: /* FALLTHROUGH */
615: case (ROFF_ig):
616: break;
617: default:
1.27 schwarze 618: (*r->msg)(MANDOCERR_NOSCOPE, r->data, ln, ppos, NULL);
1.1 schwarze 619: return(ROFF_IGN);
1.2 schwarze 620: }
621:
622: if ((*bufp)[pos])
1.27 schwarze 623: (*r->msg)(MANDOCERR_ARGSLOST, r->data, ln, pos, NULL);
1.2 schwarze 624:
625: roffnode_pop(r);
626: roffnode_cleanscope(r);
627: return(ROFF_IGN);
628:
629: }
1.1 schwarze 630:
631:
1.2 schwarze 632: static void
633: roffnode_cleanscope(struct roff *r)
634: {
1.1 schwarze 635:
1.2 schwarze 636: while (r->last) {
637: if (--r->last->endspan < 0)
638: break;
639: roffnode_pop(r);
640: }
641: }
1.1 schwarze 642:
643:
1.2 schwarze 644: /* ARGSUSED */
645: static enum rofferr
646: roff_ccond(ROFF_ARGS)
647: {
1.1 schwarze 648:
1.2 schwarze 649: if (NULL == r->last) {
1.27 schwarze 650: (*r->msg)(MANDOCERR_NOSCOPE, r->data, ln, ppos, NULL);
1.1 schwarze 651: return(ROFF_IGN);
1.2 schwarze 652: }
1.1 schwarze 653:
1.2 schwarze 654: switch (r->last->tok) {
655: case (ROFF_el):
656: /* FALLTHROUGH */
657: case (ROFF_ie):
658: /* FALLTHROUGH */
659: case (ROFF_if):
660: break;
661: default:
1.27 schwarze 662: (*r->msg)(MANDOCERR_NOSCOPE, r->data, ln, ppos, NULL);
1.2 schwarze 663: return(ROFF_IGN);
664: }
1.1 schwarze 665:
1.2 schwarze 666: if (r->last->endspan > -1) {
1.27 schwarze 667: (*r->msg)(MANDOCERR_NOSCOPE, r->data, ln, ppos, NULL);
1.1 schwarze 668: return(ROFF_IGN);
1.2 schwarze 669: }
670:
671: if ((*bufp)[pos])
1.27 schwarze 672: (*r->msg)(MANDOCERR_ARGSLOST, r->data, ln, pos, NULL);
1.1 schwarze 673:
1.2 schwarze 674: roffnode_pop(r);
675: roffnode_cleanscope(r);
1.1 schwarze 676: return(ROFF_IGN);
677: }
678:
679:
680: /* ARGSUSED */
681: static enum rofferr
1.2 schwarze 682: roff_block(ROFF_ARGS)
1.1 schwarze 683: {
1.2 schwarze 684: int sv;
685: size_t sz;
1.16 schwarze 686: char *name;
687:
688: name = NULL;
1.2 schwarze 689:
1.16 schwarze 690: if (ROFF_ig != tok) {
691: if ('\0' == (*bufp)[pos]) {
692: (*r->msg)(MANDOCERR_NOARGS, r->data, ln, ppos, NULL);
693: return(ROFF_IGN);
694: }
1.22 schwarze 695:
696: /*
697: * Re-write `de1', since we don't really care about
698: * groff's strange compatibility mode, into `de'.
699: */
700:
1.18 schwarze 701: if (ROFF_de1 == tok)
702: tok = ROFF_de;
1.16 schwarze 703: if (ROFF_de == tok)
704: name = *bufp + pos;
1.21 schwarze 705: else
706: (*r->msg)(MANDOCERR_REQUEST, r->data, ln, ppos,
707: roffs[tok].name);
1.22 schwarze 708:
1.2 schwarze 709: while ((*bufp)[pos] && ' ' != (*bufp)[pos])
710: pos++;
1.22 schwarze 711:
1.2 schwarze 712: while (' ' == (*bufp)[pos])
1.16 schwarze 713: (*bufp)[pos++] = '\0';
1.2 schwarze 714: }
715:
1.16 schwarze 716: roffnode_push(r, tok, name, ln, ppos);
717:
718: /*
719: * At the beginning of a `de' macro, clear the existing string
720: * with the same name, if there is one. New content will be
721: * added from roff_block_text() in multiline mode.
722: */
1.22 schwarze 723:
1.16 schwarze 724: if (ROFF_de == tok)
1.19 schwarze 725: roff_setstr(r, name, "", 0);
1.2 schwarze 726:
727: if ('\0' == (*bufp)[pos])
728: return(ROFF_IGN);
1.1 schwarze 729:
1.22 schwarze 730: /* If present, process the custom end-of-line marker. */
731:
1.2 schwarze 732: sv = pos;
1.22 schwarze 733: while ((*bufp)[pos] &&
734: ' ' != (*bufp)[pos] &&
1.2 schwarze 735: '\t' != (*bufp)[pos])
736: pos++;
737:
738: /*
739: * Note: groff does NOT like escape characters in the input.
740: * Instead of detecting this, we're just going to let it fly and
741: * to hell with it.
742: */
743:
744: assert(pos > sv);
745: sz = (size_t)(pos - sv);
746:
747: if (1 == sz && '.' == (*bufp)[sv])
748: return(ROFF_IGN);
749:
1.11 schwarze 750: r->last->end = mandoc_malloc(sz + 1);
1.2 schwarze 751:
752: memcpy(r->last->end, *bufp + sv, sz);
753: r->last->end[(int)sz] = '\0';
754:
755: if ((*bufp)[pos])
1.22 schwarze 756: (*r->msg)(MANDOCERR_ARGSLOST, r->data, ln, pos, NULL);
1.1 schwarze 757:
758: return(ROFF_IGN);
759: }
760:
761:
762: /* ARGSUSED */
763: static enum rofferr
1.2 schwarze 764: roff_block_sub(ROFF_ARGS)
1.1 schwarze 765: {
1.2 schwarze 766: enum rofft t;
767: int i, j;
768:
769: /*
770: * First check whether a custom macro exists at this level. If
771: * it does, then check against it. This is some of groff's
772: * stranger behaviours. If we encountered a custom end-scope
773: * tag and that tag also happens to be a "real" macro, then we
774: * need to try interpreting it again as a real macro. If it's
775: * not, then return ignore. Else continue.
776: */
777:
778: if (r->last->end) {
779: i = pos + 1;
780: while (' ' == (*bufp)[i] || '\t' == (*bufp)[i])
781: i++;
782:
783: for (j = 0; r->last->end[j]; j++, i++)
784: if ((*bufp)[i] != r->last->end[j])
785: break;
1.1 schwarze 786:
1.2 schwarze 787: if ('\0' == r->last->end[j] &&
788: ('\0' == (*bufp)[i] ||
789: ' ' == (*bufp)[i] ||
790: '\t' == (*bufp)[i])) {
791: roffnode_pop(r);
792: roffnode_cleanscope(r);
1.1 schwarze 793:
1.16 schwarze 794: if (ROFF_MAX != roff_parse(r, *bufp, &pos))
1.2 schwarze 795: return(ROFF_RERUN);
796: return(ROFF_IGN);
797: }
1.1 schwarze 798: }
799:
1.2 schwarze 800: /*
801: * If we have no custom end-query or lookup failed, then try
802: * pulling it out of the hashtable.
803: */
1.1 schwarze 804:
1.2 schwarze 805: ppos = pos;
1.16 schwarze 806: t = roff_parse(r, *bufp, &pos);
1.1 schwarze 807:
1.16 schwarze 808: /*
809: * Macros other than block-end are only significant
810: * in `de' blocks; elsewhere, simply throw them away.
811: */
812: if (ROFF_cblock != t) {
813: if (ROFF_de == tok)
814: roff_setstr(r, r->last->name, *bufp + ppos, 1);
1.1 schwarze 815: return(ROFF_IGN);
1.16 schwarze 816: }
1.1 schwarze 817:
1.2 schwarze 818: assert(roffs[t].proc);
1.6 schwarze 819: return((*roffs[t].proc)(r, t, bufp, szp,
820: ln, ppos, pos, offs));
1.2 schwarze 821: }
822:
823:
824: /* ARGSUSED */
825: static enum rofferr
826: roff_block_text(ROFF_ARGS)
827: {
828:
1.16 schwarze 829: if (ROFF_de == tok)
830: roff_setstr(r, r->last->name, *bufp + pos, 1);
831:
1.2 schwarze 832: return(ROFF_IGN);
833: }
834:
835:
836: /* ARGSUSED */
837: static enum rofferr
838: roff_cond_sub(ROFF_ARGS)
839: {
840: enum rofft t;
841: enum roffrule rr;
842:
843: ppos = pos;
844: rr = r->last->rule;
845:
1.5 schwarze 846: /*
847: * Clean out scope. If we've closed ourselves, then don't
848: * continue.
849: */
850:
851: roffnode_cleanscope(r);
852:
1.16 schwarze 853: if (ROFF_MAX == (t = roff_parse(r, *bufp, &pos))) {
1.12 schwarze 854: if ('\\' == (*bufp)[pos] && '}' == (*bufp)[pos + 1])
855: return(roff_ccond
856: (r, ROFF_ccond, bufp, szp,
857: ln, pos, pos + 2, offs));
1.2 schwarze 858: return(ROFFRULE_DENY == rr ? ROFF_IGN : ROFF_CONT);
1.12 schwarze 859: }
1.2 schwarze 860:
861: /*
862: * A denied conditional must evaluate its children if and only
863: * if they're either structurally required (such as loops and
864: * conditionals) or a closing macro.
865: */
866: if (ROFFRULE_DENY == rr)
867: if ( ! (ROFFMAC_STRUCT & roffs[t].flags))
868: if (ROFF_ccond != t)
869: return(ROFF_IGN);
870:
871: assert(roffs[t].proc);
1.6 schwarze 872: return((*roffs[t].proc)(r, t, bufp, szp,
873: ln, ppos, pos, offs));
1.2 schwarze 874: }
875:
876:
877: /* ARGSUSED */
878: static enum rofferr
879: roff_cond_text(ROFF_ARGS)
880: {
881: char *ep, *st;
882: enum roffrule rr;
883:
884: rr = r->last->rule;
1.1 schwarze 885:
886: /*
1.2 schwarze 887: * We display the value of the text if out current evaluation
888: * scope permits us to do so.
1.1 schwarze 889: */
1.13 schwarze 890:
891: /* FIXME: use roff_ccond? */
1.1 schwarze 892:
1.2 schwarze 893: st = &(*bufp)[pos];
894: if (NULL == (ep = strstr(st, "\\}"))) {
895: roffnode_cleanscope(r);
896: return(ROFFRULE_DENY == rr ? ROFF_IGN : ROFF_CONT);
897: }
898:
1.4 schwarze 899: if (ep == st || (ep > st && '\\' != *(ep - 1)))
1.2 schwarze 900: roffnode_pop(r);
901:
902: roffnode_cleanscope(r);
903: return(ROFFRULE_DENY == rr ? ROFF_IGN : ROFF_CONT);
904: }
905:
906:
1.5 schwarze 907: static enum roffrule
908: roff_evalcond(const char *v, int *pos)
909: {
910:
911: switch (v[*pos]) {
912: case ('n'):
913: (*pos)++;
914: return(ROFFRULE_ALLOW);
915: case ('e'):
916: /* FALLTHROUGH */
917: case ('o'):
918: /* FALLTHROUGH */
919: case ('t'):
920: (*pos)++;
921: return(ROFFRULE_DENY);
922: default:
923: break;
924: }
925:
926: while (v[*pos] && ' ' != v[*pos])
927: (*pos)++;
928: return(ROFFRULE_DENY);
929: }
930:
1.2 schwarze 931: /* ARGSUSED */
932: static enum rofferr
1.21 schwarze 933: roff_line_ignore(ROFF_ARGS)
1.6 schwarze 934: {
1.30 ! schwarze 935:
! 936: if (ROFF_it == tok)
! 937: (*r->msg)(MANDOCERR_REQUEST, r->data, ln, ppos, "it");
1.6 schwarze 938:
1.21 schwarze 939: return(ROFF_IGN);
940: }
941:
942: /* ARGSUSED */
943: static enum rofferr
1.2 schwarze 944: roff_cond(ROFF_ARGS)
945: {
946: int sv;
1.5 schwarze 947: enum roffrule rule;
1.2 schwarze 948:
949: /* Stack overflow! */
950:
951: if (ROFF_ie == tok && r->rstackpos == RSTACK_MAX - 1) {
1.1 schwarze 952: (*r->msg)(MANDOCERR_MEM, r->data, ln, ppos, NULL);
953: return(ROFF_ERR);
954: }
955:
1.5 schwarze 956: /* First, evaluate the conditional. */
1.2 schwarze 957:
1.5 schwarze 958: if (ROFF_el == tok) {
959: /*
960: * An `.el' will get the value of the current rstack
961: * entry set in prior `ie' calls or defaults to DENY.
962: */
963: if (r->rstackpos < 0)
964: rule = ROFFRULE_DENY;
965: else
966: rule = r->rstack[r->rstackpos];
967: } else
968: rule = roff_evalcond(*bufp, &pos);
1.2 schwarze 969:
970: sv = pos;
1.5 schwarze 971:
1.2 schwarze 972: while (' ' == (*bufp)[pos])
973: pos++;
974:
975: /*
976: * Roff is weird. If we have just white-space after the
977: * conditional, it's considered the BODY and we exit without
978: * really doing anything. Warn about this. It's probably
979: * wrong.
980: */
1.5 schwarze 981:
1.2 schwarze 982: if ('\0' == (*bufp)[pos] && sv != pos) {
1.22 schwarze 983: (*r->msg)(MANDOCERR_NOARGS, r->data, ln, ppos, NULL);
984: return(ROFF_IGN);
1.2 schwarze 985: }
986:
1.16 schwarze 987: roffnode_push(r, tok, NULL, ln, ppos);
1.2 schwarze 988:
1.5 schwarze 989: r->last->rule = rule;
1.2 schwarze 990:
991: if (ROFF_ie == tok) {
992: /*
993: * An if-else will put the NEGATION of the current
994: * evaluated conditional into the stack.
995: */
996: r->rstackpos++;
997: if (ROFFRULE_DENY == r->last->rule)
998: r->rstack[r->rstackpos] = ROFFRULE_ALLOW;
999: else
1000: r->rstack[r->rstackpos] = ROFFRULE_DENY;
1001: }
1.5 schwarze 1002:
1003: /* If the parent has false as its rule, then so do we. */
1004:
1.2 schwarze 1005: if (r->last->parent && ROFFRULE_DENY == r->last->parent->rule)
1006: r->last->rule = ROFFRULE_DENY;
1.5 schwarze 1007:
1008: /*
1009: * Determine scope. If we're invoked with "\{" trailing the
1010: * conditional, then we're in a multiline scope. Else our scope
1011: * expires on the next line.
1012: */
1.2 schwarze 1013:
1014: r->last->endspan = 1;
1015:
1016: if ('\\' == (*bufp)[pos] && '{' == (*bufp)[pos + 1]) {
1017: r->last->endspan = -1;
1018: pos += 2;
1019: }
1020:
1021: /*
1022: * If there are no arguments on the line, the next-line scope is
1023: * assumed.
1024: */
1025:
1026: if ('\0' == (*bufp)[pos])
1027: return(ROFF_IGN);
1028:
1029: /* Otherwise re-run the roff parser after recalculating. */
1.1 schwarze 1030:
1.2 schwarze 1031: *offs = pos;
1032: return(ROFF_RERUN);
1.1 schwarze 1033: }
1034:
1035:
1.2 schwarze 1036: /* ARGSUSED */
1037: static enum rofferr
1.7 schwarze 1038: roff_ds(ROFF_ARGS)
1039: {
1.10 schwarze 1040: char *name, *string;
1041:
1042: /*
1043: * A symbol is named by the first word following the macro
1044: * invocation up to a space. Its value is anything after the
1045: * name's trailing whitespace and optional double-quote. Thus,
1046: *
1047: * [.ds foo "bar " ]
1048: *
1049: * will have `bar " ' as its value.
1050: */
1.7 schwarze 1051:
1.28 schwarze 1052: string = *bufp + pos;
1053: name = roff_getname(r, &string, ln, pos);
1.7 schwarze 1054: if ('\0' == *name)
1055: return(ROFF_IGN);
1056:
1.28 schwarze 1057: /* Read past initial double-quote. */
1058: if ('"' == *string)
1.7 schwarze 1059: string++;
1060:
1.10 schwarze 1061: /* The rest is the value. */
1.16 schwarze 1062: roff_setstr(r, name, string, 0);
1.7 schwarze 1063: return(ROFF_IGN);
1064: }
1065:
1066:
1067: /* ARGSUSED */
1068: static enum rofferr
1.6 schwarze 1069: roff_nr(ROFF_ARGS)
1.1 schwarze 1070: {
1.28 schwarze 1071: const char *key;
1072: char *val;
1.6 schwarze 1073: struct reg *rg;
1074:
1.28 schwarze 1075: val = *bufp + pos;
1076: key = roff_getname(r, &val, ln, pos);
1.6 schwarze 1077: rg = r->regs->regs;
1078:
1079: if (0 == strcmp(key, "nS")) {
1080: rg[(int)REG_nS].set = 1;
1081: if ( ! roff_parse_nat(val, &rg[(int)REG_nS].v.u))
1082: rg[(int)REG_nS].v.u = 0;
1083: }
1.1 schwarze 1084:
1.29 schwarze 1085: return(ROFF_IGN);
1086: }
1087:
1088: /* ARGSUSED */
1089: static enum rofferr
1090: roff_rm(ROFF_ARGS)
1091: {
1092: const char *name;
1093: char *cp;
1094:
1095: cp = *bufp + pos;
1096: while ('\0' != *cp) {
1097: name = roff_getname(r, &cp, ln, cp - *bufp);
1098: if ('\0' != *name)
1099: roff_setstr(r, name, NULL, 0);
1100: }
1.2 schwarze 1101: return(ROFF_IGN);
1.14 schwarze 1102: }
1103:
1104: /* ARGSUSED */
1105: static enum rofferr
1.27 schwarze 1106: roff_TE(ROFF_ARGS)
1107: {
1108:
1109: if (NULL == r->tbl)
1110: (*r->msg)(MANDOCERR_NOSCOPE, r->data, ln, ppos, NULL);
1111: else
1112: tbl_end(r->tbl);
1113:
1114: r->tbl = NULL;
1115: return(ROFF_IGN);
1116: }
1117:
1118: /* ARGSUSED */
1119: static enum rofferr
1120: roff_T_(ROFF_ARGS)
1121: {
1122:
1123: if (NULL == r->tbl)
1124: (*r->msg)(MANDOCERR_NOSCOPE, r->data, ln, ppos, NULL);
1125: else
1126: tbl_restart(ppos, ln, r->tbl);
1127:
1128: return(ROFF_IGN);
1129: }
1130:
1131: /* ARGSUSED */
1132: static enum rofferr
1133: roff_TS(ROFF_ARGS)
1134: {
1135: struct tbl_node *t;
1136:
1137: if (r->tbl) {
1138: (*r->msg)(MANDOCERR_SCOPEBROKEN, r->data, ln, ppos, NULL);
1139: tbl_end(r->tbl);
1140: }
1141:
1142: t = tbl_alloc(ppos, ln, r->data, r->msg);
1143:
1144: if (r->last_tbl)
1145: r->last_tbl->next = t;
1146: else
1147: r->first_tbl = r->last_tbl = t;
1148:
1149: r->tbl = r->last_tbl = t;
1150: return(ROFF_IGN);
1151: }
1152:
1153: /* ARGSUSED */
1154: static enum rofferr
1.14 schwarze 1155: roff_so(ROFF_ARGS)
1156: {
1157: char *name;
1.15 schwarze 1158:
1159: (*r->msg)(MANDOCERR_SO, r->data, ln, ppos, NULL);
1.14 schwarze 1160:
1.22 schwarze 1161: /*
1162: * Handle `so'. Be EXTREMELY careful, as we shouldn't be
1163: * opening anything that's not in our cwd or anything beneath
1164: * it. Thus, explicitly disallow traversing up the file-system
1165: * or using absolute paths.
1166: */
1167:
1.14 schwarze 1168: name = *bufp + pos;
1169: if ('/' == *name || strstr(name, "../") || strstr(name, "/..")) {
1170: (*r->msg)(MANDOCERR_SOPATH, r->data, ln, pos, NULL);
1171: return(ROFF_ERR);
1172: }
1173:
1174: *offs = pos;
1175: return(ROFF_SO);
1.7 schwarze 1176: }
1177:
1.16 schwarze 1178: /* ARGSUSED */
1179: static enum rofferr
1180: roff_userdef(ROFF_ARGS)
1.12 schwarze 1181: {
1.16 schwarze 1182: const char *arg[9];
1183: char *cp, *n1, *n2;
1.25 schwarze 1184: int i;
1.12 schwarze 1185:
1.16 schwarze 1186: /*
1187: * Collect pointers to macro argument strings
1188: * and null-terminate them.
1189: */
1190: cp = *bufp + pos;
1.25 schwarze 1191: for (i = 0; i < 9; i++)
1.26 schwarze 1192: arg[i] = '\0' == *cp ? "" :
1.25 schwarze 1193: mandoc_getarg(&cp, r->msg, r->data, ln, &pos);
1.16 schwarze 1194:
1195: /*
1196: * Expand macro arguments.
1.12 schwarze 1197: */
1.16 schwarze 1198: *szp = 0;
1199: n1 = cp = mandoc_strdup(r->current_string);
1200: while (NULL != (cp = strstr(cp, "\\$"))) {
1201: i = cp[2] - '1';
1202: if (0 > i || 8 < i) {
1203: /* Not an argument invocation. */
1204: cp += 2;
1205: continue;
1206: }
1207:
1208: *szp = strlen(n1) - 3 + strlen(arg[i]) + 1;
1209: n2 = mandoc_malloc(*szp);
1210:
1211: strlcpy(n2, n1, (size_t)(cp - n1 + 1));
1212: strlcat(n2, arg[i], *szp);
1213: strlcat(n2, cp + 3, *szp);
1214:
1215: cp = n2 + (cp - n1);
1216: free(n1);
1217: n1 = n2;
1.12 schwarze 1218: }
1219:
1.16 schwarze 1220: /*
1221: * Replace the macro invocation
1222: * by the expanded macro.
1223: */
1224: free(*bufp);
1225: *bufp = n1;
1226: if (0 == *szp)
1227: *szp = strlen(*bufp) + 1;
1228:
1.19 schwarze 1229: return(*szp > 1 && '\n' == (*bufp)[(int)*szp - 2] ?
1.16 schwarze 1230: ROFF_REPARSE : ROFF_APPEND);
1.12 schwarze 1231: }
1.28 schwarze 1232:
1233:
1234: static char *
1235: roff_getname(struct roff *r, char **cpp, int ln, int pos)
1236: {
1237: char *name, *cp;
1238:
1239: name = *cpp;
1240: if ('\0' == *name)
1241: return(name);
1242:
1243: /* Read until end of name. */
1244: for (cp = name; '\0' != *cp && ' ' != *cp; cp++) {
1245: if ('\\' != *cp)
1246: continue;
1247: cp++;
1248: if ('\\' == *cp)
1249: continue;
1250: (*r->msg)(MANDOCERR_NAMESC, r->data, ln, pos, NULL);
1251: *cp = '\0';
1252: name = cp;
1253: }
1254:
1255: /* Nil-terminate name. */
1256: if ('\0' != *cp)
1257: *(cp++) = '\0';
1258:
1259: /* Read past spaces. */
1260: while (' ' == *cp)
1261: cp++;
1262:
1263: *cpp = cp;
1264: return(name);
1265: }
1266:
1.12 schwarze 1267:
1.16 schwarze 1268: /*
1269: * Store *string into the user-defined string called *name.
1270: * In multiline mode, append to an existing entry and append '\n';
1271: * else replace the existing entry, if there is one.
1272: * To clear an existing entry, call with (*r, *name, NULL, 0).
1273: */
1.8 schwarze 1274: static void
1.16 schwarze 1275: roff_setstr(struct roff *r, const char *name, const char *string,
1276: int multiline)
1.7 schwarze 1277: {
1278: struct roffstr *n;
1.16 schwarze 1279: char *c;
1280: size_t oldch, newch;
1.7 schwarze 1281:
1.16 schwarze 1282: /* Search for an existing string with the same name. */
1.8 schwarze 1283: n = r->first_string;
1.7 schwarze 1284: while (n && strcmp(name, n->name))
1285: n = n->next;
1.8 schwarze 1286:
1287: if (NULL == n) {
1.16 schwarze 1288: /* Create a new string table entry. */
1.8 schwarze 1289: n = mandoc_malloc(sizeof(struct roffstr));
1.16 schwarze 1290: n->name = mandoc_strdup(name);
1291: n->string = NULL;
1.8 schwarze 1292: n->next = r->first_string;
1293: r->first_string = n;
1.16 schwarze 1294: } else if (0 == multiline) {
1295: /* In multiline mode, append; else replace. */
1.7 schwarze 1296: free(n->string);
1.16 schwarze 1297: n->string = NULL;
1298: }
1299:
1300: if (NULL == string)
1301: return;
1302:
1303: /*
1304: * One additional byte for the '\n' in multiline mode,
1305: * and one for the terminating '\0'.
1306: */
1307: newch = strlen(string) + (multiline ? 2 : 1);
1308: if (NULL == n->string) {
1309: n->string = mandoc_malloc(newch);
1310: *n->string = '\0';
1311: oldch = 0;
1312: } else {
1313: oldch = strlen(n->string);
1314: n->string = mandoc_realloc(n->string, oldch + newch);
1315: }
1316:
1317: /* Skip existing content in the destination buffer. */
1318: c = n->string + oldch;
1319:
1320: /* Append new content to the destination buffer. */
1321: while (*string) {
1322: /*
1323: * Rudimentary roff copy mode:
1324: * Handle escaped backslashes.
1325: */
1326: if ('\\' == *string && '\\' == *(string + 1))
1327: string++;
1328: *c++ = *string++;
1329: }
1.8 schwarze 1330:
1.16 schwarze 1331: /* Append terminating bytes. */
1332: if (multiline)
1333: *c++ = '\n';
1334: *c = '\0';
1.7 schwarze 1335: }
1336:
1337:
1.8 schwarze 1338: static const char *
1339: roff_getstrn(const struct roff *r, const char *name, size_t len)
1.7 schwarze 1340: {
1.8 schwarze 1341: const struct roffstr *n;
1.7 schwarze 1342:
1.8 schwarze 1343: n = r->first_string;
1.10 schwarze 1344: while (n && (strncmp(name, n->name, len) || '\0' != n->name[(int)len]))
1.7 schwarze 1345: n = n->next;
1.8 schwarze 1346:
1347: return(n ? n->string : NULL);
1.7 schwarze 1348: }
1349:
1.8 schwarze 1350:
1351: static void
1352: roff_freestr(struct roff *r)
1.7 schwarze 1353: {
1354: struct roffstr *n, *nn;
1355:
1.8 schwarze 1356: for (n = r->first_string; n; n = nn) {
1.7 schwarze 1357: free(n->name);
1358: free(n->string);
1359: nn = n->next;
1360: free(n);
1361: }
1.8 schwarze 1362:
1363: r->first_string = NULL;
1.27 schwarze 1364: }
1365:
1366: const struct tbl_span *
1367: roff_span(const struct roff *r)
1368: {
1369:
1370: return(r->tbl ? tbl_span(r->tbl) : NULL);
1.1 schwarze 1371: }
![[BACK]](/icons/back.gif){kind=icon}
Return to roff.c CVS log ![[TXT]](/icons/text.gif){kind=icon}
![[DIR]](/icons/dir.gif){kind=icon}
Up to [local] / src / usr.bin / mandoc