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