Annotation of src/usr.bin/mandoc/roff.c, Revision 1.91
1.91 ! schwarze 1: /* $Id: roff.c,v 1.90 2014/07/04 16:11:41 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 */
1.91 ! schwarze 499: int arg_complete; /* argument not interrupted by eol */
1.79 schwarze 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.91 ! schwarze 584: arg_complete = 1;
1.53 schwarze 585: for (naml = 0; 0 == maxl || naml < maxl; naml++, cp++) {
1.42 schwarze 586: if ('\0' == *cp) {
1.80 schwarze 587: mandoc_msg(MANDOCERR_BADESCAPE, r->parse,
588: ln, (int)(stesc - *bufp), NULL);
1.91 ! schwarze 589: arg_complete = 0;
1.79 schwarze 590: break;
1.42 schwarze 591: }
1.79 schwarze 592: if (0 == maxl && *cp == term) {
593: cp++;
1.8 schwarze 594: break;
1.79 schwarze 595: }
1.8 schwarze 596: }
597:
1.23 schwarze 598: /*
599: * Retrieve the replacement string; if it is
600: * undefined, resume searching for escapes.
601: */
602:
1.79 schwarze 603: switch (stesc[1]) {
1.80 schwarze 604: case '*':
1.91 ! schwarze 605: if (arg_complete)
! 606: res = roff_getstrn(r, stnam, naml);
1.79 schwarze 607: break;
1.80 schwarze 608: case 'B':
1.79 schwarze 609: npos = 0;
1.91 ! schwarze 610: ubuf[0] = arg_complete &&
! 611: roff_evalnum(stnam, &npos, NULL, 0) &&
! 612: stnam + npos + 1 == cp ? '1' : '0';
1.79 schwarze 613: ubuf[1] = '\0';
614: break;
1.80 schwarze 615: case 'n':
1.91 ! schwarze 616: if (arg_complete)
! 617: (void)snprintf(ubuf, sizeof(ubuf), "%d",
! 618: roff_getregn(r, stnam, naml));
! 619: else
! 620: ubuf[0] = '\0';
1.79 schwarze 621: break;
1.80 schwarze 622: case 'w':
1.91 ! schwarze 623: /* use even incomplete args */
1.81 schwarze 624: (void)snprintf(ubuf, sizeof(ubuf), "%d",
1.79 schwarze 625: 24 * (int)naml);
626: break;
627: }
1.8 schwarze 628:
629: if (NULL == res) {
1.80 schwarze 630: mandoc_msg(MANDOCERR_BADESCAPE, r->parse,
631: ln, (int)(stesc - *bufp), NULL);
1.37 schwarze 632: res = "";
1.8 schwarze 633: }
634:
1.23 schwarze 635: /* Replace the escape sequence by the string. */
636:
1.82 schwarze 637: *stesc = '\0';
638: *szp = mandoc_asprintf(&nbuf, "%s%s%s",
639: *bufp, res, cp) + 1;
1.8 schwarze 640:
1.78 schwarze 641: /* Prepare for the next replacement. */
1.8 schwarze 642:
1.78 schwarze 643: start = nbuf + pos;
1.82 schwarze 644: stesc = nbuf + (stesc - *bufp) + strlen(res);
1.8 schwarze 645: free(*bufp);
1.53 schwarze 646: *bufp = nbuf;
1.42 schwarze 647: }
1.45 schwarze 648: return(ROFF_CONT);
1.42 schwarze 649: }
650:
651: /*
1.51 schwarze 652: * Process text streams:
653: * Convert all breakable hyphens into ASCII_HYPH.
654: * Decrement and spring input line trap.
1.42 schwarze 655: */
656: static enum rofferr
1.51 schwarze 657: roff_parsetext(char **bufp, size_t *szp, int pos, int *offs)
1.42 schwarze 658: {
659: size_t sz;
660: const char *start;
1.51 schwarze 661: char *p;
662: int isz;
1.42 schwarze 663: enum mandoc_esc esc;
664:
1.51 schwarze 665: start = p = *bufp + pos;
1.42 schwarze 666:
667: while ('\0' != *p) {
668: sz = strcspn(p, "-\\");
669: p += sz;
670:
671: if ('\0' == *p)
672: break;
673:
674: if ('\\' == *p) {
675: /* Skip over escapes. */
676: p++;
1.62 schwarze 677: esc = mandoc_escape((const char **)&p, NULL, NULL);
1.42 schwarze 678: if (ESCAPE_ERROR == esc)
679: break;
680: continue;
681: } else if (p == start) {
682: p++;
683: continue;
684: }
685:
1.44 schwarze 686: if (isalpha((unsigned char)p[-1]) &&
687: isalpha((unsigned char)p[1]))
1.42 schwarze 688: *p = ASCII_HYPH;
689: p++;
1.8 schwarze 690: }
691:
1.51 schwarze 692: /* Spring the input line trap. */
693: if (1 == roffit_lines) {
1.75 schwarze 694: isz = mandoc_asprintf(&p, "%s\n.%s", *bufp, roffit_macro);
1.51 schwarze 695: free(*bufp);
696: *bufp = p;
697: *szp = isz + 1;
698: *offs = 0;
699: free(roffit_macro);
700: roffit_lines = 0;
701: return(ROFF_REPARSE);
702: } else if (1 < roffit_lines)
703: --roffit_lines;
1.42 schwarze 704: return(ROFF_CONT);
1.8 schwarze 705: }
706:
1.1 schwarze 707: enum rofferr
1.80 schwarze 708: roff_parseln(struct roff *r, int ln, char **bufp,
1.6 schwarze 709: size_t *szp, int pos, int *offs)
1.1 schwarze 710: {
711: enum rofft t;
1.27 schwarze 712: enum rofferr e;
1.35 schwarze 713: int ppos, ctl;
1.1 schwarze 714:
1.2 schwarze 715: /*
1.8 schwarze 716: * Run the reserved-word filter only if we have some reserved
717: * words to fill in.
718: */
719:
1.45 schwarze 720: e = roff_res(r, bufp, szp, ln, pos);
721: if (ROFF_IGN == e)
722: return(e);
723: assert(ROFF_CONT == e);
1.8 schwarze 724:
1.35 schwarze 725: ppos = pos;
1.48 schwarze 726: ctl = roff_getcontrol(r, *bufp, &pos);
1.35 schwarze 727:
1.8 schwarze 728: /*
1.2 schwarze 729: * First, if a scope is open and we're not a macro, pass the
730: * text through the macro's filter. If a scope isn't open and
731: * we're not a macro, just let it through.
1.32 schwarze 732: * Finally, if there's an equation scope open, divert it into it
733: * no matter our state.
1.2 schwarze 734: */
735:
1.35 schwarze 736: if (r->last && ! ctl) {
1.2 schwarze 737: t = r->last->tok;
738: assert(roffs[t].text);
1.80 schwarze 739: e = (*roffs[t].text)(r, t, bufp, szp, ln, pos, pos, offs);
1.27 schwarze 740: assert(ROFF_IGN == e || ROFF_CONT == e);
1.32 schwarze 741: if (ROFF_CONT != e)
742: return(e);
1.54 schwarze 743: }
744: if (r->eqn)
745: return(eqn_read(&r->eqn, ln, *bufp, ppos, offs));
746: if ( ! ctl) {
1.32 schwarze 747: if (r->tbl)
1.35 schwarze 748: return(tbl_read(r->tbl, ln, *bufp, pos));
1.51 schwarze 749: return(roff_parsetext(bufp, szp, pos, offs));
1.54 schwarze 750: }
1.2 schwarze 751:
752: /*
753: * If a scope is open, go to the child handler for that macro,
754: * as it may want to preprocess before doing anything with it.
1.32 schwarze 755: * Don't do so if an equation is open.
1.2 schwarze 756: */
757:
758: if (r->last) {
1.1 schwarze 759: t = r->last->tok;
760: assert(roffs[t].sub);
1.80 schwarze 761: return((*roffs[t].sub)(r, t, bufp, szp,
762: ln, ppos, pos, offs));
1.2 schwarze 763: }
764:
765: /*
766: * Lastly, as we've no scope open, try to look up and execute
767: * the new macro. If no macro is found, simply return and let
768: * the compilers handle it.
769: */
770:
1.87 schwarze 771: if (ROFF_MAX == (t = roff_parse(r, *bufp, &pos, ln, ppos)))
1.1 schwarze 772: return(ROFF_CONT);
773:
1.2 schwarze 774: assert(roffs[t].proc);
1.80 schwarze 775: return((*roffs[t].proc)(r, t, bufp, szp, ln, ppos, pos, offs));
1.2 schwarze 776: }
777:
1.27 schwarze 778: void
1.2 schwarze 779: roff_endparse(struct roff *r)
780: {
1.1 schwarze 781:
1.27 schwarze 782: if (r->last)
1.35 schwarze 783: mandoc_msg(MANDOCERR_SCOPEEXIT, r->parse,
1.80 schwarze 784: r->last->line, r->last->col, NULL);
1.27 schwarze 785:
1.32 schwarze 786: if (r->eqn) {
1.80 schwarze 787: mandoc_msg(MANDOCERR_SCOPEEXIT, r->parse,
788: r->eqn->eqn.ln, r->eqn->eqn.pos, NULL);
1.41 schwarze 789: eqn_end(&r->eqn);
1.32 schwarze 790: }
791:
1.27 schwarze 792: if (r->tbl) {
1.80 schwarze 793: mandoc_msg(MANDOCERR_SCOPEEXIT, r->parse,
794: r->tbl->line, r->tbl->pos, NULL);
1.41 schwarze 795: tbl_end(&r->tbl);
1.27 schwarze 796: }
1.1 schwarze 797: }
798:
799: /*
800: * Parse a roff node's type from the input buffer. This must be in the
801: * form of ".foo xxx" in the usual way.
802: */
803: static enum rofft
1.87 schwarze 804: roff_parse(struct roff *r, char *buf, int *pos, int ln, int ppos)
1.1 schwarze 805: {
1.87 schwarze 806: char *cp;
1.16 schwarze 807: const char *mac;
808: size_t maclen;
1.1 schwarze 809: enum rofft t;
810:
1.87 schwarze 811: cp = buf + *pos;
812:
813: if ('\0' == *cp || '"' == *cp || '\t' == *cp || ' ' == *cp)
1.1 schwarze 814: return(ROFF_MAX);
815:
1.87 schwarze 816: mac = cp;
817: maclen = roff_getname(r, &cp, ln, ppos);
1.1 schwarze 818:
1.16 schwarze 819: t = (r->current_string = roff_getstrn(r, mac, maclen))
1.42 schwarze 820: ? ROFF_USERDEF : roffhash_find(mac, maclen);
1.1 schwarze 821:
1.87 schwarze 822: if (ROFF_MAX != t)
823: *pos = cp - buf;
1.1 schwarze 824:
825: return(t);
826: }
827:
828: static enum rofferr
1.2 schwarze 829: roff_cblock(ROFF_ARGS)
1.1 schwarze 830: {
831:
1.2 schwarze 832: /*
833: * A block-close `..' should only be invoked as a child of an
834: * ignore macro, otherwise raise a warning and just ignore it.
835: */
836:
837: if (NULL == r->last) {
1.35 schwarze 838: mandoc_msg(MANDOCERR_NOSCOPE, r->parse, ln, ppos, NULL);
1.2 schwarze 839: return(ROFF_IGN);
840: }
1.1 schwarze 841:
1.2 schwarze 842: switch (r->last->tok) {
1.80 schwarze 843: case ROFF_am:
1.2 schwarze 844: /* FALLTHROUGH */
1.80 schwarze 845: case ROFF_ami:
1.2 schwarze 846: /* FALLTHROUGH */
1.80 schwarze 847: case ROFF_am1:
1.2 schwarze 848: /* FALLTHROUGH */
1.80 schwarze 849: case ROFF_de:
1.23 schwarze 850: /* ROFF_de1 is remapped to ROFF_de in roff_block(). */
1.2 schwarze 851: /* FALLTHROUGH */
1.80 schwarze 852: case ROFF_dei:
1.2 schwarze 853: /* FALLTHROUGH */
1.80 schwarze 854: case ROFF_ig:
1.2 schwarze 855: break;
856: default:
1.35 schwarze 857: mandoc_msg(MANDOCERR_NOSCOPE, r->parse, ln, ppos, NULL);
1.1 schwarze 858: return(ROFF_IGN);
1.2 schwarze 859: }
860:
861: if ((*bufp)[pos])
1.90 schwarze 862: mandoc_vmsg(MANDOCERR_ARG_SKIP, r->parse, ln, pos,
863: ".. %s", *bufp + pos);
1.2 schwarze 864:
865: roffnode_pop(r);
866: roffnode_cleanscope(r);
867: return(ROFF_IGN);
868:
869: }
1.1 schwarze 870:
1.2 schwarze 871: static void
872: roffnode_cleanscope(struct roff *r)
873: {
1.1 schwarze 874:
1.2 schwarze 875: while (r->last) {
1.46 schwarze 876: if (--r->last->endspan != 0)
1.2 schwarze 877: break;
878: roffnode_pop(r);
879: }
880: }
1.1 schwarze 881:
1.68 schwarze 882: static void
883: roff_ccond(struct roff *r, int ln, int ppos)
1.2 schwarze 884: {
1.1 schwarze 885:
1.2 schwarze 886: if (NULL == r->last) {
1.35 schwarze 887: mandoc_msg(MANDOCERR_NOSCOPE, r->parse, ln, ppos, NULL);
1.68 schwarze 888: return;
1.2 schwarze 889: }
1.1 schwarze 890:
1.2 schwarze 891: switch (r->last->tok) {
1.80 schwarze 892: case ROFF_el:
1.2 schwarze 893: /* FALLTHROUGH */
1.80 schwarze 894: case ROFF_ie:
1.2 schwarze 895: /* FALLTHROUGH */
1.80 schwarze 896: case ROFF_if:
1.2 schwarze 897: break;
898: default:
1.35 schwarze 899: mandoc_msg(MANDOCERR_NOSCOPE, r->parse, ln, ppos, NULL);
1.68 schwarze 900: return;
1.2 schwarze 901: }
1.1 schwarze 902:
1.2 schwarze 903: if (r->last->endspan > -1) {
1.35 schwarze 904: mandoc_msg(MANDOCERR_NOSCOPE, r->parse, ln, ppos, NULL);
1.68 schwarze 905: return;
1.2 schwarze 906: }
907:
908: roffnode_pop(r);
909: roffnode_cleanscope(r);
1.68 schwarze 910: return;
1.1 schwarze 911: }
912:
913: static enum rofferr
1.2 schwarze 914: roff_block(ROFF_ARGS)
1.1 schwarze 915: {
1.86 schwarze 916: char *name, *cp;
917: size_t namesz;
1.16 schwarze 918:
1.86 schwarze 919: name = cp = *bufp + pos;
920: namesz = 0;
1.2 schwarze 921:
1.16 schwarze 922: if (ROFF_ig != tok) {
1.86 schwarze 923: if ('\0' == *cp) {
1.89 schwarze 924: mandoc_msg(MANDOCERR_REQ_EMPTY, r->parse,
925: ln, ppos, roffs[tok].name);
1.16 schwarze 926: return(ROFF_IGN);
927: }
1.22 schwarze 928:
929: /*
930: * Re-write `de1', since we don't really care about
931: * groff's strange compatibility mode, into `de'.
932: */
933:
1.18 schwarze 934: if (ROFF_de1 == tok)
935: tok = ROFF_de;
1.86 schwarze 936: else if (ROFF_de != tok)
1.35 schwarze 937: mandoc_msg(MANDOCERR_REQUEST, r->parse, ln, ppos,
1.21 schwarze 938: roffs[tok].name);
1.22 schwarze 939:
1.86 schwarze 940: namesz = roff_getname(r, &cp, ln, ppos);
941: name[namesz] = '\0';
942: } else
943: name = NULL;
1.2 schwarze 944:
1.16 schwarze 945: roffnode_push(r, tok, name, ln, ppos);
946:
947: /*
948: * At the beginning of a `de' macro, clear the existing string
949: * with the same name, if there is one. New content will be
1.66 schwarze 950: * appended from roff_block_text() in multiline mode.
1.16 schwarze 951: */
1.22 schwarze 952:
1.86 schwarze 953: if (namesz && ROFF_de == tok)
954: roff_setstrn(&r->strtab, name, namesz, "", 0, 0);
1.2 schwarze 955:
1.86 schwarze 956: if ('\0' == *cp)
1.2 schwarze 957: return(ROFF_IGN);
1.1 schwarze 958:
1.22 schwarze 959: /* If present, process the custom end-of-line marker. */
960:
1.86 schwarze 961: name = cp;
962: namesz = roff_getname(r, &cp, ln, ppos);
963: if (namesz)
964: r->last->end = mandoc_strndup(name, namesz);
1.2 schwarze 965:
1.86 schwarze 966: if ('\0' != *cp)
1.90 schwarze 967: mandoc_vmsg(MANDOCERR_ARG_EXCESS, r->parse,
968: ln, pos, ".%s ... %s", roffs[tok].name, cp);
1.1 schwarze 969:
970: return(ROFF_IGN);
971: }
972:
973: static enum rofferr
1.2 schwarze 974: roff_block_sub(ROFF_ARGS)
1.1 schwarze 975: {
1.2 schwarze 976: enum rofft t;
977: int i, j;
978:
979: /*
980: * First check whether a custom macro exists at this level. If
981: * it does, then check against it. This is some of groff's
982: * stranger behaviours. If we encountered a custom end-scope
983: * tag and that tag also happens to be a "real" macro, then we
984: * need to try interpreting it again as a real macro. If it's
985: * not, then return ignore. Else continue.
986: */
987:
988: if (r->last->end) {
1.35 schwarze 989: for (i = pos, j = 0; r->last->end[j]; j++, i++)
1.2 schwarze 990: if ((*bufp)[i] != r->last->end[j])
991: break;
1.1 schwarze 992:
1.80 schwarze 993: if ('\0' == r->last->end[j] &&
994: ('\0' == (*bufp)[i] ||
995: ' ' == (*bufp)[i] ||
996: '\t' == (*bufp)[i])) {
1.2 schwarze 997: roffnode_pop(r);
998: roffnode_cleanscope(r);
1.1 schwarze 999:
1.35 schwarze 1000: while (' ' == (*bufp)[i] || '\t' == (*bufp)[i])
1001: i++;
1002:
1003: pos = i;
1.87 schwarze 1004: if (ROFF_MAX != roff_parse(r, *bufp, &pos, ln, ppos))
1.2 schwarze 1005: return(ROFF_RERUN);
1006: return(ROFF_IGN);
1007: }
1.1 schwarze 1008: }
1009:
1.2 schwarze 1010: /*
1011: * If we have no custom end-query or lookup failed, then try
1012: * pulling it out of the hashtable.
1013: */
1.1 schwarze 1014:
1.87 schwarze 1015: t = roff_parse(r, *bufp, &pos, ln, ppos);
1.1 schwarze 1016:
1.16 schwarze 1017: /*
1018: * Macros other than block-end are only significant
1019: * in `de' blocks; elsewhere, simply throw them away.
1020: */
1021: if (ROFF_cblock != t) {
1022: if (ROFF_de == tok)
1.66 schwarze 1023: roff_setstr(r, r->last->name, *bufp + ppos, 2);
1.1 schwarze 1024: return(ROFF_IGN);
1.16 schwarze 1025: }
1.1 schwarze 1026:
1.2 schwarze 1027: assert(roffs[t].proc);
1.80 schwarze 1028: return((*roffs[t].proc)(r, t, bufp, szp, ln, ppos, pos, offs));
1.2 schwarze 1029: }
1030:
1031: static enum rofferr
1032: roff_block_text(ROFF_ARGS)
1033: {
1034:
1.16 schwarze 1035: if (ROFF_de == tok)
1.66 schwarze 1036: roff_setstr(r, r->last->name, *bufp + pos, 2);
1.16 schwarze 1037:
1.2 schwarze 1038: return(ROFF_IGN);
1039: }
1040:
1041: static enum rofferr
1042: roff_cond_sub(ROFF_ARGS)
1043: {
1044: enum rofft t;
1.37 schwarze 1045: char *ep;
1.71 schwarze 1046: int rr;
1.2 schwarze 1047:
1048: rr = r->last->rule;
1.37 schwarze 1049: roffnode_cleanscope(r);
1.87 schwarze 1050: t = roff_parse(r, *bufp, &pos, ln, ppos);
1.2 schwarze 1051:
1.37 schwarze 1052: /*
1.50 schwarze 1053: * Fully handle known macros when they are structurally
1054: * required or when the conditional evaluated to true.
1.5 schwarze 1055: */
1056:
1.50 schwarze 1057: if ((ROFF_MAX != t) &&
1.71 schwarze 1058: (rr || ROFFMAC_STRUCT & roffs[t].flags)) {
1.50 schwarze 1059: assert(roffs[t].proc);
1060: return((*roffs[t].proc)(r, t, bufp, szp,
1.80 schwarze 1061: ln, ppos, pos, offs));
1.50 schwarze 1062: }
1.39 schwarze 1063:
1.69 schwarze 1064: /*
1065: * If `\}' occurs on a macro line without a preceding macro,
1066: * drop the line completely.
1067: */
1068:
1069: ep = *bufp + pos;
1070: if ('\\' == ep[0] && '}' == ep[1])
1.71 schwarze 1071: rr = 0;
1.69 schwarze 1072:
1.50 schwarze 1073: /* Always check for the closing delimiter `\}'. */
1.39 schwarze 1074:
1.50 schwarze 1075: while (NULL != (ep = strchr(ep, '\\'))) {
1.70 schwarze 1076: if ('}' == *(++ep)) {
1077: *ep = '&';
1078: roff_ccond(r, ln, ep - *bufp - 1);
1079: }
1080: ++ep;
1.50 schwarze 1081: }
1.71 schwarze 1082: return(rr ? ROFF_CONT : ROFF_IGN);
1.2 schwarze 1083: }
1084:
1085: static enum rofferr
1086: roff_cond_text(ROFF_ARGS)
1087: {
1.37 schwarze 1088: char *ep;
1.71 schwarze 1089: int rr;
1.2 schwarze 1090:
1091: rr = r->last->rule;
1.37 schwarze 1092: roffnode_cleanscope(r);
1.1 schwarze 1093:
1.70 schwarze 1094: ep = *bufp + pos;
1095: while (NULL != (ep = strchr(ep, '\\'))) {
1096: if ('}' == *(++ep)) {
1097: *ep = '&';
1098: roff_ccond(r, ln, ep - *bufp - 1);
1099: }
1100: ++ep;
1.2 schwarze 1101: }
1.71 schwarze 1102: return(rr ? ROFF_CONT : ROFF_IGN);
1.2 schwarze 1103: }
1104:
1.77 schwarze 1105: /*
1106: * Parse a single signed integer number. Stop at the first non-digit.
1107: * If there is at least one digit, return success and advance the
1108: * parse point, else return failure and let the parse point unchanged.
1109: * Ignore overflows, treat them just like the C language.
1110: */
1.56 schwarze 1111: static int
1112: roff_getnum(const char *v, int *pos, int *res)
1113: {
1.79 schwarze 1114: int myres, n, p;
1115:
1116: if (NULL == res)
1117: res = &myres;
1.56 schwarze 1118:
1119: p = *pos;
1120: n = v[p] == '-';
1121: if (n)
1122: p++;
1123:
1124: for (*res = 0; isdigit((unsigned char)v[p]); p++)
1.77 schwarze 1125: *res = 10 * *res + v[p] - '0';
1.56 schwarze 1126: if (p == *pos + n)
1127: return 0;
1128:
1129: if (n)
1130: *res = -*res;
1131:
1132: *pos = p;
1133: return 1;
1134: }
1135:
1.71 schwarze 1136: /*
1137: * Evaluate a string comparison condition.
1138: * The first character is the delimiter.
1139: * Succeed if the string up to its second occurrence
1140: * matches the string up to its third occurence.
1141: * Advance the cursor after the third occurrence
1142: * or lacking that, to the end of the line.
1143: */
1144: static int
1145: roff_evalstrcond(const char *v, int *pos)
1146: {
1147: const char *s1, *s2, *s3;
1148: int match;
1149:
1150: match = 0;
1151: s1 = v + *pos; /* initial delimiter */
1152: s2 = s1 + 1; /* for scanning the first string */
1153: s3 = strchr(s2, *s1); /* for scanning the second string */
1154:
1155: if (NULL == s3) /* found no middle delimiter */
1156: goto out;
1157:
1158: while ('\0' != *++s3) {
1159: if (*s2 != *s3) { /* mismatch */
1160: s3 = strchr(s3, *s1);
1161: break;
1162: }
1163: if (*s3 == *s1) { /* found the final delimiter */
1164: match = 1;
1165: break;
1166: }
1167: s2++;
1168: }
1169:
1170: out:
1171: if (NULL == s3)
1172: s3 = strchr(s2, '\0');
1173: else
1174: s3++;
1175: *pos = s3 - v;
1176: return(match);
1177: }
1178:
1.77 schwarze 1179: /*
1180: * Evaluate an optionally negated single character, numerical,
1181: * or string condition.
1182: */
1.71 schwarze 1183: static int
1.5 schwarze 1184: roff_evalcond(const char *v, int *pos)
1185: {
1.77 schwarze 1186: int wanttrue, number;
1.5 schwarze 1187:
1.71 schwarze 1188: if ('!' == v[*pos]) {
1189: wanttrue = 0;
1190: (*pos)++;
1191: } else
1192: wanttrue = 1;
1193:
1.5 schwarze 1194: switch (v[*pos]) {
1.80 schwarze 1195: case 'n':
1.71 schwarze 1196: /* FALLTHROUGH */
1.80 schwarze 1197: case 'o':
1.5 schwarze 1198: (*pos)++;
1.71 schwarze 1199: return(wanttrue);
1.80 schwarze 1200: case 'c':
1.71 schwarze 1201: /* FALLTHROUGH */
1.80 schwarze 1202: case 'd':
1.71 schwarze 1203: /* FALLTHROUGH */
1.80 schwarze 1204: case 'e':
1.5 schwarze 1205: /* FALLTHROUGH */
1.80 schwarze 1206: case 'r':
1.5 schwarze 1207: /* FALLTHROUGH */
1.80 schwarze 1208: case 't':
1.5 schwarze 1209: (*pos)++;
1.71 schwarze 1210: return(!wanttrue);
1.5 schwarze 1211: default:
1212: break;
1213: }
1214:
1.77 schwarze 1215: if (roff_evalnum(v, pos, &number, 0))
1216: return((number > 0) == wanttrue);
1217: else
1.71 schwarze 1218: return(roff_evalstrcond(v, pos) == wanttrue);
1.5 schwarze 1219: }
1220:
1.2 schwarze 1221: static enum rofferr
1.21 schwarze 1222: roff_line_ignore(ROFF_ARGS)
1.6 schwarze 1223: {
1.30 schwarze 1224:
1.21 schwarze 1225: return(ROFF_IGN);
1226: }
1227:
1228: static enum rofferr
1.2 schwarze 1229: roff_cond(ROFF_ARGS)
1230: {
1.46 schwarze 1231:
1232: roffnode_push(r, tok, NULL, ln, ppos);
1.2 schwarze 1233:
1.80 schwarze 1234: /*
1.35 schwarze 1235: * An `.el' has no conditional body: it will consume the value
1236: * of the current rstack entry set in prior `ie' calls or
1.80 schwarze 1237: * defaults to DENY.
1.35 schwarze 1238: *
1239: * If we're not an `el', however, then evaluate the conditional.
1240: */
1.1 schwarze 1241:
1.46 schwarze 1242: r->last->rule = ROFF_el == tok ?
1.80 schwarze 1243: (r->rstackpos < 0 ? 0 : r->rstack[r->rstackpos--]) :
1244: roff_evalcond(*bufp, &pos);
1.2 schwarze 1245:
1.35 schwarze 1246: /*
1247: * An if-else will put the NEGATION of the current evaluated
1248: * conditional into the stack of rules.
1249: */
1250:
1.2 schwarze 1251: if (ROFF_ie == tok) {
1.35 schwarze 1252: if (r->rstackpos == RSTACK_MAX - 1) {
1.80 schwarze 1253: mandoc_msg(MANDOCERR_MEM,
1254: r->parse, ln, ppos, NULL);
1.35 schwarze 1255: return(ROFF_ERR);
1256: }
1.71 schwarze 1257: r->rstack[++r->rstackpos] = !r->last->rule;
1.2 schwarze 1258: }
1.5 schwarze 1259:
1260: /* If the parent has false as its rule, then so do we. */
1261:
1.71 schwarze 1262: if (r->last->parent && !r->last->parent->rule)
1263: r->last->rule = 0;
1.5 schwarze 1264:
1265: /*
1.46 schwarze 1266: * Determine scope.
1267: * If there is nothing on the line after the conditional,
1268: * not even whitespace, use next-line scope.
1.5 schwarze 1269: */
1.2 schwarze 1270:
1.46 schwarze 1271: if ('\0' == (*bufp)[pos]) {
1272: r->last->endspan = 2;
1273: goto out;
1274: }
1275:
1276: while (' ' == (*bufp)[pos])
1277: pos++;
1278:
1279: /* An opening brace requests multiline scope. */
1.2 schwarze 1280:
1281: if ('\\' == (*bufp)[pos] && '{' == (*bufp)[pos + 1]) {
1282: r->last->endspan = -1;
1283: pos += 2;
1.46 schwarze 1284: goto out;
1.80 schwarze 1285: }
1.2 schwarze 1286:
1287: /*
1.46 schwarze 1288: * Anything else following the conditional causes
1289: * single-line scope. Warn if the scope contains
1290: * nothing but trailing whitespace.
1.2 schwarze 1291: */
1292:
1293: if ('\0' == (*bufp)[pos])
1.89 schwarze 1294: mandoc_msg(MANDOCERR_COND_EMPTY, r->parse,
1295: ln, ppos, roffs[tok].name);
1.2 schwarze 1296:
1.46 schwarze 1297: r->last->endspan = 1;
1.1 schwarze 1298:
1.46 schwarze 1299: out:
1.2 schwarze 1300: *offs = pos;
1301: return(ROFF_RERUN);
1.1 schwarze 1302: }
1303:
1.2 schwarze 1304: static enum rofferr
1.7 schwarze 1305: roff_ds(ROFF_ARGS)
1306: {
1.85 schwarze 1307: char *string;
1308: const char *name;
1309: size_t namesz;
1.10 schwarze 1310:
1311: /*
1.85 schwarze 1312: * The first word is the name of the string.
1313: * If it is empty or terminated by an escape sequence,
1314: * abort the `ds' request without defining anything.
1.10 schwarze 1315: */
1.7 schwarze 1316:
1.85 schwarze 1317: name = string = *bufp + pos;
1.7 schwarze 1318: if ('\0' == *name)
1319: return(ROFF_IGN);
1320:
1.85 schwarze 1321: namesz = roff_getname(r, &string, ln, pos);
1322: if ('\\' == name[namesz])
1323: return(ROFF_IGN);
1324:
1325: /* Read past the initial double-quote, if any. */
1.28 schwarze 1326: if ('"' == *string)
1.7 schwarze 1327: string++;
1328:
1.10 schwarze 1329: /* The rest is the value. */
1.85 schwarze 1330: roff_setstrn(&r->strtab, name, namesz, string, strlen(string),
1331: ROFF_as == tok);
1.7 schwarze 1332: return(ROFF_IGN);
1333: }
1334:
1.77 schwarze 1335: /*
1336: * Parse a single operator, one or two characters long.
1337: * If the operator is recognized, return success and advance the
1338: * parse point, else return failure and let the parse point unchanged.
1339: */
1340: static int
1341: roff_getop(const char *v, int *pos, char *res)
1342: {
1343:
1344: *res = v[*pos];
1345:
1346: switch (*res) {
1.80 schwarze 1347: case '+':
1.77 schwarze 1348: /* FALLTHROUGH */
1.80 schwarze 1349: case '-':
1.77 schwarze 1350: /* FALLTHROUGH */
1.80 schwarze 1351: case '*':
1.77 schwarze 1352: /* FALLTHROUGH */
1.80 schwarze 1353: case '/':
1.77 schwarze 1354: /* FALLTHROUGH */
1.80 schwarze 1355: case '%':
1.77 schwarze 1356: /* FALLTHROUGH */
1.80 schwarze 1357: case '&':
1.77 schwarze 1358: /* FALLTHROUGH */
1.80 schwarze 1359: case ':':
1.77 schwarze 1360: break;
1361: case '<':
1362: switch (v[*pos + 1]) {
1.80 schwarze 1363: case '=':
1.77 schwarze 1364: *res = 'l';
1365: (*pos)++;
1366: break;
1.80 schwarze 1367: case '>':
1.77 schwarze 1368: *res = '!';
1369: (*pos)++;
1370: break;
1.80 schwarze 1371: case '?':
1.77 schwarze 1372: *res = 'i';
1373: (*pos)++;
1374: break;
1375: default:
1376: break;
1377: }
1378: break;
1379: case '>':
1380: switch (v[*pos + 1]) {
1.80 schwarze 1381: case '=':
1.77 schwarze 1382: *res = 'g';
1383: (*pos)++;
1384: break;
1.80 schwarze 1385: case '?':
1.77 schwarze 1386: *res = 'a';
1387: (*pos)++;
1388: break;
1389: default:
1390: break;
1391: }
1392: break;
1393: case '=':
1394: if ('=' == v[*pos + 1])
1395: (*pos)++;
1396: break;
1397: default:
1398: return(0);
1399: }
1400: (*pos)++;
1401:
1402: return(*res);
1403: }
1404:
1405: /*
1406: * Evaluate either a parenthesized numeric expression
1407: * or a single signed integer number.
1408: */
1409: static int
1410: roff_evalpar(const char *v, int *pos, int *res)
1411: {
1412:
1413: if ('(' != v[*pos])
1414: return(roff_getnum(v, pos, res));
1415:
1416: (*pos)++;
1417: if ( ! roff_evalnum(v, pos, res, 1))
1418: return(0);
1419:
1.79 schwarze 1420: /*
1421: * Omission of the closing parenthesis
1422: * is an error in validation mode,
1423: * but ignored in evaluation mode.
1424: */
1425:
1.77 schwarze 1426: if (')' == v[*pos])
1427: (*pos)++;
1.79 schwarze 1428: else if (NULL == res)
1429: return(0);
1.77 schwarze 1430:
1431: return(1);
1432: }
1433:
1434: /*
1435: * Evaluate a complete numeric expression.
1436: * Proceed left to right, there is no concept of precedence.
1437: */
1438: static int
1439: roff_evalnum(const char *v, int *pos, int *res, int skipwhite)
1440: {
1441: int mypos, operand2;
1442: char operator;
1443:
1444: if (NULL == pos) {
1445: mypos = 0;
1446: pos = &mypos;
1447: }
1448:
1449: if (skipwhite)
1450: while (isspace((unsigned char)v[*pos]))
1451: (*pos)++;
1452:
1453: if ( ! roff_evalpar(v, pos, res))
1454: return(0);
1455:
1456: while (1) {
1457: if (skipwhite)
1458: while (isspace((unsigned char)v[*pos]))
1459: (*pos)++;
1460:
1461: if ( ! roff_getop(v, pos, &operator))
1462: break;
1463:
1464: if (skipwhite)
1465: while (isspace((unsigned char)v[*pos]))
1466: (*pos)++;
1467:
1468: if ( ! roff_evalpar(v, pos, &operand2))
1469: return(0);
1470:
1471: if (skipwhite)
1472: while (isspace((unsigned char)v[*pos]))
1473: (*pos)++;
1.79 schwarze 1474:
1475: if (NULL == res)
1476: continue;
1.77 schwarze 1477:
1478: switch (operator) {
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 *= operand2;
1487: break;
1.80 schwarze 1488: case '/':
1.77 schwarze 1489: *res /= operand2;
1490: break;
1.80 schwarze 1491: case '%':
1.77 schwarze 1492: *res %= operand2;
1493: break;
1.80 schwarze 1494: case '<':
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 'l':
1.77 schwarze 1501: *res = *res <= operand2;
1502: break;
1.80 schwarze 1503: case 'g':
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 '!':
1.77 schwarze 1510: *res = *res != operand2;
1511: break;
1.80 schwarze 1512: case '&':
1.77 schwarze 1513: *res = *res && operand2;
1514: break;
1.80 schwarze 1515: case ':':
1.77 schwarze 1516: *res = *res || operand2;
1517: break;
1.80 schwarze 1518: case 'i':
1.77 schwarze 1519: if (operand2 < *res)
1520: *res = operand2;
1521: break;
1.80 schwarze 1522: case 'a':
1.77 schwarze 1523: if (operand2 > *res)
1524: *res = operand2;
1525: break;
1526: default:
1527: abort();
1528: }
1529: }
1530: return(1);
1531: }
1532:
1.52 schwarze 1533: void
1.60 schwarze 1534: roff_setreg(struct roff *r, const char *name, int val, char sign)
1.41 schwarze 1535: {
1.52 schwarze 1536: struct roffreg *reg;
1537:
1538: /* Search for an existing register with the same name. */
1539: reg = r->regtab;
1540:
1541: while (reg && strcmp(name, reg->key.p))
1542: reg = reg->next;
1.41 schwarze 1543:
1.52 schwarze 1544: if (NULL == reg) {
1545: /* Create a new register. */
1546: reg = mandoc_malloc(sizeof(struct roffreg));
1547: reg->key.p = mandoc_strdup(name);
1548: reg->key.sz = strlen(name);
1.60 schwarze 1549: reg->val = 0;
1.52 schwarze 1550: reg->next = r->regtab;
1551: r->regtab = reg;
1552: }
1553:
1.60 schwarze 1554: if ('+' == sign)
1555: reg->val += val;
1556: else if ('-' == sign)
1557: reg->val -= val;
1558: else
1559: reg->val = val;
1.41 schwarze 1560: }
1561:
1.65 schwarze 1562: /*
1563: * Handle some predefined read-only number registers.
1564: * For now, return -1 if the requested register is not predefined;
1565: * in case a predefined read-only register having the value -1
1566: * were to turn up, another special value would have to be chosen.
1567: */
1568: static int
1569: roff_getregro(const char *name)
1570: {
1571:
1572: switch (*name) {
1.80 schwarze 1573: case 'A': /* ASCII approximation mode is always off. */
1.65 schwarze 1574: return(0);
1.80 schwarze 1575: case 'g': /* Groff compatibility mode is always on. */
1.65 schwarze 1576: return(1);
1.80 schwarze 1577: case 'H': /* Fixed horizontal resolution. */
1.65 schwarze 1578: return (24);
1.80 schwarze 1579: case 'j': /* Always adjust left margin only. */
1.65 schwarze 1580: return(0);
1.80 schwarze 1581: case 'T': /* Some output device is always defined. */
1.65 schwarze 1582: return(1);
1.80 schwarze 1583: case 'V': /* Fixed vertical resolution. */
1.65 schwarze 1584: return (40);
1585: default:
1586: return (-1);
1587: }
1588: }
1589:
1.53 schwarze 1590: int
1.52 schwarze 1591: roff_getreg(const struct roff *r, const char *name)
1.41 schwarze 1592: {
1.52 schwarze 1593: struct roffreg *reg;
1.65 schwarze 1594: int val;
1595:
1596: if ('.' == name[0] && '\0' != name[1] && '\0' == name[2]) {
1597: val = roff_getregro(name + 1);
1598: if (-1 != val)
1599: return (val);
1600: }
1.52 schwarze 1601:
1602: for (reg = r->regtab; reg; reg = reg->next)
1603: if (0 == strcmp(name, reg->key.p))
1.53 schwarze 1604: return(reg->val);
1605:
1606: return(0);
1607: }
1608:
1609: static int
1610: roff_getregn(const struct roff *r, const char *name, size_t len)
1611: {
1612: struct roffreg *reg;
1.65 schwarze 1613: int val;
1614:
1615: if ('.' == name[0] && 2 == len) {
1616: val = roff_getregro(name + 1);
1617: if (-1 != val)
1618: return (val);
1619: }
1.53 schwarze 1620:
1621: for (reg = r->regtab; reg; reg = reg->next)
1622: if (len == reg->key.sz &&
1623: 0 == strncmp(name, reg->key.p, len))
1624: return(reg->val);
1.41 schwarze 1625:
1.52 schwarze 1626: return(0);
1.41 schwarze 1627: }
1628:
1.52 schwarze 1629: static void
1630: roff_freereg(struct roffreg *reg)
1.41 schwarze 1631: {
1.52 schwarze 1632: struct roffreg *old_reg;
1.41 schwarze 1633:
1.52 schwarze 1634: while (NULL != reg) {
1635: free(reg->key.p);
1636: old_reg = reg;
1637: reg = reg->next;
1638: free(old_reg);
1639: }
1.41 schwarze 1640: }
1.7 schwarze 1641:
1642: static enum rofferr
1.6 schwarze 1643: roff_nr(ROFF_ARGS)
1.1 schwarze 1644: {
1.85 schwarze 1645: char *key, *val;
1646: size_t keysz;
1.37 schwarze 1647: int iv;
1.60 schwarze 1648: char sign;
1.6 schwarze 1649:
1.85 schwarze 1650: key = val = *bufp + pos;
1651: if ('\0' == *key)
1652: return(ROFF_IGN);
1653:
1654: keysz = roff_getname(r, &val, ln, pos);
1655: if ('\\' == key[keysz])
1656: return(ROFF_IGN);
1657: key[keysz] = '\0';
1.6 schwarze 1658:
1.60 schwarze 1659: sign = *val;
1660: if ('+' == sign || '-' == sign)
1661: val++;
1662:
1.77 schwarze 1663: if (roff_evalnum(val, NULL, &iv, 0))
1664: roff_setreg(r, key, iv, sign);
1.1 schwarze 1665:
1.76 schwarze 1666: return(ROFF_IGN);
1667: }
1668:
1669: static enum rofferr
1670: roff_rr(ROFF_ARGS)
1671: {
1672: struct roffreg *reg, **prev;
1.85 schwarze 1673: char *name, *cp;
1674: size_t namesz;
1.76 schwarze 1675:
1.85 schwarze 1676: name = cp = *bufp + pos;
1677: if ('\0' == *name)
1678: return(ROFF_IGN);
1679: namesz = roff_getname(r, &cp, ln, pos);
1680: name[namesz] = '\0';
1.76 schwarze 1681:
1682: prev = &r->regtab;
1683: while (1) {
1684: reg = *prev;
1685: if (NULL == reg || !strcmp(name, reg->key.p))
1686: break;
1687: prev = ®->next;
1688: }
1689: if (NULL != reg) {
1690: *prev = reg->next;
1691: free(reg->key.p);
1692: free(reg);
1693: }
1.29 schwarze 1694: return(ROFF_IGN);
1695: }
1696:
1697: static enum rofferr
1698: roff_rm(ROFF_ARGS)
1699: {
1700: const char *name;
1701: char *cp;
1.85 schwarze 1702: size_t namesz;
1.29 schwarze 1703:
1704: cp = *bufp + pos;
1705: while ('\0' != *cp) {
1.85 schwarze 1706: name = cp;
1707: namesz = roff_getname(r, &cp, ln, (int)(cp - *bufp));
1708: roff_setstrn(&r->strtab, name, namesz, NULL, 0, 0);
1709: if ('\\' == name[namesz])
1710: break;
1.29 schwarze 1711: }
1.51 schwarze 1712: return(ROFF_IGN);
1713: }
1714:
1715: static enum rofferr
1716: roff_it(ROFF_ARGS)
1717: {
1718: char *cp;
1719: size_t len;
1720: int iv;
1721:
1722: /* Parse the number of lines. */
1723: cp = *bufp + pos;
1724: len = strcspn(cp, " \t");
1725: cp[len] = '\0';
1726: if ((iv = mandoc_strntoi(cp, len, 10)) <= 0) {
1727: mandoc_msg(MANDOCERR_NUMERIC, r->parse,
1.80 schwarze 1728: ln, ppos, *bufp + 1);
1.51 schwarze 1729: return(ROFF_IGN);
1730: }
1731: cp += len + 1;
1732:
1733: /* Arm the input line trap. */
1734: roffit_lines = iv;
1735: roffit_macro = mandoc_strdup(cp);
1.2 schwarze 1736: return(ROFF_IGN);
1.47 schwarze 1737: }
1738:
1739: static enum rofferr
1740: roff_Dd(ROFF_ARGS)
1741: {
1742: const char *const *cp;
1743:
1.72 schwarze 1744: if (0 == ((MPARSE_MDOC | MPARSE_QUICK) & r->options))
1.47 schwarze 1745: for (cp = __mdoc_reserved; *cp; cp++)
1746: roff_setstr(r, *cp, NULL, 0);
1747:
1748: return(ROFF_CONT);
1749: }
1750:
1751: static enum rofferr
1752: roff_TH(ROFF_ARGS)
1753: {
1754: const char *const *cp;
1755:
1.72 schwarze 1756: if (0 == (MPARSE_QUICK & r->options))
1.47 schwarze 1757: for (cp = __man_reserved; *cp; cp++)
1758: roff_setstr(r, *cp, NULL, 0);
1759:
1760: return(ROFF_CONT);
1.14 schwarze 1761: }
1762:
1763: static enum rofferr
1.27 schwarze 1764: roff_TE(ROFF_ARGS)
1765: {
1766:
1767: if (NULL == r->tbl)
1.35 schwarze 1768: mandoc_msg(MANDOCERR_NOSCOPE, r->parse, ln, ppos, NULL);
1.27 schwarze 1769: else
1.41 schwarze 1770: tbl_end(&r->tbl);
1.27 schwarze 1771:
1772: return(ROFF_IGN);
1773: }
1774:
1775: static enum rofferr
1776: roff_T_(ROFF_ARGS)
1777: {
1778:
1779: if (NULL == r->tbl)
1.35 schwarze 1780: mandoc_msg(MANDOCERR_NOSCOPE, r->parse, ln, ppos, NULL);
1.27 schwarze 1781: else
1782: tbl_restart(ppos, ln, r->tbl);
1783:
1784: return(ROFF_IGN);
1785: }
1786:
1.41 schwarze 1787: #if 0
1788: static int
1789: roff_closeeqn(struct roff *r)
1790: {
1791:
1792: return(r->eqn && ROFF_EQN == eqn_end(&r->eqn) ? 1 : 0);
1793: }
1794: #endif
1795:
1796: static void
1.80 schwarze 1797: roff_openeqn(struct roff *r, const char *name, int line,
1.41 schwarze 1798: int offs, const char *buf)
1.32 schwarze 1799: {
1.41 schwarze 1800: struct eqn_node *e;
1801: int poff;
1.32 schwarze 1802:
1803: assert(NULL == r->eqn);
1.41 schwarze 1804: e = eqn_alloc(name, offs, line, r->parse);
1.32 schwarze 1805:
1806: if (r->last_eqn)
1807: r->last_eqn->next = e;
1808: else
1809: r->first_eqn = r->last_eqn = e;
1810:
1811: r->eqn = r->last_eqn = e;
1.41 schwarze 1812:
1813: if (buf) {
1814: poff = 0;
1815: eqn_read(&r->eqn, line, buf, offs, &poff);
1816: }
1817: }
1818:
1819: static enum rofferr
1820: roff_EQ(ROFF_ARGS)
1821: {
1822:
1823: roff_openeqn(r, *bufp + pos, ln, ppos, NULL);
1.32 schwarze 1824: return(ROFF_IGN);
1825: }
1826:
1827: static enum rofferr
1828: roff_EN(ROFF_ARGS)
1829: {
1830:
1.35 schwarze 1831: mandoc_msg(MANDOCERR_NOSCOPE, r->parse, ln, ppos, NULL);
1.32 schwarze 1832: return(ROFF_IGN);
1833: }
1834:
1835: static enum rofferr
1.27 schwarze 1836: roff_TS(ROFF_ARGS)
1837: {
1.49 schwarze 1838: struct tbl_node *tbl;
1.27 schwarze 1839:
1840: if (r->tbl) {
1.35 schwarze 1841: mandoc_msg(MANDOCERR_SCOPEBROKEN, r->parse, ln, ppos, NULL);
1.41 schwarze 1842: tbl_end(&r->tbl);
1.27 schwarze 1843: }
1844:
1.49 schwarze 1845: tbl = tbl_alloc(ppos, ln, r->parse);
1.27 schwarze 1846:
1847: if (r->last_tbl)
1.49 schwarze 1848: r->last_tbl->next = tbl;
1.27 schwarze 1849: else
1.49 schwarze 1850: r->first_tbl = r->last_tbl = tbl;
1.27 schwarze 1851:
1.49 schwarze 1852: r->tbl = r->last_tbl = tbl;
1.27 schwarze 1853: return(ROFF_IGN);
1854: }
1855:
1856: static enum rofferr
1.48 schwarze 1857: roff_cc(ROFF_ARGS)
1858: {
1859: const char *p;
1860:
1861: p = *bufp + pos;
1862:
1863: if ('\0' == *p || '.' == (r->control = *p++))
1864: r->control = 0;
1865:
1866: if ('\0' != *p)
1867: mandoc_msg(MANDOCERR_ARGCOUNT, r->parse, ln, ppos, NULL);
1868:
1869: return(ROFF_IGN);
1870: }
1871:
1872: static enum rofferr
1.42 schwarze 1873: roff_tr(ROFF_ARGS)
1874: {
1875: const char *p, *first, *second;
1876: size_t fsz, ssz;
1877: enum mandoc_esc esc;
1878:
1879: p = *bufp + pos;
1880:
1881: if ('\0' == *p) {
1882: mandoc_msg(MANDOCERR_ARGCOUNT, r->parse, ln, ppos, NULL);
1883: return(ROFF_IGN);
1884: }
1885:
1886: while ('\0' != *p) {
1887: fsz = ssz = 1;
1888:
1889: first = p++;
1890: if ('\\' == *first) {
1891: esc = mandoc_escape(&p, NULL, NULL);
1892: if (ESCAPE_ERROR == esc) {
1.80 schwarze 1893: mandoc_msg(MANDOCERR_BADESCAPE,
1894: r->parse, ln,
1895: (int)(p - *bufp), NULL);
1.42 schwarze 1896: return(ROFF_IGN);
1897: }
1898: fsz = (size_t)(p - first);
1899: }
1900:
1901: second = p++;
1902: if ('\\' == *second) {
1903: esc = mandoc_escape(&p, NULL, NULL);
1904: if (ESCAPE_ERROR == esc) {
1.80 schwarze 1905: mandoc_msg(MANDOCERR_BADESCAPE,
1906: r->parse, ln,
1907: (int)(p - *bufp), NULL);
1.42 schwarze 1908: return(ROFF_IGN);
1909: }
1910: ssz = (size_t)(p - second);
1911: } else if ('\0' == *second) {
1.80 schwarze 1912: mandoc_msg(MANDOCERR_ARGCOUNT, r->parse,
1913: ln, (int)(p - *bufp), NULL);
1.42 schwarze 1914: second = " ";
1915: p--;
1916: }
1917:
1918: if (fsz > 1) {
1.80 schwarze 1919: roff_setstrn(&r->xmbtab, first, fsz,
1920: second, ssz, 0);
1.42 schwarze 1921: continue;
1922: }
1923:
1924: if (NULL == r->xtab)
1.80 schwarze 1925: r->xtab = mandoc_calloc(128,
1926: sizeof(struct roffstr));
1.42 schwarze 1927:
1928: free(r->xtab[(int)*first].p);
1929: r->xtab[(int)*first].p = mandoc_strndup(second, ssz);
1930: r->xtab[(int)*first].sz = ssz;
1931: }
1932:
1933: return(ROFF_IGN);
1934: }
1935:
1936: static enum rofferr
1.14 schwarze 1937: roff_so(ROFF_ARGS)
1938: {
1939: char *name;
1.15 schwarze 1940:
1.83 schwarze 1941: name = *bufp + pos;
1942: mandoc_vmsg(MANDOCERR_SO, r->parse, ln, ppos, ".so %s", name);
1.14 schwarze 1943:
1.22 schwarze 1944: /*
1945: * Handle `so'. Be EXTREMELY careful, as we shouldn't be
1946: * opening anything that's not in our cwd or anything beneath
1947: * it. Thus, explicitly disallow traversing up the file-system
1948: * or using absolute paths.
1949: */
1950:
1.14 schwarze 1951: if ('/' == *name || strstr(name, "../") || strstr(name, "/..")) {
1.83 schwarze 1952: mandoc_vmsg(MANDOCERR_SO_PATH, r->parse, ln, ppos,
1953: ".so %s", name);
1.14 schwarze 1954: return(ROFF_ERR);
1955: }
1956:
1957: *offs = pos;
1958: return(ROFF_SO);
1.7 schwarze 1959: }
1960:
1.16 schwarze 1961: static enum rofferr
1962: roff_userdef(ROFF_ARGS)
1.12 schwarze 1963: {
1.16 schwarze 1964: const char *arg[9];
1965: char *cp, *n1, *n2;
1.25 schwarze 1966: int i;
1.12 schwarze 1967:
1.16 schwarze 1968: /*
1969: * Collect pointers to macro argument strings
1.61 schwarze 1970: * and NUL-terminate them.
1.16 schwarze 1971: */
1972: cp = *bufp + pos;
1.25 schwarze 1973: for (i = 0; i < 9; i++)
1.26 schwarze 1974: arg[i] = '\0' == *cp ? "" :
1.35 schwarze 1975: mandoc_getarg(r->parse, &cp, ln, &pos);
1.16 schwarze 1976:
1977: /*
1978: * Expand macro arguments.
1.12 schwarze 1979: */
1.16 schwarze 1980: *szp = 0;
1981: n1 = cp = mandoc_strdup(r->current_string);
1982: while (NULL != (cp = strstr(cp, "\\$"))) {
1983: i = cp[2] - '1';
1984: if (0 > i || 8 < i) {
1985: /* Not an argument invocation. */
1986: cp += 2;
1987: continue;
1988: }
1.82 schwarze 1989: *cp = '\0';
1990: *szp = mandoc_asprintf(&n2, "%s%s%s",
1991: n1, arg[i], cp + 3) + 1;
1.16 schwarze 1992: cp = n2 + (cp - n1);
1993: free(n1);
1994: n1 = n2;
1.12 schwarze 1995: }
1996:
1.16 schwarze 1997: /*
1998: * Replace the macro invocation
1999: * by the expanded macro.
2000: */
2001: free(*bufp);
2002: *bufp = n1;
2003: if (0 == *szp)
2004: *szp = strlen(*bufp) + 1;
2005:
1.19 schwarze 2006: return(*szp > 1 && '\n' == (*bufp)[(int)*szp - 2] ?
1.16 schwarze 2007: ROFF_REPARSE : ROFF_APPEND);
1.12 schwarze 2008: }
1.28 schwarze 2009:
1.85 schwarze 2010: static size_t
1.28 schwarze 2011: roff_getname(struct roff *r, char **cpp, int ln, int pos)
2012: {
2013: char *name, *cp;
1.85 schwarze 2014: size_t namesz;
1.28 schwarze 2015:
2016: name = *cpp;
2017: if ('\0' == *name)
1.85 schwarze 2018: return(0);
1.28 schwarze 2019:
1.85 schwarze 2020: /* Read until end of name and terminate it with NUL. */
2021: for (cp = name; 1; cp++) {
2022: if ('\0' == *cp || ' ' == *cp) {
2023: namesz = cp - name;
2024: break;
2025: }
1.28 schwarze 2026: if ('\\' != *cp)
2027: continue;
1.88 schwarze 2028: namesz = cp - name;
2029: if ('{' == cp[1] || '}' == cp[1])
2030: break;
1.28 schwarze 2031: cp++;
2032: if ('\\' == *cp)
2033: continue;
1.35 schwarze 2034: mandoc_msg(MANDOCERR_NAMESC, r->parse, ln, pos, NULL);
1.85 schwarze 2035: mandoc_escape((const char **)&cp, NULL, NULL);
2036: break;
1.28 schwarze 2037: }
2038:
2039: /* Read past spaces. */
2040: while (' ' == *cp)
2041: cp++;
2042:
2043: *cpp = cp;
1.85 schwarze 2044: return(namesz);
1.28 schwarze 2045: }
2046:
1.16 schwarze 2047: /*
2048: * Store *string into the user-defined string called *name.
2049: * To clear an existing entry, call with (*r, *name, NULL, 0).
1.66 schwarze 2050: * append == 0: replace mode
2051: * append == 1: single-line append mode
2052: * append == 2: multiline append mode, append '\n' after each call
1.16 schwarze 2053: */
1.8 schwarze 2054: static void
1.16 schwarze 2055: roff_setstr(struct roff *r, const char *name, const char *string,
1.66 schwarze 2056: int append)
1.7 schwarze 2057: {
1.42 schwarze 2058:
2059: roff_setstrn(&r->strtab, name, strlen(name), string,
1.80 schwarze 2060: string ? strlen(string) : 0, append);
1.42 schwarze 2061: }
2062:
2063: static void
2064: roff_setstrn(struct roffkv **r, const char *name, size_t namesz,
1.66 schwarze 2065: const char *string, size_t stringsz, int append)
1.42 schwarze 2066: {
2067: struct roffkv *n;
2068: char *c;
2069: int i;
2070: size_t oldch, newch;
1.7 schwarze 2071:
1.16 schwarze 2072: /* Search for an existing string with the same name. */
1.42 schwarze 2073: n = *r;
2074:
1.84 schwarze 2075: while (n && (namesz != n->key.sz ||
2076: strncmp(n->key.p, name, namesz)))
1.7 schwarze 2077: n = n->next;
1.8 schwarze 2078:
2079: if (NULL == n) {
1.16 schwarze 2080: /* Create a new string table entry. */
1.42 schwarze 2081: n = mandoc_malloc(sizeof(struct roffkv));
2082: n->key.p = mandoc_strndup(name, namesz);
2083: n->key.sz = namesz;
2084: n->val.p = NULL;
2085: n->val.sz = 0;
2086: n->next = *r;
2087: *r = n;
1.66 schwarze 2088: } else if (0 == append) {
1.42 schwarze 2089: free(n->val.p);
2090: n->val.p = NULL;
2091: n->val.sz = 0;
1.16 schwarze 2092: }
2093:
2094: if (NULL == string)
2095: return;
2096:
2097: /*
2098: * One additional byte for the '\n' in multiline mode,
2099: * and one for the terminating '\0'.
2100: */
1.66 schwarze 2101: newch = stringsz + (1 < append ? 2u : 1u);
1.42 schwarze 2102:
2103: if (NULL == n->val.p) {
2104: n->val.p = mandoc_malloc(newch);
2105: *n->val.p = '\0';
1.16 schwarze 2106: oldch = 0;
2107: } else {
1.42 schwarze 2108: oldch = n->val.sz;
2109: n->val.p = mandoc_realloc(n->val.p, oldch + newch);
1.16 schwarze 2110: }
2111:
2112: /* Skip existing content in the destination buffer. */
1.42 schwarze 2113: c = n->val.p + (int)oldch;
1.16 schwarze 2114:
2115: /* Append new content to the destination buffer. */
1.42 schwarze 2116: i = 0;
2117: while (i < (int)stringsz) {
1.16 schwarze 2118: /*
2119: * Rudimentary roff copy mode:
2120: * Handle escaped backslashes.
2121: */
1.42 schwarze 2122: if ('\\' == string[i] && '\\' == string[i + 1])
2123: i++;
2124: *c++ = string[i++];
1.16 schwarze 2125: }
1.8 schwarze 2126:
1.16 schwarze 2127: /* Append terminating bytes. */
1.66 schwarze 2128: if (1 < append)
1.16 schwarze 2129: *c++ = '\n';
1.42 schwarze 2130:
1.16 schwarze 2131: *c = '\0';
1.42 schwarze 2132: n->val.sz = (int)(c - n->val.p);
1.7 schwarze 2133: }
2134:
1.8 schwarze 2135: static const char *
2136: roff_getstrn(const struct roff *r, const char *name, size_t len)
1.7 schwarze 2137: {
1.42 schwarze 2138: const struct roffkv *n;
1.64 schwarze 2139: int i;
1.7 schwarze 2140:
1.42 schwarze 2141: for (n = r->strtab; n; n = n->next)
1.80 schwarze 2142: if (0 == strncmp(name, n->key.p, len) &&
2143: '\0' == n->key.p[(int)len])
1.42 schwarze 2144: return(n->val.p);
1.64 schwarze 2145:
2146: for (i = 0; i < PREDEFS_MAX; i++)
2147: if (0 == strncmp(name, predefs[i].name, len) &&
2148: '\0' == predefs[i].name[(int)len])
2149: return(predefs[i].str);
1.8 schwarze 2150:
1.42 schwarze 2151: return(NULL);
1.7 schwarze 2152: }
2153:
1.8 schwarze 2154: static void
1.42 schwarze 2155: roff_freestr(struct roffkv *r)
1.7 schwarze 2156: {
1.42 schwarze 2157: struct roffkv *n, *nn;
1.7 schwarze 2158:
1.42 schwarze 2159: for (n = r; n; n = nn) {
2160: free(n->key.p);
2161: free(n->val.p);
1.7 schwarze 2162: nn = n->next;
2163: free(n);
2164: }
1.27 schwarze 2165: }
2166:
2167: const struct tbl_span *
2168: roff_span(const struct roff *r)
2169: {
1.80 schwarze 2170:
1.27 schwarze 2171: return(r->tbl ? tbl_span(r->tbl) : NULL);
1.32 schwarze 2172: }
2173:
2174: const struct eqn *
2175: roff_eqn(const struct roff *r)
2176: {
1.80 schwarze 2177:
1.32 schwarze 2178: return(r->last_eqn ? &r->last_eqn->eqn : NULL);
1.42 schwarze 2179: }
2180:
2181: /*
2182: * Duplicate an input string, making the appropriate character
2183: * conversations (as stipulated by `tr') along the way.
2184: * Returns a heap-allocated string with all the replacements made.
2185: */
2186: char *
2187: roff_strdup(const struct roff *r, const char *p)
2188: {
2189: const struct roffkv *cp;
2190: char *res;
2191: const char *pp;
2192: size_t ssz, sz;
2193: enum mandoc_esc esc;
2194:
2195: if (NULL == r->xmbtab && NULL == r->xtab)
2196: return(mandoc_strdup(p));
2197: else if ('\0' == *p)
2198: return(mandoc_strdup(""));
2199:
2200: /*
2201: * Step through each character looking for term matches
2202: * (remember that a `tr' can be invoked with an escape, which is
2203: * a glyph but the escape is multi-character).
2204: * We only do this if the character hash has been initialised
2205: * and the string is >0 length.
2206: */
2207:
2208: res = NULL;
2209: ssz = 0;
2210:
2211: while ('\0' != *p) {
2212: if ('\\' != *p && r->xtab && r->xtab[(int)*p].p) {
2213: sz = r->xtab[(int)*p].sz;
2214: res = mandoc_realloc(res, ssz + sz + 1);
2215: memcpy(res + ssz, r->xtab[(int)*p].p, sz);
2216: ssz += sz;
2217: p++;
2218: continue;
2219: } else if ('\\' != *p) {
2220: res = mandoc_realloc(res, ssz + 2);
2221: res[ssz++] = *p++;
2222: continue;
2223: }
2224:
2225: /* Search for term matches. */
2226: for (cp = r->xmbtab; cp; cp = cp->next)
2227: if (0 == strncmp(p, cp->key.p, cp->key.sz))
2228: break;
2229:
2230: if (NULL != cp) {
2231: /*
2232: * A match has been found.
2233: * Append the match to the array and move
2234: * forward by its keysize.
2235: */
1.80 schwarze 2236: res = mandoc_realloc(res,
2237: ssz + cp->val.sz + 1);
1.42 schwarze 2238: memcpy(res + ssz, cp->val.p, cp->val.sz);
2239: ssz += cp->val.sz;
2240: p += (int)cp->key.sz;
2241: continue;
2242: }
2243:
2244: /*
2245: * Handle escapes carefully: we need to copy
2246: * over just the escape itself, or else we might
2247: * do replacements within the escape itself.
2248: * Make sure to pass along the bogus string.
2249: */
2250: pp = p++;
2251: esc = mandoc_escape(&p, NULL, NULL);
2252: if (ESCAPE_ERROR == esc) {
2253: sz = strlen(pp);
2254: res = mandoc_realloc(res, ssz + sz + 1);
2255: memcpy(res + ssz, pp, sz);
2256: break;
2257: }
1.80 schwarze 2258: /*
2259: * We bail out on bad escapes.
1.42 schwarze 2260: * No need to warn: we already did so when
2261: * roff_res() was called.
2262: */
2263: sz = (int)(p - pp);
2264: res = mandoc_realloc(res, ssz + sz + 1);
2265: memcpy(res + ssz, pp, sz);
2266: ssz += sz;
2267: }
2268:
2269: res[(int)ssz] = '\0';
2270: return(res);
1.48 schwarze 2271: }
2272:
2273: /*
1.80 schwarze 2274: * Find out whether a line is a macro line or not.
1.48 schwarze 2275: * If it is, adjust the current position and return one; if it isn't,
2276: * return zero and don't change the current position.
2277: * If the control character has been set with `.cc', then let that grain
2278: * precedence.
2279: * This is slighly contrary to groff, where using the non-breaking
2280: * control character when `cc' has been invoked will cause the
2281: * non-breaking macro contents to be printed verbatim.
2282: */
2283: int
2284: roff_getcontrol(const struct roff *r, const char *cp, int *ppos)
2285: {
2286: int pos;
2287:
2288: pos = *ppos;
2289:
2290: if (0 != r->control && cp[pos] == r->control)
2291: pos++;
2292: else if (0 != r->control)
2293: return(0);
2294: else if ('\\' == cp[pos] && '.' == cp[pos + 1])
2295: pos += 2;
2296: else if ('.' == cp[pos] || '\'' == cp[pos])
2297: pos++;
2298: else
2299: return(0);
2300:
2301: while (' ' == cp[pos] || '\t' == cp[pos])
2302: pos++;
2303:
2304: *ppos = pos;
2305: return(1);
1.1 schwarze 2306: }
![[BACK]](/icons/back.gif){kind=icon}
Return to roff.c CVS log ![[TXT]](/icons/text.gif){kind=icon}
![[DIR]](/icons/dir.gif){kind=icon}
Up to [local] / src / usr.bin / mandoc