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