Annotation of mandoc/roff.c, Revision 1.250
1.250 ! schwarze 1: /* $Id: roff.c,v 1.249 2015/01/14 22:58:16 schwarze Exp $ */
1.1 kristaps 2: /*
1.247 schwarze 3: * Copyright (c) 2010, 2011, 2012, 2014 Kristaps Dzonsons <kristaps@bsd.lv>
4: * Copyright (c) 2010-2015 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.250 ! schwarze 78: ROFF_IX,
1.76 kristaps 79: ROFF_cblock,
1.106 kristaps 80: ROFF_USERDEF,
1.67 kristaps 81: ROFF_MAX
82: };
83:
1.147 kristaps 84: /*
1.167 kristaps 85: * An incredibly-simple string buffer.
86: */
1.94 kristaps 87: struct roffstr {
1.167 kristaps 88: char *p; /* nil-terminated buffer */
89: size_t sz; /* saved strlen(p) */
1.166 kristaps 90: };
91:
92: /*
1.167 kristaps 93: * A key-value roffstr pair as part of a singly-linked list.
1.166 kristaps 94: */
95: struct roffkv {
96: struct roffstr key;
97: struct roffstr val;
98: struct roffkv *next; /* next in list */
1.94 kristaps 99: };
100:
1.180 schwarze 101: /*
102: * A single number register as part of a singly-linked list.
103: */
104: struct roffreg {
105: struct roffstr key;
1.181 schwarze 106: int val;
1.180 schwarze 107: struct roffreg *next;
108: };
109:
1.67 kristaps 110: struct roff {
1.128 kristaps 111: struct mparse *parse; /* parse point */
1.237 schwarze 112: const struct mchars *mchars; /* character table */
1.67 kristaps 113: struct roffnode *last; /* leaf of stack */
1.223 schwarze 114: int *rstack; /* stack of inverted `ie' values */
1.180 schwarze 115: struct roffreg *regtab; /* number registers */
1.166 kristaps 116: struct roffkv *strtab; /* user-defined strings & macros */
1.167 kristaps 117: struct roffkv *xmbtab; /* multi-byte trans table (`tr') */
118: struct roffstr *xtab; /* single-byte trans table (`tr') */
1.106 kristaps 119: const char *current_string; /* value of last called user macro */
1.118 kristaps 120: struct tbl_node *first_tbl; /* first table parsed */
121: struct tbl_node *last_tbl; /* last table parsed */
122: struct tbl_node *tbl; /* current table being parsed */
1.125 kristaps 123: struct eqn_node *last_eqn; /* last equation parsed */
124: struct eqn_node *first_eqn; /* first equation parsed */
125: struct eqn_node *eqn; /* current equation being parsed */
1.230 schwarze 126: int eqn_inline; /* current equation is inline */
1.223 schwarze 127: int options; /* parse options */
128: int rstacksz; /* current size limit of rstack */
129: int rstackpos; /* position in rstack */
1.227 schwarze 130: int format; /* current file in mdoc or man format */
1.223 schwarze 131: char control; /* control character */
1.79 kristaps 132: };
133:
1.67 kristaps 134: struct roffnode {
135: enum rofft tok; /* type of node */
136: struct roffnode *parent; /* up one in stack */
137: int line; /* parse line */
138: int col; /* parse col */
1.106 kristaps 139: char *name; /* node name, e.g. macro name */
1.79 kristaps 140: char *end; /* end-rules: custom token */
141: int endspan; /* end-rules: next-line or infty */
1.198 schwarze 142: int rule; /* current evaluation rule */
1.67 kristaps 143: };
144:
145: #define ROFF_ARGS struct roff *r, /* parse ctx */ \
1.72 kristaps 146: enum rofft tok, /* tok of macro */ \
1.238 schwarze 147: struct buf *buf, /* input buffer */ \
1.67 kristaps 148: int ln, /* parse line */ \
1.75 kristaps 149: int ppos, /* original pos in buffer */ \
150: int pos, /* current pos in buffer */ \
1.74 kristaps 151: int *offs /* reset offset of buffer data */
1.67 kristaps 152:
153: typedef enum rofferr (*roffproc)(ROFF_ARGS);
154:
155: struct roffmac {
156: const char *name; /* macro name */
1.79 kristaps 157: roffproc proc; /* process new macro */
158: roffproc text; /* process as child text of macro */
159: roffproc sub; /* process as child of macro */
160: int flags;
161: #define ROFFMAC_STRUCT (1 << 0) /* always interpret */
1.85 kristaps 162: struct roffmac *next;
1.67 kristaps 163: };
164:
1.141 kristaps 165: struct predef {
166: const char *name; /* predefined input name */
167: const char *str; /* replacement symbol */
168: };
169:
170: #define PREDEF(__name, __str) \
171: { (__name), (__str) },
172:
1.155 kristaps 173: static enum rofft roffhash_find(const char *, size_t);
174: static void roffhash_init(void);
175: static void roffnode_cleanscope(struct roff *);
176: static void roffnode_pop(struct roff *);
177: static void roffnode_push(struct roff *, enum rofft,
178: const char *, int, int);
1.80 kristaps 179: static enum rofferr roff_block(ROFF_ARGS);
180: static enum rofferr roff_block_text(ROFF_ARGS);
181: static enum rofferr roff_block_sub(ROFF_ARGS);
182: static enum rofferr roff_cblock(ROFF_ARGS);
1.174 kristaps 183: static enum rofferr roff_cc(ROFF_ARGS);
1.195 schwarze 184: static void roff_ccond(struct roff *, int, int);
1.82 kristaps 185: static enum rofferr roff_cond(ROFF_ARGS);
186: static enum rofferr roff_cond_text(ROFF_ARGS);
187: static enum rofferr roff_cond_sub(ROFF_ARGS);
1.92 schwarze 188: static enum rofferr roff_ds(ROFF_ARGS);
1.238 schwarze 189: static enum rofferr roff_eqndelim(struct roff *, struct buf *, int);
1.234 kristaps 190: static int roff_evalcond(struct roff *r, int,
191: const char *, int *);
192: static int roff_evalnum(struct roff *, int,
193: const char *, int *, int *, int);
194: static int roff_evalpar(struct roff *, int,
195: const char *, int *, int *);
1.198 schwarze 196: static int roff_evalstrcond(const char *, int *);
1.155 kristaps 197: static void roff_free1(struct roff *);
1.180 schwarze 198: static void roff_freereg(struct roffreg *);
1.167 kristaps 199: static void roff_freestr(struct roffkv *);
1.212 schwarze 200: static size_t roff_getname(struct roff *, char **, int, int);
1.184 schwarze 201: static int roff_getnum(const char *, int *, int *);
202: static int roff_getop(const char *, int *, char *);
1.181 schwarze 203: static int roff_getregn(const struct roff *,
204: const char *, size_t);
1.192 schwarze 205: static int roff_getregro(const char *name);
1.207 schwarze 206: static const char *roff_getstrn(const struct roff *,
1.94 kristaps 207: const char *, size_t);
1.178 schwarze 208: static enum rofferr roff_it(ROFF_ARGS);
1.103 kristaps 209: static enum rofferr roff_line_ignore(ROFF_ARGS);
1.89 kristaps 210: static enum rofferr roff_nr(ROFF_ARGS);
1.214 schwarze 211: static enum rofft roff_parse(struct roff *, char *, int *,
212: int, int);
1.238 schwarze 213: static enum rofferr roff_parsetext(struct buf *, int, int *);
214: static enum rofferr roff_res(struct roff *, struct buf *, int, int);
1.122 schwarze 215: static enum rofferr roff_rm(ROFF_ARGS);
1.203 schwarze 216: static enum rofferr roff_rr(ROFF_ARGS);
1.94 kristaps 217: static void roff_setstr(struct roff *,
1.106 kristaps 218: const char *, const char *, int);
1.207 schwarze 219: static void roff_setstrn(struct roffkv **, const char *,
1.164 kristaps 220: size_t, const char *, size_t, int);
1.105 kristaps 221: static enum rofferr roff_so(ROFF_ARGS);
1.164 kristaps 222: static enum rofferr roff_tr(ROFF_ARGS);
1.175 schwarze 223: static enum rofferr roff_Dd(ROFF_ARGS);
224: static enum rofferr roff_TH(ROFF_ARGS);
1.109 kristaps 225: static enum rofferr roff_TE(ROFF_ARGS);
226: static enum rofferr roff_TS(ROFF_ARGS);
1.125 kristaps 227: static enum rofferr roff_EQ(ROFF_ARGS);
228: static enum rofferr roff_EN(ROFF_ARGS);
1.112 kristaps 229: static enum rofferr roff_T_(ROFF_ARGS);
1.106 kristaps 230: static enum rofferr roff_userdef(ROFF_ARGS);
1.67 kristaps 231:
1.155 kristaps 232: /* See roffhash_find() */
1.85 kristaps 233:
234: #define ASCII_HI 126
235: #define ASCII_LO 33
236: #define HASHWIDTH (ASCII_HI - ASCII_LO + 1)
237:
238: static struct roffmac *hash[HASHWIDTH];
239:
240: static struct roffmac roffs[ROFF_MAX] = {
1.103 kristaps 241: { "ad", roff_line_ignore, NULL, NULL, 0, NULL },
1.85 kristaps 242: { "am", roff_block, roff_block_text, roff_block_sub, 0, NULL },
243: { "ami", roff_block, roff_block_text, roff_block_sub, 0, NULL },
244: { "am1", roff_block, roff_block_text, roff_block_sub, 0, NULL },
1.193 schwarze 245: { "as", roff_ds, NULL, NULL, 0, NULL },
1.174 kristaps 246: { "cc", roff_cc, NULL, NULL, 0, NULL },
1.194 schwarze 247: { "ce", roff_line_ignore, NULL, NULL, 0, NULL },
1.85 kristaps 248: { "de", roff_block, roff_block_text, roff_block_sub, 0, NULL },
249: { "dei", roff_block, roff_block_text, roff_block_sub, 0, NULL },
250: { "de1", roff_block, roff_block_text, roff_block_sub, 0, NULL },
1.92 schwarze 251: { "ds", roff_ds, NULL, NULL, 0, NULL },
1.85 kristaps 252: { "el", roff_cond, roff_cond_text, roff_cond_sub, ROFFMAC_STRUCT, NULL },
1.185 schwarze 253: { "fam", roff_line_ignore, NULL, NULL, 0, NULL },
1.186 schwarze 254: { "hw", roff_line_ignore, NULL, NULL, 0, NULL },
1.103 kristaps 255: { "hy", roff_line_ignore, NULL, NULL, 0, NULL },
1.85 kristaps 256: { "ie", roff_cond, roff_cond_text, roff_cond_sub, ROFFMAC_STRUCT, NULL },
257: { "if", roff_cond, roff_cond_text, roff_cond_sub, ROFFMAC_STRUCT, NULL },
258: { "ig", roff_block, roff_block_text, roff_block_sub, 0, NULL },
1.178 schwarze 259: { "it", roff_it, NULL, NULL, 0, NULL },
1.103 kristaps 260: { "ne", roff_line_ignore, NULL, NULL, 0, NULL },
261: { "nh", roff_line_ignore, NULL, NULL, 0, NULL },
1.104 kristaps 262: { "nr", roff_nr, NULL, NULL, 0, NULL },
1.124 schwarze 263: { "ns", roff_line_ignore, NULL, NULL, 0, NULL },
1.229 schwarze 264: { "pl", roff_line_ignore, NULL, NULL, 0, NULL },
1.124 schwarze 265: { "ps", roff_line_ignore, NULL, NULL, 0, NULL },
1.122 schwarze 266: { "rm", roff_rm, NULL, NULL, 0, NULL },
1.203 schwarze 267: { "rr", roff_rr, NULL, NULL, 0, NULL },
1.105 kristaps 268: { "so", roff_so, NULL, NULL, 0, NULL },
1.124 schwarze 269: { "ta", roff_line_ignore, NULL, NULL, 0, NULL },
1.164 kristaps 270: { "tr", roff_tr, NULL, NULL, 0, NULL },
1.175 schwarze 271: { "Dd", roff_Dd, NULL, NULL, 0, NULL },
272: { "TH", roff_TH, NULL, NULL, 0, NULL },
1.109 kristaps 273: { "TS", roff_TS, NULL, NULL, 0, NULL },
274: { "TE", roff_TE, NULL, NULL, 0, NULL },
1.112 kristaps 275: { "T&", roff_T_, NULL, NULL, 0, NULL },
1.125 kristaps 276: { "EQ", roff_EQ, NULL, NULL, 0, NULL },
277: { "EN", roff_EN, NULL, NULL, 0, NULL },
1.250 ! schwarze 278: { "IX", roff_line_ignore, NULL, NULL, 0, NULL },
1.85 kristaps 279: { ".", roff_cblock, NULL, NULL, 0, NULL },
1.106 kristaps 280: { NULL, roff_userdef, NULL, NULL, 0, NULL },
1.67 kristaps 281: };
282:
1.200 schwarze 283: /* not currently implemented: Ds em Eq LP Me PP pp Or Rd Sf SH */
1.175 schwarze 284: const char *const __mdoc_reserved[] = {
285: "Ac", "Ad", "An", "Ao", "Ap", "Aq", "Ar", "At",
286: "Bc", "Bd", "Bf", "Bk", "Bl", "Bo", "Bq",
287: "Brc", "Bro", "Brq", "Bsx", "Bt", "Bx",
288: "Cd", "Cm", "Db", "Dc", "Dd", "Dl", "Do", "Dq",
1.200 schwarze 289: "Dt", "Dv", "Dx", "D1",
290: "Ec", "Ed", "Ef", "Ek", "El", "Em",
291: "En", "Eo", "Er", "Es", "Ev", "Ex",
1.175 schwarze 292: "Fa", "Fc", "Fd", "Fl", "Fn", "Fo", "Fr", "Ft", "Fx",
1.200 schwarze 293: "Hf", "Ic", "In", "It", "Lb", "Li", "Lk", "Lp",
294: "Ms", "Mt", "Nd", "Nm", "No", "Ns", "Nx",
1.175 schwarze 295: "Oc", "Oo", "Op", "Os", "Ot", "Ox",
1.200 schwarze 296: "Pa", "Pc", "Pf", "Po", "Pp", "Pq",
297: "Qc", "Ql", "Qo", "Qq", "Re", "Rs", "Rv",
298: "Sc", "Sh", "Sm", "So", "Sq",
1.175 schwarze 299: "Ss", "St", "Sx", "Sy",
300: "Ta", "Tn", "Ud", "Ux", "Va", "Vt", "Xc", "Xo", "Xr",
1.200 schwarze 301: "%A", "%B", "%C", "%D", "%I", "%J", "%N", "%O",
1.175 schwarze 302: "%P", "%Q", "%R", "%T", "%U", "%V",
303: NULL
304: };
305:
1.200 schwarze 306: /* not currently implemented: BT DE DS ME MT PT SY TQ YS */
1.175 schwarze 307: const char *const __man_reserved[] = {
1.200 schwarze 308: "AT", "B", "BI", "BR", "DT",
309: "EE", "EN", "EQ", "EX", "HP", "I", "IB", "IP", "IR",
310: "LP", "OP", "P", "PD", "PP",
311: "R", "RB", "RE", "RI", "RS", "SB", "SH", "SM", "SS",
312: "TE", "TH", "TP", "TS", "T&", "UC", "UE", "UR",
1.175 schwarze 313: NULL
314: };
315:
1.141 kristaps 316: /* Array of injected predefined strings. */
317: #define PREDEFS_MAX 38
318: static const struct predef predefs[PREDEFS_MAX] = {
319: #include "predefs.in"
320: };
321:
1.155 kristaps 322: /* See roffhash_find() */
1.85 kristaps 323: #define ROFF_HASH(p) (p[0] - ASCII_LO)
324:
1.178 schwarze 325: static int roffit_lines; /* number of lines to delay */
326: static char *roffit_macro; /* nil-terminated macro line */
327:
1.207 schwarze 328:
1.85 kristaps 329: static void
1.155 kristaps 330: roffhash_init(void)
1.85 kristaps 331: {
332: struct roffmac *n;
333: int buc, i;
334:
1.106 kristaps 335: for (i = 0; i < (int)ROFF_USERDEF; i++) {
1.85 kristaps 336: assert(roffs[i].name[0] >= ASCII_LO);
337: assert(roffs[i].name[0] <= ASCII_HI);
338:
339: buc = ROFF_HASH(roffs[i].name);
340:
341: if (NULL != (n = hash[buc])) {
342: for ( ; n->next; n = n->next)
343: /* Do nothing. */ ;
344: n->next = &roffs[i];
345: } else
346: hash[buc] = &roffs[i];
347: }
348: }
349:
1.67 kristaps 350: /*
351: * Look up a roff token by its name. Returns ROFF_MAX if no macro by
352: * the nil-terminated string name could be found.
353: */
354: static enum rofft
1.155 kristaps 355: roffhash_find(const char *p, size_t s)
1.67 kristaps 356: {
1.85 kristaps 357: int buc;
358: struct roffmac *n;
1.67 kristaps 359:
1.85 kristaps 360: /*
361: * libroff has an extremely simple hashtable, for the time
362: * being, which simply keys on the first character, which must
363: * be printable, then walks a chain. It works well enough until
364: * optimised.
365: */
366:
367: if (p[0] < ASCII_LO || p[0] > ASCII_HI)
368: return(ROFF_MAX);
369:
370: buc = ROFF_HASH(p);
371:
372: if (NULL == (n = hash[buc]))
373: return(ROFF_MAX);
374: for ( ; n; n = n->next)
1.106 kristaps 375: if (0 == strncmp(n->name, p, s) && '\0' == n->name[(int)s])
1.85 kristaps 376: return((enum rofft)(n - roffs));
1.67 kristaps 377:
378: return(ROFF_MAX);
379: }
380:
381: /*
382: * Pop the current node off of the stack of roff instructions currently
383: * pending.
384: */
385: static void
386: roffnode_pop(struct roff *r)
387: {
388: struct roffnode *p;
389:
1.75 kristaps 390: assert(r->last);
1.207 schwarze 391: p = r->last;
1.82 kristaps 392:
1.75 kristaps 393: r->last = r->last->parent;
1.106 kristaps 394: free(p->name);
395: free(p->end);
1.67 kristaps 396: free(p);
397: }
398:
399: /*
400: * Push a roff node onto the instruction stack. This must later be
401: * removed with roffnode_pop().
402: */
1.98 schwarze 403: static void
1.106 kristaps 404: roffnode_push(struct roff *r, enum rofft tok, const char *name,
405: int line, int col)
1.67 kristaps 406: {
407: struct roffnode *p;
408:
1.98 schwarze 409: p = mandoc_calloc(1, sizeof(struct roffnode));
1.67 kristaps 410: p->tok = tok;
1.106 kristaps 411: if (name)
412: p->name = mandoc_strdup(name);
1.67 kristaps 413: p->parent = r->last;
414: p->line = line;
415: p->col = col;
1.198 schwarze 416: p->rule = p->parent ? p->parent->rule : 0;
1.67 kristaps 417:
418: r->last = p;
419: }
420:
421: static void
422: roff_free1(struct roff *r)
423: {
1.176 schwarze 424: struct tbl_node *tbl;
1.125 kristaps 425: struct eqn_node *e;
1.167 kristaps 426: int i;
1.67 kristaps 427:
1.176 schwarze 428: while (NULL != (tbl = r->first_tbl)) {
429: r->first_tbl = tbl->next;
430: tbl_free(tbl);
1.109 kristaps 431: }
1.113 kristaps 432: r->first_tbl = r->last_tbl = r->tbl = NULL;
433:
1.125 kristaps 434: while (NULL != (e = r->first_eqn)) {
435: r->first_eqn = e->next;
436: eqn_free(e);
437: }
438: r->first_eqn = r->last_eqn = r->eqn = NULL;
439:
1.67 kristaps 440: while (r->last)
441: roffnode_pop(r);
1.109 kristaps 442:
1.223 schwarze 443: free (r->rstack);
444: r->rstack = NULL;
445: r->rstacksz = 0;
446: r->rstackpos = -1;
447:
448: roff_freereg(r->regtab);
449: r->regtab = NULL;
450:
1.167 kristaps 451: roff_freestr(r->strtab);
452: roff_freestr(r->xmbtab);
453: r->strtab = r->xmbtab = NULL;
454:
455: if (r->xtab)
456: for (i = 0; i < 128; i++)
457: free(r->xtab[i].p);
458: free(r->xtab);
459: r->xtab = NULL;
1.67 kristaps 460: }
461:
462: void
463: roff_reset(struct roff *r)
464: {
465:
466: roff_free1(r);
1.227 schwarze 467: r->format = r->options & (MPARSE_MDOC | MPARSE_MAN);
1.174 kristaps 468: r->control = 0;
1.67 kristaps 469: }
470:
471: void
472: roff_free(struct roff *r)
473: {
474:
475: roff_free1(r);
476: free(r);
477: }
478:
479: struct roff *
1.237 schwarze 480: roff_alloc(struct mparse *parse, const struct mchars *mchars, int options)
1.67 kristaps 481: {
482: struct roff *r;
483:
1.98 schwarze 484: r = mandoc_calloc(1, sizeof(struct roff));
1.128 kristaps 485: r->parse = parse;
1.237 schwarze 486: r->mchars = mchars;
1.199 schwarze 487: r->options = options;
1.227 schwarze 488: r->format = options & (MPARSE_MDOC | MPARSE_MAN);
1.82 kristaps 489: r->rstackpos = -1;
1.207 schwarze 490:
1.155 kristaps 491: roffhash_init();
1.141 kristaps 492:
1.67 kristaps 493: return(r);
494: }
495:
1.94 kristaps 496: /*
1.206 schwarze 497: * In the current line, expand escape sequences that tend to get
498: * used in numerical expressions and conditional requests.
499: * Also check the syntax of the remaining escape sequences.
1.154 kristaps 500: */
1.172 schwarze 501: static enum rofferr
1.238 schwarze 502: roff_res(struct roff *r, struct buf *buf, int ln, int pos)
1.94 kristaps 503: {
1.208 schwarze 504: char ubuf[24]; /* buffer to print the number */
1.205 schwarze 505: const char *start; /* start of the string to process */
1.209 schwarze 506: char *stesc; /* start of an escape sequence ('\\') */
1.108 schwarze 507: const char *stnam; /* start of the name, after "[(*" */
508: const char *cp; /* end of the name, e.g. before ']' */
509: const char *res; /* the string to be substituted */
1.238 schwarze 510: char *nbuf; /* new buffer to copy buf->buf to */
1.181 schwarze 511: size_t maxl; /* expected length of the escape name */
512: size_t naml; /* actual length of the escape name */
1.237 schwarze 513: enum mandoc_esc esc; /* type of the escape sequence */
514: int inaml; /* length returned from mandoc_escape() */
1.181 schwarze 515: int expand_count; /* to avoid infinite loops */
1.206 schwarze 516: int npos; /* position in numeric expression */
1.218 schwarze 517: int arg_complete; /* argument not interrupted by eol */
1.206 schwarze 518: char term; /* character terminating the escape */
1.94 kristaps 519:
1.170 schwarze 520: expand_count = 0;
1.238 schwarze 521: start = buf->buf + pos;
1.205 schwarze 522: stesc = strchr(start, '\0') - 1;
523: while (stesc-- > start) {
1.170 schwarze 524:
1.205 schwarze 525: /* Search backwards for the next backslash. */
526:
1.238 schwarze 527: if (*stesc != '\\')
1.205 schwarze 528: continue;
529:
530: /* If it is escaped, skip it. */
531:
532: for (cp = stesc - 1; cp >= start; cp--)
1.238 schwarze 533: if (*cp != '\\')
1.205 schwarze 534: break;
535:
1.238 schwarze 536: if ((stesc - cp) % 2 == 0) {
1.209 schwarze 537: stesc = (char *)cp;
1.205 schwarze 538: continue;
539: }
1.108 schwarze 540:
1.206 schwarze 541: /* Decide whether to expand or to check only. */
1.108 schwarze 542:
1.206 schwarze 543: term = '\0';
1.205 schwarze 544: cp = stesc + 1;
1.181 schwarze 545: switch (*cp) {
1.207 schwarze 546: case '*':
1.181 schwarze 547: res = NULL;
548: break;
1.207 schwarze 549: case 'B':
1.206 schwarze 550: /* FALLTHROUGH */
1.207 schwarze 551: case 'w':
1.206 schwarze 552: term = cp[1];
553: /* FALLTHROUGH */
1.207 schwarze 554: case 'n':
1.181 schwarze 555: res = ubuf;
556: break;
557: default:
1.237 schwarze 558: esc = mandoc_escape(&cp, &stnam, &inaml);
559: if (esc == ESCAPE_ERROR ||
560: (esc == ESCAPE_SPECIAL &&
561: mchars_spec2cp(r->mchars, stnam, inaml) < 0))
1.219 schwarze 562: mandoc_vmsg(MANDOCERR_ESC_BAD,
1.238 schwarze 563: r->parse, ln, (int)(stesc - buf->buf),
1.219 schwarze 564: "%.*s", (int)(cp - stesc), stesc);
1.205 schwarze 565: continue;
1.152 kristaps 566: }
567:
1.205 schwarze 568: if (EXPAND_LIMIT < ++expand_count) {
569: mandoc_msg(MANDOCERR_ROFFLOOP, r->parse,
1.238 schwarze 570: ln, (int)(stesc - buf->buf), NULL);
1.205 schwarze 571: return(ROFF_IGN);
572: }
1.108 schwarze 573:
574: /*
575: * The third character decides the length
1.181 schwarze 576: * of the name of the string or register.
1.108 schwarze 577: * Save a pointer to the name.
578: */
579:
1.238 schwarze 580: if (term == '\0') {
1.206 schwarze 581: switch (*++cp) {
1.207 schwarze 582: case '\0':
1.206 schwarze 583: maxl = 0;
584: break;
1.207 schwarze 585: case '(':
1.206 schwarze 586: cp++;
587: maxl = 2;
588: break;
1.207 schwarze 589: case '[':
1.206 schwarze 590: cp++;
591: term = ']';
592: maxl = 0;
593: break;
594: default:
595: maxl = 1;
596: break;
597: }
598: } else {
599: cp += 2;
1.94 kristaps 600: maxl = 0;
601: }
1.108 schwarze 602: stnam = cp;
1.94 kristaps 603:
1.108 schwarze 604: /* Advance to the end of the name. */
1.94 kristaps 605:
1.218 schwarze 606: arg_complete = 1;
1.238 schwarze 607: for (naml = 0; maxl == 0 || naml < maxl; naml++, cp++) {
608: if (*cp == '\0') {
1.219 schwarze 609: mandoc_msg(MANDOCERR_ESC_BAD, r->parse,
1.238 schwarze 610: ln, (int)(stesc - buf->buf), stesc);
1.218 schwarze 611: arg_complete = 0;
1.206 schwarze 612: break;
1.153 kristaps 613: }
1.238 schwarze 614: if (maxl == 0 && *cp == term) {
1.206 schwarze 615: cp++;
1.94 kristaps 616: break;
1.206 schwarze 617: }
1.94 kristaps 618: }
619:
1.108 schwarze 620: /*
621: * Retrieve the replacement string; if it is
622: * undefined, resume searching for escapes.
623: */
624:
1.206 schwarze 625: switch (stesc[1]) {
1.207 schwarze 626: case '*':
1.218 schwarze 627: if (arg_complete)
628: res = roff_getstrn(r, stnam, naml);
1.206 schwarze 629: break;
1.207 schwarze 630: case 'B':
1.206 schwarze 631: npos = 0;
1.218 schwarze 632: ubuf[0] = arg_complete &&
1.234 kristaps 633: roff_evalnum(r, ln, stnam, &npos, NULL, 0) &&
1.218 schwarze 634: stnam + npos + 1 == cp ? '1' : '0';
1.206 schwarze 635: ubuf[1] = '\0';
636: break;
1.207 schwarze 637: case 'n':
1.218 schwarze 638: if (arg_complete)
639: (void)snprintf(ubuf, sizeof(ubuf), "%d",
640: roff_getregn(r, stnam, naml));
641: else
642: ubuf[0] = '\0';
1.206 schwarze 643: break;
1.207 schwarze 644: case 'w':
1.218 schwarze 645: /* use even incomplete args */
1.208 schwarze 646: (void)snprintf(ubuf, sizeof(ubuf), "%d",
1.206 schwarze 647: 24 * (int)naml);
648: break;
649: }
1.94 kristaps 650:
1.238 schwarze 651: if (res == NULL) {
1.219 schwarze 652: mandoc_vmsg(MANDOCERR_STR_UNDEF,
1.238 schwarze 653: r->parse, ln, (int)(stesc - buf->buf),
1.219 schwarze 654: "%.*s", (int)naml, stnam);
1.142 kristaps 655: res = "";
1.246 schwarze 656: } else if (buf->sz + strlen(res) > SHRT_MAX) {
657: mandoc_msg(MANDOCERR_ROFFLOOP, r->parse,
658: ln, (int)(stesc - buf->buf), NULL);
659: return(ROFF_IGN);
1.94 kristaps 660: }
661:
1.108 schwarze 662: /* Replace the escape sequence by the string. */
663:
1.209 schwarze 664: *stesc = '\0';
1.238 schwarze 665: buf->sz = mandoc_asprintf(&nbuf, "%s%s%s",
666: buf->buf, res, cp) + 1;
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: }
1.247 schwarze 1168: if (*ep != '\0')
1169: ++ep;
1.177 schwarze 1170: }
1.198 schwarze 1171: return(rr ? ROFF_CONT : ROFF_IGN);
1.82 kristaps 1172: }
1173:
1174: static enum rofferr
1175: roff_cond_text(ROFF_ARGS)
1.78 kristaps 1176: {
1.140 kristaps 1177: char *ep;
1.198 schwarze 1178: int rr;
1.82 kristaps 1179:
1180: rr = r->last->rule;
1.140 kristaps 1181: roffnode_cleanscope(r);
1.82 kristaps 1182:
1.238 schwarze 1183: ep = buf->buf + pos;
1184: while ((ep = strchr(ep, '\\')) != NULL) {
1185: if (*(++ep) == '}') {
1.197 schwarze 1186: *ep = '&';
1.238 schwarze 1187: roff_ccond(r, ln, ep - buf->buf - 1);
1.197 schwarze 1188: }
1.247 schwarze 1189: if (*ep != '\0')
1190: ++ep;
1.78 kristaps 1191: }
1.198 schwarze 1192: return(rr ? ROFF_CONT : ROFF_IGN);
1.74 kristaps 1193: }
1194:
1.204 schwarze 1195: /*
1196: * Parse a single signed integer number. Stop at the first non-digit.
1197: * If there is at least one digit, return success and advance the
1198: * parse point, else return failure and let the parse point unchanged.
1199: * Ignore overflows, treat them just like the C language.
1200: */
1.184 schwarze 1201: static int
1202: roff_getnum(const char *v, int *pos, int *res)
1203: {
1.206 schwarze 1204: int myres, n, p;
1205:
1206: if (NULL == res)
1207: res = &myres;
1.184 schwarze 1208:
1209: p = *pos;
1210: n = v[p] == '-';
1211: if (n)
1212: p++;
1213:
1214: for (*res = 0; isdigit((unsigned char)v[p]); p++)
1.204 schwarze 1215: *res = 10 * *res + v[p] - '0';
1.184 schwarze 1216: if (p == *pos + n)
1217: return 0;
1218:
1219: if (n)
1220: *res = -*res;
1221:
1222: *pos = p;
1223: return 1;
1224: }
1225:
1.198 schwarze 1226: /*
1227: * Evaluate a string comparison condition.
1228: * The first character is the delimiter.
1229: * Succeed if the string up to its second occurrence
1230: * matches the string up to its third occurence.
1231: * Advance the cursor after the third occurrence
1232: * or lacking that, to the end of the line.
1233: */
1234: static int
1235: roff_evalstrcond(const char *v, int *pos)
1236: {
1237: const char *s1, *s2, *s3;
1238: int match;
1239:
1240: match = 0;
1241: s1 = v + *pos; /* initial delimiter */
1242: s2 = s1 + 1; /* for scanning the first string */
1243: s3 = strchr(s2, *s1); /* for scanning the second string */
1244:
1245: if (NULL == s3) /* found no middle delimiter */
1246: goto out;
1247:
1248: while ('\0' != *++s3) {
1249: if (*s2 != *s3) { /* mismatch */
1250: s3 = strchr(s3, *s1);
1251: break;
1252: }
1253: if (*s3 == *s1) { /* found the final delimiter */
1254: match = 1;
1255: break;
1256: }
1257: s2++;
1258: }
1259:
1260: out:
1261: if (NULL == s3)
1262: s3 = strchr(s2, '\0');
1.242 schwarze 1263: else if (*s3 != '\0')
1.198 schwarze 1264: s3++;
1265: *pos = s3 - v;
1266: return(match);
1267: }
1268:
1.204 schwarze 1269: /*
1270: * Evaluate an optionally negated single character, numerical,
1271: * or string condition.
1272: */
1.198 schwarze 1273: static int
1.234 kristaps 1274: roff_evalcond(struct roff *r, int ln, const char *v, int *pos)
1.88 kristaps 1275: {
1.241 schwarze 1276: int number, savepos, wanttrue;
1.88 kristaps 1277:
1.198 schwarze 1278: if ('!' == v[*pos]) {
1279: wanttrue = 0;
1280: (*pos)++;
1281: } else
1282: wanttrue = 1;
1283:
1.88 kristaps 1284: switch (v[*pos]) {
1.240 schwarze 1285: case '\0':
1286: return(0);
1.207 schwarze 1287: case 'n':
1.198 schwarze 1288: /* FALLTHROUGH */
1.207 schwarze 1289: case 'o':
1.88 kristaps 1290: (*pos)++;
1.198 schwarze 1291: return(wanttrue);
1.207 schwarze 1292: case 'c':
1.198 schwarze 1293: /* FALLTHROUGH */
1.207 schwarze 1294: case 'd':
1.198 schwarze 1295: /* FALLTHROUGH */
1.207 schwarze 1296: case 'e':
1.88 kristaps 1297: /* FALLTHROUGH */
1.207 schwarze 1298: case 'r':
1.88 kristaps 1299: /* FALLTHROUGH */
1.207 schwarze 1300: case 't':
1.239 schwarze 1301: /* FALLTHROUGH */
1302: case 'v':
1.88 kristaps 1303: (*pos)++;
1.198 schwarze 1304: return(!wanttrue);
1.88 kristaps 1305: default:
1306: break;
1307: }
1308:
1.241 schwarze 1309: savepos = *pos;
1.234 kristaps 1310: if (roff_evalnum(r, ln, v, pos, &number, 0))
1.204 schwarze 1311: return((number > 0) == wanttrue);
1.241 schwarze 1312: else if (*pos == savepos)
1313: return(roff_evalstrcond(v, pos) == wanttrue);
1.204 schwarze 1314: else
1.241 schwarze 1315: return (0);
1.88 kristaps 1316: }
1317:
1.74 kristaps 1318: static enum rofferr
1.103 kristaps 1319: roff_line_ignore(ROFF_ARGS)
1.89 kristaps 1320: {
1.123 schwarze 1321:
1.89 kristaps 1322: return(ROFF_IGN);
1323: }
1324:
1.104 kristaps 1325: static enum rofferr
1.82 kristaps 1326: roff_cond(ROFF_ARGS)
1.74 kristaps 1327: {
1.173 schwarze 1328:
1329: roffnode_push(r, tok, NULL, ln, ppos);
1.74 kristaps 1330:
1.207 schwarze 1331: /*
1.134 kristaps 1332: * An `.el' has no conditional body: it will consume the value
1333: * of the current rstack entry set in prior `ie' calls or
1.207 schwarze 1334: * defaults to DENY.
1.134 kristaps 1335: *
1336: * If we're not an `el', however, then evaluate the conditional.
1337: */
1.133 kristaps 1338:
1.238 schwarze 1339: r->last->rule = tok == ROFF_el ?
1.207 schwarze 1340: (r->rstackpos < 0 ? 0 : r->rstack[r->rstackpos--]) :
1.238 schwarze 1341: roff_evalcond(r, ln, buf->buf, &pos);
1.77 kristaps 1342:
1.134 kristaps 1343: /*
1344: * An if-else will put the NEGATION of the current evaluated
1345: * conditional into the stack of rules.
1346: */
1347:
1.238 schwarze 1348: if (tok == ROFF_ie) {
1.223 schwarze 1349: if (r->rstackpos + 1 == r->rstacksz) {
1350: r->rstacksz += 16;
1351: r->rstack = mandoc_reallocarray(r->rstack,
1352: r->rstacksz, sizeof(int));
1.134 kristaps 1353: }
1.198 schwarze 1354: r->rstack[++r->rstackpos] = !r->last->rule;
1.82 kristaps 1355: }
1.88 kristaps 1356:
1357: /* If the parent has false as its rule, then so do we. */
1358:
1.198 schwarze 1359: if (r->last->parent && !r->last->parent->rule)
1360: r->last->rule = 0;
1.88 kristaps 1361:
1362: /*
1.173 schwarze 1363: * Determine scope.
1364: * If there is nothing on the line after the conditional,
1365: * not even whitespace, use next-line scope.
1.88 kristaps 1366: */
1.74 kristaps 1367:
1.238 schwarze 1368: if (buf->buf[pos] == '\0') {
1.173 schwarze 1369: r->last->endspan = 2;
1370: goto out;
1371: }
1372:
1.238 schwarze 1373: while (buf->buf[pos] == ' ')
1.173 schwarze 1374: pos++;
1375:
1376: /* An opening brace requests multiline scope. */
1.75 kristaps 1377:
1.238 schwarze 1378: if (buf->buf[pos] == '\\' && buf->buf[pos + 1] == '{') {
1.75 kristaps 1379: r->last->endspan = -1;
1380: pos += 2;
1.173 schwarze 1381: goto out;
1.207 schwarze 1382: }
1.74 kristaps 1383:
1.77 kristaps 1384: /*
1.173 schwarze 1385: * Anything else following the conditional causes
1386: * single-line scope. Warn if the scope contains
1387: * nothing but trailing whitespace.
1.77 kristaps 1388: */
1389:
1.238 schwarze 1390: if (buf->buf[pos] == '\0')
1.216 schwarze 1391: mandoc_msg(MANDOCERR_COND_EMPTY, r->parse,
1392: ln, ppos, roffs[tok].name);
1.77 kristaps 1393:
1.173 schwarze 1394: r->last->endspan = 1;
1.74 kristaps 1395:
1.173 schwarze 1396: out:
1.75 kristaps 1397: *offs = pos;
1398: return(ROFF_RERUN);
1.83 schwarze 1399: }
1400:
1401: static enum rofferr
1.92 schwarze 1402: roff_ds(ROFF_ARGS)
1403: {
1.212 schwarze 1404: char *string;
1405: const char *name;
1406: size_t namesz;
1.96 kristaps 1407:
1408: /*
1.212 schwarze 1409: * The first word is the name of the string.
1410: * If it is empty or terminated by an escape sequence,
1411: * abort the `ds' request without defining anything.
1.96 kristaps 1412: */
1.92 schwarze 1413:
1.238 schwarze 1414: name = string = buf->buf + pos;
1415: if (*name == '\0')
1.92 schwarze 1416: return(ROFF_IGN);
1417:
1.212 schwarze 1418: namesz = roff_getname(r, &string, ln, pos);
1.238 schwarze 1419: if (name[namesz] == '\\')
1.212 schwarze 1420: return(ROFF_IGN);
1421:
1422: /* Read past the initial double-quote, if any. */
1.238 schwarze 1423: if (*string == '"')
1.92 schwarze 1424: string++;
1425:
1.96 kristaps 1426: /* The rest is the value. */
1.212 schwarze 1427: roff_setstrn(&r->strtab, name, namesz, string, strlen(string),
1428: ROFF_as == tok);
1.92 schwarze 1429: return(ROFF_IGN);
1430: }
1431:
1.204 schwarze 1432: /*
1433: * Parse a single operator, one or two characters long.
1434: * If the operator is recognized, return success and advance the
1435: * parse point, else return failure and let the parse point unchanged.
1436: */
1437: static int
1438: roff_getop(const char *v, int *pos, char *res)
1439: {
1440:
1441: *res = v[*pos];
1442:
1443: switch (*res) {
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: /* FALLTHROUGH */
1.207 schwarze 1456: case ':':
1.204 schwarze 1457: break;
1458: case '<':
1459: switch (v[*pos + 1]) {
1.207 schwarze 1460: case '=':
1.204 schwarze 1461: *res = 'l';
1462: (*pos)++;
1463: break;
1.207 schwarze 1464: case '>':
1.204 schwarze 1465: *res = '!';
1466: (*pos)++;
1467: break;
1.207 schwarze 1468: case '?':
1.204 schwarze 1469: *res = 'i';
1470: (*pos)++;
1471: break;
1472: default:
1473: break;
1474: }
1475: break;
1476: case '>':
1477: switch (v[*pos + 1]) {
1.207 schwarze 1478: case '=':
1.204 schwarze 1479: *res = 'g';
1480: (*pos)++;
1481: break;
1.207 schwarze 1482: case '?':
1.204 schwarze 1483: *res = 'a';
1484: (*pos)++;
1485: break;
1486: default:
1487: break;
1488: }
1489: break;
1490: case '=':
1491: if ('=' == v[*pos + 1])
1492: (*pos)++;
1493: break;
1494: default:
1495: return(0);
1496: }
1497: (*pos)++;
1498:
1499: return(*res);
1500: }
1501:
1502: /*
1503: * Evaluate either a parenthesized numeric expression
1504: * or a single signed integer number.
1505: */
1506: static int
1.235 schwarze 1507: roff_evalpar(struct roff *r, int ln,
1.234 kristaps 1508: const char *v, int *pos, int *res)
1.204 schwarze 1509: {
1510:
1511: if ('(' != v[*pos])
1512: return(roff_getnum(v, pos, res));
1513:
1514: (*pos)++;
1.234 kristaps 1515: if ( ! roff_evalnum(r, ln, v, pos, res, 1))
1.204 schwarze 1516: return(0);
1517:
1.206 schwarze 1518: /*
1519: * Omission of the closing parenthesis
1520: * is an error in validation mode,
1521: * but ignored in evaluation mode.
1522: */
1523:
1.204 schwarze 1524: if (')' == v[*pos])
1525: (*pos)++;
1.206 schwarze 1526: else if (NULL == res)
1527: return(0);
1.204 schwarze 1528:
1529: return(1);
1530: }
1531:
1532: /*
1533: * Evaluate a complete numeric expression.
1534: * Proceed left to right, there is no concept of precedence.
1535: */
1536: static int
1.235 schwarze 1537: roff_evalnum(struct roff *r, int ln, const char *v,
1.234 kristaps 1538: int *pos, int *res, int skipwhite)
1.204 schwarze 1539: {
1540: int mypos, operand2;
1541: char operator;
1542:
1543: if (NULL == pos) {
1544: mypos = 0;
1545: pos = &mypos;
1546: }
1547:
1548: if (skipwhite)
1549: while (isspace((unsigned char)v[*pos]))
1550: (*pos)++;
1551:
1.234 kristaps 1552: if ( ! roff_evalpar(r, ln, v, pos, res))
1.204 schwarze 1553: return(0);
1554:
1555: while (1) {
1556: if (skipwhite)
1557: while (isspace((unsigned char)v[*pos]))
1558: (*pos)++;
1559:
1560: if ( ! roff_getop(v, pos, &operator))
1561: break;
1562:
1563: if (skipwhite)
1564: while (isspace((unsigned char)v[*pos]))
1565: (*pos)++;
1566:
1.234 kristaps 1567: if ( ! roff_evalpar(r, ln, v, pos, &operand2))
1.204 schwarze 1568: return(0);
1569:
1570: if (skipwhite)
1571: while (isspace((unsigned char)v[*pos]))
1572: (*pos)++;
1.206 schwarze 1573:
1574: if (NULL == res)
1575: continue;
1.204 schwarze 1576:
1577: switch (operator) {
1.207 schwarze 1578: case '+':
1.204 schwarze 1579: *res += operand2;
1580: break;
1.207 schwarze 1581: case '-':
1.204 schwarze 1582: *res -= operand2;
1583: break;
1.207 schwarze 1584: case '*':
1.204 schwarze 1585: *res *= operand2;
1586: break;
1.207 schwarze 1587: case '/':
1.244 schwarze 1588: if (operand2 == 0) {
1.235 schwarze 1589: mandoc_msg(MANDOCERR_DIVZERO,
1.234 kristaps 1590: r->parse, ln, *pos, v);
1591: *res = 0;
1592: break;
1593: }
1.204 schwarze 1594: *res /= operand2;
1595: break;
1.207 schwarze 1596: case '%':
1.244 schwarze 1597: if (operand2 == 0) {
1598: mandoc_msg(MANDOCERR_DIVZERO,
1599: r->parse, ln, *pos, v);
1600: *res = 0;
1601: break;
1602: }
1.204 schwarze 1603: *res %= operand2;
1604: break;
1.207 schwarze 1605: case '<':
1.204 schwarze 1606: *res = *res < operand2;
1607: break;
1.207 schwarze 1608: case '>':
1.204 schwarze 1609: *res = *res > operand2;
1610: break;
1.207 schwarze 1611: case 'l':
1.204 schwarze 1612: *res = *res <= operand2;
1613: break;
1.207 schwarze 1614: case 'g':
1.204 schwarze 1615: *res = *res >= operand2;
1616: break;
1.207 schwarze 1617: case '=':
1.204 schwarze 1618: *res = *res == operand2;
1619: break;
1.207 schwarze 1620: case '!':
1.204 schwarze 1621: *res = *res != operand2;
1622: break;
1.207 schwarze 1623: case '&':
1.204 schwarze 1624: *res = *res && operand2;
1625: break;
1.207 schwarze 1626: case ':':
1.204 schwarze 1627: *res = *res || operand2;
1628: break;
1.207 schwarze 1629: case 'i':
1.204 schwarze 1630: if (operand2 < *res)
1631: *res = operand2;
1632: break;
1.207 schwarze 1633: case 'a':
1.204 schwarze 1634: if (operand2 > *res)
1635: *res = operand2;
1636: break;
1637: default:
1638: abort();
1639: }
1640: }
1641: return(1);
1642: }
1643:
1.180 schwarze 1644: void
1.187 schwarze 1645: roff_setreg(struct roff *r, const char *name, int val, char sign)
1.147 kristaps 1646: {
1.180 schwarze 1647: struct roffreg *reg;
1648:
1649: /* Search for an existing register with the same name. */
1650: reg = r->regtab;
1651:
1652: while (reg && strcmp(name, reg->key.p))
1653: reg = reg->next;
1.147 kristaps 1654:
1.180 schwarze 1655: if (NULL == reg) {
1656: /* Create a new register. */
1657: reg = mandoc_malloc(sizeof(struct roffreg));
1658: reg->key.p = mandoc_strdup(name);
1659: reg->key.sz = strlen(name);
1.187 schwarze 1660: reg->val = 0;
1.180 schwarze 1661: reg->next = r->regtab;
1662: r->regtab = reg;
1663: }
1664:
1.187 schwarze 1665: if ('+' == sign)
1666: reg->val += val;
1667: else if ('-' == sign)
1668: reg->val -= val;
1669: else
1670: reg->val = val;
1.147 kristaps 1671: }
1672:
1.192 schwarze 1673: /*
1674: * Handle some predefined read-only number registers.
1675: * For now, return -1 if the requested register is not predefined;
1676: * in case a predefined read-only register having the value -1
1677: * were to turn up, another special value would have to be chosen.
1678: */
1679: static int
1680: roff_getregro(const char *name)
1681: {
1682:
1683: switch (*name) {
1.207 schwarze 1684: case 'A': /* ASCII approximation mode is always off. */
1.192 schwarze 1685: return(0);
1.207 schwarze 1686: case 'g': /* Groff compatibility mode is always on. */
1.192 schwarze 1687: return(1);
1.207 schwarze 1688: case 'H': /* Fixed horizontal resolution. */
1.192 schwarze 1689: return (24);
1.207 schwarze 1690: case 'j': /* Always adjust left margin only. */
1.192 schwarze 1691: return(0);
1.207 schwarze 1692: case 'T': /* Some output device is always defined. */
1.192 schwarze 1693: return(1);
1.207 schwarze 1694: case 'V': /* Fixed vertical resolution. */
1.192 schwarze 1695: return (40);
1696: default:
1697: return (-1);
1698: }
1699: }
1700:
1.181 schwarze 1701: int
1.180 schwarze 1702: roff_getreg(const struct roff *r, const char *name)
1.147 kristaps 1703: {
1.180 schwarze 1704: struct roffreg *reg;
1.192 schwarze 1705: int val;
1706:
1707: if ('.' == name[0] && '\0' != name[1] && '\0' == name[2]) {
1708: val = roff_getregro(name + 1);
1709: if (-1 != val)
1710: return (val);
1711: }
1.180 schwarze 1712:
1713: for (reg = r->regtab; reg; reg = reg->next)
1714: if (0 == strcmp(name, reg->key.p))
1.181 schwarze 1715: return(reg->val);
1716:
1717: return(0);
1718: }
1719:
1720: static int
1721: roff_getregn(const struct roff *r, const char *name, size_t len)
1722: {
1723: struct roffreg *reg;
1.192 schwarze 1724: int val;
1725:
1726: if ('.' == name[0] && 2 == len) {
1727: val = roff_getregro(name + 1);
1728: if (-1 != val)
1729: return (val);
1730: }
1.181 schwarze 1731:
1732: for (reg = r->regtab; reg; reg = reg->next)
1733: if (len == reg->key.sz &&
1734: 0 == strncmp(name, reg->key.p, len))
1735: return(reg->val);
1.147 kristaps 1736:
1.180 schwarze 1737: return(0);
1.147 kristaps 1738: }
1739:
1.180 schwarze 1740: static void
1741: roff_freereg(struct roffreg *reg)
1.147 kristaps 1742: {
1.180 schwarze 1743: struct roffreg *old_reg;
1.147 kristaps 1744:
1.180 schwarze 1745: while (NULL != reg) {
1746: free(reg->key.p);
1747: old_reg = reg;
1748: reg = reg->next;
1749: free(old_reg);
1750: }
1.147 kristaps 1751: }
1.92 schwarze 1752:
1753: static enum rofferr
1.89 kristaps 1754: roff_nr(ROFF_ARGS)
1.83 schwarze 1755: {
1.212 schwarze 1756: char *key, *val;
1757: size_t keysz;
1.138 kristaps 1758: int iv;
1.187 schwarze 1759: char sign;
1.89 kristaps 1760:
1.238 schwarze 1761: key = val = buf->buf + pos;
1762: if (*key == '\0')
1.212 schwarze 1763: return(ROFF_IGN);
1764:
1765: keysz = roff_getname(r, &val, ln, pos);
1.238 schwarze 1766: if (key[keysz] == '\\')
1.212 schwarze 1767: return(ROFF_IGN);
1768: key[keysz] = '\0';
1.89 kristaps 1769:
1.187 schwarze 1770: sign = *val;
1.238 schwarze 1771: if (sign == '+' || sign == '-')
1.187 schwarze 1772: val++;
1773:
1.234 kristaps 1774: if (roff_evalnum(r, ln, val, NULL, &iv, 0))
1.204 schwarze 1775: roff_setreg(r, key, iv, sign);
1.109 kristaps 1776:
1.203 schwarze 1777: return(ROFF_IGN);
1778: }
1779:
1780: static enum rofferr
1781: roff_rr(ROFF_ARGS)
1782: {
1783: struct roffreg *reg, **prev;
1.212 schwarze 1784: char *name, *cp;
1785: size_t namesz;
1.203 schwarze 1786:
1.238 schwarze 1787: name = cp = buf->buf + pos;
1788: if (*name == '\0')
1.212 schwarze 1789: return(ROFF_IGN);
1790: namesz = roff_getname(r, &cp, ln, pos);
1791: name[namesz] = '\0';
1.203 schwarze 1792:
1793: prev = &r->regtab;
1794: while (1) {
1795: reg = *prev;
1.238 schwarze 1796: if (reg == NULL || !strcmp(name, reg->key.p))
1.203 schwarze 1797: break;
1798: prev = ®->next;
1799: }
1.238 schwarze 1800: if (reg != NULL) {
1.203 schwarze 1801: *prev = reg->next;
1802: free(reg->key.p);
1803: free(reg);
1804: }
1.122 schwarze 1805: return(ROFF_IGN);
1806: }
1807:
1808: static enum rofferr
1809: roff_rm(ROFF_ARGS)
1810: {
1811: const char *name;
1812: char *cp;
1.212 schwarze 1813: size_t namesz;
1.122 schwarze 1814:
1.238 schwarze 1815: cp = buf->buf + pos;
1816: while (*cp != '\0') {
1.212 schwarze 1817: name = cp;
1.238 schwarze 1818: namesz = roff_getname(r, &cp, ln, (int)(cp - buf->buf));
1.212 schwarze 1819: roff_setstrn(&r->strtab, name, namesz, NULL, 0, 0);
1.238 schwarze 1820: if (name[namesz] == '\\')
1.212 schwarze 1821: break;
1.122 schwarze 1822: }
1.178 schwarze 1823: return(ROFF_IGN);
1824: }
1825:
1826: static enum rofferr
1827: roff_it(ROFF_ARGS)
1828: {
1829: char *cp;
1830: size_t len;
1831: int iv;
1832:
1833: /* Parse the number of lines. */
1.238 schwarze 1834: cp = buf->buf + pos;
1.178 schwarze 1835: len = strcspn(cp, " \t");
1836: cp[len] = '\0';
1837: if ((iv = mandoc_strntoi(cp, len, 10)) <= 0) {
1.222 schwarze 1838: mandoc_msg(MANDOCERR_IT_NONUM, r->parse,
1.238 schwarze 1839: ln, ppos, buf->buf + 1);
1.178 schwarze 1840: return(ROFF_IGN);
1841: }
1842: cp += len + 1;
1843:
1844: /* Arm the input line trap. */
1845: roffit_lines = iv;
1846: roffit_macro = mandoc_strdup(cp);
1.109 kristaps 1847: return(ROFF_IGN);
1.175 schwarze 1848: }
1849:
1850: static enum rofferr
1851: roff_Dd(ROFF_ARGS)
1852: {
1853: const char *const *cp;
1854:
1.227 schwarze 1855: if ((r->options & (MPARSE_MDOC | MPARSE_QUICK)) == 0)
1.175 schwarze 1856: for (cp = __mdoc_reserved; *cp; cp++)
1857: roff_setstr(r, *cp, NULL, 0);
1858:
1.227 schwarze 1859: if (r->format == 0)
1860: r->format = MPARSE_MDOC;
1861:
1.175 schwarze 1862: return(ROFF_CONT);
1863: }
1864:
1865: static enum rofferr
1866: roff_TH(ROFF_ARGS)
1867: {
1868: const char *const *cp;
1869:
1.227 schwarze 1870: if ((r->options & MPARSE_QUICK) == 0)
1.175 schwarze 1871: for (cp = __man_reserved; *cp; cp++)
1872: roff_setstr(r, *cp, NULL, 0);
1873:
1.227 schwarze 1874: if (r->format == 0)
1875: r->format = MPARSE_MAN;
1876:
1.175 schwarze 1877: return(ROFF_CONT);
1.109 kristaps 1878: }
1879:
1880: static enum rofferr
1881: roff_TE(ROFF_ARGS)
1882: {
1883:
1884: if (NULL == r->tbl)
1.221 schwarze 1885: mandoc_msg(MANDOCERR_BLK_NOTOPEN, r->parse,
1886: ln, ppos, "TE");
1.115 kristaps 1887: else
1.151 kristaps 1888: tbl_end(&r->tbl);
1.109 kristaps 1889:
1.112 kristaps 1890: return(ROFF_IGN);
1891: }
1892:
1893: static enum rofferr
1894: roff_T_(ROFF_ARGS)
1895: {
1896:
1897: if (NULL == r->tbl)
1.221 schwarze 1898: mandoc_msg(MANDOCERR_BLK_NOTOPEN, r->parse,
1899: ln, ppos, "T&");
1.112 kristaps 1900: else
1.116 kristaps 1901: tbl_restart(ppos, ln, r->tbl);
1.112 kristaps 1902:
1.109 kristaps 1903: return(ROFF_IGN);
1904: }
1905:
1.230 schwarze 1906: /*
1907: * Handle in-line equation delimiters.
1908: */
1909: static enum rofferr
1.238 schwarze 1910: roff_eqndelim(struct roff *r, struct buf *buf, int pos)
1.151 kristaps 1911: {
1.233 schwarze 1912: char *cp1, *cp2;
1913: const char *bef_pr, *bef_nl, *mac, *aft_nl, *aft_pr;
1.151 kristaps 1914:
1.230 schwarze 1915: /*
1916: * Outside equations, look for an opening delimiter.
1917: * If we are inside an equation, we already know it is
1918: * in-line, or this function wouldn't have been called;
1919: * so look for a closing delimiter.
1920: */
1921:
1.238 schwarze 1922: cp1 = buf->buf + pos;
1.230 schwarze 1923: cp2 = strchr(cp1, r->eqn == NULL ?
1924: r->last_eqn->odelim : r->last_eqn->cdelim);
1925: if (cp2 == NULL)
1926: return(ROFF_CONT);
1927:
1.233 schwarze 1928: *cp2++ = '\0';
1929: bef_pr = bef_nl = aft_nl = aft_pr = "";
1930:
1931: /* Handle preceding text, protecting whitespace. */
1932:
1.238 schwarze 1933: if (*buf->buf != '\0') {
1.233 schwarze 1934: if (r->eqn == NULL)
1935: bef_pr = "\\&";
1936: bef_nl = "\n";
1937: }
1938:
1939: /*
1940: * Prepare replacing the delimiter with an equation macro
1941: * and drop leading white space from the equation.
1942: */
1.230 schwarze 1943:
1.233 schwarze 1944: if (r->eqn == NULL) {
1945: while (*cp2 == ' ')
1946: cp2++;
1947: mac = ".EQ";
1948: } else
1949: mac = ".EN";
1950:
1951: /* Handle following text, protecting whitespace. */
1952:
1953: if (*cp2 != '\0') {
1954: aft_nl = "\n";
1955: if (r->eqn != NULL)
1956: aft_pr = "\\&";
1957: }
1958:
1959: /* Do the actual replacement. */
1960:
1.238 schwarze 1961: buf->sz = mandoc_asprintf(&cp1, "%s%s%s%s%s%s%s", buf->buf,
1.233 schwarze 1962: bef_pr, bef_nl, mac, aft_nl, aft_pr, cp2) + 1;
1.238 schwarze 1963: free(buf->buf);
1964: buf->buf = cp1;
1.230 schwarze 1965:
1966: /* Toggle the in-line state of the eqn subsystem. */
1967:
1968: r->eqn_inline = r->eqn == NULL;
1969: return(ROFF_REPARSE);
1.151 kristaps 1970: }
1971:
1.235 schwarze 1972: static enum rofferr
1973: roff_EQ(ROFF_ARGS)
1.125 kristaps 1974: {
1.151 kristaps 1975: struct eqn_node *e;
1.125 kristaps 1976:
1.238 schwarze 1977: assert(r->eqn == NULL);
1.235 schwarze 1978: e = eqn_alloc(ppos, ln, r->parse);
1.125 kristaps 1979:
1.230 schwarze 1980: if (r->last_eqn) {
1.125 kristaps 1981: r->last_eqn->next = e;
1.230 schwarze 1982: e->delim = r->last_eqn->delim;
1983: e->odelim = r->last_eqn->odelim;
1984: e->cdelim = r->last_eqn->cdelim;
1985: } else
1.125 kristaps 1986: r->first_eqn = r->last_eqn = e;
1987:
1988: r->eqn = r->last_eqn = e;
1.151 kristaps 1989:
1.238 schwarze 1990: if (buf->buf[pos] != '\0')
1.235 schwarze 1991: mandoc_vmsg(MANDOCERR_ARG_SKIP, r->parse, ln, pos,
1.238 schwarze 1992: ".EQ %s", buf->buf + pos);
1.151 kristaps 1993:
1.125 kristaps 1994: return(ROFF_IGN);
1995: }
1996:
1997: static enum rofferr
1998: roff_EN(ROFF_ARGS)
1999: {
2000:
1.221 schwarze 2001: mandoc_msg(MANDOCERR_BLK_NOTOPEN, r->parse, ln, ppos, "EN");
1.125 kristaps 2002: return(ROFF_IGN);
2003: }
2004:
2005: static enum rofferr
1.109 kristaps 2006: roff_TS(ROFF_ARGS)
2007: {
1.176 schwarze 2008: struct tbl_node *tbl;
1.89 kristaps 2009:
1.115 kristaps 2010: if (r->tbl) {
1.221 schwarze 2011: mandoc_msg(MANDOCERR_BLK_BROKEN, r->parse,
2012: ln, ppos, "TS breaks TS");
1.151 kristaps 2013: tbl_end(&r->tbl);
1.115 kristaps 2014: }
1.83 schwarze 2015:
1.176 schwarze 2016: tbl = tbl_alloc(ppos, ln, r->parse);
1.113 kristaps 2017:
2018: if (r->last_tbl)
1.176 schwarze 2019: r->last_tbl->next = tbl;
1.113 kristaps 2020: else
1.176 schwarze 2021: r->first_tbl = r->last_tbl = tbl;
1.113 kristaps 2022:
1.176 schwarze 2023: r->tbl = r->last_tbl = tbl;
1.83 schwarze 2024: return(ROFF_IGN);
1.92 schwarze 2025: }
2026:
1.105 kristaps 2027: static enum rofferr
1.174 kristaps 2028: roff_cc(ROFF_ARGS)
2029: {
2030: const char *p;
2031:
1.238 schwarze 2032: p = buf->buf + pos;
1.174 kristaps 2033:
1.238 schwarze 2034: if (*p == '\0' || (r->control = *p++) == '.')
1.174 kristaps 2035: r->control = 0;
2036:
1.238 schwarze 2037: if (*p != '\0')
1.174 kristaps 2038: mandoc_msg(MANDOCERR_ARGCOUNT, r->parse, ln, ppos, NULL);
2039:
2040: return(ROFF_IGN);
2041: }
2042:
2043: static enum rofferr
1.164 kristaps 2044: roff_tr(ROFF_ARGS)
2045: {
2046: const char *p, *first, *second;
2047: size_t fsz, ssz;
2048: enum mandoc_esc esc;
2049:
1.238 schwarze 2050: p = buf->buf + pos;
1.164 kristaps 2051:
1.238 schwarze 2052: if (*p == '\0') {
1.164 kristaps 2053: mandoc_msg(MANDOCERR_ARGCOUNT, r->parse, ln, ppos, NULL);
2054: return(ROFF_IGN);
2055: }
2056:
1.238 schwarze 2057: while (*p != '\0') {
1.164 kristaps 2058: fsz = ssz = 1;
2059:
2060: first = p++;
1.238 schwarze 2061: if (*first == '\\') {
1.164 kristaps 2062: esc = mandoc_escape(&p, NULL, NULL);
1.238 schwarze 2063: if (esc == ESCAPE_ERROR) {
1.219 schwarze 2064: mandoc_msg(MANDOCERR_ESC_BAD, r->parse,
1.238 schwarze 2065: ln, (int)(p - buf->buf), first);
1.164 kristaps 2066: return(ROFF_IGN);
2067: }
2068: fsz = (size_t)(p - first);
2069: }
2070:
2071: second = p++;
1.238 schwarze 2072: if (*second == '\\') {
1.164 kristaps 2073: esc = mandoc_escape(&p, NULL, NULL);
1.238 schwarze 2074: if (esc == ESCAPE_ERROR) {
1.219 schwarze 2075: mandoc_msg(MANDOCERR_ESC_BAD, r->parse,
1.238 schwarze 2076: ln, (int)(p - buf->buf), second);
1.164 kristaps 2077: return(ROFF_IGN);
2078: }
2079: ssz = (size_t)(p - second);
1.238 schwarze 2080: } else if (*second == '\0') {
1.207 schwarze 2081: mandoc_msg(MANDOCERR_ARGCOUNT, r->parse,
1.238 schwarze 2082: ln, (int)(p - buf->buf), NULL);
1.164 kristaps 2083: second = " ";
1.165 kristaps 2084: p--;
1.164 kristaps 2085: }
2086:
1.167 kristaps 2087: if (fsz > 1) {
1.207 schwarze 2088: roff_setstrn(&r->xmbtab, first, fsz,
2089: second, ssz, 0);
1.167 kristaps 2090: continue;
2091: }
2092:
1.238 schwarze 2093: if (r->xtab == NULL)
1.207 schwarze 2094: r->xtab = mandoc_calloc(128,
2095: sizeof(struct roffstr));
1.167 kristaps 2096:
2097: free(r->xtab[(int)*first].p);
2098: r->xtab[(int)*first].p = mandoc_strndup(second, ssz);
2099: r->xtab[(int)*first].sz = ssz;
1.164 kristaps 2100: }
2101:
2102: return(ROFF_IGN);
2103: }
2104:
2105: static enum rofferr
1.105 kristaps 2106: roff_so(ROFF_ARGS)
2107: {
1.249 schwarze 2108: char *name, *cp;
1.105 kristaps 2109:
1.238 schwarze 2110: name = buf->buf + pos;
1.224 schwarze 2111: mandoc_vmsg(MANDOCERR_SO, r->parse, ln, ppos, "so %s", name);
1.105 kristaps 2112:
2113: /*
2114: * Handle `so'. Be EXTREMELY careful, as we shouldn't be
2115: * opening anything that's not in our cwd or anything beneath
2116: * it. Thus, explicitly disallow traversing up the file-system
2117: * or using absolute paths.
2118: */
2119:
1.238 schwarze 2120: if (*name == '/' || strstr(name, "../") || strstr(name, "/..")) {
1.210 schwarze 2121: mandoc_vmsg(MANDOCERR_SO_PATH, r->parse, ln, ppos,
2122: ".so %s", name);
1.249 schwarze 2123: buf->sz = mandoc_asprintf(&cp,
2124: ".sp\nSee the file %s.\n.sp", name) + 1;
2125: free(buf->buf);
2126: buf->buf = cp;
2127: *offs = 0;
2128: return(ROFF_REPARSE);
1.105 kristaps 2129: }
2130:
2131: *offs = pos;
2132: return(ROFF_SO);
2133: }
1.92 schwarze 2134:
1.106 kristaps 2135: static enum rofferr
2136: roff_userdef(ROFF_ARGS)
1.99 kristaps 2137: {
1.106 kristaps 2138: const char *arg[9];
2139: char *cp, *n1, *n2;
1.119 schwarze 2140: int i;
1.106 kristaps 2141:
2142: /*
2143: * Collect pointers to macro argument strings
1.188 schwarze 2144: * and NUL-terminate them.
1.106 kristaps 2145: */
1.238 schwarze 2146: cp = buf->buf + pos;
1.119 schwarze 2147: for (i = 0; i < 9; i++)
1.238 schwarze 2148: arg[i] = *cp == '\0' ? "" :
1.136 kristaps 2149: mandoc_getarg(r->parse, &cp, ln, &pos);
1.99 kristaps 2150:
1.106 kristaps 2151: /*
2152: * Expand macro arguments.
1.99 kristaps 2153: */
1.238 schwarze 2154: buf->sz = 0;
1.106 kristaps 2155: n1 = cp = mandoc_strdup(r->current_string);
1.238 schwarze 2156: while ((cp = strstr(cp, "\\$")) != NULL) {
1.106 kristaps 2157: i = cp[2] - '1';
2158: if (0 > i || 8 < i) {
2159: /* Not an argument invocation. */
2160: cp += 2;
2161: continue;
2162: }
1.209 schwarze 2163: *cp = '\0';
1.238 schwarze 2164: buf->sz = mandoc_asprintf(&n2, "%s%s%s",
1.209 schwarze 2165: n1, arg[i], cp + 3) + 1;
1.106 kristaps 2166: cp = n2 + (cp - n1);
2167: free(n1);
2168: n1 = n2;
1.99 kristaps 2169: }
2170:
1.106 kristaps 2171: /*
2172: * Replace the macro invocation
2173: * by the expanded macro.
2174: */
1.238 schwarze 2175: free(buf->buf);
2176: buf->buf = n1;
2177: if (buf->sz == 0)
2178: buf->sz = strlen(buf->buf) + 1;
1.248 schwarze 2179: *offs = 0;
1.106 kristaps 2180:
1.238 schwarze 2181: return(buf->sz > 1 && buf->buf[buf->sz - 2] == '\n' ?
1.106 kristaps 2182: ROFF_REPARSE : ROFF_APPEND);
1.99 kristaps 2183: }
1.121 schwarze 2184:
1.212 schwarze 2185: static size_t
1.121 schwarze 2186: roff_getname(struct roff *r, char **cpp, int ln, int pos)
2187: {
2188: char *name, *cp;
1.212 schwarze 2189: size_t namesz;
1.121 schwarze 2190:
2191: name = *cpp;
2192: if ('\0' == *name)
1.212 schwarze 2193: return(0);
1.121 schwarze 2194:
1.212 schwarze 2195: /* Read until end of name and terminate it with NUL. */
2196: for (cp = name; 1; cp++) {
2197: if ('\0' == *cp || ' ' == *cp) {
2198: namesz = cp - name;
2199: break;
2200: }
1.121 schwarze 2201: if ('\\' != *cp)
2202: continue;
1.215 schwarze 2203: namesz = cp - name;
2204: if ('{' == cp[1] || '}' == cp[1])
2205: break;
1.121 schwarze 2206: cp++;
2207: if ('\\' == *cp)
2208: continue;
1.224 schwarze 2209: mandoc_vmsg(MANDOCERR_NAMESC, r->parse, ln, pos,
2210: "%.*s", (int)(cp - name + 1), name);
1.212 schwarze 2211: mandoc_escape((const char **)&cp, NULL, NULL);
2212: break;
1.121 schwarze 2213: }
2214:
2215: /* Read past spaces. */
2216: while (' ' == *cp)
2217: cp++;
2218:
2219: *cpp = cp;
1.212 schwarze 2220: return(namesz);
1.121 schwarze 2221: }
2222:
1.106 kristaps 2223: /*
2224: * Store *string into the user-defined string called *name.
2225: * To clear an existing entry, call with (*r, *name, NULL, 0).
1.193 schwarze 2226: * append == 0: replace mode
2227: * append == 1: single-line append mode
2228: * append == 2: multiline append mode, append '\n' after each call
1.106 kristaps 2229: */
1.94 kristaps 2230: static void
1.106 kristaps 2231: roff_setstr(struct roff *r, const char *name, const char *string,
1.193 schwarze 2232: int append)
1.92 schwarze 2233: {
1.164 kristaps 2234:
2235: roff_setstrn(&r->strtab, name, strlen(name), string,
1.207 schwarze 2236: string ? strlen(string) : 0, append);
1.164 kristaps 2237: }
2238:
2239: static void
1.166 kristaps 2240: roff_setstrn(struct roffkv **r, const char *name, size_t namesz,
1.193 schwarze 2241: const char *string, size_t stringsz, int append)
1.164 kristaps 2242: {
1.166 kristaps 2243: struct roffkv *n;
1.164 kristaps 2244: char *c;
2245: int i;
2246: size_t oldch, newch;
1.92 schwarze 2247:
1.106 kristaps 2248: /* Search for an existing string with the same name. */
1.164 kristaps 2249: n = *r;
2250:
1.211 schwarze 2251: while (n && (namesz != n->key.sz ||
2252: strncmp(n->key.p, name, namesz)))
1.92 schwarze 2253: n = n->next;
1.94 kristaps 2254:
2255: if (NULL == n) {
1.106 kristaps 2256: /* Create a new string table entry. */
1.166 kristaps 2257: n = mandoc_malloc(sizeof(struct roffkv));
2258: n->key.p = mandoc_strndup(name, namesz);
2259: n->key.sz = namesz;
2260: n->val.p = NULL;
2261: n->val.sz = 0;
1.164 kristaps 2262: n->next = *r;
2263: *r = n;
1.193 schwarze 2264: } else if (0 == append) {
1.166 kristaps 2265: free(n->val.p);
2266: n->val.p = NULL;
2267: n->val.sz = 0;
1.106 kristaps 2268: }
2269:
2270: if (NULL == string)
2271: return;
2272:
2273: /*
2274: * One additional byte for the '\n' in multiline mode,
2275: * and one for the terminating '\0'.
2276: */
1.193 schwarze 2277: newch = stringsz + (1 < append ? 2u : 1u);
1.164 kristaps 2278:
1.166 kristaps 2279: if (NULL == n->val.p) {
2280: n->val.p = mandoc_malloc(newch);
2281: *n->val.p = '\0';
1.106 kristaps 2282: oldch = 0;
2283: } else {
1.166 kristaps 2284: oldch = n->val.sz;
2285: n->val.p = mandoc_realloc(n->val.p, oldch + newch);
1.106 kristaps 2286: }
2287:
2288: /* Skip existing content in the destination buffer. */
1.166 kristaps 2289: c = n->val.p + (int)oldch;
1.106 kristaps 2290:
2291: /* Append new content to the destination buffer. */
1.164 kristaps 2292: i = 0;
2293: while (i < (int)stringsz) {
1.106 kristaps 2294: /*
2295: * Rudimentary roff copy mode:
2296: * Handle escaped backslashes.
2297: */
1.164 kristaps 2298: if ('\\' == string[i] && '\\' == string[i + 1])
2299: i++;
2300: *c++ = string[i++];
1.106 kristaps 2301: }
1.94 kristaps 2302:
1.106 kristaps 2303: /* Append terminating bytes. */
1.193 schwarze 2304: if (1 < append)
1.106 kristaps 2305: *c++ = '\n';
1.163 kristaps 2306:
1.106 kristaps 2307: *c = '\0';
1.166 kristaps 2308: n->val.sz = (int)(c - n->val.p);
1.92 schwarze 2309: }
2310:
1.94 kristaps 2311: static const char *
2312: roff_getstrn(const struct roff *r, const char *name, size_t len)
1.92 schwarze 2313: {
1.166 kristaps 2314: const struct roffkv *n;
1.191 schwarze 2315: int i;
1.92 schwarze 2316:
1.164 kristaps 2317: for (n = r->strtab; n; n = n->next)
1.207 schwarze 2318: if (0 == strncmp(name, n->key.p, len) &&
2319: '\0' == n->key.p[(int)len])
1.166 kristaps 2320: return(n->val.p);
1.191 schwarze 2321:
2322: for (i = 0; i < PREDEFS_MAX; i++)
2323: if (0 == strncmp(name, predefs[i].name, len) &&
2324: '\0' == predefs[i].name[(int)len])
2325: return(predefs[i].str);
1.94 kristaps 2326:
1.157 kristaps 2327: return(NULL);
1.92 schwarze 2328: }
2329:
1.94 kristaps 2330: static void
1.167 kristaps 2331: roff_freestr(struct roffkv *r)
1.92 schwarze 2332: {
1.166 kristaps 2333: struct roffkv *n, *nn;
1.92 schwarze 2334:
1.167 kristaps 2335: for (n = r; n; n = nn) {
1.166 kristaps 2336: free(n->key.p);
2337: free(n->val.p);
1.92 schwarze 2338: nn = n->next;
2339: free(n);
2340: }
1.114 kristaps 2341: }
2342:
2343: const struct tbl_span *
2344: roff_span(const struct roff *r)
2345: {
1.207 schwarze 2346:
1.114 kristaps 2347: return(r->tbl ? tbl_span(r->tbl) : NULL);
1.125 kristaps 2348: }
2349:
2350: const struct eqn *
2351: roff_eqn(const struct roff *r)
2352: {
1.207 schwarze 2353:
1.125 kristaps 2354: return(r->last_eqn ? &r->last_eqn->eqn : NULL);
1.164 kristaps 2355: }
2356:
2357: /*
2358: * Duplicate an input string, making the appropriate character
2359: * conversations (as stipulated by `tr') along the way.
2360: * Returns a heap-allocated string with all the replacements made.
2361: */
2362: char *
2363: roff_strdup(const struct roff *r, const char *p)
2364: {
1.166 kristaps 2365: const struct roffkv *cp;
1.164 kristaps 2366: char *res;
2367: const char *pp;
2368: size_t ssz, sz;
2369: enum mandoc_esc esc;
2370:
1.167 kristaps 2371: if (NULL == r->xmbtab && NULL == r->xtab)
1.164 kristaps 2372: return(mandoc_strdup(p));
2373: else if ('\0' == *p)
2374: return(mandoc_strdup(""));
2375:
2376: /*
2377: * Step through each character looking for term matches
2378: * (remember that a `tr' can be invoked with an escape, which is
2379: * a glyph but the escape is multi-character).
2380: * We only do this if the character hash has been initialised
2381: * and the string is >0 length.
2382: */
2383:
2384: res = NULL;
2385: ssz = 0;
2386:
2387: while ('\0' != *p) {
1.167 kristaps 2388: if ('\\' != *p && r->xtab && r->xtab[(int)*p].p) {
2389: sz = r->xtab[(int)*p].sz;
2390: res = mandoc_realloc(res, ssz + sz + 1);
2391: memcpy(res + ssz, r->xtab[(int)*p].p, sz);
2392: ssz += sz;
2393: p++;
2394: continue;
2395: } else if ('\\' != *p) {
2396: res = mandoc_realloc(res, ssz + 2);
2397: res[ssz++] = *p++;
2398: continue;
2399: }
2400:
1.164 kristaps 2401: /* Search for term matches. */
1.167 kristaps 2402: for (cp = r->xmbtab; cp; cp = cp->next)
1.166 kristaps 2403: if (0 == strncmp(p, cp->key.p, cp->key.sz))
1.164 kristaps 2404: break;
2405:
2406: if (NULL != cp) {
2407: /*
2408: * A match has been found.
2409: * Append the match to the array and move
2410: * forward by its keysize.
2411: */
1.207 schwarze 2412: res = mandoc_realloc(res,
2413: ssz + cp->val.sz + 1);
1.166 kristaps 2414: memcpy(res + ssz, cp->val.p, cp->val.sz);
2415: ssz += cp->val.sz;
2416: p += (int)cp->key.sz;
1.164 kristaps 2417: continue;
2418: }
2419:
1.167 kristaps 2420: /*
2421: * Handle escapes carefully: we need to copy
2422: * over just the escape itself, or else we might
2423: * do replacements within the escape itself.
2424: * Make sure to pass along the bogus string.
2425: */
2426: pp = p++;
2427: esc = mandoc_escape(&p, NULL, NULL);
2428: if (ESCAPE_ERROR == esc) {
2429: sz = strlen(pp);
1.164 kristaps 2430: res = mandoc_realloc(res, ssz + sz + 1);
2431: memcpy(res + ssz, pp, sz);
1.167 kristaps 2432: break;
1.164 kristaps 2433: }
1.207 schwarze 2434: /*
2435: * We bail out on bad escapes.
1.167 kristaps 2436: * No need to warn: we already did so when
2437: * roff_res() was called.
2438: */
2439: sz = (int)(p - pp);
2440: res = mandoc_realloc(res, ssz + sz + 1);
2441: memcpy(res + ssz, pp, sz);
2442: ssz += sz;
1.164 kristaps 2443: }
2444:
2445: res[(int)ssz] = '\0';
2446: return(res);
1.227 schwarze 2447: }
2448:
2449: int
2450: roff_getformat(const struct roff *r)
2451: {
2452:
2453: return(r->format);
1.174 kristaps 2454: }
2455:
2456: /*
1.207 schwarze 2457: * Find out whether a line is a macro line or not.
1.174 kristaps 2458: * If it is, adjust the current position and return one; if it isn't,
2459: * return zero and don't change the current position.
2460: * If the control character has been set with `.cc', then let that grain
2461: * precedence.
2462: * This is slighly contrary to groff, where using the non-breaking
2463: * control character when `cc' has been invoked will cause the
2464: * non-breaking macro contents to be printed verbatim.
2465: */
2466: int
2467: roff_getcontrol(const struct roff *r, const char *cp, int *ppos)
2468: {
2469: int pos;
2470:
2471: pos = *ppos;
2472:
2473: if (0 != r->control && cp[pos] == r->control)
2474: pos++;
2475: else if (0 != r->control)
2476: return(0);
2477: else if ('\\' == cp[pos] && '.' == cp[pos + 1])
2478: pos += 2;
2479: else if ('.' == cp[pos] || '\'' == cp[pos])
2480: pos++;
2481: else
2482: return(0);
2483:
2484: while (' ' == cp[pos] || '\t' == cp[pos])
2485: pos++;
2486:
2487: *ppos = pos;
2488: return(1);
1.74 kristaps 2489: }
CVSweb