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