Annotation of src/usr.bin/mandoc/roff.c, Revision 1.55
1.55 ! schwarze 1: /* $Id: roff.c,v 1.54 2013/10/03 22:50:02 schwarze Exp $ */
1.1 schwarze 2: /*
1.48 schwarze 3: * Copyright (c) 2010, 2011, 2012 Kristaps Dzonsons <kristaps@bsd.lv>
1.50 schwarze 4: * Copyright (c) 2010, 2011, 2012, 2013 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.51 schwarze 20: #include <stdio.h>
1.1 schwarze 21: #include <stdlib.h>
22: #include <string.h>
23:
24: #include "mandoc.h"
1.27 schwarze 25: #include "libroff.h"
1.8 schwarze 26: #include "libmandoc.h"
1.1 schwarze 27:
1.37 schwarze 28: /* Maximum number of nested if-else conditionals. */
1.2 schwarze 29: #define RSTACK_MAX 128
30:
1.43 schwarze 31: /* Maximum number of string expansions per line, to break infinite loops. */
32: #define EXPAND_LIMIT 1000
33:
1.1 schwarze 34: enum rofft {
1.20 schwarze 35: ROFF_ad,
1.2 schwarze 36: ROFF_am,
37: ROFF_ami,
38: ROFF_am1,
1.48 schwarze 39: ROFF_cc,
1.1 schwarze 40: ROFF_de,
41: ROFF_dei,
1.2 schwarze 42: ROFF_de1,
43: ROFF_ds,
44: ROFF_el,
1.20 schwarze 45: ROFF_hy,
1.2 schwarze 46: ROFF_ie,
47: ROFF_if,
1.1 schwarze 48: ROFF_ig,
1.30 schwarze 49: ROFF_it,
1.20 schwarze 50: ROFF_ne,
51: ROFF_nh,
1.14 schwarze 52: ROFF_nr,
1.31 schwarze 53: ROFF_ns,
54: ROFF_ps,
1.2 schwarze 55: ROFF_rm,
1.14 schwarze 56: ROFF_so,
1.31 schwarze 57: ROFF_ta,
1.2 schwarze 58: ROFF_tr,
1.47 schwarze 59: ROFF_Dd,
60: ROFF_TH,
1.27 schwarze 61: ROFF_TS,
62: ROFF_TE,
63: ROFF_T_,
1.32 schwarze 64: ROFF_EQ,
65: ROFF_EN,
1.2 schwarze 66: ROFF_cblock,
1.37 schwarze 67: ROFF_ccond,
1.16 schwarze 68: ROFF_USERDEF,
1.1 schwarze 69: ROFF_MAX
70: };
71:
1.2 schwarze 72: enum roffrule {
1.55 ! schwarze 73: ROFFRULE_DENY,
! 74: ROFFRULE_ALLOW
1.2 schwarze 75: };
76:
1.41 schwarze 77: /*
1.42 schwarze 78: * An incredibly-simple string buffer.
79: */
1.8 schwarze 80: struct roffstr {
1.42 schwarze 81: char *p; /* nil-terminated buffer */
82: size_t sz; /* saved strlen(p) */
83: };
84:
85: /*
86: * A key-value roffstr pair as part of a singly-linked list.
87: */
88: struct roffkv {
89: struct roffstr key;
90: struct roffstr val;
91: struct roffkv *next; /* next in list */
1.8 schwarze 92: };
93:
1.52 schwarze 94: /*
95: * A single number register as part of a singly-linked list.
96: */
97: struct roffreg {
98: struct roffstr key;
1.53 schwarze 99: int val;
1.52 schwarze 100: struct roffreg *next;
101: };
102:
1.1 schwarze 103: struct roff {
1.47 schwarze 104: enum mparset parsetype; /* requested parse type */
1.35 schwarze 105: struct mparse *parse; /* parse point */
1.1 schwarze 106: struct roffnode *last; /* leaf of stack */
1.2 schwarze 107: enum roffrule rstack[RSTACK_MAX]; /* stack of !`ie' rules */
1.48 schwarze 108: char control; /* control character */
1.2 schwarze 109: int rstackpos; /* position in rstack */
1.52 schwarze 110: struct roffreg *regtab; /* number registers */
1.42 schwarze 111: struct roffkv *strtab; /* user-defined strings & macros */
112: struct roffkv *xmbtab; /* multi-byte trans table (`tr') */
113: struct roffstr *xtab; /* single-byte trans table (`tr') */
1.16 schwarze 114: const char *current_string; /* value of last called user macro */
1.27 schwarze 115: struct tbl_node *first_tbl; /* first table parsed */
116: struct tbl_node *last_tbl; /* last table parsed */
117: struct tbl_node *tbl; /* current table being parsed */
1.32 schwarze 118: struct eqn_node *last_eqn; /* last equation parsed */
119: struct eqn_node *first_eqn; /* first equation parsed */
120: struct eqn_node *eqn; /* current equation being parsed */
1.1 schwarze 121: };
122:
123: struct roffnode {
124: enum rofft tok; /* type of node */
125: struct roffnode *parent; /* up one in stack */
126: int line; /* parse line */
127: int col; /* parse col */
1.16 schwarze 128: char *name; /* node name, e.g. macro name */
1.2 schwarze 129: char *end; /* end-rules: custom token */
130: int endspan; /* end-rules: next-line or infty */
131: enum roffrule rule; /* current evaluation rule */
1.1 schwarze 132: };
133:
134: #define ROFF_ARGS struct roff *r, /* parse ctx */ \
135: enum rofft tok, /* tok of macro */ \
136: char **bufp, /* input buffer */ \
137: size_t *szp, /* size of input buffer */ \
138: int ln, /* parse line */ \
1.2 schwarze 139: int ppos, /* original pos in buffer */ \
140: int pos, /* current pos in buffer */ \
141: int *offs /* reset offset of buffer data */
1.1 schwarze 142:
143: typedef enum rofferr (*roffproc)(ROFF_ARGS);
144:
145: struct roffmac {
146: const char *name; /* macro name */
1.2 schwarze 147: roffproc proc; /* process new macro */
148: roffproc text; /* process as child text of macro */
149: roffproc sub; /* process as child of macro */
150: int flags;
151: #define ROFFMAC_STRUCT (1 << 0) /* always interpret */
1.3 schwarze 152: struct roffmac *next;
1.1 schwarze 153: };
154:
1.37 schwarze 155: struct predef {
156: const char *name; /* predefined input name */
157: const char *str; /* replacement symbol */
158: };
159:
160: #define PREDEF(__name, __str) \
161: { (__name), (__str) },
162:
1.42 schwarze 163: static enum rofft roffhash_find(const char *, size_t);
164: static void roffhash_init(void);
165: static void roffnode_cleanscope(struct roff *);
166: static void roffnode_pop(struct roff *);
167: static void roffnode_push(struct roff *, enum rofft,
168: const char *, int, int);
1.2 schwarze 169: static enum rofferr roff_block(ROFF_ARGS);
170: static enum rofferr roff_block_text(ROFF_ARGS);
171: static enum rofferr roff_block_sub(ROFF_ARGS);
172: static enum rofferr roff_cblock(ROFF_ARGS);
1.48 schwarze 173: static enum rofferr roff_cc(ROFF_ARGS);
1.2 schwarze 174: static enum rofferr roff_ccond(ROFF_ARGS);
175: static enum rofferr roff_cond(ROFF_ARGS);
176: static enum rofferr roff_cond_text(ROFF_ARGS);
177: static enum rofferr roff_cond_sub(ROFF_ARGS);
1.7 schwarze 178: static enum rofferr roff_ds(ROFF_ARGS);
1.8 schwarze 179: static enum roffrule roff_evalcond(const char *, int *);
1.42 schwarze 180: static void roff_free1(struct roff *);
1.52 schwarze 181: static void roff_freereg(struct roffreg *);
1.42 schwarze 182: static void roff_freestr(struct roffkv *);
1.28 schwarze 183: static char *roff_getname(struct roff *, char **, int, int);
1.53 schwarze 184: static int roff_getregn(const struct roff *,
185: const char *, size_t);
1.8 schwarze 186: static const char *roff_getstrn(const struct roff *,
187: const char *, size_t);
1.51 schwarze 188: static enum rofferr roff_it(ROFF_ARGS);
1.21 schwarze 189: static enum rofferr roff_line_ignore(ROFF_ARGS);
1.6 schwarze 190: static enum rofferr roff_nr(ROFF_ARGS);
1.41 schwarze 191: static void roff_openeqn(struct roff *, const char *,
192: int, int, const char *);
1.42 schwarze 193: static enum rofft roff_parse(struct roff *, const char *, int *);
1.51 schwarze 194: static enum rofferr roff_parsetext(char **, size_t *, int, int *);
1.45 schwarze 195: static enum rofferr roff_res(struct roff *,
1.37 schwarze 196: char **, size_t *, int, int);
1.29 schwarze 197: static enum rofferr roff_rm(ROFF_ARGS);
1.8 schwarze 198: static void roff_setstr(struct roff *,
1.16 schwarze 199: const char *, const char *, int);
1.42 schwarze 200: static void roff_setstrn(struct roffkv **, const char *,
201: size_t, const char *, size_t, int);
1.14 schwarze 202: static enum rofferr roff_so(ROFF_ARGS);
1.42 schwarze 203: static enum rofferr roff_tr(ROFF_ARGS);
1.47 schwarze 204: static enum rofferr roff_Dd(ROFF_ARGS);
205: static enum rofferr roff_TH(ROFF_ARGS);
1.27 schwarze 206: static enum rofferr roff_TE(ROFF_ARGS);
207: static enum rofferr roff_TS(ROFF_ARGS);
1.32 schwarze 208: static enum rofferr roff_EQ(ROFF_ARGS);
209: static enum rofferr roff_EN(ROFF_ARGS);
1.27 schwarze 210: static enum rofferr roff_T_(ROFF_ARGS);
1.16 schwarze 211: static enum rofferr roff_userdef(ROFF_ARGS);
1.1 schwarze 212:
1.42 schwarze 213: /* See roffhash_find() */
1.3 schwarze 214:
215: #define ASCII_HI 126
216: #define ASCII_LO 33
217: #define HASHWIDTH (ASCII_HI - ASCII_LO + 1)
218:
219: static struct roffmac *hash[HASHWIDTH];
220:
221: static struct roffmac roffs[ROFF_MAX] = {
1.21 schwarze 222: { "ad", roff_line_ignore, NULL, NULL, 0, NULL },
1.3 schwarze 223: { "am", roff_block, roff_block_text, roff_block_sub, 0, NULL },
224: { "ami", roff_block, roff_block_text, roff_block_sub, 0, NULL },
225: { "am1", roff_block, roff_block_text, roff_block_sub, 0, NULL },
1.48 schwarze 226: { "cc", roff_cc, NULL, NULL, 0, NULL },
1.3 schwarze 227: { "de", roff_block, roff_block_text, roff_block_sub, 0, NULL },
228: { "dei", roff_block, roff_block_text, roff_block_sub, 0, NULL },
229: { "de1", roff_block, roff_block_text, roff_block_sub, 0, NULL },
1.7 schwarze 230: { "ds", roff_ds, NULL, NULL, 0, NULL },
1.3 schwarze 231: { "el", roff_cond, roff_cond_text, roff_cond_sub, ROFFMAC_STRUCT, NULL },
1.21 schwarze 232: { "hy", roff_line_ignore, NULL, NULL, 0, NULL },
1.3 schwarze 233: { "ie", roff_cond, roff_cond_text, roff_cond_sub, ROFFMAC_STRUCT, NULL },
234: { "if", roff_cond, roff_cond_text, roff_cond_sub, ROFFMAC_STRUCT, NULL },
235: { "ig", roff_block, roff_block_text, roff_block_sub, 0, NULL },
1.51 schwarze 236: { "it", roff_it, NULL, NULL, 0, NULL },
1.21 schwarze 237: { "ne", roff_line_ignore, NULL, NULL, 0, NULL },
238: { "nh", roff_line_ignore, NULL, NULL, 0, NULL },
1.14 schwarze 239: { "nr", roff_nr, NULL, NULL, 0, NULL },
1.31 schwarze 240: { "ns", roff_line_ignore, NULL, NULL, 0, NULL },
241: { "ps", roff_line_ignore, NULL, NULL, 0, NULL },
1.29 schwarze 242: { "rm", roff_rm, NULL, NULL, 0, NULL },
1.14 schwarze 243: { "so", roff_so, NULL, NULL, 0, NULL },
1.31 schwarze 244: { "ta", roff_line_ignore, NULL, NULL, 0, NULL },
1.42 schwarze 245: { "tr", roff_tr, NULL, NULL, 0, NULL },
1.47 schwarze 246: { "Dd", roff_Dd, NULL, NULL, 0, NULL },
247: { "TH", roff_TH, NULL, NULL, 0, NULL },
1.27 schwarze 248: { "TS", roff_TS, NULL, NULL, 0, NULL },
249: { "TE", roff_TE, NULL, NULL, 0, NULL },
250: { "T&", roff_T_, NULL, NULL, 0, NULL },
1.32 schwarze 251: { "EQ", roff_EQ, NULL, NULL, 0, NULL },
252: { "EN", roff_EN, NULL, NULL, 0, NULL },
1.3 schwarze 253: { ".", roff_cblock, NULL, NULL, 0, NULL },
254: { "\\}", roff_ccond, NULL, NULL, 0, NULL },
1.16 schwarze 255: { NULL, roff_userdef, NULL, NULL, 0, NULL },
1.1 schwarze 256: };
257:
1.47 schwarze 258: const char *const __mdoc_reserved[] = {
259: "Ac", "Ad", "An", "Ao", "Ap", "Aq", "Ar", "At",
260: "Bc", "Bd", "Bf", "Bk", "Bl", "Bo", "Bq",
261: "Brc", "Bro", "Brq", "Bsx", "Bt", "Bx",
262: "Cd", "Cm", "Db", "Dc", "Dd", "Dl", "Do", "Dq",
263: "Ds", "Dt", "Dv", "Dx", "D1",
264: "Ec", "Ed", "Ef", "Ek", "El", "Em", "em",
265: "En", "Eo", "Eq", "Er", "Es", "Ev", "Ex",
266: "Fa", "Fc", "Fd", "Fl", "Fn", "Fo", "Fr", "Ft", "Fx",
267: "Hf", "Ic", "In", "It", "Lb", "Li", "Lk", "Lp", "LP",
268: "Me", "Ms", "Mt", "Nd", "Nm", "No", "Ns", "Nx",
269: "Oc", "Oo", "Op", "Os", "Ot", "Ox",
270: "Pa", "Pc", "Pf", "Po", "Pp", "PP", "pp", "Pq",
271: "Qc", "Ql", "Qo", "Qq", "Or", "Rd", "Re", "Rs", "Rv",
272: "Sc", "Sf", "Sh", "SH", "Sm", "So", "Sq",
273: "Ss", "St", "Sx", "Sy",
274: "Ta", "Tn", "Ud", "Ux", "Va", "Vt", "Xc", "Xo", "Xr",
275: "%A", "%B", "%D", "%I", "%J", "%N", "%O",
276: "%P", "%Q", "%R", "%T", "%U", "%V",
277: NULL
278: };
279:
280: const char *const __man_reserved[] = {
281: "AT", "B", "BI", "BR", "BT", "DE", "DS", "DT",
282: "EE", "EN", "EQ", "EX", "HF", "HP", "I", "IB", "IP", "IR",
283: "LP", "ME", "MT", "OP", "P", "PD", "PP", "PT",
284: "R", "RB", "RE", "RI", "RS", "SB", "SH", "SM", "SS", "SY",
285: "TE", "TH", "TP", "TQ", "TS", "T&", "UC", "UE", "UR", "YS",
286: NULL
287: };
288:
1.37 schwarze 289: /* Array of injected predefined strings. */
290: #define PREDEFS_MAX 38
291: static const struct predef predefs[PREDEFS_MAX] = {
292: #include "predefs.in"
293: };
294:
1.42 schwarze 295: /* See roffhash_find() */
1.3 schwarze 296: #define ROFF_HASH(p) (p[0] - ASCII_LO)
297:
1.51 schwarze 298: static int roffit_lines; /* number of lines to delay */
299: static char *roffit_macro; /* nil-terminated macro line */
300:
1.3 schwarze 301: static void
1.42 schwarze 302: roffhash_init(void)
1.3 schwarze 303: {
304: struct roffmac *n;
305: int buc, i;
306:
1.16 schwarze 307: for (i = 0; i < (int)ROFF_USERDEF; i++) {
1.3 schwarze 308: assert(roffs[i].name[0] >= ASCII_LO);
309: assert(roffs[i].name[0] <= ASCII_HI);
310:
311: buc = ROFF_HASH(roffs[i].name);
312:
313: if (NULL != (n = hash[buc])) {
314: for ( ; n->next; n = n->next)
315: /* Do nothing. */ ;
316: n->next = &roffs[i];
317: } else
318: hash[buc] = &roffs[i];
319: }
320: }
321:
1.1 schwarze 322: /*
323: * Look up a roff token by its name. Returns ROFF_MAX if no macro by
324: * the nil-terminated string name could be found.
325: */
326: static enum rofft
1.42 schwarze 327: roffhash_find(const char *p, size_t s)
1.1 schwarze 328: {
1.3 schwarze 329: int buc;
330: struct roffmac *n;
1.1 schwarze 331:
1.3 schwarze 332: /*
333: * libroff has an extremely simple hashtable, for the time
334: * being, which simply keys on the first character, which must
335: * be printable, then walks a chain. It works well enough until
336: * optimised.
337: */
338:
339: if (p[0] < ASCII_LO || p[0] > ASCII_HI)
340: return(ROFF_MAX);
341:
342: buc = ROFF_HASH(p);
343:
344: if (NULL == (n = hash[buc]))
345: return(ROFF_MAX);
346: for ( ; n; n = n->next)
1.16 schwarze 347: if (0 == strncmp(n->name, p, s) && '\0' == n->name[(int)s])
1.3 schwarze 348: return((enum rofft)(n - roffs));
1.1 schwarze 349:
350: return(ROFF_MAX);
351: }
352:
353:
354: /*
355: * Pop the current node off of the stack of roff instructions currently
356: * pending.
357: */
358: static void
359: roffnode_pop(struct roff *r)
360: {
361: struct roffnode *p;
362:
1.2 schwarze 363: assert(r->last);
364: p = r->last;
365:
366: r->last = r->last->parent;
1.16 schwarze 367: free(p->name);
368: free(p->end);
1.1 schwarze 369: free(p);
370: }
371:
372:
373: /*
374: * Push a roff node onto the instruction stack. This must later be
375: * removed with roffnode_pop().
376: */
1.11 schwarze 377: static void
1.16 schwarze 378: roffnode_push(struct roff *r, enum rofft tok, const char *name,
379: int line, int col)
1.1 schwarze 380: {
381: struct roffnode *p;
382:
1.11 schwarze 383: p = mandoc_calloc(1, sizeof(struct roffnode));
1.1 schwarze 384: p->tok = tok;
1.16 schwarze 385: if (name)
386: p->name = mandoc_strdup(name);
1.1 schwarze 387: p->parent = r->last;
388: p->line = line;
389: p->col = col;
1.2 schwarze 390: p->rule = p->parent ? p->parent->rule : ROFFRULE_DENY;
1.1 schwarze 391:
392: r->last = p;
393: }
394:
395:
396: static void
397: roff_free1(struct roff *r)
398: {
1.49 schwarze 399: struct tbl_node *tbl;
1.32 schwarze 400: struct eqn_node *e;
1.42 schwarze 401: int i;
1.27 schwarze 402:
1.49 schwarze 403: while (NULL != (tbl = r->first_tbl)) {
404: r->first_tbl = tbl->next;
405: tbl_free(tbl);
1.27 schwarze 406: }
407:
408: r->first_tbl = r->last_tbl = r->tbl = NULL;
1.1 schwarze 409:
1.32 schwarze 410: while (NULL != (e = r->first_eqn)) {
411: r->first_eqn = e->next;
412: eqn_free(e);
413: }
414:
415: r->first_eqn = r->last_eqn = r->eqn = NULL;
416:
1.1 schwarze 417: while (r->last)
418: roffnode_pop(r);
1.27 schwarze 419:
1.42 schwarze 420: roff_freestr(r->strtab);
421: roff_freestr(r->xmbtab);
422:
423: r->strtab = r->xmbtab = NULL;
424:
1.52 schwarze 425: roff_freereg(r->regtab);
426:
427: r->regtab = NULL;
428:
1.42 schwarze 429: if (r->xtab)
430: for (i = 0; i < 128; i++)
431: free(r->xtab[i].p);
432:
433: free(r->xtab);
434: r->xtab = NULL;
1.1 schwarze 435: }
436:
437: void
438: roff_reset(struct roff *r)
439: {
1.38 schwarze 440: int i;
1.1 schwarze 441:
442: roff_free1(r);
1.38 schwarze 443:
1.48 schwarze 444: r->control = 0;
1.41 schwarze 445:
1.38 schwarze 446: for (i = 0; i < PREDEFS_MAX; i++)
447: roff_setstr(r, predefs[i].name, predefs[i].str, 0);
1.1 schwarze 448: }
449:
450:
451: void
452: roff_free(struct roff *r)
453: {
454:
455: roff_free1(r);
456: free(r);
457: }
458:
459:
460: struct roff *
1.47 schwarze 461: roff_alloc(enum mparset type, struct mparse *parse)
1.1 schwarze 462: {
463: struct roff *r;
1.37 schwarze 464: int i;
1.1 schwarze 465:
1.11 schwarze 466: r = mandoc_calloc(1, sizeof(struct roff));
1.47 schwarze 467: r->parsetype = type;
1.35 schwarze 468: r->parse = parse;
1.2 schwarze 469: r->rstackpos = -1;
1.3 schwarze 470:
1.42 schwarze 471: roffhash_init();
1.37 schwarze 472:
473: for (i = 0; i < PREDEFS_MAX; i++)
474: roff_setstr(r, predefs[i].name, predefs[i].str, 0);
475:
1.1 schwarze 476: return(r);
477: }
478:
1.8 schwarze 479: /*
1.53 schwarze 480: * In the current line, expand user-defined strings ("\*")
481: * and references to number registers ("\n").
482: * Also check the syntax of other escape sequences.
1.8 schwarze 483: */
1.45 schwarze 484: static enum rofferr
1.37 schwarze 485: roff_res(struct roff *r, char **bufp, size_t *szp, int ln, int pos)
1.8 schwarze 486: {
1.53 schwarze 487: char ubuf[12]; /* buffer to print the number */
1.23 schwarze 488: const char *stesc; /* start of an escape sequence ('\\') */
489: const char *stnam; /* start of the name, after "[(*" */
490: const char *cp; /* end of the name, e.g. before ']' */
491: const char *res; /* the string to be substituted */
1.53 schwarze 492: char *nbuf; /* new buffer to copy bufp to */
493: size_t nsz; /* size of the new buffer */
494: size_t maxl; /* expected length of the escape name */
495: size_t naml; /* actual length of the escape name */
496: int expand_count; /* to avoid infinite loops */
1.8 schwarze 497:
1.43 schwarze 498: expand_count = 0;
499:
1.42 schwarze 500: again:
1.24 schwarze 501: cp = *bufp + pos;
502: while (NULL != (cp = strchr(cp, '\\'))) {
503: stesc = cp++;
1.23 schwarze 504:
505: /*
1.53 schwarze 506: * The second character must be an asterisk or an n.
1.23 schwarze 507: * If it isn't, skip it anyway: It is escaped,
508: * so it can't start another escape sequence.
509: */
510:
1.24 schwarze 511: if ('\0' == *cp)
1.45 schwarze 512: return(ROFF_CONT);
1.42 schwarze 513:
1.53 schwarze 514: switch (*cp) {
515: case ('*'):
516: res = NULL;
517: break;
518: case ('n'):
519: res = ubuf;
520: break;
521: default:
522: if (ESCAPE_ERROR != mandoc_escape(&cp, NULL, NULL))
1.42 schwarze 523: continue;
524: mandoc_msg
525: (MANDOCERR_BADESCAPE, r->parse,
526: ln, (int)(stesc - *bufp), NULL);
1.45 schwarze 527: return(ROFF_CONT);
1.42 schwarze 528: }
529:
530: cp++;
1.23 schwarze 531:
532: /*
533: * The third character decides the length
1.53 schwarze 534: * of the name of the string or register.
1.23 schwarze 535: * Save a pointer to the name.
536: */
537:
1.24 schwarze 538: switch (*cp) {
539: case ('\0'):
1.45 schwarze 540: return(ROFF_CONT);
1.8 schwarze 541: case ('('):
542: cp++;
543: maxl = 2;
544: break;
545: case ('['):
546: cp++;
547: maxl = 0;
548: break;
549: default:
550: maxl = 1;
551: break;
552: }
1.23 schwarze 553: stnam = cp;
1.8 schwarze 554:
1.23 schwarze 555: /* Advance to the end of the name. */
1.8 schwarze 556:
1.53 schwarze 557: for (naml = 0; 0 == maxl || naml < maxl; naml++, cp++) {
1.42 schwarze 558: if ('\0' == *cp) {
559: mandoc_msg
560: (MANDOCERR_BADESCAPE,
561: r->parse, ln,
562: (int)(stesc - *bufp), NULL);
1.45 schwarze 563: return(ROFF_CONT);
1.42 schwarze 564: }
1.8 schwarze 565: if (0 == maxl && ']' == *cp)
566: break;
567: }
568:
1.23 schwarze 569: /*
570: * Retrieve the replacement string; if it is
571: * undefined, resume searching for escapes.
572: */
573:
1.53 schwarze 574: if (NULL == res)
575: res = roff_getstrn(r, stnam, naml);
576: else
577: snprintf(ubuf, sizeof(ubuf), "%d",
578: roff_getregn(r, stnam, naml));
1.8 schwarze 579:
580: if (NULL == res) {
1.42 schwarze 581: mandoc_msg
582: (MANDOCERR_BADESCAPE, r->parse,
583: ln, (int)(stesc - *bufp), NULL);
1.37 schwarze 584: res = "";
1.8 schwarze 585: }
586:
1.23 schwarze 587: /* Replace the escape sequence by the string. */
588:
1.42 schwarze 589: pos = stesc - *bufp;
590:
1.8 schwarze 591: nsz = *szp + strlen(res) + 1;
1.53 schwarze 592: nbuf = mandoc_malloc(nsz);
1.8 schwarze 593:
1.53 schwarze 594: strlcpy(nbuf, *bufp, (size_t)(stesc - *bufp + 1));
595: strlcat(nbuf, res, nsz);
596: strlcat(nbuf, cp + (maxl ? 0 : 1), nsz);
1.8 schwarze 597:
598: free(*bufp);
599:
1.53 schwarze 600: *bufp = nbuf;
1.8 schwarze 601: *szp = nsz;
1.43 schwarze 602:
603: if (EXPAND_LIMIT >= ++expand_count)
604: goto again;
605:
606: /* Just leave the string unexpanded. */
607: mandoc_msg(MANDOCERR_ROFFLOOP, r->parse, ln, pos, NULL);
1.45 schwarze 608: return(ROFF_IGN);
1.42 schwarze 609: }
1.45 schwarze 610: return(ROFF_CONT);
1.42 schwarze 611: }
612:
613: /*
1.51 schwarze 614: * Process text streams:
615: * Convert all breakable hyphens into ASCII_HYPH.
616: * Decrement and spring input line trap.
1.42 schwarze 617: */
618: static enum rofferr
1.51 schwarze 619: roff_parsetext(char **bufp, size_t *szp, int pos, int *offs)
1.42 schwarze 620: {
621: size_t sz;
622: const char *start;
1.51 schwarze 623: char *p;
624: int isz;
1.42 schwarze 625: enum mandoc_esc esc;
626:
1.51 schwarze 627: start = p = *bufp + pos;
1.42 schwarze 628:
629: while ('\0' != *p) {
630: sz = strcspn(p, "-\\");
631: p += sz;
632:
633: if ('\0' == *p)
634: break;
635:
636: if ('\\' == *p) {
637: /* Skip over escapes. */
638: p++;
639: esc = mandoc_escape
640: ((const char **)&p, NULL, NULL);
641: if (ESCAPE_ERROR == esc)
642: break;
643: continue;
644: } else if (p == start) {
645: p++;
646: continue;
647: }
648:
1.44 schwarze 649: if (isalpha((unsigned char)p[-1]) &&
650: isalpha((unsigned char)p[1]))
1.42 schwarze 651: *p = ASCII_HYPH;
652: p++;
1.8 schwarze 653: }
654:
1.51 schwarze 655: /* Spring the input line trap. */
656: if (1 == roffit_lines) {
657: isz = asprintf(&p, "%s\n.%s", *bufp, roffit_macro);
658: if (-1 == isz) {
659: perror(NULL);
660: exit((int)MANDOCLEVEL_SYSERR);
661: }
662: free(*bufp);
663: *bufp = p;
664: *szp = isz + 1;
665: *offs = 0;
666: free(roffit_macro);
667: roffit_lines = 0;
668: return(ROFF_REPARSE);
669: } else if (1 < roffit_lines)
670: --roffit_lines;
1.42 schwarze 671: return(ROFF_CONT);
1.8 schwarze 672: }
673:
1.1 schwarze 674: enum rofferr
1.6 schwarze 675: roff_parseln(struct roff *r, int ln, char **bufp,
676: size_t *szp, int pos, int *offs)
1.1 schwarze 677: {
678: enum rofft t;
1.27 schwarze 679: enum rofferr e;
1.35 schwarze 680: int ppos, ctl;
1.1 schwarze 681:
1.2 schwarze 682: /*
1.8 schwarze 683: * Run the reserved-word filter only if we have some reserved
684: * words to fill in.
685: */
686:
1.45 schwarze 687: e = roff_res(r, bufp, szp, ln, pos);
688: if (ROFF_IGN == e)
689: return(e);
690: assert(ROFF_CONT == e);
1.8 schwarze 691:
1.35 schwarze 692: ppos = pos;
1.48 schwarze 693: ctl = roff_getcontrol(r, *bufp, &pos);
1.35 schwarze 694:
1.8 schwarze 695: /*
1.2 schwarze 696: * First, if a scope is open and we're not a macro, pass the
697: * text through the macro's filter. If a scope isn't open and
698: * we're not a macro, just let it through.
1.32 schwarze 699: * Finally, if there's an equation scope open, divert it into it
700: * no matter our state.
1.2 schwarze 701: */
702:
1.35 schwarze 703: if (r->last && ! ctl) {
1.2 schwarze 704: t = r->last->tok;
705: assert(roffs[t].text);
1.27 schwarze 706: e = (*roffs[t].text)
707: (r, t, bufp, szp, ln, pos, pos, offs);
708: assert(ROFF_IGN == e || ROFF_CONT == e);
1.32 schwarze 709: if (ROFF_CONT != e)
710: return(e);
1.54 schwarze 711: }
712: if (r->eqn)
713: return(eqn_read(&r->eqn, ln, *bufp, ppos, offs));
714: if ( ! ctl) {
1.32 schwarze 715: if (r->tbl)
1.35 schwarze 716: return(tbl_read(r->tbl, ln, *bufp, pos));
1.51 schwarze 717: return(roff_parsetext(bufp, szp, pos, offs));
1.54 schwarze 718: }
1.2 schwarze 719:
720: /*
721: * If a scope is open, go to the child handler for that macro,
722: * as it may want to preprocess before doing anything with it.
1.32 schwarze 723: * Don't do so if an equation is open.
1.2 schwarze 724: */
725:
726: if (r->last) {
1.1 schwarze 727: t = r->last->tok;
728: assert(roffs[t].sub);
1.2 schwarze 729: return((*roffs[t].sub)
1.8 schwarze 730: (r, t, bufp, szp,
1.35 schwarze 731: ln, ppos, pos, offs));
1.2 schwarze 732: }
733:
734: /*
735: * Lastly, as we've no scope open, try to look up and execute
736: * the new macro. If no macro is found, simply return and let
737: * the compilers handle it.
738: */
739:
1.16 schwarze 740: if (ROFF_MAX == (t = roff_parse(r, *bufp, &pos)))
1.1 schwarze 741: return(ROFF_CONT);
742:
1.2 schwarze 743: assert(roffs[t].proc);
744: return((*roffs[t].proc)
1.8 schwarze 745: (r, t, bufp, szp,
746: ln, ppos, pos, offs));
1.2 schwarze 747: }
748:
1.1 schwarze 749:
1.27 schwarze 750: void
1.2 schwarze 751: roff_endparse(struct roff *r)
752: {
1.1 schwarze 753:
1.27 schwarze 754: if (r->last)
1.35 schwarze 755: mandoc_msg(MANDOCERR_SCOPEEXIT, r->parse,
1.27 schwarze 756: r->last->line, r->last->col, NULL);
757:
1.32 schwarze 758: if (r->eqn) {
1.35 schwarze 759: mandoc_msg(MANDOCERR_SCOPEEXIT, r->parse,
1.41 schwarze 760: r->eqn->eqn.ln, r->eqn->eqn.pos, NULL);
761: eqn_end(&r->eqn);
1.32 schwarze 762: }
763:
1.27 schwarze 764: if (r->tbl) {
1.35 schwarze 765: mandoc_msg(MANDOCERR_SCOPEEXIT, r->parse,
1.27 schwarze 766: r->tbl->line, r->tbl->pos, NULL);
1.41 schwarze 767: tbl_end(&r->tbl);
1.27 schwarze 768: }
1.1 schwarze 769: }
770:
771: /*
772: * Parse a roff node's type from the input buffer. This must be in the
773: * form of ".foo xxx" in the usual way.
774: */
775: static enum rofft
1.16 schwarze 776: roff_parse(struct roff *r, const char *buf, int *pos)
1.1 schwarze 777: {
1.16 schwarze 778: const char *mac;
779: size_t maclen;
1.1 schwarze 780: enum rofft t;
781:
1.39 schwarze 782: if ('\0' == buf[*pos] || '"' == buf[*pos] ||
783: '\t' == buf[*pos] || ' ' == buf[*pos])
1.1 schwarze 784: return(ROFF_MAX);
785:
1.39 schwarze 786: /*
787: * We stop the macro parse at an escape, tab, space, or nil.
788: * However, `\}' is also a valid macro, so make sure we don't
789: * clobber it by seeing the `\' as the end of token.
790: */
791:
1.16 schwarze 792: mac = buf + *pos;
1.39 schwarze 793: maclen = strcspn(mac + 1, " \\\t\0") + 1;
1.1 schwarze 794:
1.16 schwarze 795: t = (r->current_string = roff_getstrn(r, mac, maclen))
1.42 schwarze 796: ? ROFF_USERDEF : roffhash_find(mac, maclen);
1.1 schwarze 797:
1.34 schwarze 798: *pos += (int)maclen;
1.35 schwarze 799:
1.1 schwarze 800: while (buf[*pos] && ' ' == buf[*pos])
801: (*pos)++;
802:
803: return(t);
804: }
805:
806: /* ARGSUSED */
807: static enum rofferr
1.2 schwarze 808: roff_cblock(ROFF_ARGS)
1.1 schwarze 809: {
810:
1.2 schwarze 811: /*
812: * A block-close `..' should only be invoked as a child of an
813: * ignore macro, otherwise raise a warning and just ignore it.
814: */
815:
816: if (NULL == r->last) {
1.35 schwarze 817: mandoc_msg(MANDOCERR_NOSCOPE, r->parse, ln, ppos, NULL);
1.2 schwarze 818: return(ROFF_IGN);
819: }
1.1 schwarze 820:
1.2 schwarze 821: switch (r->last->tok) {
822: case (ROFF_am):
823: /* FALLTHROUGH */
824: case (ROFF_ami):
825: /* FALLTHROUGH */
826: case (ROFF_am1):
827: /* FALLTHROUGH */
828: case (ROFF_de):
1.23 schwarze 829: /* ROFF_de1 is remapped to ROFF_de in roff_block(). */
1.2 schwarze 830: /* FALLTHROUGH */
831: case (ROFF_dei):
832: /* FALLTHROUGH */
833: case (ROFF_ig):
834: break;
835: default:
1.35 schwarze 836: mandoc_msg(MANDOCERR_NOSCOPE, r->parse, ln, ppos, NULL);
1.1 schwarze 837: return(ROFF_IGN);
1.2 schwarze 838: }
839:
840: if ((*bufp)[pos])
1.35 schwarze 841: mandoc_msg(MANDOCERR_ARGSLOST, r->parse, ln, pos, NULL);
1.2 schwarze 842:
843: roffnode_pop(r);
844: roffnode_cleanscope(r);
845: return(ROFF_IGN);
846:
847: }
1.1 schwarze 848:
849:
1.2 schwarze 850: static void
851: roffnode_cleanscope(struct roff *r)
852: {
1.1 schwarze 853:
1.2 schwarze 854: while (r->last) {
1.46 schwarze 855: if (--r->last->endspan != 0)
1.2 schwarze 856: break;
857: roffnode_pop(r);
858: }
859: }
1.1 schwarze 860:
861:
1.2 schwarze 862: /* ARGSUSED */
863: static enum rofferr
864: roff_ccond(ROFF_ARGS)
865: {
1.1 schwarze 866:
1.2 schwarze 867: if (NULL == r->last) {
1.35 schwarze 868: mandoc_msg(MANDOCERR_NOSCOPE, r->parse, ln, ppos, NULL);
1.1 schwarze 869: return(ROFF_IGN);
1.2 schwarze 870: }
1.1 schwarze 871:
1.2 schwarze 872: switch (r->last->tok) {
873: case (ROFF_el):
874: /* FALLTHROUGH */
875: case (ROFF_ie):
876: /* FALLTHROUGH */
877: case (ROFF_if):
878: break;
879: default:
1.35 schwarze 880: mandoc_msg(MANDOCERR_NOSCOPE, r->parse, ln, ppos, NULL);
1.2 schwarze 881: return(ROFF_IGN);
882: }
1.1 schwarze 883:
1.2 schwarze 884: if (r->last->endspan > -1) {
1.35 schwarze 885: mandoc_msg(MANDOCERR_NOSCOPE, r->parse, ln, ppos, NULL);
1.1 schwarze 886: return(ROFF_IGN);
1.2 schwarze 887: }
888:
889: if ((*bufp)[pos])
1.35 schwarze 890: mandoc_msg(MANDOCERR_ARGSLOST, r->parse, ln, pos, NULL);
1.1 schwarze 891:
1.2 schwarze 892: roffnode_pop(r);
893: roffnode_cleanscope(r);
1.1 schwarze 894: return(ROFF_IGN);
895: }
896:
897:
898: /* ARGSUSED */
899: static enum rofferr
1.2 schwarze 900: roff_block(ROFF_ARGS)
1.1 schwarze 901: {
1.2 schwarze 902: int sv;
903: size_t sz;
1.16 schwarze 904: char *name;
905:
906: name = NULL;
1.2 schwarze 907:
1.16 schwarze 908: if (ROFF_ig != tok) {
909: if ('\0' == (*bufp)[pos]) {
1.35 schwarze 910: mandoc_msg(MANDOCERR_NOARGS, r->parse, ln, ppos, NULL);
1.16 schwarze 911: return(ROFF_IGN);
912: }
1.22 schwarze 913:
914: /*
915: * Re-write `de1', since we don't really care about
916: * groff's strange compatibility mode, into `de'.
917: */
918:
1.18 schwarze 919: if (ROFF_de1 == tok)
920: tok = ROFF_de;
1.16 schwarze 921: if (ROFF_de == tok)
922: name = *bufp + pos;
1.21 schwarze 923: else
1.35 schwarze 924: mandoc_msg(MANDOCERR_REQUEST, r->parse, ln, ppos,
1.21 schwarze 925: roffs[tok].name);
1.22 schwarze 926:
1.33 schwarze 927: while ((*bufp)[pos] && ! isspace((unsigned char)(*bufp)[pos]))
1.2 schwarze 928: pos++;
1.22 schwarze 929:
1.33 schwarze 930: while (isspace((unsigned char)(*bufp)[pos]))
1.16 schwarze 931: (*bufp)[pos++] = '\0';
1.2 schwarze 932: }
933:
1.16 schwarze 934: roffnode_push(r, tok, name, ln, ppos);
935:
936: /*
937: * At the beginning of a `de' macro, clear the existing string
938: * with the same name, if there is one. New content will be
939: * added from roff_block_text() in multiline mode.
940: */
1.22 schwarze 941:
1.16 schwarze 942: if (ROFF_de == tok)
1.19 schwarze 943: roff_setstr(r, name, "", 0);
1.2 schwarze 944:
945: if ('\0' == (*bufp)[pos])
946: return(ROFF_IGN);
1.1 schwarze 947:
1.22 schwarze 948: /* If present, process the custom end-of-line marker. */
949:
1.2 schwarze 950: sv = pos;
1.33 schwarze 951: while ((*bufp)[pos] && ! isspace((unsigned char)(*bufp)[pos]))
1.2 schwarze 952: pos++;
953:
954: /*
955: * Note: groff does NOT like escape characters in the input.
956: * Instead of detecting this, we're just going to let it fly and
957: * to hell with it.
958: */
959:
960: assert(pos > sv);
961: sz = (size_t)(pos - sv);
962:
963: if (1 == sz && '.' == (*bufp)[sv])
964: return(ROFF_IGN);
965:
1.11 schwarze 966: r->last->end = mandoc_malloc(sz + 1);
1.2 schwarze 967:
968: memcpy(r->last->end, *bufp + sv, sz);
969: r->last->end[(int)sz] = '\0';
970:
971: if ((*bufp)[pos])
1.35 schwarze 972: mandoc_msg(MANDOCERR_ARGSLOST, r->parse, ln, pos, NULL);
1.1 schwarze 973:
974: return(ROFF_IGN);
975: }
976:
977:
978: /* ARGSUSED */
979: static enum rofferr
1.2 schwarze 980: roff_block_sub(ROFF_ARGS)
1.1 schwarze 981: {
1.2 schwarze 982: enum rofft t;
983: int i, j;
984:
985: /*
986: * First check whether a custom macro exists at this level. If
987: * it does, then check against it. This is some of groff's
988: * stranger behaviours. If we encountered a custom end-scope
989: * tag and that tag also happens to be a "real" macro, then we
990: * need to try interpreting it again as a real macro. If it's
991: * not, then return ignore. Else continue.
992: */
993:
994: if (r->last->end) {
1.35 schwarze 995: for (i = pos, j = 0; r->last->end[j]; j++, i++)
1.2 schwarze 996: if ((*bufp)[i] != r->last->end[j])
997: break;
1.1 schwarze 998:
1.2 schwarze 999: if ('\0' == r->last->end[j] &&
1000: ('\0' == (*bufp)[i] ||
1001: ' ' == (*bufp)[i] ||
1002: '\t' == (*bufp)[i])) {
1003: roffnode_pop(r);
1004: roffnode_cleanscope(r);
1.1 schwarze 1005:
1.35 schwarze 1006: while (' ' == (*bufp)[i] || '\t' == (*bufp)[i])
1007: i++;
1008:
1009: pos = i;
1.16 schwarze 1010: if (ROFF_MAX != roff_parse(r, *bufp, &pos))
1.2 schwarze 1011: return(ROFF_RERUN);
1012: return(ROFF_IGN);
1013: }
1.1 schwarze 1014: }
1015:
1.2 schwarze 1016: /*
1017: * If we have no custom end-query or lookup failed, then try
1018: * pulling it out of the hashtable.
1019: */
1.1 schwarze 1020:
1.36 schwarze 1021: t = roff_parse(r, *bufp, &pos);
1.1 schwarze 1022:
1.16 schwarze 1023: /*
1024: * Macros other than block-end are only significant
1025: * in `de' blocks; elsewhere, simply throw them away.
1026: */
1027: if (ROFF_cblock != t) {
1028: if (ROFF_de == tok)
1029: roff_setstr(r, r->last->name, *bufp + ppos, 1);
1.1 schwarze 1030: return(ROFF_IGN);
1.16 schwarze 1031: }
1.1 schwarze 1032:
1.2 schwarze 1033: assert(roffs[t].proc);
1.6 schwarze 1034: return((*roffs[t].proc)(r, t, bufp, szp,
1035: ln, ppos, pos, offs));
1.2 schwarze 1036: }
1037:
1038:
1039: /* ARGSUSED */
1040: static enum rofferr
1041: roff_block_text(ROFF_ARGS)
1042: {
1043:
1.16 schwarze 1044: if (ROFF_de == tok)
1045: roff_setstr(r, r->last->name, *bufp + pos, 1);
1046:
1.2 schwarze 1047: return(ROFF_IGN);
1048: }
1049:
1050:
1051: /* ARGSUSED */
1052: static enum rofferr
1053: roff_cond_sub(ROFF_ARGS)
1054: {
1055: enum rofft t;
1056: enum roffrule rr;
1.37 schwarze 1057: char *ep;
1.2 schwarze 1058:
1059: rr = r->last->rule;
1.37 schwarze 1060: roffnode_cleanscope(r);
1.50 schwarze 1061: t = roff_parse(r, *bufp, &pos);
1.2 schwarze 1062:
1.37 schwarze 1063: /*
1.50 schwarze 1064: * Fully handle known macros when they are structurally
1065: * required or when the conditional evaluated to true.
1.5 schwarze 1066: */
1067:
1.50 schwarze 1068: if ((ROFF_MAX != t) &&
1069: (ROFF_ccond == t || ROFFRULE_ALLOW == rr ||
1070: ROFFMAC_STRUCT & roffs[t].flags)) {
1071: assert(roffs[t].proc);
1072: return((*roffs[t].proc)(r, t, bufp, szp,
1073: ln, ppos, pos, offs));
1074: }
1.39 schwarze 1075:
1.50 schwarze 1076: /* Always check for the closing delimiter `\}'. */
1.39 schwarze 1077:
1.50 schwarze 1078: ep = &(*bufp)[pos];
1079: while (NULL != (ep = strchr(ep, '\\'))) {
1080: if ('}' != *(++ep))
1081: continue;
1.2 schwarze 1082:
1.50 schwarze 1083: /*
1084: * If we're at the end of line, then just chop
1085: * off the \} and resize the buffer.
1086: * If we aren't, then convert it to spaces.
1087: */
1.37 schwarze 1088:
1.50 schwarze 1089: if ('\0' == *(ep + 1)) {
1090: *--ep = '\0';
1091: *szp -= 2;
1092: } else
1093: *(ep - 1) = *ep = ' ';
1.2 schwarze 1094:
1.50 schwarze 1095: roff_ccond(r, ROFF_ccond, bufp, szp,
1096: ln, pos, pos + 2, offs);
1097: break;
1098: }
1099: return(ROFFRULE_DENY == rr ? ROFF_IGN : ROFF_CONT);
1.2 schwarze 1100: }
1101:
1102: /* ARGSUSED */
1103: static enum rofferr
1104: roff_cond_text(ROFF_ARGS)
1105: {
1.37 schwarze 1106: char *ep;
1.2 schwarze 1107: enum roffrule rr;
1108:
1109: rr = r->last->rule;
1.37 schwarze 1110: roffnode_cleanscope(r);
1.1 schwarze 1111:
1.37 schwarze 1112: ep = &(*bufp)[pos];
1113: for ( ; NULL != (ep = strchr(ep, '\\')); ep++) {
1114: ep++;
1115: if ('}' != *ep)
1116: continue;
1117: *ep = '&';
1118: roff_ccond(r, ROFF_ccond, bufp, szp,
1119: ln, pos, pos + 2, offs);
1.2 schwarze 1120: }
1121: return(ROFFRULE_DENY == rr ? ROFF_IGN : ROFF_CONT);
1122: }
1123:
1.5 schwarze 1124: static enum roffrule
1125: roff_evalcond(const char *v, int *pos)
1126: {
1127:
1128: switch (v[*pos]) {
1129: case ('n'):
1130: (*pos)++;
1131: return(ROFFRULE_ALLOW);
1132: case ('e'):
1133: /* FALLTHROUGH */
1134: case ('o'):
1135: /* FALLTHROUGH */
1136: case ('t'):
1137: (*pos)++;
1138: return(ROFFRULE_DENY);
1139: default:
1140: break;
1141: }
1142:
1143: while (v[*pos] && ' ' != v[*pos])
1144: (*pos)++;
1145: return(ROFFRULE_DENY);
1146: }
1147:
1.2 schwarze 1148: /* ARGSUSED */
1149: static enum rofferr
1.21 schwarze 1150: roff_line_ignore(ROFF_ARGS)
1.6 schwarze 1151: {
1.30 schwarze 1152:
1.21 schwarze 1153: return(ROFF_IGN);
1154: }
1155:
1156: /* ARGSUSED */
1157: static enum rofferr
1.2 schwarze 1158: roff_cond(ROFF_ARGS)
1159: {
1.46 schwarze 1160:
1161: roffnode_push(r, tok, NULL, ln, ppos);
1.2 schwarze 1162:
1.35 schwarze 1163: /*
1164: * An `.el' has no conditional body: it will consume the value
1165: * of the current rstack entry set in prior `ie' calls or
1166: * defaults to DENY.
1167: *
1168: * If we're not an `el', however, then evaluate the conditional.
1169: */
1.1 schwarze 1170:
1.46 schwarze 1171: r->last->rule = ROFF_el == tok ?
1.35 schwarze 1172: (r->rstackpos < 0 ?
1173: ROFFRULE_DENY : r->rstack[r->rstackpos--]) :
1174: roff_evalcond(*bufp, &pos);
1.2 schwarze 1175:
1.35 schwarze 1176: /*
1177: * An if-else will put the NEGATION of the current evaluated
1178: * conditional into the stack of rules.
1179: */
1180:
1.2 schwarze 1181: if (ROFF_ie == tok) {
1.35 schwarze 1182: if (r->rstackpos == RSTACK_MAX - 1) {
1183: mandoc_msg(MANDOCERR_MEM,
1184: r->parse, ln, ppos, NULL);
1185: return(ROFF_ERR);
1186: }
1187: r->rstack[++r->rstackpos] =
1188: ROFFRULE_DENY == r->last->rule ?
1189: ROFFRULE_ALLOW : ROFFRULE_DENY;
1.2 schwarze 1190: }
1.5 schwarze 1191:
1192: /* If the parent has false as its rule, then so do we. */
1193:
1.2 schwarze 1194: if (r->last->parent && ROFFRULE_DENY == r->last->parent->rule)
1195: r->last->rule = ROFFRULE_DENY;
1.5 schwarze 1196:
1197: /*
1.46 schwarze 1198: * Determine scope.
1199: * If there is nothing on the line after the conditional,
1200: * not even whitespace, use next-line scope.
1.5 schwarze 1201: */
1.2 schwarze 1202:
1.46 schwarze 1203: if ('\0' == (*bufp)[pos]) {
1204: r->last->endspan = 2;
1205: goto out;
1206: }
1207:
1208: while (' ' == (*bufp)[pos])
1209: pos++;
1210:
1211: /* An opening brace requests multiline scope. */
1.2 schwarze 1212:
1213: if ('\\' == (*bufp)[pos] && '{' == (*bufp)[pos + 1]) {
1214: r->last->endspan = -1;
1215: pos += 2;
1.46 schwarze 1216: goto out;
1.2 schwarze 1217: }
1218:
1219: /*
1.46 schwarze 1220: * Anything else following the conditional causes
1221: * single-line scope. Warn if the scope contains
1222: * nothing but trailing whitespace.
1.2 schwarze 1223: */
1224:
1225: if ('\0' == (*bufp)[pos])
1.46 schwarze 1226: mandoc_msg(MANDOCERR_NOARGS, r->parse, ln, ppos, NULL);
1.2 schwarze 1227:
1.46 schwarze 1228: r->last->endspan = 1;
1.1 schwarze 1229:
1.46 schwarze 1230: out:
1.2 schwarze 1231: *offs = pos;
1232: return(ROFF_RERUN);
1.1 schwarze 1233: }
1234:
1235:
1.2 schwarze 1236: /* ARGSUSED */
1237: static enum rofferr
1.7 schwarze 1238: roff_ds(ROFF_ARGS)
1239: {
1.10 schwarze 1240: char *name, *string;
1241:
1242: /*
1243: * A symbol is named by the first word following the macro
1244: * invocation up to a space. Its value is anything after the
1245: * name's trailing whitespace and optional double-quote. Thus,
1246: *
1247: * [.ds foo "bar " ]
1248: *
1249: * will have `bar " ' as its value.
1250: */
1.7 schwarze 1251:
1.28 schwarze 1252: string = *bufp + pos;
1253: name = roff_getname(r, &string, ln, pos);
1.7 schwarze 1254: if ('\0' == *name)
1255: return(ROFF_IGN);
1256:
1.28 schwarze 1257: /* Read past initial double-quote. */
1258: if ('"' == *string)
1.7 schwarze 1259: string++;
1260:
1.10 schwarze 1261: /* The rest is the value. */
1.16 schwarze 1262: roff_setstr(r, name, string, 0);
1.7 schwarze 1263: return(ROFF_IGN);
1264: }
1265:
1.52 schwarze 1266: void
1.53 schwarze 1267: roff_setreg(struct roff *r, const char *name, int val)
1.41 schwarze 1268: {
1.52 schwarze 1269: struct roffreg *reg;
1270:
1271: /* Search for an existing register with the same name. */
1272: reg = r->regtab;
1273:
1274: while (reg && strcmp(name, reg->key.p))
1275: reg = reg->next;
1.41 schwarze 1276:
1.52 schwarze 1277: if (NULL == reg) {
1278: /* Create a new register. */
1279: reg = mandoc_malloc(sizeof(struct roffreg));
1280: reg->key.p = mandoc_strdup(name);
1281: reg->key.sz = strlen(name);
1282: reg->next = r->regtab;
1283: r->regtab = reg;
1284: }
1285:
1.53 schwarze 1286: reg->val = val;
1.41 schwarze 1287: }
1288:
1.53 schwarze 1289: int
1.52 schwarze 1290: roff_getreg(const struct roff *r, const char *name)
1.41 schwarze 1291: {
1.52 schwarze 1292: struct roffreg *reg;
1293:
1294: for (reg = r->regtab; reg; reg = reg->next)
1295: if (0 == strcmp(name, reg->key.p))
1.53 schwarze 1296: return(reg->val);
1297:
1298: return(0);
1299: }
1300:
1301: static int
1302: roff_getregn(const struct roff *r, const char *name, size_t len)
1303: {
1304: struct roffreg *reg;
1305:
1306: for (reg = r->regtab; reg; reg = reg->next)
1307: if (len == reg->key.sz &&
1308: 0 == strncmp(name, reg->key.p, len))
1309: return(reg->val);
1.41 schwarze 1310:
1.52 schwarze 1311: return(0);
1.41 schwarze 1312: }
1313:
1.52 schwarze 1314: static void
1315: roff_freereg(struct roffreg *reg)
1.41 schwarze 1316: {
1.52 schwarze 1317: struct roffreg *old_reg;
1.41 schwarze 1318:
1.52 schwarze 1319: while (NULL != reg) {
1320: free(reg->key.p);
1321: old_reg = reg;
1322: reg = reg->next;
1323: free(old_reg);
1324: }
1.41 schwarze 1325: }
1.7 schwarze 1326:
1327: /* ARGSUSED */
1328: static enum rofferr
1.6 schwarze 1329: roff_nr(ROFF_ARGS)
1.1 schwarze 1330: {
1.28 schwarze 1331: const char *key;
1332: char *val;
1.37 schwarze 1333: int iv;
1.6 schwarze 1334:
1.28 schwarze 1335: val = *bufp + pos;
1336: key = roff_getname(r, &val, ln, pos);
1.6 schwarze 1337:
1.52 schwarze 1338: iv = mandoc_strntoi(val, strlen(val), 10);
1339:
1.53 schwarze 1340: roff_setreg(r, key, iv);
1.1 schwarze 1341:
1.29 schwarze 1342: return(ROFF_IGN);
1343: }
1344:
1345: /* ARGSUSED */
1346: static enum rofferr
1347: roff_rm(ROFF_ARGS)
1348: {
1349: const char *name;
1350: char *cp;
1351:
1352: cp = *bufp + pos;
1353: while ('\0' != *cp) {
1.34 schwarze 1354: name = roff_getname(r, &cp, ln, (int)(cp - *bufp));
1.29 schwarze 1355: if ('\0' != *name)
1356: roff_setstr(r, name, NULL, 0);
1357: }
1.51 schwarze 1358: return(ROFF_IGN);
1359: }
1360:
1361: /* ARGSUSED */
1362: static enum rofferr
1363: roff_it(ROFF_ARGS)
1364: {
1365: char *cp;
1366: size_t len;
1367: int iv;
1368:
1369: /* Parse the number of lines. */
1370: cp = *bufp + pos;
1371: len = strcspn(cp, " \t");
1372: cp[len] = '\0';
1373: if ((iv = mandoc_strntoi(cp, len, 10)) <= 0) {
1374: mandoc_msg(MANDOCERR_NUMERIC, r->parse,
1375: ln, ppos, *bufp + 1);
1376: return(ROFF_IGN);
1377: }
1378: cp += len + 1;
1379:
1380: /* Arm the input line trap. */
1381: roffit_lines = iv;
1382: roffit_macro = mandoc_strdup(cp);
1.2 schwarze 1383: return(ROFF_IGN);
1.47 schwarze 1384: }
1385:
1386: /* ARGSUSED */
1387: static enum rofferr
1388: roff_Dd(ROFF_ARGS)
1389: {
1390: const char *const *cp;
1391:
1392: if (MPARSE_MDOC != r->parsetype)
1393: for (cp = __mdoc_reserved; *cp; cp++)
1394: roff_setstr(r, *cp, NULL, 0);
1395:
1396: return(ROFF_CONT);
1397: }
1398:
1399: /* ARGSUSED */
1400: static enum rofferr
1401: roff_TH(ROFF_ARGS)
1402: {
1403: const char *const *cp;
1404:
1405: if (MPARSE_MDOC != r->parsetype)
1406: for (cp = __man_reserved; *cp; cp++)
1407: roff_setstr(r, *cp, NULL, 0);
1408:
1409: return(ROFF_CONT);
1.14 schwarze 1410: }
1411:
1412: /* ARGSUSED */
1413: static enum rofferr
1.27 schwarze 1414: roff_TE(ROFF_ARGS)
1415: {
1416:
1417: if (NULL == r->tbl)
1.35 schwarze 1418: mandoc_msg(MANDOCERR_NOSCOPE, r->parse, ln, ppos, NULL);
1.27 schwarze 1419: else
1.41 schwarze 1420: tbl_end(&r->tbl);
1.27 schwarze 1421:
1422: return(ROFF_IGN);
1423: }
1424:
1425: /* ARGSUSED */
1426: static enum rofferr
1427: roff_T_(ROFF_ARGS)
1428: {
1429:
1430: if (NULL == r->tbl)
1.35 schwarze 1431: mandoc_msg(MANDOCERR_NOSCOPE, r->parse, ln, ppos, NULL);
1.27 schwarze 1432: else
1433: tbl_restart(ppos, ln, r->tbl);
1434:
1435: return(ROFF_IGN);
1436: }
1437:
1.41 schwarze 1438: #if 0
1439: static int
1440: roff_closeeqn(struct roff *r)
1441: {
1442:
1443: return(r->eqn && ROFF_EQN == eqn_end(&r->eqn) ? 1 : 0);
1444: }
1445: #endif
1446:
1447: static void
1448: roff_openeqn(struct roff *r, const char *name, int line,
1449: int offs, const char *buf)
1.32 schwarze 1450: {
1.41 schwarze 1451: struct eqn_node *e;
1452: int poff;
1.32 schwarze 1453:
1454: assert(NULL == r->eqn);
1.41 schwarze 1455: e = eqn_alloc(name, offs, line, r->parse);
1.32 schwarze 1456:
1457: if (r->last_eqn)
1458: r->last_eqn->next = e;
1459: else
1460: r->first_eqn = r->last_eqn = e;
1461:
1462: r->eqn = r->last_eqn = e;
1.41 schwarze 1463:
1464: if (buf) {
1465: poff = 0;
1466: eqn_read(&r->eqn, line, buf, offs, &poff);
1467: }
1468: }
1469:
1470: /* ARGSUSED */
1471: static enum rofferr
1472: roff_EQ(ROFF_ARGS)
1473: {
1474:
1475: roff_openeqn(r, *bufp + pos, ln, ppos, NULL);
1.32 schwarze 1476: return(ROFF_IGN);
1477: }
1478:
1479: /* ARGSUSED */
1480: static enum rofferr
1481: roff_EN(ROFF_ARGS)
1482: {
1483:
1.35 schwarze 1484: mandoc_msg(MANDOCERR_NOSCOPE, r->parse, ln, ppos, NULL);
1.32 schwarze 1485: return(ROFF_IGN);
1486: }
1487:
1488: /* ARGSUSED */
1489: static enum rofferr
1.27 schwarze 1490: roff_TS(ROFF_ARGS)
1491: {
1.49 schwarze 1492: struct tbl_node *tbl;
1.27 schwarze 1493:
1494: if (r->tbl) {
1.35 schwarze 1495: mandoc_msg(MANDOCERR_SCOPEBROKEN, r->parse, ln, ppos, NULL);
1.41 schwarze 1496: tbl_end(&r->tbl);
1.27 schwarze 1497: }
1498:
1.49 schwarze 1499: tbl = tbl_alloc(ppos, ln, r->parse);
1.27 schwarze 1500:
1501: if (r->last_tbl)
1.49 schwarze 1502: r->last_tbl->next = tbl;
1.27 schwarze 1503: else
1.49 schwarze 1504: r->first_tbl = r->last_tbl = tbl;
1.27 schwarze 1505:
1.49 schwarze 1506: r->tbl = r->last_tbl = tbl;
1.27 schwarze 1507: return(ROFF_IGN);
1508: }
1509:
1510: /* ARGSUSED */
1511: static enum rofferr
1.48 schwarze 1512: roff_cc(ROFF_ARGS)
1513: {
1514: const char *p;
1515:
1516: p = *bufp + pos;
1517:
1518: if ('\0' == *p || '.' == (r->control = *p++))
1519: r->control = 0;
1520:
1521: if ('\0' != *p)
1522: mandoc_msg(MANDOCERR_ARGCOUNT, r->parse, ln, ppos, NULL);
1523:
1524: return(ROFF_IGN);
1525: }
1526:
1527: /* ARGSUSED */
1528: static enum rofferr
1.42 schwarze 1529: roff_tr(ROFF_ARGS)
1530: {
1531: const char *p, *first, *second;
1532: size_t fsz, ssz;
1533: enum mandoc_esc esc;
1534:
1535: p = *bufp + pos;
1536:
1537: if ('\0' == *p) {
1538: mandoc_msg(MANDOCERR_ARGCOUNT, r->parse, ln, ppos, NULL);
1539: return(ROFF_IGN);
1540: }
1541:
1542: while ('\0' != *p) {
1543: fsz = ssz = 1;
1544:
1545: first = p++;
1546: if ('\\' == *first) {
1547: esc = mandoc_escape(&p, NULL, NULL);
1548: if (ESCAPE_ERROR == esc) {
1549: mandoc_msg
1550: (MANDOCERR_BADESCAPE, r->parse,
1551: ln, (int)(p - *bufp), NULL);
1552: return(ROFF_IGN);
1553: }
1554: fsz = (size_t)(p - first);
1555: }
1556:
1557: second = p++;
1558: if ('\\' == *second) {
1559: esc = mandoc_escape(&p, NULL, NULL);
1560: if (ESCAPE_ERROR == esc) {
1561: mandoc_msg
1562: (MANDOCERR_BADESCAPE, r->parse,
1563: ln, (int)(p - *bufp), NULL);
1564: return(ROFF_IGN);
1565: }
1566: ssz = (size_t)(p - second);
1567: } else if ('\0' == *second) {
1568: mandoc_msg(MANDOCERR_ARGCOUNT, r->parse,
1569: ln, (int)(p - *bufp), NULL);
1570: second = " ";
1571: p--;
1572: }
1573:
1574: if (fsz > 1) {
1575: roff_setstrn(&r->xmbtab, first,
1576: fsz, second, ssz, 0);
1577: continue;
1578: }
1579:
1580: if (NULL == r->xtab)
1581: r->xtab = mandoc_calloc
1582: (128, sizeof(struct roffstr));
1583:
1584: free(r->xtab[(int)*first].p);
1585: r->xtab[(int)*first].p = mandoc_strndup(second, ssz);
1586: r->xtab[(int)*first].sz = ssz;
1587: }
1588:
1589: return(ROFF_IGN);
1590: }
1591:
1592: /* ARGSUSED */
1593: static enum rofferr
1.14 schwarze 1594: roff_so(ROFF_ARGS)
1595: {
1596: char *name;
1.15 schwarze 1597:
1.35 schwarze 1598: mandoc_msg(MANDOCERR_SO, r->parse, ln, ppos, NULL);
1.14 schwarze 1599:
1.22 schwarze 1600: /*
1601: * Handle `so'. Be EXTREMELY careful, as we shouldn't be
1602: * opening anything that's not in our cwd or anything beneath
1603: * it. Thus, explicitly disallow traversing up the file-system
1604: * or using absolute paths.
1605: */
1606:
1.14 schwarze 1607: name = *bufp + pos;
1608: if ('/' == *name || strstr(name, "../") || strstr(name, "/..")) {
1.35 schwarze 1609: mandoc_msg(MANDOCERR_SOPATH, r->parse, ln, pos, NULL);
1.14 schwarze 1610: return(ROFF_ERR);
1611: }
1612:
1613: *offs = pos;
1614: return(ROFF_SO);
1.7 schwarze 1615: }
1616:
1.16 schwarze 1617: /* ARGSUSED */
1618: static enum rofferr
1619: roff_userdef(ROFF_ARGS)
1.12 schwarze 1620: {
1.16 schwarze 1621: const char *arg[9];
1622: char *cp, *n1, *n2;
1.25 schwarze 1623: int i;
1.12 schwarze 1624:
1.16 schwarze 1625: /*
1626: * Collect pointers to macro argument strings
1627: * and null-terminate them.
1628: */
1629: cp = *bufp + pos;
1.25 schwarze 1630: for (i = 0; i < 9; i++)
1.26 schwarze 1631: arg[i] = '\0' == *cp ? "" :
1.35 schwarze 1632: mandoc_getarg(r->parse, &cp, ln, &pos);
1.16 schwarze 1633:
1634: /*
1635: * Expand macro arguments.
1.12 schwarze 1636: */
1.16 schwarze 1637: *szp = 0;
1638: n1 = cp = mandoc_strdup(r->current_string);
1639: while (NULL != (cp = strstr(cp, "\\$"))) {
1640: i = cp[2] - '1';
1641: if (0 > i || 8 < i) {
1642: /* Not an argument invocation. */
1643: cp += 2;
1644: continue;
1645: }
1646:
1647: *szp = strlen(n1) - 3 + strlen(arg[i]) + 1;
1648: n2 = mandoc_malloc(*szp);
1649:
1650: strlcpy(n2, n1, (size_t)(cp - n1 + 1));
1651: strlcat(n2, arg[i], *szp);
1652: strlcat(n2, cp + 3, *szp);
1653:
1654: cp = n2 + (cp - n1);
1655: free(n1);
1656: n1 = n2;
1.12 schwarze 1657: }
1658:
1.16 schwarze 1659: /*
1660: * Replace the macro invocation
1661: * by the expanded macro.
1662: */
1663: free(*bufp);
1664: *bufp = n1;
1665: if (0 == *szp)
1666: *szp = strlen(*bufp) + 1;
1667:
1.19 schwarze 1668: return(*szp > 1 && '\n' == (*bufp)[(int)*szp - 2] ?
1.16 schwarze 1669: ROFF_REPARSE : ROFF_APPEND);
1.12 schwarze 1670: }
1.28 schwarze 1671:
1672: static char *
1673: roff_getname(struct roff *r, char **cpp, int ln, int pos)
1674: {
1675: char *name, *cp;
1676:
1677: name = *cpp;
1678: if ('\0' == *name)
1679: return(name);
1680:
1681: /* Read until end of name. */
1682: for (cp = name; '\0' != *cp && ' ' != *cp; cp++) {
1683: if ('\\' != *cp)
1684: continue;
1685: cp++;
1686: if ('\\' == *cp)
1687: continue;
1.35 schwarze 1688: mandoc_msg(MANDOCERR_NAMESC, r->parse, ln, pos, NULL);
1.28 schwarze 1689: *cp = '\0';
1690: name = cp;
1691: }
1692:
1693: /* Nil-terminate name. */
1694: if ('\0' != *cp)
1695: *(cp++) = '\0';
1696:
1697: /* Read past spaces. */
1698: while (' ' == *cp)
1699: cp++;
1700:
1701: *cpp = cp;
1702: return(name);
1703: }
1704:
1.16 schwarze 1705: /*
1706: * Store *string into the user-defined string called *name.
1707: * In multiline mode, append to an existing entry and append '\n';
1708: * else replace the existing entry, if there is one.
1709: * To clear an existing entry, call with (*r, *name, NULL, 0).
1710: */
1.8 schwarze 1711: static void
1.16 schwarze 1712: roff_setstr(struct roff *r, const char *name, const char *string,
1713: int multiline)
1.7 schwarze 1714: {
1.42 schwarze 1715:
1716: roff_setstrn(&r->strtab, name, strlen(name), string,
1717: string ? strlen(string) : 0, multiline);
1718: }
1719:
1720: static void
1721: roff_setstrn(struct roffkv **r, const char *name, size_t namesz,
1722: const char *string, size_t stringsz, int multiline)
1723: {
1724: struct roffkv *n;
1725: char *c;
1726: int i;
1727: size_t oldch, newch;
1.7 schwarze 1728:
1.16 schwarze 1729: /* Search for an existing string with the same name. */
1.42 schwarze 1730: n = *r;
1731:
1732: while (n && strcmp(name, n->key.p))
1.7 schwarze 1733: n = n->next;
1.8 schwarze 1734:
1735: if (NULL == n) {
1.16 schwarze 1736: /* Create a new string table entry. */
1.42 schwarze 1737: n = mandoc_malloc(sizeof(struct roffkv));
1738: n->key.p = mandoc_strndup(name, namesz);
1739: n->key.sz = namesz;
1740: n->val.p = NULL;
1741: n->val.sz = 0;
1742: n->next = *r;
1743: *r = n;
1.16 schwarze 1744: } else if (0 == multiline) {
1745: /* In multiline mode, append; else replace. */
1.42 schwarze 1746: free(n->val.p);
1747: n->val.p = NULL;
1748: n->val.sz = 0;
1.16 schwarze 1749: }
1750:
1751: if (NULL == string)
1752: return;
1753:
1754: /*
1755: * One additional byte for the '\n' in multiline mode,
1756: * and one for the terminating '\0'.
1757: */
1.42 schwarze 1758: newch = stringsz + (multiline ? 2u : 1u);
1759:
1760: if (NULL == n->val.p) {
1761: n->val.p = mandoc_malloc(newch);
1762: *n->val.p = '\0';
1.16 schwarze 1763: oldch = 0;
1764: } else {
1.42 schwarze 1765: oldch = n->val.sz;
1766: n->val.p = mandoc_realloc(n->val.p, oldch + newch);
1.16 schwarze 1767: }
1768:
1769: /* Skip existing content in the destination buffer. */
1.42 schwarze 1770: c = n->val.p + (int)oldch;
1.16 schwarze 1771:
1772: /* Append new content to the destination buffer. */
1.42 schwarze 1773: i = 0;
1774: while (i < (int)stringsz) {
1.16 schwarze 1775: /*
1776: * Rudimentary roff copy mode:
1777: * Handle escaped backslashes.
1778: */
1.42 schwarze 1779: if ('\\' == string[i] && '\\' == string[i + 1])
1780: i++;
1781: *c++ = string[i++];
1.16 schwarze 1782: }
1.8 schwarze 1783:
1.16 schwarze 1784: /* Append terminating bytes. */
1785: if (multiline)
1786: *c++ = '\n';
1.42 schwarze 1787:
1.16 schwarze 1788: *c = '\0';
1.42 schwarze 1789: n->val.sz = (int)(c - n->val.p);
1.7 schwarze 1790: }
1791:
1.8 schwarze 1792: static const char *
1793: roff_getstrn(const struct roff *r, const char *name, size_t len)
1.7 schwarze 1794: {
1.42 schwarze 1795: const struct roffkv *n;
1.7 schwarze 1796:
1.42 schwarze 1797: for (n = r->strtab; n; n = n->next)
1798: if (0 == strncmp(name, n->key.p, len) &&
1799: '\0' == n->key.p[(int)len])
1800: return(n->val.p);
1.8 schwarze 1801:
1.42 schwarze 1802: return(NULL);
1.7 schwarze 1803: }
1804:
1.8 schwarze 1805: static void
1.42 schwarze 1806: roff_freestr(struct roffkv *r)
1.7 schwarze 1807: {
1.42 schwarze 1808: struct roffkv *n, *nn;
1.7 schwarze 1809:
1.42 schwarze 1810: for (n = r; n; n = nn) {
1811: free(n->key.p);
1812: free(n->val.p);
1.7 schwarze 1813: nn = n->next;
1814: free(n);
1815: }
1.27 schwarze 1816: }
1817:
1818: const struct tbl_span *
1819: roff_span(const struct roff *r)
1820: {
1821:
1822: return(r->tbl ? tbl_span(r->tbl) : NULL);
1.32 schwarze 1823: }
1824:
1825: const struct eqn *
1826: roff_eqn(const struct roff *r)
1827: {
1828:
1829: return(r->last_eqn ? &r->last_eqn->eqn : NULL);
1.42 schwarze 1830: }
1831:
1832: /*
1833: * Duplicate an input string, making the appropriate character
1834: * conversations (as stipulated by `tr') along the way.
1835: * Returns a heap-allocated string with all the replacements made.
1836: */
1837: char *
1838: roff_strdup(const struct roff *r, const char *p)
1839: {
1840: const struct roffkv *cp;
1841: char *res;
1842: const char *pp;
1843: size_t ssz, sz;
1844: enum mandoc_esc esc;
1845:
1846: if (NULL == r->xmbtab && NULL == r->xtab)
1847: return(mandoc_strdup(p));
1848: else if ('\0' == *p)
1849: return(mandoc_strdup(""));
1850:
1851: /*
1852: * Step through each character looking for term matches
1853: * (remember that a `tr' can be invoked with an escape, which is
1854: * a glyph but the escape is multi-character).
1855: * We only do this if the character hash has been initialised
1856: * and the string is >0 length.
1857: */
1858:
1859: res = NULL;
1860: ssz = 0;
1861:
1862: while ('\0' != *p) {
1863: if ('\\' != *p && r->xtab && r->xtab[(int)*p].p) {
1864: sz = r->xtab[(int)*p].sz;
1865: res = mandoc_realloc(res, ssz + sz + 1);
1866: memcpy(res + ssz, r->xtab[(int)*p].p, sz);
1867: ssz += sz;
1868: p++;
1869: continue;
1870: } else if ('\\' != *p) {
1871: res = mandoc_realloc(res, ssz + 2);
1872: res[ssz++] = *p++;
1873: continue;
1874: }
1875:
1876: /* Search for term matches. */
1877: for (cp = r->xmbtab; cp; cp = cp->next)
1878: if (0 == strncmp(p, cp->key.p, cp->key.sz))
1879: break;
1880:
1881: if (NULL != cp) {
1882: /*
1883: * A match has been found.
1884: * Append the match to the array and move
1885: * forward by its keysize.
1886: */
1887: res = mandoc_realloc
1888: (res, ssz + cp->val.sz + 1);
1889: memcpy(res + ssz, cp->val.p, cp->val.sz);
1890: ssz += cp->val.sz;
1891: p += (int)cp->key.sz;
1892: continue;
1893: }
1894:
1895: /*
1896: * Handle escapes carefully: we need to copy
1897: * over just the escape itself, or else we might
1898: * do replacements within the escape itself.
1899: * Make sure to pass along the bogus string.
1900: */
1901: pp = p++;
1902: esc = mandoc_escape(&p, NULL, NULL);
1903: if (ESCAPE_ERROR == esc) {
1904: sz = strlen(pp);
1905: res = mandoc_realloc(res, ssz + sz + 1);
1906: memcpy(res + ssz, pp, sz);
1907: break;
1908: }
1909: /*
1910: * We bail out on bad escapes.
1911: * No need to warn: we already did so when
1912: * roff_res() was called.
1913: */
1914: sz = (int)(p - pp);
1915: res = mandoc_realloc(res, ssz + sz + 1);
1916: memcpy(res + ssz, pp, sz);
1917: ssz += sz;
1918: }
1919:
1920: res[(int)ssz] = '\0';
1921: return(res);
1.48 schwarze 1922: }
1923:
1924: /*
1925: * Find out whether a line is a macro line or not.
1926: * If it is, adjust the current position and return one; if it isn't,
1927: * return zero and don't change the current position.
1928: * If the control character has been set with `.cc', then let that grain
1929: * precedence.
1930: * This is slighly contrary to groff, where using the non-breaking
1931: * control character when `cc' has been invoked will cause the
1932: * non-breaking macro contents to be printed verbatim.
1933: */
1934: int
1935: roff_getcontrol(const struct roff *r, const char *cp, int *ppos)
1936: {
1937: int pos;
1938:
1939: pos = *ppos;
1940:
1941: if (0 != r->control && cp[pos] == r->control)
1942: pos++;
1943: else if (0 != r->control)
1944: return(0);
1945: else if ('\\' == cp[pos] && '.' == cp[pos + 1])
1946: pos += 2;
1947: else if ('.' == cp[pos] || '\'' == cp[pos])
1948: pos++;
1949: else
1950: return(0);
1951:
1952: while (' ' == cp[pos] || '\t' == cp[pos])
1953: pos++;
1954:
1955: *ppos = pos;
1956: return(1);
1.1 schwarze 1957: }