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