version 1.6, 2014/03/28 10:08:24 |
version 1.11, 2014/03/29 11:13:49 |
|
|
#include <stdio.h> |
#include <stdio.h> |
#include <stdlib.h> |
#include <stdlib.h> |
#include <string.h> |
#include <string.h> |
|
#include <unistd.h> |
|
|
/* |
/* |
* All recognised node types. |
* All recognised node types. |
|
|
NODE_REFPURPOSE, |
NODE_REFPURPOSE, |
NODE_REFSECT1, |
NODE_REFSECT1, |
NODE_REFSYNOPSISDIV, |
NODE_REFSYNOPSISDIV, |
|
NODE_STRUCTNAME, |
NODE_SYNOPSIS, |
NODE_SYNOPSIS, |
NODE_TEXT, |
NODE_TEXT, |
NODE_TITLE, |
NODE_TITLE, |
|
|
int stop; /* should we stop now? */ |
int stop; /* should we stop now? */ |
struct pnode *root; /* root of parse tree */ |
struct pnode *root; /* root of parse tree */ |
struct pnode *cur; /* current node in tree */ |
struct pnode *cur; /* current node in tree */ |
unsigned int flags; |
char *b; /* nil-terminated buffer for pre-print */ |
#define PARSE_HAS_META 1 |
size_t bsz; /* current length of b */ |
char *b; |
size_t mbsz; /* max bsz allocation */ |
size_t bsz; |
int newln; /* output: are we on a fresh line */ |
size_t mbsz; |
|
}; |
}; |
|
|
struct node { |
struct node { |
const char *name; |
const char *name; /* docbook element name */ |
unsigned int flags; |
unsigned int flags; |
#define NODE_IGNTEXT 1 /* ignore all contained text */ |
#define NODE_IGNTEXT 1 /* ignore all contained text */ |
}; |
}; |
Line 126 static const struct node nodes[NODE__MAX] = { |
|
Line 127 static const struct node nodes[NODE__MAX] = { |
|
{ "refpurpose", 0 }, |
{ "refpurpose", 0 }, |
{ "refsect1", 0 }, |
{ "refsect1", 0 }, |
{ "refsynopsisdiv", NODE_IGNTEXT }, |
{ "refsynopsisdiv", NODE_IGNTEXT }, |
|
{ "structname", 0 }, |
{ "synopsis", 0 }, |
{ "synopsis", 0 }, |
{ NULL, 0 }, |
{ NULL, 0 }, |
{ "title", 0 }, |
{ "title", 0 }, |
}; |
}; |
|
|
|
static void |
|
pnode_print(struct parse *p, struct pnode *pn); |
|
|
/* |
/* |
* Look up whether "parent" is a valid parent for "node". |
* Look up whether "parent" is a valid parent for "node". |
|
* This is sucked directly from the DocBook specification: look at the |
|
* "children" and "parent" sections of each node. |
*/ |
*/ |
static int |
static int |
isparent(enum nodeid node, enum nodeid parent) |
isparent(enum nodeid node, enum nodeid parent) |
Line 336 isparent(enum nodeid node, enum nodeid parent) |
|
Line 343 isparent(enum nodeid node, enum nodeid parent) |
|
return(parent == NODE_REFENTRY); |
return(parent == NODE_REFENTRY); |
case (NODE_REFSYNOPSISDIV): |
case (NODE_REFSYNOPSISDIV): |
return(parent == NODE_REFENTRY); |
return(parent == NODE_REFENTRY); |
|
case (NODE_STRUCTNAME): |
|
switch (parent) { |
|
case (NODE_CODE): |
|
case (NODE_FUNCSYNOPSISINFO): |
|
case (NODE_FUNCTION): |
|
case (NODE_OPTION): |
|
case (NODE_PARA): |
|
case (NODE_PARAMETER): |
|
case (NODE_PROGRAMLISTING): |
|
case (NODE_REFDESCRIPTOR): |
|
case (NODE_REFENTRYTITLE): |
|
case (NODE_REFNAME): |
|
case (NODE_REFPURPOSE): |
|
case (NODE_SYNOPSIS): |
|
case (NODE_TITLE): |
|
return(1); |
|
default: |
|
break; |
|
} |
|
return(0); |
case (NODE_SYNOPSIS): |
case (NODE_SYNOPSIS): |
switch (parent) { |
switch (parent) { |
case (NODE_REFSYNOPSISDIV): |
case (NODE_REFSYNOPSISDIV): |
Line 364 isparent(enum nodeid node, enum nodeid parent) |
|
Line 391 isparent(enum nodeid node, enum nodeid parent) |
|
return(0); |
return(0); |
} |
} |
|
|
|
/* |
|
* Process a stream of characters. |
|
* We store text as nodes in and of themselves. |
|
* If a text node is already open, append to it. |
|
* If it's not open, open one under the current context. |
|
*/ |
static void |
static void |
xml_char(void *arg, const XML_Char *p, int sz) |
xml_char(void *arg, const XML_Char *p, int sz) |
{ |
{ |
Line 385 xml_char(void *arg, const XML_Char *p, int sz) |
|
Line 418 xml_char(void *arg, const XML_Char *p, int sz) |
|
* If we're not processing text right now, then create a text |
* If we're not processing text right now, then create a text |
* node for doing so. |
* node for doing so. |
* However, don't do so unless we have some non-whitespace to |
* However, don't do so unless we have some non-whitespace to |
* process! |
* process: strip out all leading whitespace to be sure. |
*/ |
*/ |
if (NODE_TEXT != ps->node) { |
if (NODE_TEXT != ps->node) { |
for (i = 0; i < sz; i++) |
for (i = 0; i < sz; i++) |
Line 393 xml_char(void *arg, const XML_Char *p, int sz) |
|
Line 426 xml_char(void *arg, const XML_Char *p, int sz) |
|
break; |
break; |
if (i == sz) |
if (i == sz) |
return; |
return; |
|
p += i; |
|
sz -= i; |
dat = calloc(1, sizeof(struct pnode)); |
dat = calloc(1, sizeof(struct pnode)); |
if (NULL == dat) { |
if (NULL == dat) { |
perror(NULL); |
perror(NULL); |
Line 405 xml_char(void *arg, const XML_Char *p, int sz) |
|
Line 440 xml_char(void *arg, const XML_Char *p, int sz) |
|
TAILQ_INSERT_TAIL(&ps->cur->childq, dat, child); |
TAILQ_INSERT_TAIL(&ps->cur->childq, dat, child); |
ps->cur = dat; |
ps->cur = dat; |
assert(NULL != ps->root); |
assert(NULL != ps->root); |
|
|
} |
} |
|
|
/* Append to current buffer. */ |
/* Append to current buffer. */ |
Line 420 xml_char(void *arg, const XML_Char *p, int sz) |
|
Line 454 xml_char(void *arg, const XML_Char *p, int sz) |
|
ps->cur->bsz += (size_t)sz; |
ps->cur->bsz += (size_t)sz; |
} |
} |
|
|
|
static void |
|
pnode_trim(struct pnode *pn) |
|
{ |
|
|
|
assert(NODE_TEXT == pn->node); |
|
for ( ; pn->bsz > 0; pn->bsz--) |
|
if ( ! isspace((int)pn->b[pn->bsz - 1])) |
|
break; |
|
} |
|
|
/* |
/* |
* Begin an element. |
* Begin an element. |
* First, look for the element. |
* First, look for the element. |
* If we don't find it and we're not parsing, keep going. |
* If we don't find it and we're not parsing, keep going. |
* If we don't find it (and we're parsing), puke and exit. |
* If we don't find it and we're parsing, puke and exit. |
* If we find it but we're not parsing yet (i.e., it's not a refentry |
* If we find it but we're not parsing yet (i.e., it's not a refentry |
* and thus out of context), keep going. |
* and thus out of context), keep going. |
* If we're at the root and already have a tree, puke and exit. |
* If we find it and we're at the root and already have a tree, puke and |
|
* exit (FIXME: I don't think this is right?). |
|
* If we find it but we're parsing a text node, close out the text node, |
|
* return to its parent, and keep going. |
* Make sure that the element is in the right context. |
* Make sure that the element is in the right context. |
* Lastly, put the node onto our parse tree and continue. |
* Lastly, put the node onto our parse tree and continue. |
*/ |
*/ |
Line 444 xml_elem_start(void *arg, const XML_Char *name, const |
|
Line 491 xml_elem_start(void *arg, const XML_Char *name, const |
|
/* Close out text node, if applicable... */ |
/* Close out text node, if applicable... */ |
if (NODE_TEXT == ps->node) { |
if (NODE_TEXT == ps->node) { |
assert(NULL != ps->cur); |
assert(NULL != ps->cur); |
|
pnode_trim(ps->cur); |
ps->cur = ps->cur->parent; |
ps->cur = ps->cur->parent; |
assert(NULL != ps->cur); |
assert(NULL != ps->cur); |
ps->node = ps->cur->node; |
ps->node = ps->cur->node; |
Line 455 xml_elem_start(void *arg, const XML_Char *name, const |
|
Line 503 xml_elem_start(void *arg, const XML_Char *name, const |
|
else if (0 == strcmp(nodes[node].name, name)) |
else if (0 == strcmp(nodes[node].name, name)) |
break; |
break; |
|
|
|
/* FIXME: do more with these error messages... */ |
if (NODE__MAX == node && NODE_ROOT == ps->node) { |
if (NODE__MAX == node && NODE_ROOT == ps->node) { |
fprintf(stderr, "%s: ignoring node\n", name); |
fprintf(stderr, "%s: ignoring node\n", name); |
return; |
return; |
Line 494 xml_elem_start(void *arg, const XML_Char *name, const |
|
Line 543 xml_elem_start(void *arg, const XML_Char *name, const |
|
|
|
/* |
/* |
* Roll up the parse tree. |
* Roll up the parse tree. |
* Does nothing else special. |
* If we're at a text node, roll that one up first. |
* If we hit the root, then assign ourselves as the NODE_ROOT. |
* If we hit the root, then assign ourselves as the NODE_ROOT. |
*/ |
*/ |
static void |
static void |
Line 508 xml_elem_end(void *arg, const XML_Char *name) |
|
Line 557 xml_elem_end(void *arg, const XML_Char *name) |
|
/* Close out text node, if applicable... */ |
/* Close out text node, if applicable... */ |
if (NODE_TEXT == ps->node) { |
if (NODE_TEXT == ps->node) { |
assert(NULL != ps->cur); |
assert(NULL != ps->cur); |
|
pnode_trim(ps->cur); |
ps->cur = ps->cur->parent; |
ps->cur = ps->cur->parent; |
assert(NULL != ps->cur); |
assert(NULL != ps->cur); |
ps->node = ps->cur->node; |
ps->node = ps->cur->node; |
Line 519 xml_elem_end(void *arg, const XML_Char *name) |
|
Line 569 xml_elem_end(void *arg, const XML_Char *name) |
|
ps->node = ps->cur->node; |
ps->node = ps->cur->node; |
} |
} |
|
|
|
/* |
|
* Recursively free a node (NULL is ok). |
|
*/ |
static void |
static void |
pnode_free(struct pnode *pn) |
pnode_free(struct pnode *pn) |
{ |
{ |
Line 536 pnode_free(struct pnode *pn) |
|
Line 589 pnode_free(struct pnode *pn) |
|
free(pn); |
free(pn); |
} |
} |
|
|
|
/* |
|
* Unlink a node from its parent and pnode_free() it. |
|
*/ |
static void |
static void |
pnode_unlink(struct pnode *pn) |
pnode_unlink(struct pnode *pn) |
{ |
{ |
Line 545 pnode_unlink(struct pnode *pn) |
|
Line 601 pnode_unlink(struct pnode *pn) |
|
pnode_free(pn); |
pnode_free(pn); |
} |
} |
|
|
|
/* |
|
* Unlink all children of a node and pnode_free() them. |
|
*/ |
static void |
static void |
pnode_unlinksub(struct pnode *pn) |
pnode_unlinksub(struct pnode *pn) |
{ |
{ |
Line 553 pnode_unlinksub(struct pnode *pn) |
|
Line 612 pnode_unlinksub(struct pnode *pn) |
|
pnode_unlink(TAILQ_FIRST(&pn->childq)); |
pnode_unlink(TAILQ_FIRST(&pn->childq)); |
} |
} |
|
|
|
/* |
|
* Reset the lookaside buffer. |
|
*/ |
static void |
static void |
bufclear(struct parse *p) |
bufclear(struct parse *p) |
{ |
{ |
Line 560 bufclear(struct parse *p) |
|
Line 622 bufclear(struct parse *p) |
|
p->b[p->bsz = 0] = '\0'; |
p->b[p->bsz = 0] = '\0'; |
} |
} |
|
|
|
/* |
|
* Append NODE_TEXT contents to the current buffer, reallocating its |
|
* size if necessary. |
|
* The buffer is ALWAYS nil-terminated. |
|
*/ |
static void |
static void |
bufappend(struct parse *p, struct pnode *pn) |
bufappend(struct parse *p, struct pnode *pn) |
{ |
{ |
Line 577 bufappend(struct parse *p, struct pnode *pn) |
|
Line 644 bufappend(struct parse *p, struct pnode *pn) |
|
p->b[p->bsz] = '\0'; |
p->b[p->bsz] = '\0'; |
} |
} |
|
|
|
/* |
|
* Recursively append all NODE_TEXT nodes to the buffer. |
|
* This descends into non-text nodes, but doesn't do anything beyond |
|
* them. |
|
* In other words, this is a recursive text grok. |
|
*/ |
static void |
static void |
bufappend_r(struct parse *p, struct pnode *pn) |
bufappend_r(struct parse *p, struct pnode *pn) |
{ |
{ |
Line 589 bufappend_r(struct parse *p, struct pnode *pn) |
|
Line 662 bufappend_r(struct parse *p, struct pnode *pn) |
|
} |
} |
|
|
/* |
/* |
* Print text presumably on a macro line. |
* Recursively print text presumably on a macro line. |
* Ignore any child macros. |
|
* Convert all whitespace to regular spaces. |
* Convert all whitespace to regular spaces. |
*/ |
*/ |
static void |
static void |
Line 640 pnode_printmacroline(struct parse *p, struct pnode *pn |
|
Line 712 pnode_printmacroline(struct parse *p, struct pnode *pn |
|
} |
} |
|
|
static void |
static void |
|
pnode_printmopen(struct parse *p) |
|
{ |
|
if (p->newln) { |
|
putchar('.'); |
|
p->newln = 0; |
|
} else |
|
putchar(' '); |
|
} |
|
|
|
static void |
|
pnode_printmclose(struct parse *p, int sv) |
|
{ |
|
|
|
if (sv && ! p->newln) { |
|
putchar('\n'); |
|
p->newln = 1; |
|
} |
|
} |
|
|
|
/* |
|
* If the SYNOPSIS macro has a superfluous title, kill it. |
|
*/ |
|
static void |
pnode_printrefsynopsisdiv(struct parse *p, struct pnode *pn) |
pnode_printrefsynopsisdiv(struct parse *p, struct pnode *pn) |
{ |
{ |
struct pnode *pp; |
struct pnode *pp; |
|
|
TAILQ_FOREACH(pp, &pn->childq, child) |
TAILQ_FOREACH(pp, &pn->childq, child) |
if (NODE_TITLE == pp->node) { |
if (NODE_TITLE == pp->node) { |
pnode_unlink(pp); |
pnode_unlink(pp); |
break; |
return; |
} |
} |
|
|
puts(".Sh SYNOPSIS"); |
|
} |
} |
|
|
|
/* |
|
* Start a hopefully-named `Sh' section. |
|
*/ |
static void |
static void |
pnode_printrefsect(struct parse *p, struct pnode *pn) |
pnode_printrefsect(struct parse *p, struct pnode *pn) |
{ |
{ |
Line 671 pnode_printrefsect(struct parse *p, struct pnode *pn) |
|
Line 767 pnode_printrefsect(struct parse *p, struct pnode *pn) |
|
puts("UNKNOWN"); |
puts("UNKNOWN"); |
} |
} |
|
|
|
/* |
|
* Start a reference, extracting the title and volume. |
|
*/ |
static void |
static void |
pnode_printciterefentry(struct parse *p, struct pnode *pn) |
pnode_printciterefentry(struct parse *p, struct pnode *pn) |
{ |
{ |
Line 713 pnode_printrefmeta(struct parse *p, struct pnode *pn) |
|
Line 812 pnode_printrefmeta(struct parse *p, struct pnode *pn) |
|
fputs(".Dt ", stdout); |
fputs(".Dt ", stdout); |
|
|
if (NULL != title) { |
if (NULL != title) { |
|
/* FIXME: uppercase. */ |
pnode_printmacrolinepart(p, title); |
pnode_printmacrolinepart(p, title); |
putchar(' '); |
putchar(' '); |
} else |
} else |
Line 770 pnode_printparamdef(struct parse *p, struct pnode *pn) |
|
Line 870 pnode_printparamdef(struct parse *p, struct pnode *pn) |
|
|
|
if (NULL != param) |
if (NULL != param) |
pnode_printmacrolinepart(p, param); |
pnode_printmacrolinepart(p, param); |
else |
|
fputs("UNKNOWN", stdout); |
|
|
|
puts("\""); |
puts("\""); |
} |
} |
Line 797 pnode_printfuncprototype(struct parse *p, struct pnode |
|
Line 895 pnode_printfuncprototype(struct parse *p, struct pnode |
|
puts(".Fc"); |
puts(".Fc"); |
} |
} |
|
|
/* TODO: handle "optional" values. */ |
/* |
|
* The <arg> element is more complicated than it should be because text |
|
* nodes are treated like ".Ar foo", but non-text nodes need to be |
|
* re-sent into the printer (i.e., without the preceding ".Ar"). |
|
* TODO: handle "optional" attribute. |
|
*/ |
static void |
static void |
pnode_printarg(struct parse *p, struct pnode *pn, int nested) |
pnode_printarg(struct parse *p, struct pnode *pn) |
{ |
{ |
struct pnode *pp; |
struct pnode *pp; |
int sv = nested; |
|
|
|
if ( ! nested) |
TAILQ_FOREACH(pp, &pn->childq, child) { |
fputs(".", stdout); |
if (NODE_TEXT == pp->node) { |
nested = 1; |
pnode_printmopen(p); |
TAILQ_FOREACH(pp, &pn->childq, child) |
|
if (NODE_OPTION == pp->node) { |
|
fputs("Fl ", stdout); |
|
pnode_printmacrolinepart(p, pp); |
|
} else if (NODE_TEXT == pp->node) { |
|
fputs("Ar ", stdout); |
fputs("Ar ", stdout); |
pnode_printmacrolinepart(p, pp); |
} |
} else if (NODE_ARG == pp->node) |
pnode_print(p, pp); |
pnode_printarg(p, pp, nested); |
} |
|
} |
|
|
if ( ! sv) |
/* |
puts(""); |
* Recursively search and return the first instance of "node". |
|
*/ |
|
static struct pnode * |
|
pnode_findfirst(struct pnode *pn, enum nodeid node) |
|
{ |
|
struct pnode *pp, *res; |
|
|
|
res = NULL; |
|
TAILQ_FOREACH(pp, &pn->childq, child) { |
|
res = pp->node == node ? pp : |
|
pnode_findfirst(pp, node); |
|
if (NULL != res) |
|
break; |
|
} |
|
|
|
return(res); |
} |
} |
|
|
|
static void |
|
pnode_printprologue(struct parse *p, struct pnode *pn) |
|
{ |
|
struct pnode *pp; |
|
|
|
pp = NULL == p->root ? NULL : |
|
pnode_findfirst(p->root, NODE_REFMETA); |
|
|
|
if (NULL != pp) { |
|
pnode_printrefmeta(p, pp); |
|
pnode_unlink(pp); |
|
} else { |
|
puts(".\\\" Supplying bogus prologue..."); |
|
puts(".Dd $Mdocdate" "$"); |
|
puts(".Dt UNKNOWN 1"); |
|
puts(".Os"); |
|
} |
|
} |
|
|
/* |
/* |
* Print a parsed node (or ignore it--whatever). |
* Print a parsed node (or ignore it--whatever). |
* This is a recursive function. |
* This is a recursive function. |
Line 831 pnode_print(struct parse *p, struct pnode *pn) |
|
Line 963 pnode_print(struct parse *p, struct pnode *pn) |
|
{ |
{ |
struct pnode *pp; |
struct pnode *pp; |
char *cp; |
char *cp; |
int last; |
int last, sv; |
|
|
if (NULL == pn) |
if (NULL == pn) |
return; |
return; |
|
|
if (NODE_TEXT != pn->node && NODE_ROOT != pn->node) |
sv = p->newln; |
printf(".\\\" %s\n", nodes[pn->node].name); |
|
|
|
switch (pn->node) { |
switch (pn->node) { |
case (NODE_ARG): |
case (NODE_ARG): |
pnode_printarg(p, pn, 0); |
pnode_printarg(p, pn); |
pnode_unlinksub(pn); |
pnode_unlinksub(pn); |
break; |
break; |
case (NODE_CITEREFENTRY): |
case (NODE_CITEREFENTRY): |
|
assert(p->newln); |
pnode_printciterefentry(p, pn); |
pnode_printciterefentry(p, pn); |
pnode_unlinksub(pn); |
pnode_unlinksub(pn); |
break; |
break; |
case (NODE_CODE): |
case (NODE_CODE): |
fputs(".Li ", stdout); |
pnode_printmopen(p); |
pnode_printmacroline(p, pn); |
fputs("Li ", stdout); |
pnode_unlinksub(pn); |
|
break; |
break; |
case (NODE_COMMAND): |
case (NODE_COMMAND): |
fputs(".Nm ", stdout); |
pnode_printmopen(p); |
pnode_printmacroline(p, pn); |
fputs("Nm ", stdout); |
pnode_unlinksub(pn); |
|
break; |
break; |
case (NODE_FUNCTION): |
case (NODE_FUNCTION): |
fputs(".Fn ", stdout); |
pnode_printmopen(p); |
pnode_printmacroline(p, pn); |
fputs("Fn ", stdout); |
pnode_unlinksub(pn); |
|
break; |
break; |
case (NODE_FUNCPROTOTYPE): |
case (NODE_FUNCPROTOTYPE): |
|
assert(p->newln); |
pnode_printfuncprototype(p, pn); |
pnode_printfuncprototype(p, pn); |
pnode_unlinksub(pn); |
pnode_unlinksub(pn); |
break; |
break; |
case (NODE_FUNCSYNOPSISINFO): |
case (NODE_FUNCSYNOPSISINFO): |
fputs(".Fd ", stdout); |
pnode_printmopen(p); |
pnode_printmacroline(p, pn); |
fputs("Fd ", stdout); |
pnode_unlinksub(pn); |
|
break; |
break; |
|
case (NODE_OPTION): |
|
pnode_printmopen(p); |
|
fputs("Fl ", stdout); |
|
break; |
case (NODE_PARA): |
case (NODE_PARA): |
/* FIXME: not always. */ |
assert(p->newln); |
puts(".Pp"); |
puts(".Pp"); |
break; |
break; |
case (NODE_PARAMETER): |
case (NODE_PARAMETER): |
fputs(".Fa \"", stdout); |
/* Suppress non-text children... */ |
|
pnode_printmopen(p); |
|
fputs("Fa \"", stdout); |
pnode_printmacrolinepart(p, pn); |
pnode_printmacrolinepart(p, pn); |
puts("\""); |
puts("\""); |
pnode_unlinksub(pn); |
pnode_unlinksub(pn); |
break; |
break; |
case (NODE_PROGRAMLISTING): |
case (NODE_PROGRAMLISTING): |
|
assert(p->newln); |
puts(".Bd -literal"); |
puts(".Bd -literal"); |
break; |
break; |
case (NODE_REFMETA): |
case (NODE_REFMETA): |
pnode_printrefmeta(p, pn); |
abort(); |
pnode_unlinksub(pn); |
|
p->flags |= PARSE_HAS_META; |
|
break; |
break; |
case (NODE_REFNAME): |
case (NODE_REFNAME): |
fputs(".Nm ", stdout); |
/* Suppress non-text children... */ |
pnode_printmacroline(p, pn); |
pnode_printmopen(p); |
|
fputs("Nm ", stdout); |
|
pnode_printmacrolinepart(p, pn); |
pnode_unlinksub(pn); |
pnode_unlinksub(pn); |
return; |
break; |
case (NODE_REFNAMEDIV): |
case (NODE_REFNAMEDIV): |
if ( ! (PARSE_HAS_META & p->flags)) { |
assert(p->newln); |
puts(".Dd $Mdocdate" "$"); |
|
puts(".Dt UNKNOWN 1"); |
|
puts(".Os"); |
|
} |
|
puts(".Sh NAME"); |
puts(".Sh NAME"); |
break; |
break; |
case (NODE_REFPURPOSE): |
case (NODE_REFPURPOSE): |
|
assert(p->newln); |
fputs(".Nd ", stdout); |
fputs(".Nd ", stdout); |
pnode_printmacroline(p, pn); |
break; |
pnode_unlinksub(pn); |
|
return; |
|
case (NODE_REFSYNOPSISDIV): |
case (NODE_REFSYNOPSISDIV): |
|
assert(p->newln); |
pnode_printrefsynopsisdiv(p, pn); |
pnode_printrefsynopsisdiv(p, pn); |
|
puts(".Sh SYNOPSIS"); |
break; |
break; |
case (NODE_REFSECT1): |
case (NODE_REFSECT1): |
|
assert(p->newln); |
pnode_printrefsect(p, pn); |
pnode_printrefsect(p, pn); |
break; |
break; |
|
case (NODE_STRUCTNAME): |
|
pnode_printmopen(p); |
|
fputs("Vt ", stdout); |
|
break; |
case (NODE_TEXT): |
case (NODE_TEXT): |
bufclear(p); |
bufclear(p); |
bufappend(p, pn); |
bufappend(p, pn); |
Line 923 pnode_print(struct parse *p, struct pnode *pn) |
|
Line 1061 pnode_print(struct parse *p, struct pnode *pn) |
|
* XXX: all whitespace, including tabs (?). |
* XXX: all whitespace, including tabs (?). |
* Remember to escape control characters and escapes. |
* Remember to escape control characters and escapes. |
*/ |
*/ |
|
assert(p->bsz); |
for (last = '\n', cp = p->b; '\0' != *cp; ) { |
for (last = '\n', cp = p->b; '\0' != *cp; ) { |
if ('\n' == last) { |
if ('\n' == last) { |
/* Consume all whitespace. */ |
/* Consume all whitespace. */ |
Line 938 pnode_print(struct parse *p, struct pnode *pn) |
|
Line 1077 pnode_print(struct parse *p, struct pnode *pn) |
|
if ('\\' == last) |
if ('\\' == last) |
putchar('e'); |
putchar('e'); |
} |
} |
if ('\n' != last) |
p->newln = 0; |
putchar('\n'); |
|
break; |
break; |
default: |
default: |
break; |
break; |
Line 949 pnode_print(struct parse *p, struct pnode *pn) |
|
Line 1087 pnode_print(struct parse *p, struct pnode *pn) |
|
pnode_print(p, pp); |
pnode_print(p, pp); |
|
|
switch (pn->node) { |
switch (pn->node) { |
|
case (NODE_ARG): |
|
case (NODE_CODE): |
|
case (NODE_COMMAND): |
|
case (NODE_FUNCTION): |
|
case (NODE_FUNCSYNOPSISINFO): |
|
case (NODE_OPTION): |
|
case (NODE_PARAMETER): |
|
case (NODE_REFNAME): |
|
case (NODE_STRUCTNAME): |
|
case (NODE_TEXT): |
|
pnode_printmclose(p, sv); |
|
break; |
case (NODE_PROGRAMLISTING): |
case (NODE_PROGRAMLISTING): |
|
assert(p->newln); |
puts(".Ed"); |
puts(".Ed"); |
|
p->newln = 1; |
break; |
break; |
default: |
default: |
break; |
break; |
Line 988 readfile(XML_Parser xp, int fd, |
|
Line 1140 readfile(XML_Parser xp, int fd, |
|
* Exit when we've read all or errors have occured |
* Exit when we've read all or errors have occured |
* during the parse sequence. |
* during the parse sequence. |
*/ |
*/ |
|
p.newln = 1; |
|
pnode_printprologue(&p, p.root); |
pnode_print(&p, p.root); |
pnode_print(&p, p.root); |
pnode_free(p.root); |
pnode_free(p.root); |
free(p.b); |
free(p.b); |