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