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