Annotation of mandoc/roff.c, Revision 1.25
1.25 ! kristaps 1: /* $Id: roff.c,v 1.24 2008/11/30 21:41:35 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: */
19: #include <assert.h>
20: #include <ctype.h>
21: #include <err.h>
1.12 kristaps 22: #include <stdarg.h>
1.1 kristaps 23: #include <stdlib.h>
24: #include <stdio.h>
25: #include <string.h>
26: #include <time.h>
27:
28: #include "libmdocml.h"
29: #include "private.h"
30:
1.6 kristaps 31: /* FIXME: warn if Pp occurs before/after Sh etc. (see mdoc.samples). */
32:
1.7 kristaps 33: /* FIXME: warn about "X section only" macros. */
34:
1.6 kristaps 35: /* FIXME: warn about empty lists. */
36:
1.21 kristaps 37: /* FIXME: roff_layout and roff_text have identical-ish lower bodies. */
1.7 kristaps 38:
1.11 kristaps 39: /* FIXME: NAME section needs specific elements. */
40:
41: #define ROFF_MAXARG 32
1.1 kristaps 42:
43: enum roffd {
44: ROFF_ENTER = 0,
45: ROFF_EXIT
46: };
47:
48: enum rofftype {
49: ROFF_COMMENT,
50: ROFF_TEXT,
1.11 kristaps 51: ROFF_LAYOUT,
52: ROFF_SPECIAL
1.1 kristaps 53: };
54:
55: #define ROFFCALL_ARGS \
1.2 kristaps 56: int tok, struct rofftree *tree, \
1.18 kristaps 57: char *argv[], enum roffd type
1.1 kristaps 58:
59: struct rofftree;
60:
61: struct rofftok {
1.5 kristaps 62: int (*cb)(ROFFCALL_ARGS); /* Callback. */
63: const int *args; /* Args (or NULL). */
1.6 kristaps 64: const int *parents;
65: const int *children;
66: int ctx;
1.5 kristaps 67: enum rofftype type; /* Type of macro. */
1.1 kristaps 68: int flags;
1.7 kristaps 69: #define ROFF_PARSED (1 << 0) /* "Parsed". */
70: #define ROFF_CALLABLE (1 << 1) /* "Callable". */
1.21 kristaps 71: #define ROFF_SHALLOW (1 << 2) /* Nesting block. */
1.1 kristaps 72: };
73:
74: struct roffarg {
75: int flags;
1.5 kristaps 76: #define ROFF_VALUE (1 << 0) /* Has a value. */
1.1 kristaps 77: };
78:
79: struct roffnode {
1.5 kristaps 80: int tok; /* Token id. */
81: struct roffnode *parent; /* Parent (or NULL). */
1.1 kristaps 82: };
83:
84: struct rofftree {
1.5 kristaps 85: struct roffnode *last; /* Last parsed node. */
1.14 kristaps 86: char *cur;
87:
1.5 kristaps 88: time_t date; /* `Dd' results. */
89: char os[64]; /* `Os' results. */
90: char title[64]; /* `Dt' results. */
91: char section[64]; /* `Dt' results. */
92: char volume[64]; /* `Dt' results. */
1.14 kristaps 93:
1.1 kristaps 94: int state;
1.5 kristaps 95: #define ROFF_PRELUDE (1 << 1) /* In roff prelude. */
96: #define ROFF_PRELUDE_Os (1 << 2) /* `Os' is parsed. */
97: #define ROFF_PRELUDE_Dt (1 << 3) /* `Dt' is parsed. */
98: #define ROFF_PRELUDE_Dd (1 << 4) /* `Dd' is parsed. */
99: #define ROFF_BODY (1 << 5) /* In roff body. */
1.14 kristaps 100:
1.15 kristaps 101: struct roffcb cb;
102: void *arg;
1.1 kristaps 103: };
104:
105: static int roff_Dd(ROFFCALL_ARGS);
106: static int roff_Dt(ROFFCALL_ARGS);
107: static int roff_Os(ROFFCALL_ARGS);
1.6 kristaps 108:
1.2 kristaps 109: static int roff_layout(ROFFCALL_ARGS);
110: static int roff_text(ROFFCALL_ARGS);
1.6 kristaps 111: static int roff_comment(ROFFCALL_ARGS);
1.9 kristaps 112: static int roff_close(ROFFCALL_ARGS);
1.11 kristaps 113: static int roff_special(ROFFCALL_ARGS);
1.1 kristaps 114:
1.4 kristaps 115: static struct roffnode *roffnode_new(int, struct rofftree *);
1.15 kristaps 116: static void roffnode_free(struct rofftree *);
1.1 kristaps 117:
1.12 kristaps 118: static void roff_warn(const struct rofftree *,
119: const char *, char *, ...);
120: static void roff_err(const struct rofftree *,
121: const char *, char *, ...);
122:
1.7 kristaps 123: static int roffscan(int, const int *);
1.1 kristaps 124: static int rofffindtok(const char *);
125: static int rofffindarg(const char *);
1.2 kristaps 126: static int rofffindcallable(const char *);
1.10 kristaps 127: static int roffargs(const struct rofftree *,
128: int, char *, char **);
1.5 kristaps 129: static int roffargok(int, int);
1.12 kristaps 130: static int roffnextopt(const struct rofftree *,
1.18 kristaps 131: int, char ***, char **);
1.17 kristaps 132: static int roffparse(struct rofftree *, char *);
133: static int textparse(const struct rofftree *, char *);
1.1 kristaps 134:
1.6 kristaps 135:
1.7 kristaps 136: static const int roffarg_An[] = { ROFF_Split, ROFF_Nosplit,
137: ROFF_ARGMAX };
138: static const int roffarg_Bd[] = { ROFF_Ragged, ROFF_Unfilled,
1.12 kristaps 139: ROFF_Literal, ROFF_File, ROFF_Offset, ROFF_Filled,
140: ROFF_Compact, ROFF_ARGMAX };
141: static const int roffarg_Bk[] = { ROFF_Words, ROFF_ARGMAX };
1.7 kristaps 142: static const int roffarg_Ex[] = { ROFF_Std, ROFF_ARGMAX };
143: static const int roffarg_Rv[] = { ROFF_Std, ROFF_ARGMAX };
144: static const int roffarg_Bl[] = { ROFF_Bullet, ROFF_Dash,
145: ROFF_Hyphen, ROFF_Item, ROFF_Enum, ROFF_Tag, ROFF_Diag,
146: ROFF_Hang, ROFF_Ohang, ROFF_Inset, ROFF_Column, ROFF_Offset,
1.12 kristaps 147: ROFF_Width, ROFF_Compact, ROFF_ARGMAX };
1.7 kristaps 148: static const int roffarg_St[] = {
149: ROFF_p1003_1_88, ROFF_p1003_1_90, ROFF_p1003_1_96,
150: ROFF_p1003_1_2001, ROFF_p1003_1_2004, ROFF_p1003_1,
151: ROFF_p1003_1b, ROFF_p1003_1b_93, ROFF_p1003_1c_95,
152: ROFF_p1003_1g_2000, ROFF_p1003_2_92, ROFF_p1387_2_95,
153: ROFF_p1003_2, ROFF_p1387_2, ROFF_isoC_90, ROFF_isoC_amd1,
154: ROFF_isoC_tcor1, ROFF_isoC_tcor2, ROFF_isoC_99, ROFF_ansiC,
155: ROFF_ansiC_89, ROFF_ansiC_99, ROFF_ieee754, ROFF_iso8802_3,
156: ROFF_xpg3, ROFF_xpg4, ROFF_xpg4_2, ROFF_xpg4_3, ROFF_xbd5,
157: ROFF_xcu5, ROFF_xsh5, ROFF_xns5, ROFF_xns5_2d2_0,
158: ROFF_xcurses4_2, ROFF_susv2, ROFF_susv3, ROFF_svid4,
159: ROFF_ARGMAX };
1.5 kristaps 160:
1.6 kristaps 161: static const int roffchild_Bl[] = { ROFF_It, ROFF_El, ROFF_MAX };
1.7 kristaps 162: static const int roffchild_Fo[] = { ROFF_Fa, ROFF_Fc, ROFF_MAX };
1.8 kristaps 163: static const int roffchild_Oo[] = { ROFF_Op, ROFF_Oc, ROFF_MAX };
1.9 kristaps 164: static const int roffchild_Rs[] = { ROFF_Re, ROFF__A, ROFF__B,
165: ROFF__D, ROFF__I, ROFF__J, ROFF__N, ROFF__O, ROFF__P,
166: ROFF__R, ROFF__T, ROFF__V, ROFF_MAX };
1.6 kristaps 167:
168: static const int roffparent_El[] = { ROFF_Bl, ROFF_It, ROFF_MAX };
1.7 kristaps 169: static const int roffparent_Fc[] = { ROFF_Fo, ROFF_Fa, ROFF_MAX };
170: static const int roffparent_Oc[] = { ROFF_Oo, ROFF_Oc, ROFF_MAX };
1.8 kristaps 171: static const int roffparent_It[] = { ROFF_Bl, ROFF_It, ROFF_MAX };
1.9 kristaps 172: static const int roffparent_Re[] = { ROFF_Rs, ROFF_MAX };
1.1 kristaps 173:
1.5 kristaps 174: /* Table of all known tokens. */
1.14 kristaps 175: static const struct rofftok tokens[ROFF_MAX] = {
1.10 kristaps 176: {roff_comment, NULL, NULL, NULL, 0, ROFF_COMMENT, 0 }, /* \" */
177: { roff_Dd, NULL, NULL, NULL, 0, ROFF_TEXT, 0 }, /* Dd */
178: { roff_Dt, NULL, NULL, NULL, 0, ROFF_TEXT, 0 }, /* Dt */
1.21 kristaps 179: { roff_Os, NULL, NULL, NULL, 0, ROFF_TEXT, 0 }, /* Os */
180: { roff_layout, NULL, NULL, NULL, ROFF_Sh, ROFF_LAYOUT, 0 }, /* Sh */
181: { roff_layout, NULL, NULL, NULL, ROFF_Ss, ROFF_LAYOUT, 0 }, /* Ss */
1.6 kristaps 182: { roff_text, NULL, NULL, NULL, ROFF_Pp, ROFF_TEXT, 0 }, /* Pp */
1.8 kristaps 183: { roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED }, /* D1 */
184: { roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED }, /* Dl */
1.12 kristaps 185: { roff_layout, roffarg_Bd, NULL, NULL, 0, ROFF_LAYOUT, 0 }, /* Bd */
1.9 kristaps 186: { roff_close, NULL, NULL, NULL, ROFF_Bd, ROFF_LAYOUT, 0 }, /* Ed */
1.7 kristaps 187: { roff_layout, roffarg_Bl, NULL, roffchild_Bl, 0, ROFF_LAYOUT, 0 }, /* Bl */
1.9 kristaps 188: { roff_close, NULL, roffparent_El, NULL, ROFF_Bl, ROFF_LAYOUT, 0 }, /* El */
1.21 kristaps 189: { roff_layout, NULL, roffparent_It, NULL, ROFF_It, ROFF_LAYOUT, ROFF_PARSED | ROFF_SHALLOW }, /* It */
1.20 kristaps 190: { roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Ad */ /* FIXME */
191: { roff_text, roffarg_An, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED }, /* An */
192: { roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Ar */
1.21 kristaps 193: { roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, 0 }, /* Cd */ /* XXX man.4 only */
1.7 kristaps 194: { roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Cm */
1.20 kristaps 195: { roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Dv */ /* XXX needs arg */
196: { roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Er */ /* XXX needs arg */
197: { roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Ev */ /* XXX needs arg */
1.7 kristaps 198: { roff_text, roffarg_Ex, NULL, NULL, 0, ROFF_TEXT, 0 }, /* Ex */
1.20 kristaps 199: { roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Fa */ /* XXX needs arg */
1.10 kristaps 200: { roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, 0 }, /* Fd */
1.20 kristaps 201: { roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Fl */
202: { roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Fn */ /* XXX needs arg */ /* FIXME */
203: { roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED }, /* Ft */
204: { roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Ic */ /* XXX needs arg */
1.10 kristaps 205: { roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, 0 }, /* In */
1.20 kristaps 206: { roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Li */
1.21 kristaps 207: { roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, 0 }, /* Nd */
1.20 kristaps 208: { roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Nm */ /* FIXME */
209: { roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Op */
1.8 kristaps 210: { NULL, NULL, NULL, NULL, 0, ROFF_TEXT, 0 }, /* Ot */ /* XXX deprecated */
1.20 kristaps 211: { roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Pa */
1.10 kristaps 212: { roff_text, roffarg_Rv, NULL, NULL, 0, ROFF_TEXT, 0 }, /* Rv */
1.7 kristaps 213: { roff_text, roffarg_St, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* St */
1.20 kristaps 214: { roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Va */
215: { roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Vt */ /* XXX needs arg */
216: { roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Xr */ /* XXX needs arg */
1.9 kristaps 217: { roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED }, /* %A */
218: { roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE}, /* %B */
1.10 kristaps 219: { roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, 0 }, /* %D */
1.9 kristaps 220: { roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE}, /* %I */
221: { roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE}, /* %J */
1.10 kristaps 222: { roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, 0 }, /* %N */
223: { roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, 0 }, /* %O */
224: { roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, 0 }, /* %P */
225: { roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, 0 }, /* %R */
1.9 kristaps 226: { roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED }, /* %T */
1.10 kristaps 227: { roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, 0 }, /* %V */
228: { roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Ac */
229: { roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Ao */
1.9 kristaps 230: { roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Aq */
1.10 kristaps 231: { roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, 0 }, /* At */ /* XXX at most 2 args */
232: { roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Bc */
1.7 kristaps 233: { NULL, NULL, NULL, NULL, 0, ROFF_TEXT, 0 }, /* Bf */ /* FIXME */
1.10 kristaps 234: { roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Bo */
1.18 kristaps 235: { roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Bq */
1.20 kristaps 236: { roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED }, /* Bsx */
237: { roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED }, /* Bx */
1.11 kristaps 238: {roff_special, NULL, NULL, NULL, 0, ROFF_SPECIAL, 0 }, /* Db */
1.10 kristaps 239: { roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Dc */
240: { roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Do */
1.8 kristaps 241: { roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Dq */
1.10 kristaps 242: { roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Ec */
1.7 kristaps 243: { NULL, NULL, NULL, NULL, 0, ROFF_TEXT, 0 }, /* Ef */ /* FIXME */
1.20 kristaps 244: { roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Em */ /* XXX needs arg */
1.10 kristaps 245: { roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Eo */
1.20 kristaps 246: { roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED }, /* Fx */
247: { roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED }, /* Ms */
1.6 kristaps 248: { NULL, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* No */
249: { NULL, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Ns */
1.20 kristaps 250: { roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED }, /* Nx */
251: { roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED }, /* Ox */
1.10 kristaps 252: { roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Pc */
1.8 kristaps 253: { roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED }, /* Pf */
1.10 kristaps 254: { roff_text, NULL, NULL, NULL, 0, ROFF_LAYOUT, ROFF_PARSED | ROFF_CALLABLE }, /* Po */
1.8 kristaps 255: { roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Pq */
1.10 kristaps 256: { roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Qc */
1.8 kristaps 257: { roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Ql */
1.10 kristaps 258: { roff_layout, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Qo */
1.8 kristaps 259: { roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Qq */
1.9 kristaps 260: { roff_close, NULL, roffparent_Re, NULL, ROFF_Rs, ROFF_LAYOUT, 0 }, /* Re */
261: { roff_layout, NULL, NULL, roffchild_Rs, 0, ROFF_LAYOUT, 0 }, /* Rs */
1.10 kristaps 262: { roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Sc */
263: { roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* So */
1.8 kristaps 264: { roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Sq */
1.11 kristaps 265: {roff_special, NULL, NULL, NULL, 0, ROFF_SPECIAL, 0 }, /* Sm */
1.8 kristaps 266: { roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Sx */
1.20 kristaps 267: { roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Sy */
268: { roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Tn */
269: { roff_text, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED }, /* Ux */
1.6 kristaps 270: { NULL, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Xc */
271: { NULL, NULL, NULL, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Xo */
1.14 kristaps 272: { roff_layout, NULL, NULL, roffchild_Fo, 0, ROFF_LAYOUT, 0 }, /* Fo */
1.9 kristaps 273: { roff_close, NULL, roffparent_Fc, NULL, ROFF_Fo, ROFF_LAYOUT, 0 }, /* Fc */
1.14 kristaps 274: { roff_layout, NULL, NULL, roffchild_Oo, 0, ROFF_LAYOUT, 0 }, /* Oo */
1.9 kristaps 275: { roff_close, NULL, roffparent_Oc, NULL, ROFF_Oo, ROFF_LAYOUT, 0 }, /* Oc */
1.12 kristaps 276: { roff_layout, roffarg_Bk, NULL, NULL, 0, ROFF_LAYOUT, 0 }, /* Bk */
1.9 kristaps 277: { roff_close, NULL, NULL, NULL, ROFF_Bk, ROFF_LAYOUT, 0 }, /* Ek */
1.12 kristaps 278: };
1.1 kristaps 279:
1.5 kristaps 280: /* Table of all known token arguments. */
1.14 kristaps 281: static const int tokenargs[ROFF_ARGMAX] = {
1.12 kristaps 282: 0, 0, 0, 0,
283: 0, ROFF_VALUE, ROFF_VALUE, 0,
284: 0, 0, 0, 0,
285: 0, 0, 0, 0,
1.18 kristaps 286: 0, 0, ROFF_VALUE, 0,
1.12 kristaps 287: 0, 0, 0, 0,
288: 0, 0, 0, 0,
289: 0, 0, 0, 0,
290: 0, 0, 0, 0,
291: 0, 0, 0, 0,
292: 0, 0, 0, 0,
293: 0, 0, 0, 0,
294: 0, 0, 0, 0,
295: 0, 0, 0, 0,
296: 0, 0, 0, 0,
297: };
1.1 kristaps 298:
1.14 kristaps 299: const char *const toknamesp[ROFF_MAX] = {
1.8 kristaps 300: "\\\"", "Dd", "Dt", "Os",
301: "Sh", "Ss", "Pp", "D1",
302: "Dl", "Bd", "Ed", "Bl",
303: "El", "It", "Ad", "An",
304: "Ar", "Cd", "Cm", "Dv",
305: "Er", "Ev", "Ex", "Fa",
306: "Fd", "Fl", "Fn", "Ft",
307: "Ic", "In", "Li", "Nd",
308: "Nm", "Op", "Ot", "Pa",
309: "Rv", "St", "Va", "Vt",
1.23 kristaps 310: /* LINTED */
1.8 kristaps 311: "Xr", "\%A", "\%B", "\%D",
1.23 kristaps 312: /* LINTED */
1.8 kristaps 313: "\%I", "\%J", "\%N", "\%O",
1.23 kristaps 314: /* LINTED */
1.8 kristaps 315: "\%P", "\%R", "\%T", "\%V",
316: "Ac", "Ao", "Aq", "At",
317: "Bc", "Bf", "Bo", "Bq",
318: "Bsx", "Bx", "Db", "Dc",
319: "Do", "Dq", "Ec", "Ef",
320: "Em", "Eo", "Fx", "Ms",
321: "No", "Ns", "Nx", "Ox",
322: "Pc", "Pf", "Po", "Pq",
323: "Qc", "Ql", "Qo", "Qq",
324: "Re", "Rs", "Sc", "So",
325: "Sq", "Sm", "Sx", "Sy",
326: "Tn", "Ux", "Xc", "Xo",
1.9 kristaps 327: "Fo", "Fc", "Oo", "Oc",
328: "Bk", "Ek",
1.5 kristaps 329: };
330:
1.14 kristaps 331: const char *const tokargnamesp[ROFF_ARGMAX] = {
1.9 kristaps 332: "split", "nosplit", "ragged",
333: "unfilled", "literal", "file",
334: "offset", "bullet", "dash",
335: "hyphen", "item", "enum",
336: "tag", "diag", "hang",
337: "ohang", "inset", "column",
338: "width", "compact", "std",
339: "p1003.1-88", "p1003.1-90", "p1003.1-96",
340: "p1003.1-2001", "p1003.1-2004", "p1003.1",
341: "p1003.1b", "p1003.1b-93", "p1003.1c-95",
342: "p1003.1g-2000", "p1003.2-92", "p1387.2-95",
343: "p1003.2", "p1387.2", "isoC-90",
344: "isoC-amd1", "isoC-tcor1", "isoC-tcor2",
345: "isoC-99", "ansiC", "ansiC-89",
346: "ansiC-99", "ieee754", "iso8802-3",
347: "xpg3", "xpg4", "xpg4.2",
348: "xpg4.3", "xbd5", "xcu5",
349: "xsh5", "xns5", "xns5.2d2.0",
350: "xcurses4.2", "susv2", "susv3",
1.12 kristaps 351: "svid4", "filled", "words",
1.5 kristaps 352: };
353:
354: const char *const *toknames = toknamesp;
355: const char *const *tokargnames = tokargnamesp;
1.4 kristaps 356:
1.1 kristaps 357:
358: int
359: roff_free(struct rofftree *tree, int flush)
360: {
1.16 kristaps 361: int error, t;
1.15 kristaps 362: struct roffnode *n;
1.1 kristaps 363:
1.17 kristaps 364: error = 0;
365:
1.16 kristaps 366: if ( ! flush)
367: goto end;
1.1 kristaps 368:
1.16 kristaps 369: error = 1;
1.1 kristaps 370:
1.16 kristaps 371: if (ROFF_PRELUDE & tree->state) {
1.15 kristaps 372: roff_warn(tree, NULL, "prelude never finished");
1.16 kristaps 373: goto end;
374: }
375:
376: for (n = tree->last; n->parent; n = n->parent) {
377: if (0 != tokens[n->tok].ctx)
1.17 kristaps 378: continue;
1.16 kristaps 379: roff_warn(tree, NULL, "closing explicit scope `%s'",
380: toknames[n->tok]);
381: goto end;
382: }
383:
384: while (tree->last) {
385: t = tree->last->tok;
386: if ( ! (*tokens[t].cb)(t, tree, NULL, ROFF_EXIT))
387: goto end;
1.1 kristaps 388: }
389:
1.16 kristaps 390: error = 0;
391:
392: end:
393:
1.15 kristaps 394: while (tree->last)
395: roffnode_free(tree);
396:
1.1 kristaps 397: free(tree);
1.17 kristaps 398:
1.1 kristaps 399: return(error ? 0 : 1);
400: }
401:
402:
403: struct rofftree *
1.15 kristaps 404: roff_alloc(const struct roffcb *cb, void *args)
1.1 kristaps 405: {
406: struct rofftree *tree;
407:
1.17 kristaps 408: assert(args);
409: assert(cb);
410:
1.12 kristaps 411: if (NULL == (tree = calloc(1, sizeof(struct rofftree))))
412: err(1, "calloc");
1.1 kristaps 413:
414: tree->state = ROFF_PRELUDE;
1.15 kristaps 415: tree->arg = args;
416:
417: (void)memcpy(&tree->cb, cb, sizeof(struct roffcb));
1.1 kristaps 418:
419: return(tree);
420: }
421:
422:
423: int
1.17 kristaps 424: roff_engine(struct rofftree *tree, char *buf)
1.1 kristaps 425: {
426:
1.17 kristaps 427: tree->cur = buf;
428: assert(buf);
1.12 kristaps 429:
1.17 kristaps 430: if (0 == *buf) {
1.12 kristaps 431: roff_warn(tree, buf, "blank line");
1.1 kristaps 432: return(0);
433: } else if ('.' != *buf)
1.17 kristaps 434: return(textparse(tree, buf));
1.1 kristaps 435:
1.17 kristaps 436: return(roffparse(tree, buf));
1.1 kristaps 437: }
438:
439:
440: static int
1.17 kristaps 441: textparse(const struct rofftree *tree, char *buf)
1.1 kristaps 442: {
1.17 kristaps 443:
1.21 kristaps 444: return((*tree->cb.roffdata)(tree->arg, 1, buf));
1.1 kristaps 445: }
446:
447:
448: static int
1.10 kristaps 449: roffargs(const struct rofftree *tree,
450: int tok, char *buf, char **argv)
1.1 kristaps 451: {
452: int i;
1.12 kristaps 453: char *p;
1.1 kristaps 454:
455: assert(tok >= 0 && tok < ROFF_MAX);
456: assert('.' == *buf);
457:
1.12 kristaps 458: p = buf;
459:
1.1 kristaps 460: /* LINTED */
461: for (i = 0; *buf && i < ROFF_MAXARG; i++) {
1.10 kristaps 462: if ('\"' == *buf) {
463: argv[i] = ++buf;
464: while (*buf && '\"' != *buf)
465: buf++;
466: if (0 == *buf) {
1.13 kristaps 467: roff_err(tree, argv[i], "unclosed "
1.12 kristaps 468: "quote in argument "
469: "list for `%s'",
470: toknames[tok]);
1.10 kristaps 471: return(0);
472: }
473: } else {
474: argv[i] = buf++;
475: while (*buf && ! isspace(*buf))
476: buf++;
477: if (0 == *buf)
478: continue;
1.1 kristaps 479: }
480: *buf++ = 0;
481: while (*buf && isspace(*buf))
482: buf++;
483: }
484:
485: assert(i > 0);
1.10 kristaps 486: if (ROFF_MAXARG == i && *buf) {
1.13 kristaps 487: roff_err(tree, p, "too many arguments for `%s'", toknames
1.12 kristaps 488: [tok]);
1.10 kristaps 489: return(0);
490: }
491:
492: argv[i] = NULL;
493: return(1);
1.1 kristaps 494: }
495:
496:
1.6 kristaps 497: /* XXX */
498: static int
499: roffscan(int tok, const int *tokv)
500: {
1.7 kristaps 501:
1.6 kristaps 502: if (NULL == tokv)
503: return(1);
504:
1.7 kristaps 505: for ( ; ROFF_MAX != *tokv; tokv++)
1.6 kristaps 506: if (tok == *tokv)
507: return(1);
508:
509: return(0);
510: }
511:
512:
1.1 kristaps 513: static int
1.17 kristaps 514: roffparse(struct rofftree *tree, char *buf)
1.1 kristaps 515: {
516: int tok, t;
1.6 kristaps 517: struct roffnode *n;
1.1 kristaps 518: char *argv[ROFF_MAXARG];
1.18 kristaps 519: char **argvp;
1.1 kristaps 520:
1.25 ! kristaps 521: if (0 != *buf && 0 != *(buf + 1) && 0 != *(buf + 2))
! 522: if (0 == strncmp(buf, ".\\\"", 3))
! 523: return(1);
! 524:
1.6 kristaps 525: if (ROFF_MAX == (tok = rofffindtok(buf + 1))) {
1.12 kristaps 526: roff_err(tree, buf + 1, "bogus line macro");
1.6 kristaps 527: return(0);
528: } else if (NULL == tokens[tok].cb) {
1.12 kristaps 529: roff_err(tree, buf + 1, "unsupported macro `%s'",
530: toknames[tok]);
1.1 kristaps 531: return(0);
1.25 ! kristaps 532: }
! 533:
! 534: assert(ROFF___ != tok);
1.10 kristaps 535: if ( ! roffargs(tree, tok, buf, argv))
1.1 kristaps 536: return(0);
1.12 kristaps 537:
1.18 kristaps 538: argvp = (char **)argv;
1.6 kristaps 539:
540: /*
1.12 kristaps 541: * Prelude macros break some assumptions, so branch now.
1.6 kristaps 542: */
1.1 kristaps 543:
1.6 kristaps 544: if (ROFF_PRELUDE & tree->state) {
545: assert(NULL == tree->last);
546: return((*tokens[tok].cb)(tok, tree, argvp, ROFF_ENTER));
547: } else
548: assert(tree->last);
549:
550: assert(ROFF_BODY & tree->state);
551:
552: /*
553: * First check that our possible parents and parent's possible
554: * children are satisfied.
555: */
556:
557: if ( ! roffscan(tree->last->tok, tokens[tok].parents)) {
1.15 kristaps 558: roff_err(tree, *argvp, "`%s' has invalid parent `%s'",
559: toknames[tok],
560: toknames[tree->last->tok]);
1.6 kristaps 561: return(0);
562: }
563:
564: if ( ! roffscan(tok, tokens[tree->last->tok].children)) {
1.18 kristaps 565: roff_err(tree, *argvp, "`%s' is invalid child of `%s'",
566: toknames[tok],
567: toknames[tree->last->tok]);
1.1 kristaps 568: return(0);
569: }
570:
571: /*
1.6 kristaps 572: * Branch if we're not a layout token.
1.1 kristaps 573: */
574:
1.6 kristaps 575: if (ROFF_LAYOUT != tokens[tok].type)
576: return((*tokens[tok].cb)(tok, tree, argvp, ROFF_ENTER));
1.1 kristaps 577:
1.6 kristaps 578: /*
579: * Check our scope rules.
580: */
1.1 kristaps 581:
1.6 kristaps 582: if (0 == tokens[tok].ctx)
583: return((*tokens[tok].cb)(tok, tree, argvp, ROFF_ENTER));
1.1 kristaps 584:
1.12 kristaps 585: /*
586: * First consider implicit-end tags, like as follows:
587: * .Sh SECTION 1
588: * .Sh SECTION 2
589: * In this, we want to close the scope of the NAME section. If
590: * there's an intermediary implicit-end tag, such as
591: * .Sh SECTION 1
592: * .Ss Subsection 1
593: * .Sh SECTION 2
594: * then it must be closed as well.
595: */
596:
1.6 kristaps 597: if (tok == tokens[tok].ctx) {
1.12 kristaps 598: /*
599: * First search up to the point where we must close.
600: * If one doesn't exist, then we can open a new scope.
601: */
602:
1.6 kristaps 603: for (n = tree->last; n; n = n->parent) {
604: assert(0 == tokens[n->tok].ctx ||
605: n->tok == tokens[n->tok].ctx);
606: if (n->tok == tok)
607: break;
1.10 kristaps 608: if (ROFF_SHALLOW & tokens[tok].flags) {
609: n = NULL;
610: break;
611: }
1.6 kristaps 612: }
1.10 kristaps 613:
614: /*
615: * Create a new scope, as no previous one exists to
616: * close out.
617: */
1.12 kristaps 618:
619: if (NULL == n)
1.6 kristaps 620: return((*tokens[tok].cb)(tok, tree, argvp, ROFF_ENTER));
1.10 kristaps 621:
622: /*
1.12 kristaps 623: * Close out all intermediary scoped blocks, then hang
624: * the current scope from our predecessor's parent.
1.10 kristaps 625: */
626:
1.1 kristaps 627: do {
628: t = tree->last->tok;
1.6 kristaps 629: if ( ! (*tokens[t].cb)(t, tree, NULL, ROFF_EXIT))
1.1 kristaps 630: return(0);
631: } while (t != tok);
1.6 kristaps 632:
633: return((*tokens[tok].cb)(tok, tree, argvp, ROFF_ENTER));
1.1 kristaps 634: }
635:
1.12 kristaps 636: /*
637: * Now consider explicit-end tags, where we want to close back
638: * to a specific tag. Example:
639: * .Bl
640: * .It Item.
641: * .El
642: * In this, the `El' tag closes out the scope of `Bl'.
643: */
644:
1.9 kristaps 645: assert(tree->last);
1.6 kristaps 646: assert(tok != tokens[tok].ctx && 0 != tokens[tok].ctx);
647:
1.14 kristaps 648: /* LINTED */
1.6 kristaps 649: do {
650: t = tree->last->tok;
651: if ( ! (*tokens[t].cb)(t, tree, NULL, ROFF_EXIT))
652: return(0);
653: } while (t != tokens[tok].ctx);
1.1 kristaps 654:
1.9 kristaps 655: assert(tree->last);
656: return(1);
1.1 kristaps 657: }
658:
659:
660: static int
661: rofffindarg(const char *name)
662: {
663: size_t i;
664:
665: /* FIXME: use a table, this is slow but ok for now. */
666:
667: /* LINTED */
668: for (i = 0; i < ROFF_ARGMAX; i++)
669: /* LINTED */
1.4 kristaps 670: if (0 == strcmp(name, tokargnames[i]))
1.1 kristaps 671: return((int)i);
672:
673: return(ROFF_ARGMAX);
674: }
675:
676:
677: static int
1.6 kristaps 678: rofffindtok(const char *buf)
1.1 kristaps 679: {
1.6 kristaps 680: char token[4];
1.23 kristaps 681: int i;
1.1 kristaps 682:
1.6 kristaps 683: for (i = 0; *buf && ! isspace(*buf) && i < 3; i++, buf++)
684: token[i] = *buf;
685:
1.9 kristaps 686: if (i == 3)
1.6 kristaps 687: return(ROFF_MAX);
688:
689: token[i] = 0;
690:
1.1 kristaps 691: /* FIXME: use a table, this is slow but ok for now. */
692:
693: /* LINTED */
694: for (i = 0; i < ROFF_MAX; i++)
695: /* LINTED */
1.12 kristaps 696: if (0 == strcmp(toknames[i], token))
1.1 kristaps 697: return((int)i);
1.7 kristaps 698:
1.1 kristaps 699: return(ROFF_MAX);
700: }
701:
702:
1.20 kristaps 703: static int
704: roffispunct(const char *p)
705: {
706:
707: if (0 == *p)
708: return(0);
709: if (0 != *(p + 1))
710: return(0);
711:
712: switch (*p) {
713: case('{'):
714: /* FALLTHROUGH */
715: case('.'):
716: /* FALLTHROUGH */
717: case(','):
718: /* FALLTHROUGH */
719: case(';'):
720: /* FALLTHROUGH */
721: case(':'):
722: /* FALLTHROUGH */
723: case('?'):
724: /* FALLTHROUGH */
725: case('!'):
726: /* FALLTHROUGH */
727: case('('):
728: /* FALLTHROUGH */
729: case(')'):
730: /* FALLTHROUGH */
731: case('['):
732: /* FALLTHROUGH */
733: case(']'):
734: /* FALLTHROUGH */
735: case('}'):
736: return(1);
737: default:
738: break;
739: }
740:
741: return(0);
742: }
743:
744:
1.2 kristaps 745: static int
746: rofffindcallable(const char *name)
747: {
748: int c;
749:
750: if (ROFF_MAX == (c = rofffindtok(name)))
751: return(ROFF_MAX);
1.8 kristaps 752: assert(c >= 0 && c < ROFF_MAX);
1.2 kristaps 753: return(ROFF_CALLABLE & tokens[c].flags ? c : ROFF_MAX);
754: }
755:
756:
1.1 kristaps 757: static struct roffnode *
1.4 kristaps 758: roffnode_new(int tokid, struct rofftree *tree)
1.1 kristaps 759: {
760: struct roffnode *p;
761:
1.12 kristaps 762: if (NULL == (p = malloc(sizeof(struct roffnode))))
763: err(1, "malloc");
1.1 kristaps 764:
765: p->tok = tokid;
766: p->parent = tree->last;
767: tree->last = p;
1.9 kristaps 768:
1.1 kristaps 769: return(p);
770: }
771:
772:
1.5 kristaps 773: static int
774: roffargok(int tokid, int argid)
775: {
776: const int *c;
777:
778: if (NULL == (c = tokens[tokid].args))
779: return(0);
780:
781: for ( ; ROFF_ARGMAX != *c; c++)
782: if (argid == *c)
783: return(1);
784:
785: return(0);
786: }
787:
788:
1.1 kristaps 789: static void
1.15 kristaps 790: roffnode_free(struct rofftree *tree)
1.1 kristaps 791: {
792: struct roffnode *p;
793:
794: assert(tree->last);
795:
796: p = tree->last;
797: tree->last = tree->last->parent;
798: free(p);
799: }
800:
801:
1.6 kristaps 802: static int
1.12 kristaps 803: roffnextopt(const struct rofftree *tree, int tok,
1.18 kristaps 804: char ***in, char **val)
1.6 kristaps 805: {
1.18 kristaps 806: char *arg, **argv;
1.6 kristaps 807: int v;
808:
809: *val = NULL;
810: argv = *in;
811: assert(argv);
812:
813: if (NULL == (arg = *argv))
814: return(-1);
815: if ('-' != *arg)
816: return(-1);
817:
1.12 kristaps 818: if (ROFF_ARGMAX == (v = rofffindarg(arg + 1))) {
819: roff_warn(tree, arg, "argument-like parameter `%s' to "
820: "`%s'", &arg[1], toknames[tok]);
1.6 kristaps 821: return(-1);
1.12 kristaps 822: }
823:
824: if ( ! roffargok(tok, v)) {
825: roff_warn(tree, arg, "invalid argument parameter `%s' to "
826: "`%s'", tokargnames[v], toknames[tok]);
1.6 kristaps 827: return(-1);
1.12 kristaps 828: }
829:
830: if ( ! (ROFF_VALUE & tokenargs[v]))
1.6 kristaps 831: return(v);
832:
833: *in = ++argv;
834:
1.12 kristaps 835: if (NULL == *argv) {
836: roff_err(tree, arg, "empty value of `%s' for `%s'",
837: tokargnames[v], toknames[tok]);
838: return(ROFF_ARGMAX);
839: }
1.6 kristaps 840:
1.12 kristaps 841: return(v);
1.6 kristaps 842: }
843:
844:
1.1 kristaps 845: /* ARGSUSED */
846: static int
847: roff_Dd(ROFFCALL_ARGS)
848: {
849:
1.4 kristaps 850: if (ROFF_BODY & tree->state) {
851: assert( ! (ROFF_PRELUDE & tree->state));
852: assert(ROFF_PRELUDE_Dd & tree->state);
853: return(roff_text(tok, tree, argv, type));
854: }
855:
1.1 kristaps 856: assert(ROFF_PRELUDE & tree->state);
1.4 kristaps 857: assert( ! (ROFF_BODY & tree->state));
858:
1.6 kristaps 859: if (ROFF_PRELUDE_Dd & tree->state) {
1.12 kristaps 860: roff_err(tree, *argv, "repeated `Dd' in prelude");
1.6 kristaps 861: return(0);
862: } else if (ROFF_PRELUDE_Dt & tree->state) {
1.12 kristaps 863: roff_err(tree, *argv, "out-of-order `Dd' in prelude");
1.1 kristaps 864: return(0);
865: }
866:
1.4 kristaps 867: /* TODO: parse date. */
868:
1.1 kristaps 869: assert(NULL == tree->last);
870: tree->state |= ROFF_PRELUDE_Dd;
871:
872: return(1);
873: }
874:
875:
876: /* ARGSUSED */
877: static int
878: roff_Dt(ROFFCALL_ARGS)
879: {
880:
1.4 kristaps 881: if (ROFF_BODY & tree->state) {
882: assert( ! (ROFF_PRELUDE & tree->state));
883: assert(ROFF_PRELUDE_Dt & tree->state);
884: return(roff_text(tok, tree, argv, type));
885: }
886:
1.1 kristaps 887: assert(ROFF_PRELUDE & tree->state);
1.4 kristaps 888: assert( ! (ROFF_BODY & tree->state));
889:
1.6 kristaps 890: if ( ! (ROFF_PRELUDE_Dd & tree->state)) {
1.12 kristaps 891: roff_err(tree, *argv, "out-of-order `Dt' in prelude");
1.1 kristaps 892: return(0);
1.6 kristaps 893: } else if (ROFF_PRELUDE_Dt & tree->state) {
1.12 kristaps 894: roff_err(tree, *argv, "repeated `Dt' in prelude");
1.6 kristaps 895: return(0);
1.1 kristaps 896: }
897:
1.4 kristaps 898: /* TODO: parse date. */
899:
1.1 kristaps 900: assert(NULL == tree->last);
901: tree->state |= ROFF_PRELUDE_Dt;
902:
903: return(1);
904: }
905:
906:
907: /* ARGSUSED */
908: static int
909: roff_Os(ROFFCALL_ARGS)
910: {
911:
912: if (ROFF_EXIT == type) {
1.18 kristaps 913: roffnode_free(tree);
914: return((*tree->cb.rofftail)(tree->arg));
1.4 kristaps 915: } else if (ROFF_BODY & tree->state) {
916: assert( ! (ROFF_PRELUDE & tree->state));
917: assert(ROFF_PRELUDE_Os & tree->state);
918: return(roff_text(tok, tree, argv, type));
919: }
1.1 kristaps 920:
921: assert(ROFF_PRELUDE & tree->state);
922: if ( ! (ROFF_PRELUDE_Dt & tree->state) ||
923: ! (ROFF_PRELUDE_Dd & tree->state)) {
1.12 kristaps 924: roff_err(tree, *argv, "out-of-order `Os' in prelude");
1.1 kristaps 925: return(0);
926: }
927:
1.4 kristaps 928: /* TODO: extract OS. */
1.1 kristaps 929:
930: tree->state |= ROFF_PRELUDE_Os;
931: tree->state &= ~ROFF_PRELUDE;
932: tree->state |= ROFF_BODY;
933:
1.4 kristaps 934: assert(NULL == tree->last);
935:
1.18 kristaps 936: if (NULL == roffnode_new(tok, tree))
937: return(0);
938:
939: return((*tree->cb.roffhead)(tree->arg));
1.1 kristaps 940: }
941:
942:
943: /* ARGSUSED */
944: static int
1.2 kristaps 945: roff_layout(ROFFCALL_ARGS)
1.1 kristaps 946: {
1.2 kristaps 947: int i, c, argcp[ROFF_MAXARG];
948: char *v, *argvp[ROFF_MAXARG];
1.1 kristaps 949:
1.4 kristaps 950: if (ROFF_PRELUDE & tree->state) {
1.12 kristaps 951: roff_err(tree, *argv, "`%s' disallowed in prelude",
952: toknames[tok]);
1.4 kristaps 953: return(0);
954: }
955:
1.2 kristaps 956: if (ROFF_EXIT == type) {
1.15 kristaps 957: roffnode_free(tree);
958: return((*tree->cb.roffblkout)(tree->arg, tok));
1.2 kristaps 959: }
1.1 kristaps 960:
1.2 kristaps 961: i = 0;
1.12 kristaps 962: argv++;
1.5 kristaps 963:
1.12 kristaps 964: while (-1 != (c = roffnextopt(tree, tok, &argv, &v))) {
965: if (ROFF_ARGMAX == c)
1.5 kristaps 966: return(0);
1.12 kristaps 967:
1.2 kristaps 968: argcp[i] = c;
969: argvp[i] = v;
1.5 kristaps 970: i++;
1.1 kristaps 971: argv++;
972: }
973:
1.5 kristaps 974: argcp[i] = ROFF_ARGMAX;
975: argvp[i] = NULL;
976:
1.4 kristaps 977: if (NULL == roffnode_new(tok, tree))
1.2 kristaps 978: return(0);
979:
1.18 kristaps 980: if ( ! (*tree->cb.roffblkin)(tree->arg, tok, argcp, argvp))
981: return(0);
982:
983: if (NULL == *argv)
984: return(1);
985:
1.24 kristaps 986: if ( ! (*tree->cb.roffin)(tree->arg, tok, argcp, argvp))
1.2 kristaps 987: return(0);
988:
989: if ( ! (ROFF_PARSED & tokens[tok].flags)) {
1.21 kristaps 990: i = 0;
1.14 kristaps 991: while (*argv) {
1.21 kristaps 992: if ( ! (*tree->cb.roffdata)(tree->arg, i, *argv++))
1.14 kristaps 993: return(0);
1.21 kristaps 994: i = 1;
1.14 kristaps 995: }
1.18 kristaps 996: return((*tree->cb.roffout)(tree->arg, tok));
1.2 kristaps 997: }
998:
1.21 kristaps 999: i = 0;
1.1 kristaps 1000: while (*argv) {
1.8 kristaps 1001: if (ROFF_MAX != (c = rofffindcallable(*argv))) {
1002: if (NULL == tokens[c].cb) {
1.12 kristaps 1003: roff_err(tree, *argv, "unsupported "
1004: "macro `%s'",
1005: toknames[c]);
1.8 kristaps 1006: return(0);
1007: }
1.14 kristaps 1008: if ( ! (*tokens[c].cb)(c, tree, argv, ROFF_ENTER))
1.2 kristaps 1009: return(0);
1.14 kristaps 1010: break;
1.8 kristaps 1011: }
1.12 kristaps 1012:
1.17 kristaps 1013: assert(tree->arg);
1.21 kristaps 1014: if ( ! (*tree->cb.roffdata)(tree->arg, i, *argv++))
1.14 kristaps 1015: return(0);
1.21 kristaps 1016: i = 1;
1017: }
1018:
1019: /*
1020: * If we're the first parser (*argv == tree->cur) then purge out
1021: * any additional punctuation, should there be any remaining at
1022: * the end of line.
1023: */
1024:
1025: if (ROFF_PARSED & tokens[tok].flags && *argv) {
1026: i = 0;
1027: while (argv[i])
1028: i++;
1029:
1030: assert(i > 0);
1031: if ( ! roffispunct(argv[--i]))
1.22 kristaps 1032: return((*tree->cb.roffout)(tree->arg, tok));
1.21 kristaps 1033:
1034: while (i >= 0 && roffispunct(argv[i]))
1035: i--;
1036:
1037: assert(0 != i);
1038: i++;
1039:
1.23 kristaps 1040: /* LINTED */
1.21 kristaps 1041: while (argv[i])
1042: if ( ! (*tree->cb.roffdata)(tree->arg, 0, argv[i++]))
1043: return(0);
1.14 kristaps 1044: }
1.12 kristaps 1045:
1.18 kristaps 1046: return((*tree->cb.roffout)(tree->arg, tok));
1.2 kristaps 1047: }
1048:
1049:
1050: /* ARGSUSED */
1051: static int
1052: roff_text(ROFFCALL_ARGS)
1053: {
1.21 kristaps 1054: int i, j, first, c, argcp[ROFF_MAXARG];
1.2 kristaps 1055: char *v, *argvp[ROFF_MAXARG];
1056:
1.4 kristaps 1057: if (ROFF_PRELUDE & tree->state) {
1.12 kristaps 1058: roff_err(tree, *argv, "`%s' disallowed in prelude",
1059: toknames[tok]);
1.4 kristaps 1060: return(0);
1061: }
1062:
1.21 kristaps 1063: /* FIXME: breaks if passed from roff_layout. */
1064: first = *argv == tree->cur;
1065:
1.2 kristaps 1066: i = 0;
1.12 kristaps 1067: argv++;
1.5 kristaps 1068:
1.12 kristaps 1069: while (-1 != (c = roffnextopt(tree, tok, &argv, &v))) {
1070: if (ROFF_ARGMAX == c)
1.2 kristaps 1071: return(0);
1.12 kristaps 1072:
1.2 kristaps 1073: argcp[i] = c;
1074: argvp[i] = v;
1.5 kristaps 1075: i++;
1.1 kristaps 1076: argv++;
1077: }
1078:
1.5 kristaps 1079: argcp[i] = ROFF_ARGMAX;
1080: argvp[i] = NULL;
1081:
1.24 kristaps 1082: if ( ! (*tree->cb.roffin)(tree->arg, tok, argcp, argvp))
1.2 kristaps 1083: return(0);
1.1 kristaps 1084:
1.2 kristaps 1085: if ( ! (ROFF_PARSED & tokens[tok].flags)) {
1.21 kristaps 1086: i = 0;
1.14 kristaps 1087: while (*argv) {
1.21 kristaps 1088: if ( ! (*tree->cb.roffdata)(tree->arg, i, *argv++))
1.14 kristaps 1089: return(0);
1.21 kristaps 1090: i = 1;
1.14 kristaps 1091: }
1.15 kristaps 1092: return((*tree->cb.roffout)(tree->arg, tok));
1.2 kristaps 1093: }
1.1 kristaps 1094:
1.21 kristaps 1095: i = 0;
1.2 kristaps 1096: while (*argv) {
1.20 kristaps 1097: if (ROFF_MAX == (c = rofffindcallable(*argv))) {
1.21 kristaps 1098: /*
1099: * If all that remains is roff punctuation, then
1100: * close out our scope and return.
1101: */
1102: if (roffispunct(*argv)) {
1103: for (j = 0; argv[j]; j++)
1104: if ( ! roffispunct(argv[j]))
1105: break;
1106: if (NULL == argv[j])
1107: break;
1108: i = 1;
1109: }
1110:
1111: if ( ! (*tree->cb.roffdata)(tree->arg, i, *argv++))
1.8 kristaps 1112: return(0);
1.21 kristaps 1113:
1114: i = 1;
1.20 kristaps 1115: continue;
1.8 kristaps 1116: }
1.20 kristaps 1117:
1118: /*
1119: * A sub-command has been found. Execute it and
1120: * discontinue parsing for arguments.
1121: */
1122:
1123: if (NULL == tokens[c].cb) {
1124: roff_err(tree, *argv, "unsupported macro `%s'",
1125: toknames[c]);
1126: return(0);
1127: }
1128:
1129: if ( ! (*tokens[c].cb)(c, tree, argv, ROFF_ENTER))
1.14 kristaps 1130: return(0);
1.20 kristaps 1131:
1132: break;
1.14 kristaps 1133: }
1.12 kristaps 1134:
1.21 kristaps 1135: if ( ! (*tree->cb.roffout)(tree->arg, tok))
1136: return(0);
1137:
1138: /*
1139: * If we're the first parser (*argv == tree->cur) then purge out
1140: * any additional punctuation, should there be any remaining at
1141: * the end of line.
1142: */
1143:
1144: if (first && *argv) {
1145: i = 0;
1146: while (argv[i])
1147: i++;
1148:
1149: assert(i > 0);
1150: if ( ! roffispunct(argv[--i]))
1151: return(1);
1152:
1153: while (i >= 0 && roffispunct(argv[i]))
1154: i--;
1155:
1156: assert(0 != i);
1157: i++;
1158:
1.23 kristaps 1159: /* LINTED */
1.21 kristaps 1160: while (argv[i])
1161: if ( ! (*tree->cb.roffdata)(tree->arg, 0, argv[i++]))
1162: return(0);
1163: }
1164:
1165: return(1);
1.6 kristaps 1166: }
1167:
1168:
1.9 kristaps 1169: /* ARGSUSED */
1.6 kristaps 1170: static int
1171: roff_comment(ROFFCALL_ARGS)
1172: {
1173:
1174: return(1);
1.1 kristaps 1175: }
1.9 kristaps 1176:
1177:
1178: /* ARGSUSED */
1179: static int
1180: roff_close(ROFFCALL_ARGS)
1181: {
1182:
1183: return(1);
1184: }
1.11 kristaps 1185:
1186:
1187: /* ARGSUSED */
1188: static int
1189: roff_special(ROFFCALL_ARGS)
1190: {
1191:
1.15 kristaps 1192: return((*tree->cb.roffspecial)(tree->arg, tok));
1.11 kristaps 1193: }
1.12 kristaps 1194:
1195:
1196: static void
1197: roff_warn(const struct rofftree *tree, const char *pos, char *fmt, ...)
1198: {
1199: va_list ap;
1200: char buf[128];
1201:
1202: va_start(ap, fmt);
1203: (void)vsnprintf(buf, sizeof(buf), fmt, ap);
1204: va_end(ap);
1205:
1.15 kristaps 1206: (*tree->cb.roffmsg)(tree->arg,
1207: ROFF_WARN, tree->cur, pos, buf);
1.12 kristaps 1208: }
1209:
1210:
1211: static void
1212: roff_err(const struct rofftree *tree, const char *pos, char *fmt, ...)
1213: {
1214: va_list ap;
1215: char buf[128];
1216:
1217: va_start(ap, fmt);
1218: (void)vsnprintf(buf, sizeof(buf), fmt, ap);
1219: va_end(ap);
1220:
1.15 kristaps 1221: (*tree->cb.roffmsg)(tree->arg,
1222: ROFF_ERROR, tree->cur, pos, buf);
1.12 kristaps 1223: }
CVSweb
![[BACK]](/cvsweb/icons/back.gif){kind=icon}
Return to roff.c CVS log ![[TXT]](/cvsweb/icons/text.gif){kind=icon}
![[DIR]](/cvsweb/icons/dir.gif){kind=icon}
Up to [cvsweb.bsd.lv] / mandoc