]> git.cameronkatri.com Git - mandoc.git/blob - man.c
Strip trailing, unescaped whitespace from free-form, non-literal lines (like groff).
[mandoc.git] / man.c
1 /* $Id: man.c,v 1.63 2010/05/08 08:36:44 kristaps Exp $ */
2 /*
3 * Copyright (c) 2008, 2009 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 above
7 * copyright notice and this permission notice appear in all copies.
8 *
9 * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
10 * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
11 * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
12 * ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
13 * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
14 * ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
15 * OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
16 */
17 #ifdef HAVE_CONFIG_H
18 #include "config.h"
19 #endif
20
21 #include <sys/types.h>
22
23 #include <assert.h>
24 #include <ctype.h>
25 #include <stdarg.h>
26 #include <stdlib.h>
27 #include <stdio.h>
28 #include <string.h>
29
30 #include "libman.h"
31 #include "libmandoc.h"
32
33 const char *const __man_merrnames[WERRMAX] = {
34 "invalid character", /* WNPRINT */
35 "invalid manual section", /* WMSEC */
36 "invalid date format", /* WDATE */
37 "scope of prior line violated", /* WLNSCOPE */
38 "over-zealous prior line scope violation", /* WLNSCOPE2 */
39 "trailing whitespace", /* WTSPACE */
40 "unterminated quoted parameter", /* WTQUOTE */
41 "document has no body", /* WNODATA */
42 "document has no title/section", /* WNOTITLE */
43 "invalid escape sequence", /* WESCAPE */
44 "invalid number format", /* WNUMFMT */
45 "expected block head arguments", /* WHEADARGS */
46 "expected block body arguments", /* WBODYARGS */
47 "expected empty block head", /* WNHEADARGS */
48 "ill-formed macro", /* WMACROFORM */
49 "scope open on exit", /* WEXITSCOPE */
50 "no scope context", /* WNOSCOPE */
51 "literal context already open", /* WOLITERAL */
52 "no literal context open", /* WNLITERAL */
53 "invalid nesting of roff declarations", /* WROFFNEST */
54 "scope in roff instructions broken", /* WROFFSCOPE */
55 "document title should be uppercase", /* WTITLECASE */
56 "deprecated comment style", /* WBADCOMMENT */
57 };
58
59 const char *const __man_macronames[MAN_MAX] = {
60 "br", "TH", "SH", "SS",
61 "TP", "LP", "PP", "P",
62 "IP", "HP", "SM", "SB",
63 "BI", "IB", "BR", "RB",
64 "R", "B", "I", "IR",
65 "RI", "na", "i", "sp",
66 "nf", "fi", "r", "RE",
67 "RS", "DT", "UC", "PD",
68 "Sp", "Vb", "Ve", "de",
69 "dei", "am", "ami", "ig",
70 ".",
71 };
72
73 const char * const *man_macronames = __man_macronames;
74
75 static struct man_node *man_node_alloc(int, int,
76 enum man_type, enum mant);
77 static int man_node_append(struct man *,
78 struct man_node *);
79 static void man_node_free(struct man_node *);
80 static void man_node_unlink(struct man *,
81 struct man_node *);
82 static int man_ptext(struct man *, int, char *);
83 static int man_pmacro(struct man *, int, char *);
84 static void man_free1(struct man *);
85 static void man_alloc1(struct man *);
86 static int macrowarn(struct man *, int, const char *);
87
88
89 const struct man_node *
90 man_node(const struct man *m)
91 {
92
93 return(MAN_HALT & m->flags ? NULL : m->first);
94 }
95
96
97 const struct man_meta *
98 man_meta(const struct man *m)
99 {
100
101 return(MAN_HALT & m->flags ? NULL : &m->meta);
102 }
103
104
105 void
106 man_reset(struct man *man)
107 {
108
109 man_free1(man);
110 man_alloc1(man);
111 }
112
113
114 void
115 man_free(struct man *man)
116 {
117
118 man_free1(man);
119 free(man);
120 }
121
122
123 struct man *
124 man_alloc(void *data, int pflags, const struct man_cb *cb)
125 {
126 struct man *p;
127
128 p = mandoc_calloc(1, sizeof(struct man));
129
130 if (cb)
131 memcpy(&p->cb, cb, sizeof(struct man_cb));
132
133 man_hash_init();
134 p->data = data;
135 p->pflags = pflags;
136
137 man_alloc1(p);
138 return(p);
139 }
140
141
142 int
143 man_endparse(struct man *m)
144 {
145
146 if (MAN_HALT & m->flags)
147 return(0);
148 else if (man_macroend(m))
149 return(1);
150 m->flags |= MAN_HALT;
151 return(0);
152 }
153
154
155 int
156 man_parseln(struct man *m, int ln, char *buf)
157 {
158
159 return('.' == *buf || '\'' == *buf ?
160 man_pmacro(m, ln, buf) :
161 man_ptext(m, ln, buf));
162 }
163
164
165 static void
166 man_free1(struct man *man)
167 {
168
169 if (man->first)
170 man_node_delete(man, man->first);
171 if (man->meta.title)
172 free(man->meta.title);
173 if (man->meta.source)
174 free(man->meta.source);
175 if (man->meta.vol)
176 free(man->meta.vol);
177 }
178
179
180 static void
181 man_alloc1(struct man *m)
182 {
183
184 memset(&m->meta, 0, sizeof(struct man_meta));
185 m->flags = 0;
186 m->last = mandoc_calloc(1, sizeof(struct man_node));
187 m->first = m->last;
188 m->last->type = MAN_ROOT;
189 m->last->tok = MAN_MAX;
190 m->next = MAN_NEXT_CHILD;
191 }
192
193
194 static int
195 man_node_append(struct man *man, struct man_node *p)
196 {
197
198 assert(man->last);
199 assert(man->first);
200 assert(MAN_ROOT != p->type);
201
202 switch (man->next) {
203 case (MAN_NEXT_SIBLING):
204 man->last->next = p;
205 p->prev = man->last;
206 p->parent = man->last->parent;
207 break;
208 case (MAN_NEXT_CHILD):
209 man->last->child = p;
210 p->parent = man->last;
211 break;
212 default:
213 abort();
214 /* NOTREACHED */
215 }
216
217 assert(p->parent);
218 p->parent->nchild++;
219
220 if ( ! man_valid_pre(man, p))
221 return(0);
222
223 switch (p->type) {
224 case (MAN_HEAD):
225 assert(MAN_BLOCK == p->parent->type);
226 p->parent->head = p;
227 break;
228 case (MAN_BODY):
229 assert(MAN_BLOCK == p->parent->type);
230 p->parent->body = p;
231 break;
232 default:
233 break;
234 }
235
236 man->last = p;
237
238 switch (p->type) {
239 case (MAN_TEXT):
240 if ( ! man_valid_post(man))
241 return(0);
242 if ( ! man_action_post(man))
243 return(0);
244 break;
245 default:
246 break;
247 }
248
249 return(1);
250 }
251
252
253 static struct man_node *
254 man_node_alloc(int line, int pos, enum man_type type, enum mant tok)
255 {
256 struct man_node *p;
257
258 p = mandoc_calloc(1, sizeof(struct man_node));
259 p->line = line;
260 p->pos = pos;
261 p->type = type;
262 p->tok = tok;
263 return(p);
264 }
265
266
267 int
268 man_elem_alloc(struct man *m, int line, int pos, enum mant tok)
269 {
270 struct man_node *p;
271
272 p = man_node_alloc(line, pos, MAN_ELEM, tok);
273 if ( ! man_node_append(m, p))
274 return(0);
275 m->next = MAN_NEXT_CHILD;
276 return(1);
277 }
278
279
280 int
281 man_head_alloc(struct man *m, int line, int pos, enum mant tok)
282 {
283 struct man_node *p;
284
285 p = man_node_alloc(line, pos, MAN_HEAD, tok);
286 if ( ! man_node_append(m, p))
287 return(0);
288 m->next = MAN_NEXT_CHILD;
289 return(1);
290 }
291
292
293 int
294 man_body_alloc(struct man *m, int line, int pos, enum mant tok)
295 {
296 struct man_node *p;
297
298 p = man_node_alloc(line, pos, MAN_BODY, tok);
299 if ( ! man_node_append(m, p))
300 return(0);
301 m->next = MAN_NEXT_CHILD;
302 return(1);
303 }
304
305
306 int
307 man_block_alloc(struct man *m, int line, int pos, enum mant tok)
308 {
309 struct man_node *p;
310
311 p = man_node_alloc(line, pos, MAN_BLOCK, tok);
312 if ( ! man_node_append(m, p))
313 return(0);
314 m->next = MAN_NEXT_CHILD;
315 return(1);
316 }
317
318
319 int
320 man_word_alloc(struct man *m, int line, int pos, const char *word)
321 {
322 struct man_node *n;
323 size_t sv, len;
324
325 len = strlen(word);
326
327 n = man_node_alloc(line, pos, MAN_TEXT, MAN_MAX);
328 n->string = mandoc_malloc(len + 1);
329 sv = strlcpy(n->string, word, len + 1);
330
331 /* Prohibit truncation. */
332 assert(sv < len + 1);
333
334 if ( ! man_node_append(m, n))
335 return(0);
336
337 m->next = MAN_NEXT_SIBLING;
338 return(1);
339 }
340
341
342 /*
343 * Free all of the resources held by a node. This does NOT unlink a
344 * node from its context; for that, see man_node_unlink().
345 */
346 static void
347 man_node_free(struct man_node *p)
348 {
349
350 if (p->string)
351 free(p->string);
352 free(p);
353 }
354
355
356 void
357 man_node_delete(struct man *m, struct man_node *p)
358 {
359
360 while (p->child)
361 man_node_delete(m, p->child);
362
363 man_node_unlink(m, p);
364 man_node_free(p);
365 }
366
367
368 static int
369 man_ptext(struct man *m, int line, char *buf)
370 {
371 int i;
372
373 /* Ignore bogus comments. */
374
375 if ('\\' == buf[0] && '.' == buf[1] && '\"' == buf[2])
376 return(man_pwarn(m, line, 0, WBADCOMMENT));
377
378 /* Literal free-form text whitespace is preserved. */
379
380 if (MAN_LITERAL & m->flags) {
381 if ( ! man_word_alloc(m, line, 0, buf))
382 return(0);
383 goto descope;
384 }
385
386 /* Pump blank lines directly into the backend. */
387
388 for (i = 0; ' ' == buf[i]; i++)
389 /* Skip leading whitespace. */ ;
390
391 if ('\0' == buf[i]) {
392 /* Allocate a blank entry. */
393 if ( ! man_word_alloc(m, line, 0, ""))
394 return(0);
395 goto descope;
396 }
397
398 /*
399 * Warn if the last un-escaped character is whitespace. Then
400 * strip away the remaining spaces (tabs stay!).
401 */
402
403 i = (int)strlen(buf);
404 assert(i);
405
406 if (' ' == buf[i - 1] || '\t' == buf[i - 1]) {
407 assert(i > 1);
408 if ('\\' != buf[i - 2])
409 if ( ! man_pwarn(m, line, i - 1, WTSPACE))
410 return(0);
411
412 for (--i; i && ' ' == buf[i]; i--)
413 /* Spin back to non-space. */ ;
414
415 /* Jump ahead of escaped whitespace. */
416 assert(i);
417 i += '\\' == buf[i] ? 2 : 1;
418
419 buf[i] = '\0';
420 }
421
422 if ( ! man_word_alloc(m, line, 0, buf))
423 return(0);
424
425 descope:
426 /*
427 * Co-ordinate what happens with having a next-line scope open:
428 * first close out the element scope (if applicable), then close
429 * out the block scope (also if applicable).
430 */
431
432 if (MAN_ELINE & m->flags) {
433 m->flags &= ~MAN_ELINE;
434 if ( ! man_unscope(m, m->last->parent, WERRMAX))
435 return(0);
436 }
437
438 if ( ! (MAN_BLINE & m->flags))
439 return(1);
440 m->flags &= ~MAN_BLINE;
441
442 if ( ! man_unscope(m, m->last->parent, WERRMAX))
443 return(0);
444 return(man_body_alloc(m, line, 0, m->last->tok));
445 }
446
447
448 static int
449 macrowarn(struct man *m, int ln, const char *buf)
450 {
451 if ( ! (MAN_IGN_MACRO & m->pflags))
452 return(man_verr(m, ln, 0, "unknown macro: %s%s",
453 buf, strlen(buf) > 3 ? "..." : ""));
454 return(man_vwarn(m, ln, 0, "unknown macro: %s%s",
455 buf, strlen(buf) > 3 ? "..." : ""));
456 }
457
458
459 int
460 man_pmacro(struct man *m, int ln, char *buf)
461 {
462 int i, j, ppos;
463 enum mant tok;
464 char mac[5];
465 struct man_node *n;
466
467 /* Comments and empties are quickly ignored. */
468
469 if ('\0' == buf[1])
470 return(1);
471
472 i = 1;
473
474 /*
475 * Skip whitespace between the control character and initial
476 * text. "Whitespace" is both spaces and tabs.
477 */
478
479 if (' ' == buf[i] || '\t' == buf[i]) {
480 i++;
481 while (buf[i] && (' ' == buf[i] || '\t' == buf[i]))
482 i++;
483 if ('\0' == buf[i])
484 goto out;
485 }
486
487 ppos = i;
488
489 /* Copy the first word into a nil-terminated buffer. */
490
491 for (j = 0; j < 4; j++, i++) {
492 if ('\0' == (mac[j] = buf[i]))
493 break;
494 else if (' ' == buf[i])
495 break;
496
497 /* Check for invalid characters. */
498
499 if (isgraph((u_char)buf[i]))
500 continue;
501 return(man_perr(m, ln, i, WNPRINT));
502 }
503
504 mac[j] = '\0';
505
506 if (j == 4 || j < 1) {
507 if ( ! (MAN_IGN_MACRO & m->pflags)) {
508 (void)man_perr(m, ln, ppos, WMACROFORM);
509 goto err;
510 }
511 if ( ! man_pwarn(m, ln, ppos, WMACROFORM))
512 goto err;
513 return(1);
514 }
515
516 if (MAN_MAX == (tok = man_hash_find(mac))) {
517 if ( ! macrowarn(m, ln, mac))
518 goto err;
519 return(1);
520 }
521
522 /* The macro is sane. Jump to the next word. */
523
524 while (buf[i] && ' ' == buf[i])
525 i++;
526
527 /*
528 * Trailing whitespace. Note that tabs are allowed to be passed
529 * into the parser as "text", so we only warn about spaces here.
530 */
531
532 if ('\0' == buf[i] && ' ' == buf[i - 1])
533 if ( ! man_pwarn(m, ln, i - 1, WTSPACE))
534 goto err;
535
536 /*
537 * Remove prior ELINE macro, as it's being clobbering by a new
538 * macro. Note that NSCOPED macros do not close out ELINE
539 * macros---they don't print text---so we let those slip by.
540 * NOTE: we don't allow roff blocks (NOCLOSE) to be embedded
541 * here because that would stipulate blocks as children of
542 * elements!
543 */
544
545 if ( ! (MAN_NSCOPED & man_macros[tok].flags) &&
546 m->flags & MAN_ELINE) {
547 assert(MAN_TEXT != m->last->type);
548
549 /*
550 * This occurs in the following construction:
551 * .B
552 * .br
553 * .B
554 * .br
555 * I hate man macros.
556 * Flat-out disallow this madness.
557 */
558 if (MAN_NSCOPED & man_macros[m->last->tok].flags)
559 return(man_perr(m, ln, ppos, WLNSCOPE));
560
561 n = m->last;
562
563 assert(n);
564 assert(NULL == n->child);
565 assert(0 == n->nchild);
566
567 if ( ! man_nwarn(m, n, WLNSCOPE))
568 return(0);
569
570 man_node_delete(m, n);
571 m->flags &= ~MAN_ELINE;
572 }
573
574 /*
575 * Save the fact that we're in the next-line for a block. In
576 * this way, embedded roff instructions can "remember" state
577 * when they exit.
578 */
579
580 if (MAN_BLINE & m->flags)
581 m->flags |= MAN_BPLINE;
582
583 /* Call to handler... */
584
585 assert(man_macros[tok].fp);
586 if ( ! (*man_macros[tok].fp)(m, tok, ln, ppos, &i, buf))
587 goto err;
588
589 out:
590 /*
591 * We weren't in a block-line scope when entering the
592 * above-parsed macro, so return.
593 */
594
595 if ( ! (MAN_BPLINE & m->flags)) {
596 m->flags &= ~MAN_ILINE;
597 return(1);
598 }
599 m->flags &= ~MAN_BPLINE;
600
601 /*
602 * If we're in a block scope, then allow this macro to slip by
603 * without closing scope around it.
604 */
605
606 if (MAN_ILINE & m->flags) {
607 m->flags &= ~MAN_ILINE;
608 return(1);
609 }
610
611 /*
612 * If we've opened a new next-line element scope, then return
613 * now, as the next line will close out the block scope.
614 */
615
616 if (MAN_ELINE & m->flags)
617 return(1);
618
619 /* Close out the block scope opened in the prior line. */
620
621 assert(MAN_BLINE & m->flags);
622 m->flags &= ~MAN_BLINE;
623
624 if ( ! man_unscope(m, m->last->parent, WERRMAX))
625 return(0);
626 return(man_body_alloc(m, ln, 0, m->last->tok));
627
628 err: /* Error out. */
629
630 m->flags |= MAN_HALT;
631 return(0);
632 }
633
634
635 int
636 man_verr(struct man *man, int ln, int pos, const char *fmt, ...)
637 {
638 char buf[256];
639 va_list ap;
640
641 if (NULL == man->cb.man_err)
642 return(0);
643
644 va_start(ap, fmt);
645 (void)vsnprintf(buf, sizeof(buf) - 1, fmt, ap);
646 va_end(ap);
647 return((*man->cb.man_err)(man->data, ln, pos, buf));
648 }
649
650
651 int
652 man_vwarn(struct man *man, int ln, int pos, const char *fmt, ...)
653 {
654 char buf[256];
655 va_list ap;
656
657 if (NULL == man->cb.man_warn)
658 return(0);
659
660 va_start(ap, fmt);
661 (void)vsnprintf(buf, sizeof(buf) - 1, fmt, ap);
662 va_end(ap);
663 return((*man->cb.man_warn)(man->data, ln, pos, buf));
664 }
665
666
667 int
668 man_err(struct man *m, int line, int pos, int iserr, enum merr type)
669 {
670 const char *p;
671
672 p = __man_merrnames[(int)type];
673 assert(p);
674
675 if (iserr)
676 return(man_verr(m, line, pos, p));
677
678 return(man_vwarn(m, line, pos, p));
679 }
680
681
682 /*
683 * Unlink a node from its context. If "m" is provided, the last parse
684 * point will also be adjusted accordingly.
685 */
686 static void
687 man_node_unlink(struct man *m, struct man_node *n)
688 {
689
690 /* Adjust siblings. */
691
692 if (n->prev)
693 n->prev->next = n->next;
694 if (n->next)
695 n->next->prev = n->prev;
696
697 /* Adjust parent. */
698
699 if (n->parent) {
700 n->parent->nchild--;
701 if (n->parent->child == n)
702 n->parent->child = n->prev ? n->prev : n->next;
703 }
704
705 /* Adjust parse point, if applicable. */
706
707 if (m && m->last == n) {
708 /*XXX: this can occur when bailing from validation. */
709 /*assert(NULL == n->next);*/
710 if (n->prev) {
711 m->last = n->prev;
712 m->next = MAN_NEXT_SIBLING;
713 } else {
714 m->last = n->parent;
715 m->next = MAN_NEXT_CHILD;
716 }
717 }
718
719 if (m && m->first == n)
720 m->first = NULL;
721 }