1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
|
/* $Id$ */
/*
* Copyright (c) 2008 Kristaps Dzonsons <kristaps@kth.se>
*
* Permission to use, copy, modify, and distribute this software for any
* purpose with or without fee is hereby granted, provided that the
* above copyright notice and this permission notice appear in all
* copies.
*
* THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL
* WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED
* WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE
* AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL
* DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR
* PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER
* TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR
* PERFORMANCE OF THIS SOFTWARE.
*/
#include <sys/stat.h>
#include <sys/param.h>
#include <assert.h>
#include <fcntl.h>
#include <err.h>
#include <getopt.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unistd.h>
#include "mdoc.h"
#define xfprintf (void)fprintf
#define MD_LINE_SZ (256) /* Max input line size. */
/* TODO: have a struct for each transformer. */
typedef int (*mdocprint)(const struct mdoc_node *);
struct md_parse {
int warn; /* Warning flags. */
#define MD_WARN_SYNTAX (1 << 0) /* Show syntax warnings. */
#define MD_WARN_COMPAT (1 << 1) /* Show compat warnings. */
#define MD_WARN_ALL (0x03) /* Show all warnings. */
#define MD_WARN_ERR (1 << 2) /* Make warnings->errors. */
int dbg; /* Debug level. */
struct mdoc *mdoc; /* Active parser. */
char *buf; /* Input buffer. */
u_long bufsz; /* Input buffer size. */
char *name; /* Input file name. */
int fd; /* Input file desc. */
mdocprint print; /* Node-print function. */
};
extern char *__progname;
extern int treeprint(const struct mdoc_node *);
static void usage(void);
static int parse_begin(struct md_parse *);
static int parse_leave(struct md_parse *, int);
static int io_begin(struct md_parse *);
static int io_leave(struct md_parse *, int);
static int buf_begin(struct md_parse *);
static int buf_leave(struct md_parse *, int);
static void msg_msg(void *, int, int, const char *);
static int msg_err(void *, int, int, const char *);
static int msg_warn(void *, int, int,
enum mdoc_warn, const char *);
#ifdef __linux__
extern int getsubopt(char **, char *const *, char **);
#endif
int
main(int argc, char *argv[])
{
int c;
struct md_parse parser;
char *opts, *v, *filter;
#define ALL 0
#define COMPAT 1
#define SYNTAX 2
#define ERROR 3
char *toks[] = { "all", "compat", "syntax",
"error", NULL };
extern char *optarg;
extern int optind;
filter = NULL;
(void)memset(&parser, 0, sizeof(struct md_parse));
while (-1 != (c = getopt(argc, argv, "f:vW:")))
switch (c) {
case ('f'):
filter = optarg;
break;
case ('v'):
parser.dbg++;
break;
case ('W'):
opts = optarg;
while (*opts)
switch (getsubopt(&opts, toks, &v)) {
case (ALL):
parser.warn |= MD_WARN_ALL;
break;
case (COMPAT):
parser.warn |= MD_WARN_COMPAT;
break;
case (SYNTAX):
parser.warn |= MD_WARN_SYNTAX;
break;
case (ERROR):
parser.warn |= MD_WARN_ERR;
break;
default:
usage();
return(1);
}
break;
default:
usage();
return(1);
}
argv += optind;
argc -= optind;
parser.name = "-";
if (1 == argc)
parser.name = *argv++;
if (filter) {
if (0 == strcmp(filter, "tree"))
parser.print = treeprint;
}
if ( ! io_begin(&parser))
return(EXIT_FAILURE);
return(EXIT_SUCCESS);
}
static int
io_leave(struct md_parse *p, int code)
{
if (-1 == p->fd || STDIN_FILENO == p->fd)
return(code);
if (-1 == close(p->fd)) {
warn("%s", p->name);
code = 0;
}
return(code);
}
static int
io_begin(struct md_parse *p)
{
p->fd = STDIN_FILENO;
if (0 != strncmp(p->name, "-", 1))
if (-1 == (p->fd = open(p->name, O_RDONLY, 0))) {
warn("%s", p->name);
return(io_leave(p, 0));
}
return(io_leave(p, buf_begin(p)));
}
static int
buf_leave(struct md_parse *p, int code)
{
if (p->buf)
free(p->buf);
return(code);
}
static int
buf_begin(struct md_parse *p)
{
struct stat st;
if (-1 == fstat(p->fd, &st)) {
warn("%s", p->name);
return(1);
}
p->bufsz = MAX(st.st_blksize, BUFSIZ);
if (NULL == (p->buf = malloc(p->bufsz))) {
warn("malloc");
return(buf_leave(p, 0));
}
return(buf_leave(p, parse_begin(p)));
}
static int
parse_leave(struct md_parse *p, int code)
{
const struct mdoc_node *n;
if (NULL == p->mdoc)
return(code);
if ( ! mdoc_endparse(p->mdoc))
code = 0;
if (p->print && (n = mdoc_node(p->mdoc)))
(*p->print)(n);
mdoc_free(p->mdoc);
return(code);
}
static int
parse_begin(struct md_parse *p)
{
ssize_t sz, i;
size_t pos;
char line[MD_LINE_SZ];
struct mdoc_cb cb;
int lnn;
cb.mdoc_err = msg_err;
cb.mdoc_warn = msg_warn;
cb.mdoc_msg = msg_msg;
if (NULL == (p->mdoc = mdoc_alloc(p, &cb)))
return(parse_leave(p, 0));
for (lnn = 1, pos = 0; ; ) {
if (-1 == (sz = read(p->fd, p->buf, p->bufsz))) {
warn("%s", p->name);
return(parse_leave(p, 0));
} else if (0 == sz)
break;
for (i = 0; i < sz; i++) {
if ('\n' != p->buf[i]) {
if (pos < sizeof(line)) {
line[(int)pos++] = p->buf[(int)i];
continue;
}
warnx("%s: line %d too long",
p->name, lnn);
return(parse_leave(p, 0));
}
line[(int)pos] = 0;
if ( ! mdoc_parseln(p->mdoc, lnn, line))
return(parse_leave(p, 0));
lnn++;
pos = 0;
}
}
return(parse_leave(p, 1));
}
static int
msg_err(void *arg, int line, int col, const char *msg)
{
struct md_parse *p;
p = (struct md_parse *)arg;
xfprintf(stderr, "%s:%d: error: %s (column %d)\n",
p->name, line, msg, col);
return(0);
}
static void
msg_msg(void *arg, int line, int col, const char *msg)
{
struct md_parse *p;
p = (struct md_parse *)arg;
if (0 == p->dbg)
return;
xfprintf(stderr, "%s:%d: debug: %s (column %d)\n",
p->name, line, msg, col);
}
static int
msg_warn(void *arg, int line, int col,
enum mdoc_warn type, const char *msg)
{
struct md_parse *p;
p = (struct md_parse *)arg;
switch (type) {
case (WARN_COMPAT):
if (p->warn & MD_WARN_COMPAT)
break;
return(1);
case (WARN_SYNTAX):
if (p->warn & MD_WARN_SYNTAX)
break;
return(1);
}
xfprintf(stderr, "%s:%d: warning: %s (column %d)\n",
p->name, line, msg, col);
if ( ! (p->warn & MD_WARN_ERR))
return(1);
xfprintf(stderr, "%s: considering warnings as errors\n",
__progname);
return(0);
}
static void
usage(void)
{
xfprintf(stderr, "usage: %s [-v] [-Wwarn...] [-ffilter] "
"[infile]\n", __progname);
}
|