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
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
|
/* $Id$ */
/*
* Copyright (c) 2008, 2009 Kristaps Dzonsons <kristaps@openbsd.org>
*
* 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 <assert.h>
#include <ctype.h>
#include <stdarg.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include "libmdoc.h"
enum merr {
ENOCALL,
EBODYPROL,
EPROLBODY,
ESPACE,
ETEXTPROL,
ENOBLANK,
EMALLOC
};
const char *const __mdoc_macronames[MDOC_MAX] = {
"\\\"", "Dd", "Dt", "Os",
"Sh", "Ss", "Pp", "D1",
"Dl", "Bd", "Ed", "Bl",
"El", "It", "Ad", "An",
"Ar", "Cd", "Cm", "Dv",
"Er", "Ev", "Ex", "Fa",
"Fd", "Fl", "Fn", "Ft",
"Ic", "In", "Li", "Nd",
"Nm", "Op", "Ot", "Pa",
"Rv", "St", "Va", "Vt",
/* LINTED */
"Xr", "\%A", "\%B", "\%D",
/* LINTED */
"\%I", "\%J", "\%N", "\%O",
/* LINTED */
"\%P", "\%R", "\%T", "\%V",
"Ac", "Ao", "Aq", "At",
"Bc", "Bf", "Bo", "Bq",
"Bsx", "Bx", "Db", "Dc",
"Do", "Dq", "Ec", "Ef",
"Em", "Eo", "Fx", "Ms",
"No", "Ns", "Nx", "Ox",
"Pc", "Pf", "Po", "Pq",
"Qc", "Ql", "Qo", "Qq",
"Re", "Rs", "Sc", "So",
"Sq", "Sm", "Sx", "Sy",
"Tn", "Ux", "Xc", "Xo",
"Fo", "Fc", "Oo", "Oc",
"Bk", "Ek", "Bt", "Hf",
"Fr", "Ud", "Lb", "Ap",
"Lp", "Lk", "Mt", "Brq",
/* LINTED */
"Bro", "Brc", "\%C", "Es",
/* LINTED */
"En", "Dx", "\%Q"
};
const char *const __mdoc_argnames[MDOC_ARG_MAX] = {
"split", "nosplit", "ragged",
"unfilled", "literal", "file",
"offset", "bullet", "dash",
"hyphen", "item", "enum",
"tag", "diag", "hang",
"ohang", "inset", "column",
"width", "compact", "std",
"filled", "words", "emphasis",
"symbolic", "nested"
};
const char * const *mdoc_macronames = __mdoc_macronames;
const char * const *mdoc_argnames = __mdoc_argnames;
static void mdoc_free1(struct mdoc *);
static int mdoc_alloc1(struct mdoc *);
static struct mdoc_node *node_alloc(struct mdoc *, int, int,
int, enum mdoc_type);
static int node_append(struct mdoc *,
struct mdoc_node *);
static int parsetext(struct mdoc *, int, char *);
static int parsemacro(struct mdoc *, int, char *);
static int macrowarn(struct mdoc *, int, const char *);
static int perr(struct mdoc *, int, int, enum merr);
#define verr(m, t) perr((m), (m)->last->line, (m)->last->pos, (t))
/*
* Get the first (root) node of the parse tree.
*/
const struct mdoc_node *
mdoc_node(const struct mdoc *m)
{
return(MDOC_HALT & m->flags ? NULL : m->first);
}
const struct mdoc_meta *
mdoc_meta(const struct mdoc *m)
{
return(MDOC_HALT & m->flags ? NULL : &m->meta);
}
static void
mdoc_free1(struct mdoc *mdoc)
{
if (mdoc->first)
mdoc_node_freelist(mdoc->first);
if (mdoc->meta.title)
free(mdoc->meta.title);
if (mdoc->meta.os)
free(mdoc->meta.os);
if (mdoc->meta.name)
free(mdoc->meta.name);
if (mdoc->meta.arch)
free(mdoc->meta.arch);
if (mdoc->meta.vol)
free(mdoc->meta.vol);
}
static int
mdoc_alloc1(struct mdoc *mdoc)
{
bzero(&mdoc->meta, sizeof(struct mdoc_meta));
mdoc->flags = 0;
mdoc->lastnamed = mdoc->lastsec = 0;
mdoc->last = calloc(1, sizeof(struct mdoc_node));
if (NULL == mdoc->last)
return(0);
mdoc->first = mdoc->last;
mdoc->last->type = MDOC_ROOT;
mdoc->next = MDOC_NEXT_CHILD;
return(1);
}
/*
* Free up all resources contributed by a parse: the node tree,
* meta-data and so on. Then reallocate the root node for another
* parse.
*/
int
mdoc_reset(struct mdoc *mdoc)
{
mdoc_free1(mdoc);
return(mdoc_alloc1(mdoc));
}
/*
* Completely free up all resources.
*/
void
mdoc_free(struct mdoc *mdoc)
{
mdoc_free1(mdoc);
if (mdoc->htab)
mdoc_tokhash_free(mdoc->htab);
free(mdoc);
}
struct mdoc *
mdoc_alloc(void *data, int pflags, const struct mdoc_cb *cb)
{
struct mdoc *p;
if (NULL == (p = calloc(1, sizeof(struct mdoc))))
return(NULL);
p->data = data;
p->htab = mdoc_tokhash_alloc();
p->pflags = pflags;
if (cb)
(void)memcpy(&p->cb, cb, sizeof(struct mdoc_cb));
if (mdoc_alloc1(p))
return(p);
free(p);
return(NULL);
}
/*
* Climb back up the parse tree, validating open scopes. Mostly calls
* through to macro_end in macro.c.
*/
int
mdoc_endparse(struct mdoc *m)
{
if (MDOC_HALT & m->flags)
return(0);
else if (mdoc_macroend(m))
return(1);
m->flags |= MDOC_HALT;
return(0);
}
/*
* Main parse routine. Parses a single line -- really just hands off to
* the macro or text parser.
*/
int
mdoc_parseln(struct mdoc *m, int ln, char *buf)
{
/* If in error-mode, then we parse no more. */
if (MDOC_HALT & m->flags)
return(0);
return('.' == *buf ? parsemacro(m, ln, buf) :
parsetext(m, ln, buf));
}
void
mdoc_vmsg(struct mdoc *mdoc, int ln, int pos, const char *fmt, ...)
{
char buf[256];
va_list ap;
if (NULL == mdoc->cb.mdoc_msg)
return;
va_start(ap, fmt);
(void)vsnprintf(buf, sizeof(buf) - 1, fmt, ap);
va_end(ap);
(*mdoc->cb.mdoc_msg)(mdoc->data, ln, pos, buf);
}
int
mdoc_verr(struct mdoc *mdoc, int ln, int pos,
const char *fmt, ...)
{
char buf[256];
va_list ap;
if (NULL == mdoc->cb.mdoc_err)
return(0);
va_start(ap, fmt);
(void)vsnprintf(buf, sizeof(buf) - 1, fmt, ap);
va_end(ap);
return((*mdoc->cb.mdoc_err)(mdoc->data, ln, pos, buf));
}
int
mdoc_vwarn(struct mdoc *mdoc, int ln, int pos,
enum mdoc_warn type, const char *fmt, ...)
{
char buf[256];
va_list ap;
if (NULL == mdoc->cb.mdoc_warn)
return(0);
va_start(ap, fmt);
(void)vsnprintf(buf, sizeof(buf) - 1, fmt, ap);
va_end(ap);
return((*mdoc->cb.mdoc_warn)(mdoc->data, ln, pos, type, buf));
}
int
mdoc_macro(struct mdoc *m, int tok,
int ln, int pp, int *pos, char *buf)
{
/* FIXME - these should happen during validation. */
if (MDOC_PROLOGUE & mdoc_macros[tok].flags &&
SEC_PROLOGUE != m->lastnamed)
return(perr(m, ln, pp, EPROLBODY));
if ( ! (MDOC_PROLOGUE & mdoc_macros[tok].flags) &&
SEC_PROLOGUE == m->lastnamed)
return(perr(m, ln, pp, EBODYPROL));
if (1 != pp && ! (MDOC_CALLABLE & mdoc_macros[tok].flags))
return(perr(m, ln, pp, ENOCALL));
return((*mdoc_macros[tok].fp)(m, tok, ln, pp, pos, buf));
}
static int
perr(struct mdoc *m, int line, int pos, enum merr type)
{
char *p;
p = NULL;
switch (type) {
case (ENOCALL):
p = "not callable";
break;
case (EPROLBODY):
p = "macro disallowed in document body";
break;
case (EBODYPROL):
p = "macro disallowed in document prologue";
break;
case (EMALLOC):
p = "memory exhausted";
break;
case (ETEXTPROL):
p = "text disallowed in document prologue";
break;
case (ENOBLANK):
p = "blank lines disallowed in non-literal contexts";
break;
case (ESPACE):
p = "whitespace disallowed after delimiter";
break;
}
assert(p);
return(mdoc_perr(m, line, pos, p));
}
static int
node_append(struct mdoc *mdoc, struct mdoc_node *p)
{
assert(mdoc->last);
assert(mdoc->first);
assert(MDOC_ROOT != p->type);
switch (mdoc->next) {
case (MDOC_NEXT_SIBLING):
mdoc->last->next = p;
p->prev = mdoc->last;
p->parent = mdoc->last->parent;
break;
case (MDOC_NEXT_CHILD):
mdoc->last->child = p;
p->parent = mdoc->last;
break;
default:
abort();
/* NOTREACHED */
}
if ( ! mdoc_valid_pre(mdoc, p))
return(0);
if ( ! mdoc_action_pre(mdoc, p))
return(0);
switch (p->type) {
case (MDOC_HEAD):
assert(MDOC_BLOCK == p->parent->type);
p->parent->head = p;
break;
case (MDOC_TAIL):
assert(MDOC_BLOCK == p->parent->type);
p->parent->tail = p;
break;
case (MDOC_BODY):
assert(MDOC_BLOCK == p->parent->type);
p->parent->body = p;
break;
default:
break;
}
mdoc->last = p;
switch (p->type) {
case (MDOC_TEXT):
if ( ! mdoc_valid_post(mdoc))
return(0);
if ( ! mdoc_action_post(mdoc))
return(0);
break;
default:
break;
}
return(1);
}
static struct mdoc_node *
node_alloc(struct mdoc *mdoc, int line,
int pos, int tok, enum mdoc_type type)
{
struct mdoc_node *p;
if (NULL == (p = calloc(1, sizeof(struct mdoc_node)))) {
(void)verr(mdoc, EMALLOC);
return(NULL);
}
p->sec = mdoc->lastsec;
p->line = line;
p->pos = pos;
p->tok = tok;
if (MDOC_TEXT != (p->type = type))
assert(p->tok >= 0);
return(p);
}
int
mdoc_tail_alloc(struct mdoc *mdoc, int line, int pos, int tok)
{
struct mdoc_node *p;
p = node_alloc(mdoc, line, pos, tok, MDOC_TAIL);
if (NULL == p)
return(0);
return(node_append(mdoc, p));
}
int
mdoc_head_alloc(struct mdoc *mdoc, int line, int pos, int tok)
{
struct mdoc_node *p;
assert(mdoc->first);
assert(mdoc->last);
p = node_alloc(mdoc, line, pos, tok, MDOC_HEAD);
if (NULL == p)
return(0);
return(node_append(mdoc, p));
}
int
mdoc_body_alloc(struct mdoc *mdoc, int line, int pos, int tok)
{
struct mdoc_node *p;
p = node_alloc(mdoc, line, pos, tok, MDOC_BODY);
if (NULL == p)
return(0);
return(node_append(mdoc, p));
}
int
mdoc_block_alloc(struct mdoc *mdoc, int line, int pos,
int tok, struct mdoc_arg *args)
{
struct mdoc_node *p;
p = node_alloc(mdoc, line, pos, tok, MDOC_BLOCK);
if (NULL == p)
return(0);
if ((p->args = args))
(args->refcnt)++;
return(node_append(mdoc, p));
}
int
mdoc_elem_alloc(struct mdoc *mdoc, int line, int pos,
int tok, struct mdoc_arg *args)
{
struct mdoc_node *p;
p = node_alloc(mdoc, line, pos, tok, MDOC_ELEM);
if (NULL == p)
return(0);
if ((p->args = args))
(args->refcnt)++;
return(node_append(mdoc, p));
}
int
mdoc_word_alloc(struct mdoc *mdoc,
int line, int pos, const char *word)
{
struct mdoc_node *p;
p = node_alloc(mdoc, line, pos, -1, MDOC_TEXT);
if (NULL == p)
return(0);
if (NULL == (p->string = strdup(word))) {
(void)verr(mdoc, EMALLOC);
return(0);
}
return(node_append(mdoc, p));
}
void
mdoc_node_free(struct mdoc_node *p)
{
if (p->string)
free(p->string);
if (p->args)
mdoc_argv_free(p->args);
free(p);
}
void
mdoc_node_freelist(struct mdoc_node *p)
{
if (p->child)
mdoc_node_freelist(p->child);
if (p->next)
mdoc_node_freelist(p->next);
mdoc_node_free(p);
}
/*
* Parse free-form text, that is, a line that does not begin with the
* control character.
*/
static int
parsetext(struct mdoc *m, int line, char *buf)
{
if (SEC_PROLOGUE == m->lastnamed)
return(perr(m, line, 0, ETEXTPROL));
if (0 == buf[0] && ! (MDOC_LITERAL & m->flags))
return(perr(m, line, 0, ENOBLANK));
if ( ! mdoc_word_alloc(m, line, 0, buf))
return(0);
m->next = MDOC_NEXT_SIBLING;
return(1);
}
static int
macrowarn(struct mdoc *m, int ln, const char *buf)
{
if ( ! (MDOC_IGN_MACRO & m->pflags))
return(mdoc_perr(m, ln, 1,
"unknown macro: %s%s",
buf, strlen(buf) > 3 ? "..." : ""));
return(mdoc_pwarn(m, ln, 1, WARN_SYNTAX,
"unknown macro: %s%s",
buf, strlen(buf) > 3 ? "..." : ""));
}
/*
* Parse a macro line, that is, a line beginning with the control
* character.
*/
int
parsemacro(struct mdoc *m, int ln, char *buf)
{
int i, c;
char mac[5];
/* Comments and empties are quickly ignored. */
if (0 == buf[1])
return(1);
if (' ' == buf[1]) {
i = 2;
while (buf[i] && ' ' == buf[i])
i++;
if (0 == buf[i])
return(1);
return(perr(m, ln, 1, ESPACE));
}
if (buf[1] && '\\' == buf[1])
if (buf[2] && '\"' == buf[2])
return(1);
/* Copy the first word into a nil-terminated buffer. */
for (i = 1; i < 5; i++) {
if (0 == (mac[i - 1] = buf[i]))
break;
else if (' ' == buf[i])
break;
}
mac[i - 1] = 0;
if (i == 5 || i <= 2) {
if ( ! macrowarn(m, ln, mac))
goto err;
return(1);
}
if (MDOC_MAX == (c = mdoc_tokhash_find(m->htab, mac))) {
if ( ! macrowarn(m, ln, mac))
goto err;
return(1);
}
/* The macro is sane. Jump to the next word. */
while (buf[i] && ' ' == buf[i])
i++;
/* Begin recursive parse sequence. */
if ( ! mdoc_macro(m, c, ln, 1, &i, buf))
goto err;
return(1);
err: /* Error out. */
m->flags |= MDOC_HALT;
return(0);
}
|