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