Annotation of mandoc/roff.c, Revision 1.42
1.42 ! kristaps 1: /* $Id: roff.c,v 1.41 2008/12/05 11:28:17 kristaps Exp $ */
1.1 kristaps 2: /*
3: * Copyright (c) 2008 Kristaps Dzonsons <kristaps@kth.se>
4: *
5: * Permission to use, copy, modify, and distribute this software for any
6: * purpose with or without fee is hereby granted, provided that the
7: * above copyright notice and this permission notice appear in all
8: * copies.
9: *
10: * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL
11: * WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED
12: * WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE
13: * AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL
14: * DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR
15: * PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER
16: * TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR
17: * PERFORMANCE OF THIS SOFTWARE.
18: */
1.30 kristaps 19: #include <sys/param.h>
1.33 kristaps 20: #include <sys/types.h>
1.30 kristaps 21:
1.1 kristaps 22: #include <assert.h>
23: #include <ctype.h>
24: #include <err.h>
1.12 kristaps 25: #include <stdarg.h>
1.1 kristaps 26: #include <stdlib.h>
27: #include <stdio.h>
28: #include <string.h>
29: #include <time.h>
30:
31: #include "libmdocml.h"
32: #include "private.h"
33:
1.33 kristaps 34: /* FIXME: First letters of quoted-text interpreted in rofffindtok. */
35: /* FIXME: `No' not implemented. */
1.27 kristaps 36: /* TODO: warn if Pp occurs before/after Sh etc. (see mdoc.samples). */
37: /* TODO: warn about "X section only" macros. */
38: /* TODO: warn about empty lists. */
39: /* TODO: (warn) some sections need specific elements. */
40: /* TODO: (warn) NAME section has particular order. */
41: /* TODO: unify empty-content tags a la <br />. */
42: /* TODO: macros with a set number of arguments? */
1.36 kristaps 43: /* TODO: validate Dt macro arguments. */
1.41 kristaps 44: /* FIXME: Bl -diag ignore callable children. */
1.11 kristaps 45:
1.1 kristaps 46: enum roffd {
47: ROFF_ENTER = 0,
48: ROFF_EXIT
49: };
50:
51: enum rofftype {
52: ROFF_COMMENT,
53: ROFF_TEXT,
1.11 kristaps 54: ROFF_LAYOUT,
55: ROFF_SPECIAL
1.1 kristaps 56: };
57:
58: #define ROFFCALL_ARGS \
1.2 kristaps 59: int tok, struct rofftree *tree, \
1.18 kristaps 60: char *argv[], enum roffd type
1.1 kristaps 61:
62: struct rofftree;
63:
64: struct rofftok {
1.5 kristaps 65: int (*cb)(ROFFCALL_ARGS); /* Callback. */
66: const int *args; /* Args (or NULL). */
1.32 kristaps 67: const int *parents; /* Limit to parents. */
68: const int *children; /* Limit to kids. */
69: int ctx; /* Blk-close node. */
1.5 kristaps 70: enum rofftype type; /* Type of macro. */
1.40 kristaps 71: int flags;
1.7 kristaps 72: #define ROFF_PARSED (1 << 0) /* "Parsed". */
73: #define ROFF_CALLABLE (1 << 1) /* "Callable". */
1.21 kristaps 74: #define ROFF_SHALLOW (1 << 2) /* Nesting block. */
1.32 kristaps 75: #define ROFF_LSCOPE (1 << 3) /* Line scope. */
1.1 kristaps 76: };
77:
78: struct roffnode {
1.5 kristaps 79: int tok; /* Token id. */
80: struct roffnode *parent; /* Parent (or NULL). */
1.1 kristaps 81: };
82:
83: struct rofftree {
1.5 kristaps 84: struct roffnode *last; /* Last parsed node. */
1.32 kristaps 85: char *cur; /* Line start. */
1.30 kristaps 86: struct tm tm; /* `Dd' results. */
1.42 ! kristaps 87: char name[64]; /* `Nm' results. */
1.5 kristaps 88: char os[64]; /* `Os' results. */
89: char title[64]; /* `Dt' results. */
90: char section[64]; /* `Dt' results. */
91: char volume[64]; /* `Dt' results. */
1.1 kristaps 92: int state;
1.5 kristaps 93: #define ROFF_PRELUDE (1 << 1) /* In roff prelude. */
94: #define ROFF_PRELUDE_Os (1 << 2) /* `Os' is parsed. */
95: #define ROFF_PRELUDE_Dt (1 << 3) /* `Dt' is parsed. */
96: #define ROFF_PRELUDE_Dd (1 << 4) /* `Dd' is parsed. */
97: #define ROFF_BODY (1 << 5) /* In roff body. */
1.32 kristaps 98: struct roffcb cb; /* Callbacks. */
99: void *arg; /* Callbacks' arg. */
1.1 kristaps 100: };
101:
1.42 ! kristaps 102: static int roff_Dd(ROFFCALL_ARGS); /* FIXME: deprecate. */
! 103: static int roff_Dt(ROFFCALL_ARGS); /* FIXME: deprecate. */
! 104: static int roff_Os(ROFFCALL_ARGS); /* FIXME: deprecate. */
! 105: static int roff_Ns(ROFFCALL_ARGS); /* FIXME: deprecate. */
! 106: static int roff_Sm(ROFFCALL_ARGS); /* FIXME: deprecate. */
1.2 kristaps 107: static int roff_layout(ROFFCALL_ARGS);
108: static int roff_text(ROFFCALL_ARGS);
1.27 kristaps 109: static int roff_noop(ROFFCALL_ARGS);
110: static int roff_depr(ROFFCALL_ARGS);
1.40 kristaps 111: static int roff_ordered(ROFFCALL_ARGS);
1.4 kristaps 112: static struct roffnode *roffnode_new(int, struct rofftree *);
1.15 kristaps 113: static void roffnode_free(struct rofftree *);
1.12 kristaps 114: static void roff_warn(const struct rofftree *,
115: const char *, char *, ...);
116: static void roff_err(const struct rofftree *,
117: const char *, char *, ...);
1.31 kristaps 118: static int roffpurgepunct(struct rofftree *, char **);
1.7 kristaps 119: static int roffscan(int, const int *);
1.1 kristaps 120: static int rofffindtok(const char *);
121: static int rofffindarg(const char *);
1.2 kristaps 122: static int rofffindcallable(const char *);
1.10 kristaps 123: static int roffargs(const struct rofftree *,
124: int, char *, char **);
1.5 kristaps 125: static int roffargok(int, int);
1.12 kristaps 126: static int roffnextopt(const struct rofftree *,
1.18 kristaps 127: int, char ***, char **);
1.27 kristaps 128: static int roffparseopts(struct rofftree *, int,
129: char ***, int *, char **);
1.33 kristaps 130: static int roffcall(struct rofftree *, int, char **);
1.17 kristaps 131: static int roffparse(struct rofftree *, char *);
1.37 kristaps 132: static int textparse(struct rofftree *, char *);
133: static int roffdata(struct rofftree *, int, char *);
1.40 kristaps 134: static int roffspecial(struct rofftree *, int, char **);
1.42 ! kristaps 135: static int roffsetname(struct rofftree *, char **);
! 136: static int roffgetname(struct rofftree *, char **,
! 137: const char *);
1.1 kristaps 138:
1.35 kristaps 139: #ifdef __linux__
140: extern size_t strlcat(char *, const char *, size_t);
141: extern size_t strlcpy(char *, const char *, size_t);
1.33 kristaps 142: extern int vsnprintf(char *, size_t,
143: const char *, va_list);
144: extern char *strptime(const char *, const char *,
145: struct tm *);
146: #endif
147:
1.6 kristaps 148:
1.32 kristaps 149: static const int roffarg_An[] = { ROFF_Split, ROFF_Nosplit, ROFF_ARGMAX };
150: static const int roffarg_Bd[] = { ROFF_Ragged, ROFF_Unfilled, ROFF_Literal,
151: ROFF_File, ROFF_Offset, ROFF_Filled, ROFF_Compact, ROFF_ARGMAX };
1.12 kristaps 152: static const int roffarg_Bk[] = { ROFF_Words, ROFF_ARGMAX };
1.7 kristaps 153: static const int roffarg_Ex[] = { ROFF_Std, ROFF_ARGMAX };
154: static const int roffarg_Rv[] = { ROFF_Std, ROFF_ARGMAX };
1.32 kristaps 155: static const int roffarg_Bl[] = { ROFF_Bullet, ROFF_Dash, ROFF_Hyphen,
156: ROFF_Item, ROFF_Enum, ROFF_Tag, ROFF_Diag, ROFF_Hang, ROFF_Ohang,
157: ROFF_Inset, ROFF_Column, ROFF_Offset, ROFF_Width, ROFF_Compact,
1.7 kristaps 158: ROFF_ARGMAX };
1.32 kristaps 159: static const int roffarg_St[] = { ROFF_p1003_1_88, ROFF_p1003_1_90,
160: ROFF_p1003_1_96, ROFF_p1003_1_2001, ROFF_p1003_1_2004, ROFF_p1003_1,
161: ROFF_p1003_1b, ROFF_p1003_1b_93, ROFF_p1003_1c_95, ROFF_p1003_1g_2000,
162: ROFF_p1003_2_92, ROFF_p1387_2_95, ROFF_p1003_2, ROFF_p1387_2,
163: ROFF_isoC_90, ROFF_isoC_amd1, ROFF_isoC_tcor1, ROFF_isoC_tcor2,
164: ROFF_isoC_99, ROFF_ansiC, ROFF_ansiC_89, ROFF_ansiC_99, ROFF_ieee754,
165: ROFF_iso8802_3, ROFF_xpg3, ROFF_xpg4, ROFF_xpg4_2, ROFF_xpg4_3,
166: ROFF_xbd5, ROFF_xcu5, ROFF_xsh5, ROFF_xns5, ROFF_xns5_2d2_0,
167: ROFF_xcurses4_2, ROFF_susv2, ROFF_susv3, ROFF_svid4, ROFF_ARGMAX };
1.5 kristaps 168:
1.6 kristaps 169: static const int roffchild_Bl[] = { ROFF_It, ROFF_El, ROFF_MAX };
1.7 kristaps 170: static const int roffchild_Fo[] = { ROFF_Fa, ROFF_Fc, ROFF_MAX };
1.32 kristaps 171: static const int roffchild_Rs[] = { ROFF_Re, ROFF__A, ROFF__B, ROFF__D,
172: ROFF__I, ROFF__J, ROFF__N, ROFF__O, ROFF__P, ROFF__R, ROFF__T, ROFF__V,
173: ROFF_MAX };
1.6 kristaps 174:
175: static const int roffparent_El[] = { ROFF_Bl, ROFF_It, ROFF_MAX };
1.7 kristaps 176: static const int roffparent_Fc[] = { ROFF_Fo, ROFF_Fa, ROFF_MAX };
1.29 kristaps 177: static const int roffparent_Oc[] = { ROFF_Oo, ROFF_MAX };
1.8 kristaps 178: static const int roffparent_It[] = { ROFF_Bl, ROFF_It, ROFF_MAX };
1.9 kristaps 179: static const int roffparent_Re[] = { ROFF_Rs, ROFF_MAX };
1.1 kristaps 180:
1.14 kristaps 181: static const struct rofftok tokens[ROFF_MAX] = {
1.27 kristaps 182: { roff_noop, NULL, NULL, NULL, 0, ROFF_COMMENT, 0 }, /* \" */
1.10 kristaps 183: { roff_Dd, NULL, NULL, NULL, 0, ROFF_TEXT, 0 }, /* Dd */
184: { roff_Dt, NULL, NULL, NULL, 0, ROFF_TEXT, 0 }, /* Dt */
1.21 kristaps 185: { roff_Os, NULL, NULL, NULL, 0, ROFF_TEXT, 0 }, /* Os */
186: { roff_layout, NULL, NULL, NULL, ROFF_Sh, ROFF_LAYOUT, 0 }, /* Sh */
187: { roff_layout, NULL, NULL, NULL, ROFF_Ss, ROFF_LAYOUT, 0 }, /* Ss */
1.27 kristaps 188: { roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, 0 }, /* Pp */ /* XXX 0 args */
189: { roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_LSCOPE }, /* D1 */
190: { roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_LSCOPE }, /* Dl */
1.12 kristaps 191: { roff_layout, roffarg_Bd, NULL, NULL, 0, ROFF_LAYOUT, 0 }, /* Bd */
1.27 kristaps 192: { roff_noop, NULL, NULL, NULL, ROFF_Bd, ROFF_LAYOUT, 0 }, /* Ed */
1.7 kristaps 193: { roff_layout, roffarg_Bl, NULL, roffchild_Bl, 0, ROFF_LAYOUT, 0 }, /* Bl */
1.27 kristaps 194: { roff_noop, NULL, roffparent_El, NULL, ROFF_Bl, ROFF_LAYOUT, 0 }, /* El */
1.21 kristaps 195: { roff_layout, NULL, roffparent_It, NULL, ROFF_It, ROFF_LAYOUT, ROFF_PARSED | ROFF_SHALLOW }, /* It */
1.20 kristaps 196: { roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Ad */ /* FIXME */
197: { roff_text, roffarg_An, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED }, /* An */
198: { roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Ar */
1.21 kristaps 199: { roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, 0 }, /* Cd */ /* XXX man.4 only */
1.7 kristaps 200: { roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Cm */
1.20 kristaps 201: { roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Dv */ /* XXX needs arg */
202: { roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Er */ /* XXX needs arg */
203: { roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Ev */ /* XXX needs arg */
1.7 kristaps 204: { roff_text, roffarg_Ex, NULL, NULL, 0, ROFF_TEXT, 0 }, /* Ex */
1.20 kristaps 205: { roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Fa */ /* XXX needs arg */
1.10 kristaps 206: { roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, 0 }, /* Fd */
1.20 kristaps 207: { roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Fl */
1.40 kristaps 208: {roff_ordered, NULL, NULL, NULL, 0, ROFF_TEXT, /*XXX*/ -1 }, /* Fn */
1.20 kristaps 209: { roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED }, /* Ft */
210: { roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Ic */ /* XXX needs arg */
1.10 kristaps 211: { roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, 0 }, /* In */
1.20 kristaps 212: { roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Li */
1.21 kristaps 213: { roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, 0 }, /* Nd */
1.42 ! kristaps 214: {roff_ordered, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Nm */
1.27 kristaps 215: { roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE | ROFF_LSCOPE }, /* Op */
216: { roff_depr, NULL, NULL, NULL, 0, ROFF_TEXT, 0 }, /* Ot */
1.20 kristaps 217: { roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Pa */
1.10 kristaps 218: { roff_text, roffarg_Rv, NULL, NULL, 0, ROFF_TEXT, 0 }, /* Rv */
1.7 kristaps 219: { roff_text, roffarg_St, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* St */
1.20 kristaps 220: { roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Va */
221: { roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Vt */ /* XXX needs arg */
1.40 kristaps 222: {roff_ordered, NULL, NULL, NULL, 0, ROFF_TEXT, /*XXX*/ -1 }, /* Xr */
1.9 kristaps 223: { roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED }, /* %A */
224: { roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE}, /* %B */
1.10 kristaps 225: { roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, 0 }, /* %D */
1.9 kristaps 226: { roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE}, /* %I */
227: { roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE}, /* %J */
1.10 kristaps 228: { roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, 0 }, /* %N */
229: { roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, 0 }, /* %O */
230: { roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, 0 }, /* %P */
231: { roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, 0 }, /* %R */
1.9 kristaps 232: { roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED }, /* %T */
1.10 kristaps 233: { roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, 0 }, /* %V */
234: { roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Ac */
235: { roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Ao */
1.27 kristaps 236: { roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE | ROFF_LSCOPE }, /* Aq */
1.10 kristaps 237: { roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, 0 }, /* At */ /* XXX at most 2 args */
238: { roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Bc */
1.28 kristaps 239: { roff_layout, NULL, NULL, NULL, 0, ROFF_LAYOUT, 0 }, /* Bf */ /* FIXME */
1.10 kristaps 240: { roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Bo */
1.27 kristaps 241: { roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE | ROFF_LSCOPE }, /* Bq */
1.20 kristaps 242: { roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED }, /* Bsx */
243: { roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED }, /* Bx */
1.26 kristaps 244: { NULL, NULL, NULL, NULL, 0, ROFF_SPECIAL, 0 }, /* Db */
1.10 kristaps 245: { roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Dc */
246: { roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Do */
1.27 kristaps 247: { roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE | ROFF_LSCOPE }, /* Dq */
1.10 kristaps 248: { roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Ec */
1.28 kristaps 249: { roff_noop, NULL, NULL, NULL, ROFF_Bf, ROFF_LAYOUT, 0 }, /* Ef */
1.20 kristaps 250: { roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Em */ /* XXX needs arg */
1.10 kristaps 251: { roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Eo */
1.20 kristaps 252: { roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED }, /* Fx */
253: { roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED }, /* Ms */
1.40 kristaps 254: { NULL, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* No */
1.31 kristaps 255: { roff_Ns, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Ns */
1.20 kristaps 256: { roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED }, /* Nx */
257: { roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED }, /* Ox */
1.10 kristaps 258: { roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Pc */
1.26 kristaps 259: { NULL, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED }, /* Pf */
1.28 kristaps 260: { roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Po */
1.27 kristaps 261: { roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE | ROFF_LSCOPE }, /* Pq */
1.10 kristaps 262: { roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Qc */
1.8 kristaps 263: { roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Ql */
1.27 kristaps 264: { roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Qo */
265: { roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE | ROFF_LSCOPE }, /* Qq */
266: { roff_noop, NULL, roffparent_Re, NULL, ROFF_Rs, ROFF_LAYOUT, 0 }, /* Re */
1.9 kristaps 267: { roff_layout, NULL, NULL, roffchild_Rs, 0, ROFF_LAYOUT, 0 }, /* Rs */
1.10 kristaps 268: { roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Sc */
269: { roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* So */
1.27 kristaps 270: { roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE | ROFF_LSCOPE }, /* Sq */
1.33 kristaps 271: { roff_Sm, NULL, NULL, NULL, 0, ROFF_TEXT, 0 }, /* Sm */
1.8 kristaps 272: { roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Sx */
1.20 kristaps 273: { roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Sy */
274: { roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Tn */
275: { roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED }, /* Ux */
1.40 kristaps 276: { NULL, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Xc */
277: { NULL, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Xo */
1.14 kristaps 278: { roff_layout, NULL, NULL, roffchild_Fo, 0, ROFF_LAYOUT, 0 }, /* Fo */
1.27 kristaps 279: { roff_noop, NULL, roffparent_Fc, NULL, ROFF_Fo, ROFF_LAYOUT, 0 }, /* Fc */
1.29 kristaps 280: { roff_layout, NULL, NULL, NULL, 0, ROFF_LAYOUT, 0 }, /* Oo */
1.27 kristaps 281: { roff_noop, NULL, roffparent_Oc, NULL, ROFF_Oo, ROFF_LAYOUT, 0 }, /* Oc */
1.12 kristaps 282: { roff_layout, roffarg_Bk, NULL, NULL, 0, ROFF_LAYOUT, 0 }, /* Bk */
1.27 kristaps 283: { roff_noop, NULL, NULL, NULL, ROFF_Bk, ROFF_LAYOUT, 0 }, /* Ek */
284: { NULL, NULL, NULL, NULL, 0, ROFF_TEXT, 0 }, /* Bt */
285: { NULL, NULL, NULL, NULL, 0, ROFF_TEXT, 0 }, /* Hf */
286: { roff_depr, NULL, NULL, NULL, 0, ROFF_TEXT, 0 }, /* Fr */
287: { NULL, NULL, NULL, NULL, 0, ROFF_TEXT, 0 }, /* Ud */
1.12 kristaps 288: };
1.1 kristaps 289:
1.40 kristaps 290: #define ROFF_VALUE (1 << 0)
291:
1.14 kristaps 292: static const int tokenargs[ROFF_ARGMAX] = {
1.12 kristaps 293: 0, 0, 0, 0,
294: 0, ROFF_VALUE, ROFF_VALUE, 0,
295: 0, 0, 0, 0,
296: 0, 0, 0, 0,
1.18 kristaps 297: 0, 0, ROFF_VALUE, 0,
1.42 ! kristaps 298: 0, ROFF_VALUE, 0, 0,
1.12 kristaps 299: 0, 0, 0, 0,
300: 0, 0, 0, 0,
301: 0, 0, 0, 0,
302: 0, 0, 0, 0,
303: 0, 0, 0, 0,
304: 0, 0, 0, 0,
305: 0, 0, 0, 0,
306: 0, 0, 0, 0,
307: 0, 0, 0, 0,
308: };
1.1 kristaps 309:
1.14 kristaps 310: const char *const toknamesp[ROFF_MAX] = {
1.8 kristaps 311: "\\\"", "Dd", "Dt", "Os",
312: "Sh", "Ss", "Pp", "D1",
313: "Dl", "Bd", "Ed", "Bl",
314: "El", "It", "Ad", "An",
315: "Ar", "Cd", "Cm", "Dv",
316: "Er", "Ev", "Ex", "Fa",
317: "Fd", "Fl", "Fn", "Ft",
318: "Ic", "In", "Li", "Nd",
319: "Nm", "Op", "Ot", "Pa",
320: "Rv", "St", "Va", "Vt",
1.23 kristaps 321: /* LINTED */
1.8 kristaps 322: "Xr", "\%A", "\%B", "\%D",
1.23 kristaps 323: /* LINTED */
1.8 kristaps 324: "\%I", "\%J", "\%N", "\%O",
1.23 kristaps 325: /* LINTED */
1.8 kristaps 326: "\%P", "\%R", "\%T", "\%V",
327: "Ac", "Ao", "Aq", "At",
328: "Bc", "Bf", "Bo", "Bq",
329: "Bsx", "Bx", "Db", "Dc",
330: "Do", "Dq", "Ec", "Ef",
331: "Em", "Eo", "Fx", "Ms",
332: "No", "Ns", "Nx", "Ox",
333: "Pc", "Pf", "Po", "Pq",
334: "Qc", "Ql", "Qo", "Qq",
335: "Re", "Rs", "Sc", "So",
336: "Sq", "Sm", "Sx", "Sy",
337: "Tn", "Ux", "Xc", "Xo",
1.9 kristaps 338: "Fo", "Fc", "Oo", "Oc",
1.27 kristaps 339: "Bk", "Ek", "Bt", "Hf",
340: "Fr", "Ud",
1.5 kristaps 341: };
342:
1.14 kristaps 343: const char *const tokargnamesp[ROFF_ARGMAX] = {
1.9 kristaps 344: "split", "nosplit", "ragged",
345: "unfilled", "literal", "file",
346: "offset", "bullet", "dash",
347: "hyphen", "item", "enum",
348: "tag", "diag", "hang",
349: "ohang", "inset", "column",
350: "width", "compact", "std",
351: "p1003.1-88", "p1003.1-90", "p1003.1-96",
352: "p1003.1-2001", "p1003.1-2004", "p1003.1",
353: "p1003.1b", "p1003.1b-93", "p1003.1c-95",
354: "p1003.1g-2000", "p1003.2-92", "p1387.2-95",
355: "p1003.2", "p1387.2", "isoC-90",
356: "isoC-amd1", "isoC-tcor1", "isoC-tcor2",
357: "isoC-99", "ansiC", "ansiC-89",
358: "ansiC-99", "ieee754", "iso8802-3",
359: "xpg3", "xpg4", "xpg4.2",
360: "xpg4.3", "xbd5", "xcu5",
361: "xsh5", "xns5", "xns5.2d2.0",
362: "xcurses4.2", "susv2", "susv3",
1.12 kristaps 363: "svid4", "filled", "words",
1.5 kristaps 364: };
365:
366: const char *const *toknames = toknamesp;
367: const char *const *tokargnames = tokargnamesp;
1.4 kristaps 368:
1.1 kristaps 369:
370: int
371: roff_free(struct rofftree *tree, int flush)
372: {
1.16 kristaps 373: int error, t;
1.15 kristaps 374: struct roffnode *n;
1.1 kristaps 375:
1.17 kristaps 376: error = 0;
377:
1.16 kristaps 378: if ( ! flush)
379: goto end;
1.1 kristaps 380:
1.16 kristaps 381: error = 1;
1.1 kristaps 382:
1.16 kristaps 383: if (ROFF_PRELUDE & tree->state) {
1.28 kristaps 384: roff_err(tree, NULL, "prelude never finished");
1.16 kristaps 385: goto end;
386: }
387:
1.28 kristaps 388: for (n = tree->last; n; n = n->parent) {
1.16 kristaps 389: if (0 != tokens[n->tok].ctx)
1.17 kristaps 390: continue;
1.28 kristaps 391: roff_err(tree, NULL, "closing explicit scope `%s'",
1.16 kristaps 392: toknames[n->tok]);
393: goto end;
394: }
395:
396: while (tree->last) {
397: t = tree->last->tok;
398: if ( ! (*tokens[t].cb)(t, tree, NULL, ROFF_EXIT))
399: goto end;
1.1 kristaps 400: }
401:
1.30 kristaps 402: if ( ! (*tree->cb.rofftail)(tree->arg))
403: goto end;
404:
1.16 kristaps 405: error = 0;
406:
407: end:
408:
1.15 kristaps 409: while (tree->last)
410: roffnode_free(tree);
411:
1.1 kristaps 412: free(tree);
1.17 kristaps 413:
1.1 kristaps 414: return(error ? 0 : 1);
415: }
416:
417:
418: struct rofftree *
1.15 kristaps 419: roff_alloc(const struct roffcb *cb, void *args)
1.1 kristaps 420: {
421: struct rofftree *tree;
422:
1.17 kristaps 423: assert(args);
424: assert(cb);
425:
1.12 kristaps 426: if (NULL == (tree = calloc(1, sizeof(struct rofftree))))
427: err(1, "calloc");
1.1 kristaps 428:
429: tree->state = ROFF_PRELUDE;
1.15 kristaps 430: tree->arg = args;
431:
432: (void)memcpy(&tree->cb, cb, sizeof(struct roffcb));
1.1 kristaps 433:
434: return(tree);
435: }
436:
437:
438: int
1.17 kristaps 439: roff_engine(struct rofftree *tree, char *buf)
1.1 kristaps 440: {
441:
1.17 kristaps 442: tree->cur = buf;
443: assert(buf);
1.12 kristaps 444:
1.17 kristaps 445: if (0 == *buf) {
1.29 kristaps 446: roff_err(tree, buf, "blank line");
1.1 kristaps 447: return(0);
448: } else if ('.' != *buf)
1.17 kristaps 449: return(textparse(tree, buf));
1.1 kristaps 450:
1.17 kristaps 451: return(roffparse(tree, buf));
1.1 kristaps 452: }
453:
454:
455: static int
1.37 kristaps 456: textparse(struct rofftree *tree, char *buf)
1.1 kristaps 457: {
1.37 kristaps 458: char *bufp;
459:
460: /* TODO: literal parsing. */
1.17 kristaps 461:
1.30 kristaps 462: if ( ! (ROFF_BODY & tree->state)) {
463: roff_err(tree, buf, "data not in body");
464: return(0);
465: }
1.37 kristaps 466:
467: /* LINTED */
468: while (*buf) {
469: while (*buf && isspace(*buf))
470: buf++;
471:
472: if (0 == *buf)
473: break;
474:
475: bufp = buf++;
476:
477: while (*buf && ! isspace(*buf))
478: buf++;
479:
480: if (0 != *buf) {
481: *buf++ = 0;
482: if ( ! roffdata(tree, 1, bufp))
483: return(0);
484: continue;
485: }
486:
487: if ( ! roffdata(tree, 1, bufp))
488: return(0);
489: break;
490: }
491:
492: return(1);
1.1 kristaps 493: }
494:
495:
496: static int
1.10 kristaps 497: roffargs(const struct rofftree *tree,
498: int tok, char *buf, char **argv)
1.1 kristaps 499: {
500: int i;
1.12 kristaps 501: char *p;
1.1 kristaps 502:
503: assert(tok >= 0 && tok < ROFF_MAX);
504: assert('.' == *buf);
505:
1.12 kristaps 506: p = buf;
507:
1.40 kristaps 508: /*
509: * This is an ugly little loop. It parses a line into
510: * space-delimited tokens. If a quote mark is encountered, a
511: * token is alloted the entire quoted text. If whitespace is
512: * escaped, it's included in the prior alloted token.
513: */
514:
1.1 kristaps 515: /* LINTED */
1.37 kristaps 516: for (i = 0; *buf && i < ROFF_MAXLINEARG; i++) {
1.10 kristaps 517: if ('\"' == *buf) {
518: argv[i] = ++buf;
519: while (*buf && '\"' != *buf)
520: buf++;
521: if (0 == *buf) {
1.13 kristaps 522: roff_err(tree, argv[i], "unclosed "
1.12 kristaps 523: "quote in argument "
524: "list for `%s'",
525: toknames[tok]);
1.10 kristaps 526: return(0);
527: }
528: } else {
529: argv[i] = buf++;
1.40 kristaps 530: while (*buf) {
531: if ( ! isspace(*buf)) {
532: buf++;
533: continue;
534: }
535: if (*(buf - 1) == '\\') {
536: buf++;
537: continue;
538: }
539: break;
540: }
1.10 kristaps 541: if (0 == *buf)
542: continue;
1.1 kristaps 543: }
544: *buf++ = 0;
545: while (*buf && isspace(*buf))
546: buf++;
547: }
1.40 kristaps 548:
1.1 kristaps 549: assert(i > 0);
1.37 kristaps 550: if (ROFF_MAXLINEARG == i && *buf) {
1.13 kristaps 551: roff_err(tree, p, "too many arguments for `%s'", toknames
1.12 kristaps 552: [tok]);
1.10 kristaps 553: return(0);
554: }
555:
556: argv[i] = NULL;
557: return(1);
1.1 kristaps 558: }
559:
560:
1.6 kristaps 561: static int
562: roffscan(int tok, const int *tokv)
563: {
1.7 kristaps 564:
1.6 kristaps 565: if (NULL == tokv)
566: return(1);
567:
1.7 kristaps 568: for ( ; ROFF_MAX != *tokv; tokv++)
1.6 kristaps 569: if (tok == *tokv)
570: return(1);
571:
572: return(0);
573: }
574:
575:
1.1 kristaps 576: static int
1.17 kristaps 577: roffparse(struct rofftree *tree, char *buf)
1.1 kristaps 578: {
579: int tok, t;
1.6 kristaps 580: struct roffnode *n;
1.37 kristaps 581: char *argv[ROFF_MAXLINEARG];
1.18 kristaps 582: char **argvp;
1.1 kristaps 583:
1.25 kristaps 584: if (0 != *buf && 0 != *(buf + 1) && 0 != *(buf + 2))
585: if (0 == strncmp(buf, ".\\\"", 3))
586: return(1);
587:
1.6 kristaps 588: if (ROFF_MAX == (tok = rofffindtok(buf + 1))) {
1.12 kristaps 589: roff_err(tree, buf + 1, "bogus line macro");
1.6 kristaps 590: return(0);
591: } else if (NULL == tokens[tok].cb) {
1.12 kristaps 592: roff_err(tree, buf + 1, "unsupported macro `%s'",
593: toknames[tok]);
1.1 kristaps 594: return(0);
1.25 kristaps 595: }
596:
597: assert(ROFF___ != tok);
1.10 kristaps 598: if ( ! roffargs(tree, tok, buf, argv))
1.1 kristaps 599: return(0);
1.12 kristaps 600:
1.18 kristaps 601: argvp = (char **)argv;
1.6 kristaps 602:
603: /*
1.12 kristaps 604: * Prelude macros break some assumptions, so branch now.
1.6 kristaps 605: */
1.1 kristaps 606:
1.6 kristaps 607: if (ROFF_PRELUDE & tree->state) {
608: assert(NULL == tree->last);
609: return((*tokens[tok].cb)(tok, tree, argvp, ROFF_ENTER));
1.28 kristaps 610: }
1.6 kristaps 611:
612: assert(ROFF_BODY & tree->state);
613:
614: /*
615: * First check that our possible parents and parent's possible
616: * children are satisfied.
617: */
618:
1.28 kristaps 619: if (tree->last && ! roffscan
620: (tree->last->tok, tokens[tok].parents)) {
1.15 kristaps 621: roff_err(tree, *argvp, "`%s' has invalid parent `%s'",
622: toknames[tok],
623: toknames[tree->last->tok]);
1.6 kristaps 624: return(0);
625: }
626:
1.28 kristaps 627: if (tree->last && ! roffscan
628: (tok, tokens[tree->last->tok].children)) {
1.18 kristaps 629: roff_err(tree, *argvp, "`%s' is invalid child of `%s'",
630: toknames[tok],
631: toknames[tree->last->tok]);
1.1 kristaps 632: return(0);
633: }
634:
635: /*
1.6 kristaps 636: * Branch if we're not a layout token.
1.1 kristaps 637: */
638:
1.6 kristaps 639: if (ROFF_LAYOUT != tokens[tok].type)
640: return((*tokens[tok].cb)(tok, tree, argvp, ROFF_ENTER));
641: if (0 == tokens[tok].ctx)
642: return((*tokens[tok].cb)(tok, tree, argvp, ROFF_ENTER));
1.1 kristaps 643:
1.12 kristaps 644: /*
645: * First consider implicit-end tags, like as follows:
646: * .Sh SECTION 1
647: * .Sh SECTION 2
648: * In this, we want to close the scope of the NAME section. If
649: * there's an intermediary implicit-end tag, such as
650: * .Sh SECTION 1
651: * .Ss Subsection 1
652: * .Sh SECTION 2
653: * then it must be closed as well.
654: */
655:
1.6 kristaps 656: if (tok == tokens[tok].ctx) {
1.12 kristaps 657: /*
658: * First search up to the point where we must close.
659: * If one doesn't exist, then we can open a new scope.
660: */
661:
1.6 kristaps 662: for (n = tree->last; n; n = n->parent) {
663: assert(0 == tokens[n->tok].ctx ||
664: n->tok == tokens[n->tok].ctx);
665: if (n->tok == tok)
666: break;
1.10 kristaps 667: if (ROFF_SHALLOW & tokens[tok].flags) {
668: n = NULL;
669: break;
670: }
1.28 kristaps 671: if (tokens[n->tok].ctx == n->tok)
672: continue;
673: roff_err(tree, *argv, "`%s' breaks `%s' scope",
674: toknames[tok], toknames[n->tok]);
675: return(0);
1.6 kristaps 676: }
1.10 kristaps 677:
678: /*
679: * Create a new scope, as no previous one exists to
680: * close out.
681: */
1.12 kristaps 682:
683: if (NULL == n)
1.6 kristaps 684: return((*tokens[tok].cb)(tok, tree, argvp, ROFF_ENTER));
1.10 kristaps 685:
686: /*
1.12 kristaps 687: * Close out all intermediary scoped blocks, then hang
688: * the current scope from our predecessor's parent.
1.10 kristaps 689: */
690:
1.1 kristaps 691: do {
692: t = tree->last->tok;
1.6 kristaps 693: if ( ! (*tokens[t].cb)(t, tree, NULL, ROFF_EXIT))
1.1 kristaps 694: return(0);
695: } while (t != tok);
1.6 kristaps 696:
697: return((*tokens[tok].cb)(tok, tree, argvp, ROFF_ENTER));
1.1 kristaps 698: }
699:
1.12 kristaps 700: /*
701: * Now consider explicit-end tags, where we want to close back
702: * to a specific tag. Example:
703: * .Bl
704: * .It Item.
705: * .El
706: * In this, the `El' tag closes out the scope of `Bl'.
707: */
708:
1.6 kristaps 709: assert(tok != tokens[tok].ctx && 0 != tokens[tok].ctx);
710:
1.32 kristaps 711: /* LINTED */
1.28 kristaps 712: for (n = tree->last; n; n = n->parent)
713: if (n->tok != tokens[tok].ctx) {
714: if (n->tok == tokens[n->tok].ctx)
715: continue;
716: roff_err(tree, *argv, "`%s' breaks `%s' scope",
717: toknames[tok], toknames[n->tok]);
718: return(0);
719: } else
720: break;
721:
722:
723: if (NULL == n) {
724: roff_err(tree, *argv, "`%s' has no starting tag `%s'",
725: toknames[tok],
726: toknames[tokens[tok].ctx]);
727: return(0);
728: }
729:
1.14 kristaps 730: /* LINTED */
1.6 kristaps 731: do {
732: t = tree->last->tok;
733: if ( ! (*tokens[t].cb)(t, tree, NULL, ROFF_EXIT))
734: return(0);
735: } while (t != tokens[tok].ctx);
1.1 kristaps 736:
1.9 kristaps 737: return(1);
1.1 kristaps 738: }
739:
740:
741: static int
742: rofffindarg(const char *name)
743: {
744: size_t i;
745:
746: /* FIXME: use a table, this is slow but ok for now. */
747:
748: /* LINTED */
749: for (i = 0; i < ROFF_ARGMAX; i++)
750: /* LINTED */
1.4 kristaps 751: if (0 == strcmp(name, tokargnames[i]))
1.1 kristaps 752: return((int)i);
753:
754: return(ROFF_ARGMAX);
755: }
756:
757:
758: static int
1.6 kristaps 759: rofffindtok(const char *buf)
1.1 kristaps 760: {
1.6 kristaps 761: char token[4];
1.23 kristaps 762: int i;
1.1 kristaps 763:
1.6 kristaps 764: for (i = 0; *buf && ! isspace(*buf) && i < 3; i++, buf++)
765: token[i] = *buf;
766:
1.9 kristaps 767: if (i == 3)
1.6 kristaps 768: return(ROFF_MAX);
769:
770: token[i] = 0;
771:
1.1 kristaps 772: /* FIXME: use a table, this is slow but ok for now. */
773:
774: /* LINTED */
775: for (i = 0; i < ROFF_MAX; i++)
776: /* LINTED */
1.12 kristaps 777: if (0 == strcmp(toknames[i], token))
1.1 kristaps 778: return((int)i);
1.7 kristaps 779:
1.1 kristaps 780: return(ROFF_MAX);
781: }
782:
783:
1.20 kristaps 784: static int
785: roffispunct(const char *p)
786: {
787:
788: if (0 == *p)
789: return(0);
790: if (0 != *(p + 1))
791: return(0);
792:
793: switch (*p) {
794: case('{'):
795: /* FALLTHROUGH */
796: case('.'):
797: /* FALLTHROUGH */
798: case(','):
799: /* FALLTHROUGH */
800: case(';'):
801: /* FALLTHROUGH */
802: case(':'):
803: /* FALLTHROUGH */
804: case('?'):
805: /* FALLTHROUGH */
806: case('!'):
807: /* FALLTHROUGH */
808: case('('):
809: /* FALLTHROUGH */
810: case(')'):
811: /* FALLTHROUGH */
812: case('['):
813: /* FALLTHROUGH */
814: case(']'):
815: /* FALLTHROUGH */
816: case('}'):
817: return(1);
818: default:
819: break;
820: }
821:
822: return(0);
823: }
824:
825:
1.2 kristaps 826: static int
827: rofffindcallable(const char *name)
828: {
829: int c;
830:
831: if (ROFF_MAX == (c = rofffindtok(name)))
832: return(ROFF_MAX);
1.8 kristaps 833: assert(c >= 0 && c < ROFF_MAX);
1.2 kristaps 834: return(ROFF_CALLABLE & tokens[c].flags ? c : ROFF_MAX);
835: }
836:
837:
1.1 kristaps 838: static struct roffnode *
1.4 kristaps 839: roffnode_new(int tokid, struct rofftree *tree)
1.1 kristaps 840: {
841: struct roffnode *p;
842:
1.12 kristaps 843: if (NULL == (p = malloc(sizeof(struct roffnode))))
844: err(1, "malloc");
1.1 kristaps 845:
846: p->tok = tokid;
847: p->parent = tree->last;
848: tree->last = p;
1.9 kristaps 849:
1.1 kristaps 850: return(p);
851: }
852:
853:
1.5 kristaps 854: static int
855: roffargok(int tokid, int argid)
856: {
857: const int *c;
858:
859: if (NULL == (c = tokens[tokid].args))
860: return(0);
861:
862: for ( ; ROFF_ARGMAX != *c; c++)
863: if (argid == *c)
864: return(1);
865:
866: return(0);
867: }
868:
869:
1.1 kristaps 870: static void
1.15 kristaps 871: roffnode_free(struct rofftree *tree)
1.1 kristaps 872: {
873: struct roffnode *p;
874:
875: assert(tree->last);
876:
877: p = tree->last;
878: tree->last = tree->last->parent;
879: free(p);
880: }
881:
882:
1.6 kristaps 883: static int
1.40 kristaps 884: roffspecial(struct rofftree *tree, int tok, char **ordp)
885: {
886:
887: return((*tree->cb.roffspecial)(tree->arg, tok,
888: tree->cur, ordp));
889: }
890:
891:
892: static int
1.33 kristaps 893: roffcall(struct rofftree *tree, int tok, char **argv)
894: {
895:
896: if (NULL == tokens[tok].cb) {
897: roff_err(tree, *argv, "unsupported macro `%s'",
898: toknames[tok]);
899: return(0);
900: }
901: if ( ! (*tokens[tok].cb)(tok, tree, argv, ROFF_ENTER))
902: return(0);
903: return(1);
904: }
905:
906:
907: static int
1.12 kristaps 908: roffnextopt(const struct rofftree *tree, int tok,
1.18 kristaps 909: char ***in, char **val)
1.6 kristaps 910: {
1.18 kristaps 911: char *arg, **argv;
1.6 kristaps 912: int v;
913:
914: *val = NULL;
915: argv = *in;
916: assert(argv);
917:
918: if (NULL == (arg = *argv))
919: return(-1);
920: if ('-' != *arg)
921: return(-1);
922:
1.12 kristaps 923: if (ROFF_ARGMAX == (v = rofffindarg(arg + 1))) {
924: roff_warn(tree, arg, "argument-like parameter `%s' to "
1.33 kristaps 925: "`%s'", arg, toknames[tok]);
1.6 kristaps 926: return(-1);
1.12 kristaps 927: }
928:
929: if ( ! roffargok(tok, v)) {
930: roff_warn(tree, arg, "invalid argument parameter `%s' to "
931: "`%s'", tokargnames[v], toknames[tok]);
1.6 kristaps 932: return(-1);
1.12 kristaps 933: }
934:
935: if ( ! (ROFF_VALUE & tokenargs[v]))
1.6 kristaps 936: return(v);
937:
938: *in = ++argv;
939:
1.12 kristaps 940: if (NULL == *argv) {
941: roff_err(tree, arg, "empty value of `%s' for `%s'",
942: tokargnames[v], toknames[tok]);
943: return(ROFF_ARGMAX);
944: }
1.6 kristaps 945:
1.12 kristaps 946: return(v);
1.6 kristaps 947: }
948:
949:
1.27 kristaps 950: static int
1.31 kristaps 951: roffpurgepunct(struct rofftree *tree, char **argv)
952: {
953: int i;
954:
955: i = 0;
956: while (argv[i])
957: i++;
958: assert(i > 0);
959: if ( ! roffispunct(argv[--i]))
960: return(1);
961: while (i >= 0 && roffispunct(argv[i]))
962: i--;
963: i++;
964:
965: /* LINTED */
966: while (argv[i])
1.37 kristaps 967: if ( ! roffdata(tree, 0, argv[i++]))
1.31 kristaps 968: return(0);
969: return(1);
970: }
971:
972:
973: static int
1.27 kristaps 974: roffparseopts(struct rofftree *tree, int tok,
975: char ***args, int *argc, char **argv)
976: {
977: int i, c;
978: char *v;
979:
980: i = 0;
981:
982: while (-1 != (c = roffnextopt(tree, tok, args, &v))) {
983: if (ROFF_ARGMAX == c)
984: return(0);
985:
986: argc[i] = c;
987: argv[i] = v;
988: i++;
989: *args = *args + 1;
990: }
991:
992: argc[i] = ROFF_ARGMAX;
993: argv[i] = NULL;
994: return(1);
995: }
996:
997:
1.37 kristaps 998: static int
999: roffdata(struct rofftree *tree, int space, char *buf)
1000: {
1001:
1.38 kristaps 1002: if (0 == *buf)
1003: return(1);
1.37 kristaps 1004: return((*tree->cb.roffdata)(tree->arg,
1005: space != 0, tree->cur, buf));
1006: }
1007:
1008:
1.1 kristaps 1009: /* ARGSUSED */
1010: static int
1011: roff_Dd(ROFFCALL_ARGS)
1012: {
1.30 kristaps 1013: time_t t;
1014: char *p, buf[32];
1.1 kristaps 1015:
1.4 kristaps 1016: if (ROFF_BODY & tree->state) {
1017: assert( ! (ROFF_PRELUDE & tree->state));
1018: assert(ROFF_PRELUDE_Dd & tree->state);
1019: return(roff_text(tok, tree, argv, type));
1020: }
1021:
1.1 kristaps 1022: assert(ROFF_PRELUDE & tree->state);
1.4 kristaps 1023: assert( ! (ROFF_BODY & tree->state));
1024:
1.6 kristaps 1025: if (ROFF_PRELUDE_Dd & tree->state) {
1.12 kristaps 1026: roff_err(tree, *argv, "repeated `Dd' in prelude");
1.6 kristaps 1027: return(0);
1028: } else if (ROFF_PRELUDE_Dt & tree->state) {
1.12 kristaps 1029: roff_err(tree, *argv, "out-of-order `Dd' in prelude");
1.1 kristaps 1030: return(0);
1031: }
1032:
1.30 kristaps 1033: assert(NULL == tree->last);
1034:
1035: argv++;
1036:
1037: if (0 == strcmp(*argv, "$Mdocdate$")) {
1038: t = time(NULL);
1039: if (NULL == localtime_r(&t, &tree->tm))
1040: err(1, "localtime_r");
1041: tree->state |= ROFF_PRELUDE_Dd;
1042: return(1);
1043: }
1044:
1045: /* Build this from Mdocdate or raw date. */
1046:
1047: buf[0] = 0;
1048: p = *argv;
1049:
1050: if (0 != strcmp(*argv, "$Mdocdate:")) {
1051: while (*argv) {
1052: if (strlcat(buf, *argv++, sizeof(buf))
1053: < sizeof(buf))
1054: continue;
1055: roff_err(tree, p, "bad `Dd' date");
1056: return(0);
1057: }
1058: if (strptime(buf, "%b%d,%Y", &tree->tm)) {
1059: tree->state |= ROFF_PRELUDE_Dd;
1060: return(1);
1061: }
1062: roff_err(tree, *argv, "bad `Dd' date");
1063: return(0);
1064: }
1065:
1066: argv++;
1067: while (*argv && **argv != '$') {
1068: if (strlcat(buf, *argv++, sizeof(buf))
1069: >= sizeof(buf)) {
1070: roff_err(tree, p, "bad `Dd' Mdocdate");
1071: return(0);
1072: }
1073: if (strlcat(buf, " ", sizeof(buf))
1074: >= sizeof(buf)) {
1075: roff_err(tree, p, "bad `Dd' Mdocdate");
1076: return(0);
1077: }
1078: }
1079: if (NULL == *argv) {
1080: roff_err(tree, p, "bad `Dd' Mdocdate");
1081: return(0);
1082: }
1083:
1084: if (NULL == strptime(buf, "%b %d %Y", &tree->tm)) {
1085: roff_err(tree, *argv, "bad `Dd' Mdocdate");
1086: return(0);
1087: }
1.4 kristaps 1088:
1.1 kristaps 1089: tree->state |= ROFF_PRELUDE_Dd;
1090: return(1);
1091: }
1092:
1093:
1094: /* ARGSUSED */
1095: static int
1096: roff_Dt(ROFFCALL_ARGS)
1097: {
1098:
1.4 kristaps 1099: if (ROFF_BODY & tree->state) {
1100: assert( ! (ROFF_PRELUDE & tree->state));
1101: assert(ROFF_PRELUDE_Dt & tree->state);
1102: return(roff_text(tok, tree, argv, type));
1103: }
1104:
1.1 kristaps 1105: assert(ROFF_PRELUDE & tree->state);
1.4 kristaps 1106: assert( ! (ROFF_BODY & tree->state));
1107:
1.6 kristaps 1108: if ( ! (ROFF_PRELUDE_Dd & tree->state)) {
1.12 kristaps 1109: roff_err(tree, *argv, "out-of-order `Dt' in prelude");
1.1 kristaps 1110: return(0);
1.6 kristaps 1111: } else if (ROFF_PRELUDE_Dt & tree->state) {
1.12 kristaps 1112: roff_err(tree, *argv, "repeated `Dt' in prelude");
1.6 kristaps 1113: return(0);
1.1 kristaps 1114: }
1115:
1.30 kristaps 1116: argv++;
1117: if (NULL == *argv) {
1118: roff_err(tree, *argv, "`Dt' needs document title");
1119: return(0);
1120: } else if (strlcpy(tree->title, *argv, sizeof(tree->title))
1121: >= sizeof(tree->title)) {
1122: roff_err(tree, *argv, "`Dt' document title too long");
1123: return(0);
1124: }
1125:
1126: argv++;
1127: if (NULL == *argv) {
1128: roff_err(tree, *argv, "`Dt' needs section");
1129: return(0);
1130: } else if (strlcpy(tree->section, *argv, sizeof(tree->section))
1131: >= sizeof(tree->section)) {
1132: roff_err(tree, *argv, "`Dt' section too long");
1133: return(0);
1134: }
1135:
1136: argv++;
1137: if (NULL == *argv) {
1138: tree->volume[0] = 0;
1139: } else if (strlcpy(tree->volume, *argv, sizeof(tree->volume))
1140: >= sizeof(tree->volume)) {
1141: roff_err(tree, *argv, "`Dt' volume too long");
1142: return(0);
1143: }
1.4 kristaps 1144:
1.1 kristaps 1145: assert(NULL == tree->last);
1146: tree->state |= ROFF_PRELUDE_Dt;
1147:
1148: return(1);
1149: }
1150:
1151:
1.42 ! kristaps 1152: static int
! 1153: roffgetname(struct rofftree *tree, char **ordp, const char *start)
! 1154: {
! 1155: if (0 == tree->name[0]) {
! 1156: roff_err(tree, start, "`Nm' name not set");
! 1157: return(0);
! 1158: }
! 1159: *ordp++ = tree->name;
! 1160: *ordp = NULL;
! 1161: return(1);
! 1162: }
! 1163:
! 1164:
! 1165: static int
! 1166: roffsetname(struct rofftree *tree, char **ordp)
! 1167: {
! 1168:
! 1169: assert(*ordp);
! 1170:
! 1171: /* FIXME: not all sections can set this. */
! 1172:
! 1173: if (NULL != *(ordp + 1)) {
! 1174: roff_err(tree, *ordp, "too many `Nm' args");
! 1175: return(0);
! 1176: }
! 1177:
! 1178: if (strlcpy(tree->name, *ordp, sizeof(tree->name))
! 1179: >= sizeof(tree->name)) {
! 1180: roff_err(tree, *ordp, "`Nm' arg too long");
! 1181: return(0);
! 1182: }
! 1183:
! 1184: return(1);
! 1185: }
! 1186:
! 1187:
1.1 kristaps 1188: /* ARGSUSED */
1.42 ! kristaps 1189: static int
1.33 kristaps 1190: roff_Sm(ROFFCALL_ARGS)
1.31 kristaps 1191: {
1.40 kristaps 1192: char *morep[1], *p;
1.31 kristaps 1193:
1.33 kristaps 1194: p = *argv++;
1.31 kristaps 1195:
1.33 kristaps 1196: if (NULL == (morep[0] = *argv++)) {
1197: roff_err(tree, p, "`Sm' expects an argument");
1198: return(0);
1199: } else if (0 != strcmp(morep[0], "on") &&
1200: 0 != strcmp(morep[0], "off")) {
1201: roff_err(tree, p, "`Sm' has invalid argument");
1202: return(0);
1203: }
1.31 kristaps 1204:
1.33 kristaps 1205: if (*argv)
1206: roff_warn(tree, *argv, "`Sm' shouldn't have arguments");
1.31 kristaps 1207:
1.40 kristaps 1208: if ( ! roffspecial(tree, tok, morep))
1.31 kristaps 1209: return(0);
1210:
1.37 kristaps 1211: while (*argv)
1212: if ( ! roffdata(tree, 1, *argv++))
1213: return(0);
1.33 kristaps 1214:
1215: return(1);
1216: }
1217:
1218:
1219: /* ARGSUSED */
1220: static int
1221: roff_Ns(ROFFCALL_ARGS)
1222: {
1223: int j, c, first;
1.40 kristaps 1224: char *morep[1];
1.33 kristaps 1225:
1226: first = (*argv++ == tree->cur);
1.40 kristaps 1227: morep[0] = NULL;
1.33 kristaps 1228:
1.40 kristaps 1229: if ( ! roffspecial(tree, tok, morep))
1.33 kristaps 1230: return(0);
1.31 kristaps 1231:
1.33 kristaps 1232: while (*argv) {
1233: if (ROFF_MAX != (c = rofffindcallable(*argv))) {
1234: if ( ! roffcall(tree, c, argv))
1235: return(0);
1.31 kristaps 1236: break;
1237: }
1.33 kristaps 1238:
1239: if ( ! roffispunct(*argv)) {
1.37 kristaps 1240: if ( ! roffdata(tree, 1, *argv++))
1241: return(0);
1242: continue;
1.31 kristaps 1243: }
1.37 kristaps 1244:
1.33 kristaps 1245: for (j = 0; argv[j]; j++)
1246: if ( ! roffispunct(argv[j]))
1247: break;
1248:
1249: if (argv[j]) {
1.37 kristaps 1250: if ( ! roffdata(tree, 0, *argv++))
1251: return(0);
1252: continue;
1.33 kristaps 1253: }
1254:
1.31 kristaps 1255: break;
1256: }
1257:
1258: if ( ! first)
1259: return(1);
1.33 kristaps 1260:
1.31 kristaps 1261: return(roffpurgepunct(tree, argv));
1262: }
1263:
1264:
1265: /* ARGSUSED */
1266: static int
1.1 kristaps 1267: roff_Os(ROFFCALL_ARGS)
1268: {
1.30 kristaps 1269: char *p;
1.1 kristaps 1270:
1.30 kristaps 1271: if (ROFF_BODY & tree->state) {
1.4 kristaps 1272: assert( ! (ROFF_PRELUDE & tree->state));
1273: assert(ROFF_PRELUDE_Os & tree->state);
1274: return(roff_text(tok, tree, argv, type));
1275: }
1.1 kristaps 1276:
1277: assert(ROFF_PRELUDE & tree->state);
1278: if ( ! (ROFF_PRELUDE_Dt & tree->state) ||
1279: ! (ROFF_PRELUDE_Dd & tree->state)) {
1.12 kristaps 1280: roff_err(tree, *argv, "out-of-order `Os' in prelude");
1.1 kristaps 1281: return(0);
1282: }
1283:
1.30 kristaps 1284: tree->os[0] = 0;
1285:
1286: p = *++argv;
1287:
1288: while (*argv) {
1289: if (strlcat(tree->os, *argv++, sizeof(tree->os))
1290: < sizeof(tree->os))
1291: continue;
1292: roff_err(tree, p, "`Os' value too long");
1293: return(0);
1294: }
1295:
1296: if (0 == tree->os[0])
1297: if (strlcpy(tree->os, "LOCAL", sizeof(tree->os))
1298: >= sizeof(tree->os)) {
1299: roff_err(tree, p, "`Os' value too long");
1300: return(0);
1301: }
1.1 kristaps 1302:
1303: tree->state |= ROFF_PRELUDE_Os;
1304: tree->state &= ~ROFF_PRELUDE;
1305: tree->state |= ROFF_BODY;
1306:
1.4 kristaps 1307: assert(NULL == tree->last);
1308:
1.36 kristaps 1309: return((*tree->cb.roffhead)(tree->arg, &tree->tm,
1310: tree->os, tree->title, tree->section,
1311: tree->volume));
1.1 kristaps 1312: }
1313:
1314:
1315: /* ARGSUSED */
1316: static int
1.2 kristaps 1317: roff_layout(ROFFCALL_ARGS)
1.1 kristaps 1318: {
1.37 kristaps 1319: int i, c, argcp[ROFF_MAXLINEARG];
1320: char *argvp[ROFF_MAXLINEARG];
1.1 kristaps 1321:
1.4 kristaps 1322: if (ROFF_PRELUDE & tree->state) {
1.27 kristaps 1323: roff_err(tree, *argv, "bad `%s' in prelude",
1.12 kristaps 1324: toknames[tok]);
1.4 kristaps 1325: return(0);
1.27 kristaps 1326: } else if (ROFF_EXIT == type) {
1.15 kristaps 1327: roffnode_free(tree);
1.35 kristaps 1328: if ( ! (*tree->cb.roffblkbodyout)(tree->arg, tok))
1329: return(0);
1.15 kristaps 1330: return((*tree->cb.roffblkout)(tree->arg, tok));
1.2 kristaps 1331: }
1.1 kristaps 1332:
1.27 kristaps 1333: assert( ! (ROFF_CALLABLE & tokens[tok].flags));
1.5 kristaps 1334:
1.27 kristaps 1335: ++argv;
1.5 kristaps 1336:
1.27 kristaps 1337: if ( ! roffparseopts(tree, tok, &argv, argcp, argvp))
1338: return(0);
1.4 kristaps 1339: if (NULL == roffnode_new(tok, tree))
1.2 kristaps 1340: return(0);
1341:
1.27 kristaps 1342: /*
1343: * Layouts have two parts: the layout body and header. The
1344: * layout header is the trailing text of the line macro, while
1345: * the layout body is everything following until termination.
1346: */
1347:
1.18 kristaps 1348: if ( ! (*tree->cb.roffblkin)(tree->arg, tok, argcp, argvp))
1349: return(0);
1350: if (NULL == *argv)
1.35 kristaps 1351: return((*tree->cb.roffblkbodyin)
1352: (tree->arg, tok, argcp, argvp));
1353:
1354: if ( ! (*tree->cb.roffblkheadin)(tree->arg, tok, argcp, argvp))
1.2 kristaps 1355: return(0);
1356:
1.27 kristaps 1357: /*
1358: * If there are no parsable parts, then write remaining tokens
1359: * into the layout header and exit.
1360: */
1361:
1.2 kristaps 1362: if ( ! (ROFF_PARSED & tokens[tok].flags)) {
1.21 kristaps 1363: i = 0;
1.37 kristaps 1364: while (*argv)
1365: if ( ! roffdata(tree, i++, *argv++))
1.14 kristaps 1366: return(0);
1.37 kristaps 1367:
1.35 kristaps 1368: if ( ! (*tree->cb.roffblkheadout)(tree->arg, tok))
1369: return(0);
1370: return((*tree->cb.roffblkbodyin)
1371: (tree->arg, tok, argcp, argvp));
1.2 kristaps 1372: }
1373:
1.27 kristaps 1374: /*
1375: * Parsable elements may be in the header (or be the header, for
1376: * that matter). Follow the regular parsing rules for these.
1377: */
1378:
1.21 kristaps 1379: i = 0;
1.1 kristaps 1380: while (*argv) {
1.26 kristaps 1381: if (ROFF_MAX == (c = rofffindcallable(*argv))) {
1382: assert(tree->arg);
1.37 kristaps 1383: if ( ! roffdata(tree, i++, *argv++))
1.8 kristaps 1384: return(0);
1.26 kristaps 1385: continue;
1386: }
1.33 kristaps 1387: if ( ! roffcall(tree, c, argv))
1.14 kristaps 1388: return(0);
1.26 kristaps 1389: break;
1.21 kristaps 1390: }
1391:
1392: /*
1.27 kristaps 1393: * If there's trailing punctuation in the header, then write it
1394: * out now. Here we mimic the behaviour of a line-dominant text
1395: * macro.
1.21 kristaps 1396: */
1397:
1.35 kristaps 1398: if (NULL == *argv) {
1399: if ( ! (*tree->cb.roffblkheadout)(tree->arg, tok))
1400: return(0);
1401: return((*tree->cb.roffblkbodyin)
1402: (tree->arg, tok, argcp, argvp));
1403: }
1.21 kristaps 1404:
1.27 kristaps 1405: /*
1406: * Expensive. Scan to the end of line then work backwards until
1407: * a token isn't punctuation.
1408: */
1409:
1.31 kristaps 1410: if ( ! roffpurgepunct(tree, argv))
1411: return(0);
1.12 kristaps 1412:
1.35 kristaps 1413: if ( ! (*tree->cb.roffblkheadout)(tree->arg, tok))
1414: return(0);
1415: return((*tree->cb.roffblkbodyin)
1416: (tree->arg, tok, argcp, argvp));
1.2 kristaps 1417: }
1418:
1419:
1420: /* ARGSUSED */
1421: static int
1.40 kristaps 1422: roff_ordered(ROFFCALL_ARGS)
1423: {
1424: int i, first, c;
1425: char *ordp[ROFF_MAXLINEARG];
1426:
1427: if (ROFF_PRELUDE & tree->state) {
1428: roff_err(tree, *argv, "`%s' disallowed in prelude",
1429: toknames[tok]);
1430: return(0);
1431: }
1432:
1433: first = (*argv == tree->cur);
1434: argv++;
1435:
1436: if (NULL == *argv) {
1.42 ! kristaps 1437: switch (tok) {
! 1438: case (ROFF_Nm):
! 1439: if ( ! roffgetname(tree, ordp, *(argv - 1)))
! 1440: return(0);
! 1441: break;
! 1442: default:
! 1443: *ordp = NULL;
! 1444: break;
! 1445: }
1.40 kristaps 1446:
1447: return(roffspecial(tree, tok, ordp));
1448: }
1449:
1450: i = 0;
1451: while (*argv && i < ROFF_MAXLINEARG) {
1.42 ! kristaps 1452: c = rofffindcallable(*argv);
! 1453:
! 1454: if (ROFF_MAX == c && ! roffispunct(*argv)) {
! 1455: ordp[i++] = *argv++;
! 1456: continue;
! 1457: }
! 1458: ordp[i] = NULL;
! 1459:
! 1460: if (ROFF_MAX == c)
! 1461: break;
! 1462:
! 1463: switch (tok) {
! 1464: case (ROFF_Nm):
! 1465: if ( ! roffsetname(tree, ordp))
! 1466: return(0);
! 1467: break;
! 1468: default:
1.40 kristaps 1469: break;
1.42 ! kristaps 1470: }
! 1471:
! 1472: if ( ! roffspecial(tree, tok, ordp))
! 1473: return(0);
1.40 kristaps 1474:
1.42 ! kristaps 1475: return(roffcall(tree, c, ordp));
1.40 kristaps 1476: }
1477:
1.42 ! kristaps 1478: assert(i != ROFF_MAXLINEARG);
1.40 kristaps 1479: ordp[i] = NULL;
1480:
1.42 ! kristaps 1481: switch (tok) {
! 1482: case (ROFF_Nm):
! 1483: if ( ! roffsetname(tree, ordp))
! 1484: return(0);
! 1485: break;
! 1486: default:
! 1487: break;
! 1488: }
1.40 kristaps 1489:
1.42 ! kristaps 1490: if ( ! roffspecial(tree, tok, ordp))
1.40 kristaps 1491: return(0);
1492:
1493: /* FIXME: error if there's stuff after the punctuation. */
1494:
1495: if ( ! first || NULL == *argv)
1496: return(1);
1497:
1498: return(roffpurgepunct(tree, argv));
1499: }
1500:
1501:
1502: /* ARGSUSED */
1503: static int
1.2 kristaps 1504: roff_text(ROFFCALL_ARGS)
1505: {
1.37 kristaps 1506: int i, j, first, c, argcp[ROFF_MAXLINEARG];
1507: char *argvp[ROFF_MAXLINEARG];
1.2 kristaps 1508:
1.4 kristaps 1509: if (ROFF_PRELUDE & tree->state) {
1.12 kristaps 1510: roff_err(tree, *argv, "`%s' disallowed in prelude",
1511: toknames[tok]);
1.4 kristaps 1512: return(0);
1513: }
1514:
1.27 kristaps 1515: first = (*argv == tree->cur);
1.12 kristaps 1516: argv++;
1.5 kristaps 1517:
1.27 kristaps 1518: if ( ! roffparseopts(tree, tok, &argv, argcp, argvp))
1519: return(0);
1.24 kristaps 1520: if ( ! (*tree->cb.roffin)(tree->arg, tok, argcp, argvp))
1.2 kristaps 1521: return(0);
1.27 kristaps 1522: if (NULL == *argv)
1523: return((*tree->cb.roffout)(tree->arg, tok));
1.1 kristaps 1524:
1.2 kristaps 1525: if ( ! (ROFF_PARSED & tokens[tok].flags)) {
1.21 kristaps 1526: i = 0;
1.37 kristaps 1527: while (*argv)
1528: if ( ! roffdata(tree, i++, *argv++))
1.14 kristaps 1529: return(0);
1.37 kristaps 1530:
1.15 kristaps 1531: return((*tree->cb.roffout)(tree->arg, tok));
1.2 kristaps 1532: }
1.1 kristaps 1533:
1.27 kristaps 1534: /*
1535: * Deal with punctuation. Ugly. Work ahead until we encounter
1536: * terminating punctuation. If we encounter it and all
1537: * subsequent tokens are punctuation, then stop processing (the
1538: * line-dominant macro will print these tokens after closure).
1539: */
1540:
1.21 kristaps 1541: i = 0;
1.2 kristaps 1542: while (*argv) {
1.33 kristaps 1543: if (ROFF_MAX != (c = rofffindcallable(*argv))) {
1544: if ( ! (ROFF_LSCOPE & tokens[tok].flags))
1545: if ( ! (*tree->cb.roffout)(tree->arg, tok))
1546: return(0);
1547:
1548: if ( ! roffcall(tree, c, argv))
1549: return(0);
1550:
1551: if (ROFF_LSCOPE & tokens[tok].flags)
1552: if ( ! (*tree->cb.roffout)(tree->arg, tok))
1.27 kristaps 1553: return(0);
1.33 kristaps 1554:
1555: break;
1556: }
1.21 kristaps 1557:
1.33 kristaps 1558: if ( ! roffispunct(*argv)) {
1.37 kristaps 1559: if ( ! roffdata(tree, i++, *argv++))
1.33 kristaps 1560: return(0);
1561: continue;
1562: }
1.27 kristaps 1563:
1.33 kristaps 1564: i = 1;
1565: for (j = 0; argv[j]; j++)
1566: if ( ! roffispunct(argv[j]))
1567: break;
1.27 kristaps 1568:
1.33 kristaps 1569: if (argv[j]) {
1.37 kristaps 1570: if ( ! roffdata(tree, 0, *argv++))
1.27 kristaps 1571: return(0);
1.33 kristaps 1572: continue;
1.8 kristaps 1573: }
1.20 kristaps 1574:
1.33 kristaps 1575: if ( ! (*tree->cb.roffout)(tree->arg, tok))
1.14 kristaps 1576: return(0);
1.20 kristaps 1577: break;
1.14 kristaps 1578: }
1.12 kristaps 1579:
1.27 kristaps 1580: if (NULL == *argv)
1581: return((*tree->cb.roffout)(tree->arg, tok));
1582: if ( ! first)
1583: return(1);
1.21 kristaps 1584:
1.31 kristaps 1585: return(roffpurgepunct(tree, argv));
1.6 kristaps 1586: }
1587:
1588:
1.9 kristaps 1589: /* ARGSUSED */
1.6 kristaps 1590: static int
1.27 kristaps 1591: roff_noop(ROFFCALL_ARGS)
1.6 kristaps 1592: {
1593:
1594: return(1);
1.1 kristaps 1595: }
1.9 kristaps 1596:
1597:
1598: /* ARGSUSED */
1599: static int
1.27 kristaps 1600: roff_depr(ROFFCALL_ARGS)
1.9 kristaps 1601: {
1602:
1.27 kristaps 1603: roff_err(tree, *argv, "`%s' is deprecated", toknames[tok]);
1604: return(0);
1.11 kristaps 1605: }
1.12 kristaps 1606:
1607:
1608: static void
1609: roff_warn(const struct rofftree *tree, const char *pos, char *fmt, ...)
1610: {
1611: va_list ap;
1612: char buf[128];
1613:
1614: va_start(ap, fmt);
1615: (void)vsnprintf(buf, sizeof(buf), fmt, ap);
1616: va_end(ap);
1617:
1.15 kristaps 1618: (*tree->cb.roffmsg)(tree->arg,
1619: ROFF_WARN, tree->cur, pos, buf);
1.12 kristaps 1620: }
1621:
1622:
1623: static void
1624: roff_err(const struct rofftree *tree, const char *pos, char *fmt, ...)
1625: {
1626: va_list ap;
1627: char buf[128];
1628:
1629: va_start(ap, fmt);
1630: (void)vsnprintf(buf, sizeof(buf), fmt, ap);
1631: va_end(ap);
1632:
1.15 kristaps 1633: (*tree->cb.roffmsg)(tree->arg,
1634: ROFF_ERROR, tree->cur, pos, buf);
1.12 kristaps 1635: }
1.33 kristaps 1636:
CVSweb