version 1.22, 2014/03/30 17:22:01 |
version 1.26, 2014/04/02 07:52:14 |
Line 95 static const struct node nodes[NODE__MAX] = { |
|
Line 95 static const struct node nodes[NODE__MAX] = { |
|
{ "command", 0 }, |
{ "command", 0 }, |
{ "date", 0 }, |
{ "date", 0 }, |
{ "emphasis", 0 }, |
{ "emphasis", 0 }, |
|
{ "entry", 0 }, |
{ "envar", 0 }, |
{ "envar", 0 }, |
{ "filename", 0 }, |
{ "filename", 0 }, |
{ "funcdef", 0 }, |
{ "funcdef", 0 }, |
Line 103 static const struct node nodes[NODE__MAX] = { |
|
Line 104 static const struct node nodes[NODE__MAX] = { |
|
{ "funcsynopsisinfo", 0 }, |
{ "funcsynopsisinfo", 0 }, |
{ "function", 0 }, |
{ "function", 0 }, |
{ "itemizedlist", NODE_IGNTEXT }, |
{ "itemizedlist", NODE_IGNTEXT }, |
|
{ "group", NODE_IGNTEXT }, |
{ "link", 0 }, |
{ "link", 0 }, |
{ "listitem", NODE_IGNTEXT }, |
{ "listitem", NODE_IGNTEXT }, |
{ "literal", 0 }, |
{ "literal", 0 }, |
Line 128 static const struct node nodes[NODE__MAX] = { |
|
Line 130 static const struct node nodes[NODE__MAX] = { |
|
{ "refsect2", NODE_IGNTEXT }, |
{ "refsect2", NODE_IGNTEXT }, |
{ "refsynopsisdiv", NODE_IGNTEXT }, |
{ "refsynopsisdiv", NODE_IGNTEXT }, |
{ "replaceable", 0 }, |
{ "replaceable", 0 }, |
|
{ "row", NODE_IGNTEXT }, |
{ "sbr", NODE_IGNTEXT }, |
{ "sbr", NODE_IGNTEXT }, |
{ "screen", NODE_IGNTEXT }, |
{ "screen", NODE_IGNTEXT }, |
{ "structname", 0 }, |
{ "structname", 0 }, |
{ "synopsis", 0 }, |
{ "synopsis", 0 }, |
|
{ "table", NODE_IGNTEXT }, |
|
{ "tbody", NODE_IGNTEXT }, |
{ "term", 0 }, |
{ "term", 0 }, |
{ NULL, 0 }, |
{ NULL, 0 }, |
|
{ "tfoot", NODE_IGNTEXT }, |
|
{ "tgroup", NODE_IGNTEXT }, |
|
{ "thead", NODE_IGNTEXT }, |
{ "title", 0 }, |
{ "title", 0 }, |
{ "ulink", 0 }, |
{ "ulink", 0 }, |
|
{ "userinput", 0 }, |
{ "variablelist", NODE_IGNTEXT }, |
{ "variablelist", NODE_IGNTEXT }, |
{ "varlistentry", NODE_IGNTEXT }, |
{ "varlistentry", NODE_IGNTEXT }, |
|
{ "varname", 0 }, |
}; |
}; |
|
|
static void |
static void |
Line 476 bufappend_r(struct parse *p, struct pnode *pn) |
|
Line 486 bufappend_r(struct parse *p, struct pnode *pn) |
|
bufappend_r(p, pp); |
bufappend_r(p, pp); |
} |
} |
|
|
|
/* |
|
* 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); |
|
} |
|
|
#define MACROLINE_NORM 0 |
#define MACROLINE_NORM 0 |
#define MACROLINE_UPPER 1 |
#define MACROLINE_UPPER 1 |
/* |
/* |
Line 791 pnode_printarg(struct parse *p, struct pnode *pn) |
|
Line 820 pnode_printarg(struct parse *p, struct pnode *pn) |
|
} |
} |
} |
} |
|
|
/* |
static void |
* Recursively search and return the first instance of "node". |
pnode_printgroup(struct parse *p, struct pnode *pn) |
*/ |
|
static struct pnode * |
|
pnode_findfirst(struct pnode *pn, enum nodeid node) |
|
{ |
{ |
struct pnode *pp, *res; |
struct pnode *pp, *np; |
|
struct pattr *ap; |
|
int isop, sv; |
|
|
res = NULL; |
isop = 1; |
TAILQ_FOREACH(pp, &pn->childq, child) { |
TAILQ_FOREACH(ap, &pn->attrq, child) |
res = pp->node == node ? pp : |
if (ATTRKEY_CHOICE == ap->key && |
pnode_findfirst(pp, node); |
(ATTRVAL_PLAIN == ap->val || |
if (NULL != res) |
ATTRVAL_REQ == ap->val)) { |
|
isop = 0; |
break; |
break; |
|
} |
|
|
|
/* |
|
* Make sure we're on a macro line. |
|
* This will prevent pnode_print() for putting us on a |
|
* subsequent line. |
|
*/ |
|
sv = p->newln; |
|
pnode_printmopen(p); |
|
if (isop) |
|
fputs("Op", stdout); |
|
else if (sv) |
|
fputs("No", stdout); |
|
|
|
/* |
|
* Keep on printing text separated by the vertical bar as long |
|
* as we're within the same origin node as the group. |
|
* This is kind of a nightmare. |
|
* Eh, DocBook... |
|
* FIXME: if there's a "Fl", we don't cut off the leading "-" |
|
* like we do in pnode_print(). |
|
*/ |
|
TAILQ_FOREACH(pp, &pn->childq, child) { |
|
pnode_print(p, pp); |
|
np = TAILQ_NEXT(pp, child); |
|
while (NULL != np) { |
|
if (pp->node != np->node) |
|
break; |
|
fputs(" |", stdout); |
|
pnode_printmacrolinepart(p, np); |
|
pp = np; |
|
np = TAILQ_NEXT(np, child); |
|
} |
} |
} |
|
|
return(res); |
pnode_printmclose(p, sv); |
} |
} |
|
|
static void |
static void |
Line 850 pnode_printvarlistentry(struct parse *p, struct pnode |
|
Line 912 pnode_printvarlistentry(struct parse *p, struct pnode |
|
} |
} |
|
|
static void |
static void |
pnode_printitemizedlist(struct parse *p, struct pnode *pn) |
pnode_printrow(struct parse *p, struct pnode *pn) |
{ |
{ |
struct pnode *pp; |
struct pnode *pp; |
|
|
|
puts(".Bl -dash -compact"); |
|
|
|
TAILQ_FOREACH(pp, &pn->childq, child) { |
|
assert(p->newln); |
|
puts(".It"); |
|
pnode_print(p, pp); |
|
pnode_printmclose(p, 1); |
|
} |
assert(p->newln); |
assert(p->newln); |
|
puts(".El"); |
|
} |
|
|
|
static void |
|
pnode_printtable(struct parse *p, struct pnode *pn) |
|
{ |
|
struct pnode *pp; |
|
|
|
assert(p->newln); |
TAILQ_FOREACH(pp, &pn->childq, child) |
TAILQ_FOREACH(pp, &pn->childq, child) |
if (NODE_TITLE == pp->node) { |
if (NODE_TITLE == pp->node) { |
puts(".Pp"); |
puts(".Pp"); |
pnode_print(p, pp); |
pnode_print(p, pp); |
pnode_unlink(pp); |
pnode_unlink(pp); |
} |
} |
|
assert(p->newln); |
|
puts(".Bl -ohang"); |
|
while (NULL != (pp = pnode_findfirst(pn, NODE_ROW))) { |
|
puts(".It Table Row"); |
|
pnode_printrow(p, pp); |
|
pnode_printmclose(p, 1); |
|
pnode_unlink(pp); |
|
} |
|
assert(p->newln); |
|
puts(".El"); |
|
} |
|
|
|
static void |
|
pnode_printlist(struct parse *p, struct pnode *pn) |
|
{ |
|
struct pnode *pp; |
|
|
assert(p->newln); |
assert(p->newln); |
|
TAILQ_FOREACH(pp, &pn->childq, child) |
|
if (NODE_TITLE == pp->node) { |
|
puts(".Pp"); |
|
pnode_print(p, pp); |
|
pnode_unlink(pp); |
|
} |
|
assert(p->newln); |
|
|
if (NODE_ORDEREDLIST == pn->node) |
if (NODE_ORDEREDLIST == pn->node) |
puts(".Bl -enum"); |
puts(".Bl -enum"); |
Line 910 pnode_printvariablelist(struct parse *p, struct pnode |
|
Line 1012 pnode_printvariablelist(struct parse *p, struct pnode |
|
/* |
/* |
* 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. |
* FIXME: macro line continuation? |
* FIXME: if we're in a literal context (<screen> or <programlisting> or |
|
* whatever), don't print inline macros. |
*/ |
*/ |
static void |
static void |
pnode_print(struct parse *p, struct pnode *pn) |
pnode_print(struct parse *p, struct pnode *pn) |
Line 968 pnode_print(struct parse *p, struct pnode *pn) |
|
Line 1071 pnode_print(struct parse *p, struct pnode *pn) |
|
fputs("Fd", stdout); |
fputs("Fd", stdout); |
break; |
break; |
case (NODE_ITEMIZEDLIST): |
case (NODE_ITEMIZEDLIST): |
/* FALLTHROUGH */ |
|
case (NODE_ORDEREDLIST): |
|
assert(p->newln); |
assert(p->newln); |
pnode_printitemizedlist(p, pn); |
pnode_printlist(p, pn); |
|
pnode_unlinksub(pn); |
break; |
break; |
|
case (NODE_GROUP): |
|
pnode_printgroup(p, pn); |
|
pnode_unlinksub(pn); |
|
break; |
case (NODE_LITERAL): |
case (NODE_LITERAL): |
pnode_printmopen(p); |
pnode_printmopen(p); |
fputs("Li", stdout); |
fputs("Li", stdout); |
Line 981 pnode_print(struct parse *p, struct pnode *pn) |
|
Line 1087 pnode_print(struct parse *p, struct pnode *pn) |
|
pnode_printmopen(p); |
pnode_printmopen(p); |
fputs("Fl", stdout); |
fputs("Fl", stdout); |
break; |
break; |
|
case (NODE_ORDEREDLIST): |
|
assert(p->newln); |
|
pnode_printlist(p, pn); |
|
pnode_unlinksub(pn); |
|
break; |
case (NODE_PARA): |
case (NODE_PARA): |
assert(p->newln); |
assert(p->newln); |
if (NULL != pn->parent && |
if (NULL != pn->parent && |
Line 1049 pnode_print(struct parse *p, struct pnode *pn) |
|
Line 1160 pnode_print(struct parse *p, struct pnode *pn) |
|
pnode_printmopen(p); |
pnode_printmopen(p); |
fputs("Vt", stdout); |
fputs("Vt", stdout); |
break; |
break; |
|
case (NODE_TABLE): |
|
assert(p->newln); |
|
pnode_printtable(p, pn); |
|
pnode_unlinksub(pn); |
|
break; |
case (NODE_TEXT): |
case (NODE_TEXT): |
if (0 == p->newln) |
if (0 == p->newln) |
putchar(' '); |
putchar(' '); |
Line 1088 pnode_print(struct parse *p, struct pnode *pn) |
|
Line 1204 pnode_print(struct parse *p, struct pnode *pn) |
|
} |
} |
p->newln = 0; |
p->newln = 0; |
break; |
break; |
|
case (NODE_USERINPUT): |
|
pnode_printmopen(p); |
|
fputs("Li", stdout); |
|
break; |
case (NODE_VARIABLELIST): |
case (NODE_VARIABLELIST): |
assert(p->newln); |
assert(p->newln); |
pnode_printvariablelist(p, pn); |
pnode_printvariablelist(p, pn); |
Line 1097 pnode_print(struct parse *p, struct pnode *pn) |
|
Line 1217 pnode_print(struct parse *p, struct pnode *pn) |
|
assert(p->newln); |
assert(p->newln); |
pnode_printvarlistentry(p, pn); |
pnode_printvarlistentry(p, pn); |
break; |
break; |
|
case (NODE_VARNAME): |
|
pnode_printmopen(p); |
|
fputs("Va", stdout); |
|
break; |
default: |
default: |
break; |
break; |
} |
} |
Line 1120 pnode_print(struct parse *p, struct pnode *pn) |
|
Line 1244 pnode_print(struct parse *p, struct pnode *pn) |
|
case (NODE_REFPURPOSE): |
case (NODE_REFPURPOSE): |
case (NODE_STRUCTNAME): |
case (NODE_STRUCTNAME): |
case (NODE_TEXT): |
case (NODE_TEXT): |
|
case (NODE_USERINPUT): |
|
case (NODE_VARNAME): |
pnode_printmclose(p, sv); |
pnode_printmclose(p, sv); |
break; |
break; |
case (NODE_REFNAME): |
case (NODE_REFNAME): |