]>
git.cameronkatri.com Git - mandoc.git/blob - man.c
1 /* $Id: man.c,v 1.88 2010/11/30 15:36:28 kristaps Exp $ */
3 * Copyright (c) 2008, 2009, 2010 Kristaps Dzonsons <kristaps@bsd.lv>
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.
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.
21 #include <sys/types.h>
31 #include "libmandoc.h"
33 const char *const __man_macronames
[MAN_MAX
] = {
34 "br", "TH", "SH", "SS",
35 "TP", "LP", "PP", "P",
36 "IP", "HP", "SM", "SB",
37 "BI", "IB", "BR", "RB",
39 "RI", "na", "i", "sp",
40 "nf", "fi", "r", "RE",
41 "RS", "DT", "UC", "PD",
42 "Sp", "Vb", "Ve", "AT",
46 const char * const *man_macronames
= __man_macronames
;
48 static struct man_node
*man_node_alloc(int, int,
49 enum man_type
, enum mant
);
50 static int man_node_append(struct man
*,
52 static void man_node_free(struct man_node
*);
53 static void man_node_unlink(struct man
*,
55 static int man_ptext(struct man
*, int, char *, int);
56 static int man_pmacro(struct man
*, int, char *, int);
57 static void man_free1(struct man
*);
58 static void man_alloc1(struct man
*);
61 const struct man_node
*
62 man_node(const struct man
*m
)
65 return(MAN_HALT
& m
->flags
? NULL
: m
->first
);
69 const struct man_meta
*
70 man_meta(const struct man
*m
)
73 return(MAN_HALT
& m
->flags
? NULL
: &m
->meta
);
78 man_reset(struct man
*man
)
87 man_free(struct man
*man
)
96 man_alloc(struct regset
*regs
, void *data
, mandocmsg msg
)
100 p
= mandoc_calloc(1, sizeof(struct man
));
113 man_endparse(struct man
*m
)
116 if (MAN_HALT
& m
->flags
)
118 else if (man_macroend(m
))
120 m
->flags
|= MAN_HALT
;
126 man_parseln(struct man
*m
, int ln
, char *buf
, int offs
)
129 if (MAN_HALT
& m
->flags
)
132 return(('.' == buf
[offs
] || '\'' == buf
[offs
]) ?
133 man_pmacro(m
, ln
, buf
, offs
) :
134 man_ptext(m
, ln
, buf
, offs
));
139 man_free1(struct man
*man
)
143 man_node_delete(man
, man
->first
);
145 free(man
->meta
.title
);
146 if (man
->meta
.source
)
147 free(man
->meta
.source
);
148 if (man
->meta
.rawdate
)
149 free(man
->meta
.rawdate
);
153 free(man
->meta
.msec
);
158 man_alloc1(struct man
*m
)
161 memset(&m
->meta
, 0, sizeof(struct man_meta
));
163 m
->last
= mandoc_calloc(1, sizeof(struct man_node
));
165 m
->last
->type
= MAN_ROOT
;
166 m
->last
->tok
= MAN_MAX
;
167 m
->next
= MAN_NEXT_CHILD
;
172 man_node_append(struct man
*man
, struct man_node
*p
)
177 assert(MAN_ROOT
!= p
->type
);
180 case (MAN_NEXT_SIBLING
):
183 p
->parent
= man
->last
->parent
;
185 case (MAN_NEXT_CHILD
):
186 man
->last
->child
= p
;
187 p
->parent
= man
->last
;
197 if ( ! man_valid_pre(man
, p
))
202 assert(MAN_BLOCK
== p
->parent
->type
);
206 assert(MAN_BLOCK
== p
->parent
->type
);
217 if ( ! man_valid_post(man
))
228 static struct man_node
*
229 man_node_alloc(int line
, int pos
, enum man_type type
, enum mant tok
)
233 p
= mandoc_calloc(1, sizeof(struct man_node
));
243 man_elem_alloc(struct man
*m
, int line
, int pos
, enum mant tok
)
247 p
= man_node_alloc(line
, pos
, MAN_ELEM
, tok
);
248 if ( ! man_node_append(m
, p
))
250 m
->next
= MAN_NEXT_CHILD
;
256 man_head_alloc(struct man
*m
, int line
, int pos
, enum mant tok
)
260 p
= man_node_alloc(line
, pos
, MAN_HEAD
, tok
);
261 if ( ! man_node_append(m
, p
))
263 m
->next
= MAN_NEXT_CHILD
;
269 man_body_alloc(struct man
*m
, int line
, int pos
, enum mant tok
)
273 p
= man_node_alloc(line
, pos
, MAN_BODY
, tok
);
274 if ( ! man_node_append(m
, p
))
276 m
->next
= MAN_NEXT_CHILD
;
282 man_block_alloc(struct man
*m
, int line
, int pos
, enum mant tok
)
286 p
= man_node_alloc(line
, pos
, MAN_BLOCK
, tok
);
287 if ( ! man_node_append(m
, p
))
289 m
->next
= MAN_NEXT_CHILD
;
295 man_word_alloc(struct man
*m
, int line
, int pos
, const char *word
)
302 n
= man_node_alloc(line
, pos
, MAN_TEXT
, MAN_MAX
);
303 n
->string
= mandoc_malloc(len
+ 1);
304 sv
= strlcpy(n
->string
, word
, len
+ 1);
306 /* Prohibit truncation. */
307 assert(sv
< len
+ 1);
309 if ( ! man_node_append(m
, n
))
312 m
->next
= MAN_NEXT_SIBLING
;
318 * Free all of the resources held by a node. This does NOT unlink a
319 * node from its context; for that, see man_node_unlink().
322 man_node_free(struct man_node
*p
)
332 man_node_delete(struct man
*m
, struct man_node
*p
)
336 man_node_delete(m
, p
->child
);
338 man_node_unlink(m
, p
);
344 man_ptext(struct man
*m
, int line
, char *buf
, int offs
)
348 /* Ignore bogus comments. */
350 if ('\\' == buf
[offs
] &&
351 '.' == buf
[offs
+ 1] &&
352 '"' == buf
[offs
+ 2])
353 return(man_pmsg(m
, line
, offs
, MANDOCERR_BADCOMMENT
));
355 /* Literal free-form text whitespace is preserved. */
357 if (MAN_LITERAL
& m
->flags
) {
358 if ( ! man_word_alloc(m
, line
, offs
, buf
+ offs
))
363 /* Pump blank lines directly into the backend. */
365 for (i
= offs
; ' ' == buf
[i
]; i
++)
366 /* Skip leading whitespace. */ ;
368 if ('\0' == buf
[i
]) {
369 /* Allocate a blank entry. */
370 if ( ! man_word_alloc(m
, line
, offs
, ""))
376 * Warn if the last un-escaped character is whitespace. Then
377 * strip away the remaining spaces (tabs stay!).
380 i
= (int)strlen(buf
);
383 if (' ' == buf
[i
- 1] || '\t' == buf
[i
- 1]) {
384 if (i
> 1 && '\\' != buf
[i
- 2])
385 if ( ! man_pmsg(m
, line
, i
- 1, MANDOCERR_EOLNSPACE
))
388 for (--i
; i
&& ' ' == buf
[i
]; i
--)
389 /* Spin back to non-space. */ ;
391 /* Jump ahead of escaped whitespace. */
392 i
+= '\\' == buf
[i
] ? 2 : 1;
397 if ( ! man_word_alloc(m
, line
, offs
, buf
+ offs
))
401 * End-of-sentence check. If the last character is an unescaped
402 * EOS character, then flag the node as being the end of a
403 * sentence. The front-end will know how to interpret this.
407 if (mandoc_eos(buf
, (size_t)i
, 0))
408 m
->last
->flags
|= MAN_EOS
;
412 * Co-ordinate what happens with having a next-line scope open:
413 * first close out the element scope (if applicable), then close
414 * out the block scope (also if applicable).
417 if (MAN_ELINE
& m
->flags
) {
418 m
->flags
&= ~MAN_ELINE
;
419 if ( ! man_unscope(m
, m
->last
->parent
, MANDOCERR_MAX
))
423 if ( ! (MAN_BLINE
& m
->flags
))
425 m
->flags
&= ~MAN_BLINE
;
427 if ( ! man_unscope(m
, m
->last
->parent
, MANDOCERR_MAX
))
429 return(man_body_alloc(m
, line
, offs
, m
->last
->tok
));
434 man_pmacro(struct man
*m
, int ln
, char *buf
, int offs
)
441 /* Comments and empties are quickly ignored. */
445 if ('\0' == buf
[offs
])
451 * Skip whitespace between the control character and initial
452 * text. "Whitespace" is both spaces and tabs.
455 if (' ' == buf
[i
] || '\t' == buf
[i
]) {
457 while (buf
[i
] && (' ' == buf
[i
] || '\t' == buf
[i
]))
466 * Copy the first word into a nil-terminated buffer.
467 * Stop copying when a tab, space, or eoln is encountered.
471 while (j
< 4 && '\0' != buf
[i
] && ' ' != buf
[i
] && '\t' != buf
[i
])
475 tok
= (j
> 0 && j
< 4) ? man_hash_find(mac
) : MAN_MAX
;
476 if (MAN_MAX
== tok
) {
477 man_vmsg(m
, MANDOCERR_MACRO
, ln
, ppos
,
478 "unknown macro: %s%s",
479 buf
, strlen(buf
) > 3 ? "..." : "");
483 /* The macro is sane. Jump to the next word. */
485 while (buf
[i
] && ' ' == buf
[i
])
489 * Trailing whitespace. Note that tabs are allowed to be passed
490 * into the parser as "text", so we only warn about spaces here.
493 if ('\0' == buf
[i
] && ' ' == buf
[i
- 1])
494 if ( ! man_pmsg(m
, ln
, i
- 1, MANDOCERR_EOLNSPACE
))
498 * Remove prior ELINE macro, as it's being clobbering by a new
499 * macro. Note that NSCOPED macros do not close out ELINE
500 * macros---they don't print text---so we let those slip by.
503 if ( ! (MAN_NSCOPED
& man_macros
[tok
].flags
) &&
504 m
->flags
& MAN_ELINE
) {
505 assert(MAN_TEXT
!= m
->last
->type
);
508 * This occurs in the following construction:
514 * Flat-out disallow this madness.
516 if (MAN_NSCOPED
& man_macros
[m
->last
->tok
].flags
) {
517 man_pmsg(m
, ln
, ppos
, MANDOCERR_SYNTLINESCOPE
);
524 assert(NULL
== n
->child
);
525 assert(0 == n
->nchild
);
527 if ( ! man_nmsg(m
, n
, MANDOCERR_LINESCOPE
))
530 man_node_delete(m
, n
);
531 m
->flags
&= ~MAN_ELINE
;
535 * Save the fact that we're in the next-line for a block. In
536 * this way, embedded roff instructions can "remember" state
540 if (MAN_BLINE
& m
->flags
)
541 m
->flags
|= MAN_BPLINE
;
543 /* Call to handler... */
545 assert(man_macros
[tok
].fp
);
546 if ( ! (*man_macros
[tok
].fp
)(m
, tok
, ln
, ppos
, &i
, buf
))
551 * We weren't in a block-line scope when entering the
552 * above-parsed macro, so return.
555 if ( ! (MAN_BPLINE
& m
->flags
)) {
556 m
->flags
&= ~MAN_ILINE
;
559 m
->flags
&= ~MAN_BPLINE
;
562 * If we're in a block scope, then allow this macro to slip by
563 * without closing scope around it.
566 if (MAN_ILINE
& m
->flags
) {
567 m
->flags
&= ~MAN_ILINE
;
572 * If we've opened a new next-line element scope, then return
573 * now, as the next line will close out the block scope.
576 if (MAN_ELINE
& m
->flags
)
579 /* Close out the block scope opened in the prior line. */
581 assert(MAN_BLINE
& m
->flags
);
582 m
->flags
&= ~MAN_BLINE
;
584 if ( ! man_unscope(m
, m
->last
->parent
, MANDOCERR_MAX
))
586 return(man_body_alloc(m
, ln
, offs
, m
->last
->tok
));
588 err
: /* Error out. */
590 m
->flags
|= MAN_HALT
;
596 man_vmsg(struct man
*man
, enum mandocerr t
,
597 int ln
, int pos
, const char *fmt
, ...)
603 vsnprintf(buf
, sizeof(buf
) - 1, fmt
, ap
);
605 return((*man
->msg
)(t
, man
->data
, ln
, pos
, buf
));
610 * Unlink a node from its context. If "m" is provided, the last parse
611 * point will also be adjusted accordingly.
614 man_node_unlink(struct man
*m
, struct man_node
*n
)
617 /* Adjust siblings. */
620 n
->prev
->next
= n
->next
;
622 n
->next
->prev
= n
->prev
;
628 if (n
->parent
->child
== n
)
629 n
->parent
->child
= n
->prev
? n
->prev
: n
->next
;
632 /* Adjust parse point, if applicable. */
634 if (m
&& m
->last
== n
) {
635 /*XXX: this can occur when bailing from validation. */
636 /*assert(NULL == n->next);*/
639 m
->next
= MAN_NEXT_SIBLING
;
642 m
->next
= MAN_NEXT_CHILD
;
646 if (m
&& m
->first
== n
)