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