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