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