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