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