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