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