version 1.48, 2019/03/22 15:38:09 |
version 1.60, 2019/03/22 17:01:10 |
|
|
/* $Id$ */ |
/* $Id$ */ |
/* |
/* |
* Copyright (c) 2014 Kristaps Dzonsons <kristaps@bsd.lv> |
* Copyright (c) 2014 Kristaps Dzonsons <kristaps@bsd.lv> |
|
* Copyright (c) 2019 Ingo Schwarze <schwarze@openbsd.org> |
* |
* |
* Permission to use, copy, modify, and distribute this software for any |
* Permission to use, copy, modify, and distribute this software for any |
* purpose with or without fee is hereby granted, provided that the above |
* purpose with or without fee is hereby granted, provided that the above |
|
|
char *b; /* NUL-terminated buffer for pre-print */ |
char *b; /* NUL-terminated buffer for pre-print */ |
size_t bsz; /* current length of b */ |
size_t bsz; /* current length of b */ |
size_t mbsz; /* max bsz allocation */ |
size_t mbsz; /* max bsz allocation */ |
|
int level; /* header level, starting at 1 */ |
int newln; /* output: are we on a fresh line */ |
int newln; /* output: are we on a fresh line */ |
}; |
}; |
|
|
struct node { |
struct node { |
const char *name; /* docbook element name */ |
const char *name; /* docbook element name */ |
unsigned int flags; |
enum nodeid node; /* docbook element to generate */ |
#define NODE_IGNTEXT 1 /* ignore all contained text */ |
|
}; |
}; |
|
|
TAILQ_HEAD(pnodeq, pnode); |
TAILQ_HEAD(pnodeq, pnode); |
|
|
|
|
static const char *attrkeys[ATTRKEY__MAX] = { |
static const char *attrkeys[ATTRKEY__MAX] = { |
"choice", |
"choice", |
|
"class", |
"close", |
"close", |
"id", |
"id", |
|
"linkend", |
"open", |
"open", |
"rep" |
"rep" |
}; |
}; |
|
|
static const char *attrvals[ATTRVAL__MAX] = { |
static const char *attrvals[ATTRVAL__MAX] = { |
|
"monospaced", |
"norepeat", |
"norepeat", |
"opt", |
"opt", |
"plain", |
"plain", |
Line 90 static const char *attrvals[ATTRVAL__MAX] = { |
|
Line 94 static const char *attrvals[ATTRVAL__MAX] = { |
|
"req" |
"req" |
}; |
}; |
|
|
static const struct node nodes[NODE__MAX] = { |
static const struct node nodes[] = { |
{ NULL, 0 }, |
{ "acronym", NODE_ACRONYM }, |
{ "acronym", 0 }, |
{ "affiliation", NODE_AFFILIATION }, |
{ "anchor", NODE_IGNTEXT }, |
{ "anchor", NODE_ANCHOR }, |
{ "application", 0 }, |
{ "application", NODE_APPLICATION }, |
{ "arg", 0 }, |
{ "arg", NODE_ARG }, |
{ "caution", NODE_IGNTEXT }, |
{ "author", NODE_AUTHOR }, |
{ "citerefentry", NODE_IGNTEXT }, |
{ "authorgroup", NODE_AUTHORGROUP }, |
{ "cmdsynopsis", NODE_IGNTEXT }, |
{ "blockquote", NODE_BLOCKQUOTE }, |
{ "code", 0 }, |
{ "book", NODE_BOOK }, |
{ "colspec", NODE_IGNTEXT }, |
{ "bookinfo", NODE_BOOKINFO }, |
{ "command", 0 }, |
{ "caution", NODE_CAUTION }, |
{ "constant", 0 }, |
{ "chapter", NODE_SECTION }, |
{ "copyright", NODE_IGNTEXT }, |
{ "citerefentry", NODE_CITEREFENTRY }, |
{ "date", 0 }, |
{ "citetitle", NODE_CITETITLE }, |
{ "emphasis", 0 }, |
{ "cmdsynopsis", NODE_CMDSYNOPSIS }, |
{ "entry", 0 }, |
{ "code", NODE_CODE }, |
{ "envar", 0 }, |
{ "colspec", NODE_COLSPEC }, |
{ "fieldsynopsis", NODE_IGNTEXT }, |
{ "command", NODE_COMMAND }, |
{ "filename", 0 }, |
{ "constant", NODE_CONSTANT }, |
{ "funcdef", 0 }, |
{ "copyright", NODE_COPYRIGHT }, |
{ "funcprototype", NODE_IGNTEXT }, |
{ "date", NODE_DATE }, |
{ "funcsynopsis", NODE_IGNTEXT }, |
{ "editor", NODE_EDITOR }, |
{ "funcsynopsisinfo", 0 }, |
{ "emphasis", NODE_EMPHASIS }, |
{ "function", 0 }, |
{ "entry", NODE_ENTRY }, |
{ "group", NODE_IGNTEXT }, |
{ "envar", NODE_ENVAR }, |
{ "holder", NODE_IGNTEXT }, |
{ "fieldsynopsis", NODE_FIELDSYNOPSIS }, |
{ "info", NODE_IGNTEXT }, |
{ "filename", NODE_FILENAME }, |
{ "informalequation", NODE_IGNTEXT }, |
{ "firstname", NODE_FIRSTNAME }, |
{ "informaltable", NODE_IGNTEXT }, |
{ "firstterm", NODE_FIRSTTERM }, |
{ "inlineequation", NODE_IGNTEXT }, |
{ "footnote", NODE_FOOTNOTE }, |
{ "itemizedlist", NODE_IGNTEXT }, |
{ "funcdef", NODE_FUNCDEF }, |
{ "link", 0 }, |
{ "funcprototype", NODE_FUNCPROTOTYPE }, |
{ "listitem", NODE_IGNTEXT }, |
{ "funcsynopsis", NODE_FUNCSYNOPSIS }, |
{ "literal", 0 }, |
{ "funcsynopsisinfo", NODE_FUNCSYNOPSISINFO }, |
{ "manvolnum", 0 }, |
{ "function", NODE_FUNCTION }, |
{ "mml:math", NODE_IGNTEXT }, |
{ "glossterm", NODE_GLOSSTERM }, |
{ "mml:mfenced", 0 }, |
{ "group", NODE_GROUP }, |
{ "mml:mfrac", 0 }, |
{ "holder", NODE_HOLDER }, |
{ "mml:mi", 0 }, |
{ "index", NODE_INDEX }, |
{ "mml:mn", 0 }, |
{ "indexterm", NODE_INDEXTERM }, |
{ "mml:mo", 0 }, |
{ "info", NODE_INFO }, |
{ "mml:mrow", 0 }, |
{ "informalequation", NODE_INFORMALEQUATION }, |
{ "mml:msub", 0 }, |
{ "informaltable", NODE_INFORMALTABLE }, |
{ "mml:msup", 0 }, |
{ "inlineequation", NODE_INLINEEQUATION }, |
{ "modifier", 0 }, |
{ "itemizedlist", NODE_ITEMIZEDLIST }, |
{ "note", NODE_IGNTEXT }, |
{ "keysym", NODE_KEYSYM }, |
{ "option", 0 }, |
{ "legalnotice", NODE_LEGALNOTICE }, |
{ "orderedlist", NODE_IGNTEXT }, |
{ "link", NODE_LINK }, |
{ "para", 0 }, |
{ "listitem", NODE_LISTITEM }, |
{ "paramdef", 0 }, |
{ "literal", NODE_LITERAL }, |
{ "parameter", 0 }, |
{ "literallayout", NODE_LITERALLAYOUT }, |
{ "programlisting", 0 }, |
{ "manvolnum", NODE_MANVOLNUM }, |
{ "prompt", 0 }, |
{ "member", NODE_MEMBER }, |
{ "quote", 0 }, |
{ "mml:math", NODE_MML_MATH }, |
{ "refclass", NODE_IGNTEXT }, |
{ "mml:mfenced", NODE_MML_MFENCED }, |
{ "refdescriptor", NODE_IGNTEXT }, |
{ "mml:mfrac", NODE_MML_MFRAC }, |
{ "refentry", NODE_IGNTEXT }, |
{ "mml:mi", NODE_MML_MI }, |
{ "refentryinfo", NODE_IGNTEXT }, |
{ "mml:mn", NODE_MML_MN }, |
{ "refentrytitle", 0 }, |
{ "mml:mo", NODE_MML_MO }, |
{ "refmeta", NODE_IGNTEXT }, |
{ "mml:mrow", NODE_MML_MROW }, |
{ "refmetainfo", NODE_IGNTEXT }, |
{ "mml:msub", NODE_MML_MSUB }, |
{ "refmiscinfo", NODE_IGNTEXT }, |
{ "mml:msup", NODE_MML_MSUP }, |
{ "refname", 0 }, |
{ "modifier", NODE_MODIFIER }, |
{ "refnamediv", NODE_IGNTEXT }, |
{ "note", NODE_NOTE }, |
{ "refpurpose", 0 }, |
{ "option", NODE_OPTION }, |
{ "refsect1", NODE_IGNTEXT }, |
{ "orderedlist", NODE_ORDEREDLIST }, |
{ "refsect2", NODE_IGNTEXT }, |
{ "orgname", NODE_ORGNAME }, |
{ "refsect3", NODE_IGNTEXT }, |
{ "othername", NODE_OTHERNAME }, |
{ "refsection", NODE_IGNTEXT }, |
{ "para", NODE_PARA }, |
{ "refsynopsisdiv", NODE_IGNTEXT }, |
{ "paramdef", NODE_PARAMDEF }, |
{ "replaceable", 0 }, |
{ "parameter", NODE_PARAMETER }, |
{ "row", NODE_IGNTEXT }, |
{ "part", NODE_SECTION }, |
{ "sbr", NODE_IGNTEXT }, |
{ "phrase", NODE_PHRASE }, |
{ "screen", NODE_IGNTEXT }, |
{ "preface", NODE_PREFACE }, |
{ "sgmltag", 0 }, |
{ "primary", NODE_PRIMARY }, |
{ "structname", 0 }, |
{ "programlisting", NODE_PROGRAMLISTING }, |
{ "synopsis", 0 }, |
{ "prompt", NODE_PROMPT }, |
{ "table", NODE_IGNTEXT }, |
{ "quote", NODE_QUOTE }, |
{ "tbody", NODE_IGNTEXT }, |
{ "refclass", NODE_REFCLASS }, |
{ "term", 0 }, |
{ "refdescriptor", NODE_REFDESCRIPTOR }, |
{ NULL, 0 }, |
{ "refentry", NODE_REFENTRY }, |
{ "tfoot", NODE_IGNTEXT }, |
{ "refentryinfo", NODE_REFENTRYINFO }, |
{ "tgroup", NODE_IGNTEXT }, |
{ "refentrytitle", NODE_REFENTRYTITLE }, |
{ "thead", NODE_IGNTEXT }, |
{ "refmeta", NODE_REFMETA }, |
{ "tip", NODE_IGNTEXT }, |
{ "refmetainfo", NODE_REFMETAINFO }, |
{ "title", 0 }, |
{ "refmiscinfo", NODE_REFMISCINFO }, |
{ "trademark", 0 }, |
{ "refname", NODE_REFNAME }, |
{ "type", 0 }, |
{ "refnamediv", NODE_REFNAMEDIV }, |
{ "ulink", 0 }, |
{ "refpurpose", NODE_REFPURPOSE }, |
{ "userinput", 0 }, |
{ "refsect1", NODE_SECTION }, |
{ "variablelist", NODE_IGNTEXT }, |
{ "refsect2", NODE_SECTION }, |
{ "varlistentry", NODE_IGNTEXT }, |
{ "refsect3", NODE_SECTION }, |
{ "varname", 0 }, |
{ "refsection", NODE_SECTION }, |
{ "warning", NODE_IGNTEXT }, |
{ "refsynopsisdiv", NODE_REFSYNOPSISDIV }, |
{ "wordasword", 0 }, |
{ "releaseinfo", NODE_RELEASEINFO }, |
{ "year", NODE_IGNTEXT }, |
{ "replaceable", NODE_REPLACEABLE }, |
|
{ "row", NODE_ROW }, |
|
{ "sbr", NODE_SBR }, |
|
{ "screen", NODE_SCREEN }, |
|
{ "secondary", NODE_SECONDARY }, |
|
{ "sect1", NODE_SECTION }, |
|
{ "sect2", NODE_SECTION }, |
|
{ "section", NODE_SECTION }, |
|
{ "sgmltag", NODE_SGMLTAG }, |
|
{ "simplelist", NODE_SIMPLELIST }, |
|
{ "spanspec", NODE_SPANSPEC }, |
|
{ "structname", NODE_STRUCTNAME }, |
|
{ "subtitle", NODE_SUBTITLE }, |
|
{ "surname", NODE_SURNAME }, |
|
{ "synopsis", NODE_SYNOPSIS }, |
|
{ "table", NODE_TABLE }, |
|
{ "tbody", NODE_TBODY }, |
|
{ "term", NODE_TERM }, |
|
{ "tfoot", NODE_TFOOT }, |
|
{ "tgroup", NODE_TGROUP }, |
|
{ "thead", NODE_THEAD }, |
|
{ "tip", NODE_TIP }, |
|
{ "title", NODE_TITLE }, |
|
{ "trademark", NODE_TRADEMARK }, |
|
{ "type", NODE_TYPE }, |
|
{ "ulink", NODE_ULINK }, |
|
{ "userinput", NODE_USERINPUT }, |
|
{ "variablelist", NODE_VARIABLELIST }, |
|
{ "varlistentry", NODE_VARLISTENTRY }, |
|
{ "varname", NODE_VARNAME }, |
|
{ "warning", NODE_WARNING }, |
|
{ "wordasword", NODE_WORDASWORD }, |
|
{ "year", NODE_YEAR }, |
|
{ NULL, NODE__MAX } |
}; |
}; |
|
|
static int warn = 0; |
static int warn = 0; |
Line 211 xml_char(void *arg, const XML_Char *p, int sz) |
|
Line 248 xml_char(void *arg, const XML_Char *p, int sz) |
|
if (ps->stop || NODE_ROOT == ps->node) |
if (ps->stop || NODE_ROOT == ps->node) |
return; |
return; |
|
|
/* Not supposed to be collecting text. */ |
|
assert(NULL != ps->cur); |
assert(NULL != ps->cur); |
if (NODE_IGNTEXT & nodes[ps->node].flags) |
|
return; |
|
|
|
/* |
/* |
* Are we in the midst of processing text? |
* Are we in the midst of processing text? |
|
|
xml_elem_start(void *arg, const XML_Char *name, const XML_Char **atts) |
xml_elem_start(void *arg, const XML_Char *name, const XML_Char **atts) |
{ |
{ |
struct parse *ps = arg; |
struct parse *ps = arg; |
enum nodeid node; |
const struct node *node; |
enum attrkey key; |
enum attrkey key; |
enum attrval val; |
enum attrval val; |
struct pnode *dat; |
struct pnode *dat; |
Line 307 xml_elem_start(void *arg, const XML_Char *name, const |
|
Line 341 xml_elem_start(void *arg, const XML_Char *name, const |
|
ps->node = ps->cur->node; |
ps->node = ps->cur->node; |
} |
} |
|
|
for (node = 0; node < NODE__MAX; node++) |
for (node = nodes; NULL != node->name; node++) |
if (NULL == nodes[node].name) |
if (0 == strcmp(node->name, name)) |
continue; |
|
else if (0 == strcmp(nodes[node].name, name)) |
|
break; |
break; |
|
|
if (NODE__MAX == node && NODE_ROOT == ps->node) { |
if (NULL == node->name) { |
return; |
if (NODE_ROOT == ps->node) |
} else if (NODE__MAX == node) { |
return; |
fprintf(stderr, "%s:%zu:%zu: unknown node \"%s\"\n", |
fprintf(stderr, "%s:%zu:%zu: unknown node \"%s\"\n", |
ps->fname, XML_GetCurrentLineNumber(ps->xml), |
ps->fname, XML_GetCurrentLineNumber(ps->xml), |
XML_GetCurrentColumnNumber(ps->xml), name); |
XML_GetCurrentColumnNumber(ps->xml), name); |
Line 327 xml_elem_start(void *arg, const XML_Char *name, const |
|
Line 359 xml_elem_start(void *arg, const XML_Char *name, const |
|
XML_GetCurrentColumnNumber(ps->xml)); |
XML_GetCurrentColumnNumber(ps->xml)); |
ps->stop = 1; |
ps->stop = 1; |
return; |
return; |
} else if (NODE_ROOT == ps->node && NODE_REFENTRY != node) |
} |
return; |
|
|
|
if (NODE_INLINEEQUATION == node) |
if (NODE_INLINEEQUATION == node->node) |
ps->flags |= PARSE_EQN; |
ps->flags |= PARSE_EQN; |
|
|
if (NULL == (dat = calloc(1, sizeof(struct pnode)))) { |
if (NULL == (dat = calloc(1, sizeof(struct pnode)))) { |
Line 338 xml_elem_start(void *arg, const XML_Char *name, const |
|
Line 369 xml_elem_start(void *arg, const XML_Char *name, const |
|
exit(EXIT_FAILURE); |
exit(EXIT_FAILURE); |
} |
} |
|
|
dat->node = ps->node = node; |
dat->node = ps->node = node->node; |
dat->parent = ps->cur; |
dat->parent = ps->cur; |
TAILQ_INIT(&dat->childq); |
TAILQ_INIT(&dat->childq); |
TAILQ_INIT(&dat->attrq); |
TAILQ_INIT(&dat->attrq); |
Line 366 xml_elem_start(void *arg, const XML_Char *name, const |
|
Line 397 xml_elem_start(void *arg, const XML_Char *name, const |
|
XML_GetCurrentColumnNumber(ps->xml), |
XML_GetCurrentColumnNumber(ps->xml), |
*att); |
*att); |
continue; |
continue; |
} else if ( ! isattrkey(node, key)) { |
|
if (warn) |
|
fprintf(stderr, "%s:%zu:%zu: warning: " |
|
"bad attribute \"%s\"\n", |
|
ps->fname, |
|
XML_GetCurrentLineNumber(ps->xml), |
|
XML_GetCurrentColumnNumber(ps->xml), |
|
*att); |
|
continue; |
|
} |
} |
for (val = 0; val < ATTRVAL__MAX; val++) |
for (val = 0; val < ATTRVAL__MAX; val++) |
if (0 == strcmp(*(att + 1), attrvals[val])) |
if (0 == strcmp(*(att + 1), attrvals[val])) |
break; |
break; |
if (ATTRVAL__MAX != val && ! isattrval(key, val)) { |
|
if (warn) |
|
fprintf(stderr, "%s:%zu:%zu: warning: " |
|
"bad attribute value \"%s\"\n", |
|
ps->fname, |
|
XML_GetCurrentLineNumber(ps->xml), |
|
XML_GetCurrentColumnNumber(ps->xml), |
|
*(att + 1)); |
|
continue; |
|
} |
|
pattr = calloc(1, sizeof(struct pattr)); |
pattr = calloc(1, sizeof(struct pattr)); |
pattr->key = key; |
pattr->key = key; |
pattr->val = val; |
pattr->val = val; |
Line 481 pnode_unlinksub(struct pnode *pn) |
|
Line 493 pnode_unlinksub(struct pnode *pn) |
|
} |
} |
|
|
/* |
/* |
|
* Retrieve an enumeration attribute from a node. |
|
* Return ATTRVAL__MAX if the node has no such attribute. |
|
*/ |
|
enum attrval |
|
pnode_getattr(struct pnode *pn, enum attrkey key) |
|
{ |
|
struct pattr *ap; |
|
|
|
TAILQ_FOREACH(ap, &pn->attrq, child) |
|
if (ap->key == key) |
|
return ap->val; |
|
return(ATTRVAL__MAX); |
|
} |
|
|
|
/* |
|
* Retrieve an attribute string from a node. |
|
* Return defval if the node has no such attribute. |
|
*/ |
|
const char * |
|
pnode_getattr_raw(struct pnode *pn, enum attrkey key, const char *defval) |
|
{ |
|
struct pattr *ap; |
|
|
|
TAILQ_FOREACH(ap, &pn->attrq, child) |
|
if (ap->key == key) |
|
return ATTRVAL__MAX == ap->val ? ap->rawval : |
|
attrvals[ap->val]; |
|
return(defval); |
|
} |
|
|
|
/* |
* Reset the lookaside buffer. |
* Reset the lookaside buffer. |
*/ |
*/ |
static void |
static void |
Line 671 pnode_printmclosepunct(struct parse *p, struct pnode * |
|
Line 714 pnode_printmclosepunct(struct parse *p, struct pnode * |
|
p->newln = 1; |
p->newln = 1; |
} |
} |
|
|
|
static void |
|
pnode_printpara(struct parse *p, struct pnode *pn) |
|
{ |
|
struct pnode *pp; |
|
|
|
assert(p->newln); |
|
if (NULL == pn->parent || NODE_LISTITEM == pn->parent->node) |
|
return; |
|
|
|
pp = TAILQ_PREV(pn, pnodeq, child); |
|
if (NULL == pp) |
|
pp = pn->parent; |
|
if ((NODE_SECTION != pp->node && NODE_PREFACE != pp->node) || |
|
2 < p->level) |
|
puts(".Pp"); |
|
} |
|
|
/* |
/* |
* If the SYNOPSIS macro has a superfluous title, kill it. |
* If the SYNOPSIS macro has a superfluous title, kill it. |
*/ |
*/ |
|
|
pnode_printrefsect(struct parse *p, struct pnode *pn) |
pnode_printrefsect(struct parse *p, struct pnode *pn) |
{ |
{ |
struct pnode *pp; |
struct pnode *pp; |
|
const char *title; |
|
int flags, level; |
|
|
|
if (NULL == pn->parent) |
|
return; |
|
|
|
level = ++p->level; |
|
flags = 1 == level ? MACROLINE_UPPER : 0; |
|
if (3 > level) { |
|
switch (pn->node) { |
|
case (NODE_CAUTION): |
|
case (NODE_NOTE): |
|
case (NODE_TIP): |
|
case (NODE_WARNING): |
|
level = 3; |
|
break; |
|
default: |
|
break; |
|
} |
|
} |
|
|
TAILQ_FOREACH(pp, &pn->childq, child) |
TAILQ_FOREACH(pp, &pn->childq, child) |
if (NODE_TITLE == pp->node) |
if (NODE_TITLE == pp->node) |
break; |
break; |
|
|
switch (pn->node) { |
if (NULL == pp) { |
case (NODE_REFSECT1): |
switch (pn->node) { |
|
case (NODE_PREFACE): |
|
title = "Preface"; |
|
break; |
|
case (NODE_CAUTION): |
|
title = "Caution"; |
|
break; |
|
case (NODE_NOTE): |
|
title = "Note"; |
|
break; |
|
case (NODE_TIP): |
|
title = "Tip"; |
|
break; |
|
case (NODE_WARNING): |
|
title = "Warning"; |
|
break; |
|
default: |
|
title = "Unknown"; |
|
break; |
|
} |
|
} |
|
|
|
switch (level) { |
|
case (1): |
fputs(".Sh", stdout); |
fputs(".Sh", stdout); |
break; |
break; |
case (NODE_REFSECT2): |
case (2): |
fputs(".Ss", stdout); |
fputs(".Ss", stdout); |
break; |
break; |
case (NODE_REFSECT3): |
default: |
puts(".Pp"); |
pnode_printpara(p, pn); |
fputs(".Sy", stdout); |
fputs(".Sy", stdout); |
break; |
break; |
case (NODE_NOTE): |
|
/* FALLTHROUGH */ |
|
case (NODE_REFSECTION): |
|
/* FALLTHROUGH */ |
|
case (NODE_TIP): |
|
/* FALLTHROUGH */ |
|
case (NODE_CAUTION): |
|
/* FALLTHROUGH */ |
|
case (NODE_WARNING): |
|
puts(".Pp"); |
|
if (NULL == pp) |
|
return; |
|
fputs(".Em", stdout); |
|
break; |
|
default: |
|
break; |
|
} |
} |
|
|
p->newln = 0; |
|
|
|
if (NULL != pp) { |
if (NULL != pp) { |
pnode_printmacrolinetext(p, pp, |
p->newln = 0; |
NODE_REFSECT1 == pn->node ? |
pnode_printmacrolinetext(p, pp, flags); |
MACROLINE_UPPER : 0); |
|
pnode_printmclose(p, 1); |
pnode_printmclose(p, 1); |
pnode_unlink(pp); |
pnode_unlink(pp); |
} else { |
} else |
puts(NODE_REFSECT1 == pn->node ? |
printf(" %s\n", title); |
"UNKNOWN" : "unknown"); |
|
p->newln = 1; |
|
} |
|
} |
} |
|
|
/* |
/* |
Line 782 pnode_printrefmeta(struct parse *p, struct pnode *pn) |
|
Line 863 pnode_printrefmeta(struct parse *p, struct pnode *pn) |
|
else if (NODE_REFENTRYTITLE == pp->node) |
else if (NODE_REFENTRYTITLE == pp->node) |
title = pp; |
title = pp; |
|
|
puts(".Dd $Mdocdate" "$"); |
|
fputs(".Dt", stdout); |
fputs(".Dt", stdout); |
p->newln = 0; |
p->newln = 0; |
|
|
Line 796 pnode_printrefmeta(struct parse *p, struct pnode *pn) |
|
Line 876 pnode_printrefmeta(struct parse *p, struct pnode *pn) |
|
p->newln = 1; |
p->newln = 1; |
} else |
} else |
pnode_printmacroline(p, manvol); |
pnode_printmacroline(p, manvol); |
|
|
puts(".Os"); |
|
} |
} |
|
|
static void |
static void |
|
|
pnode_printmathfenced(struct parse *p, struct pnode *pn) |
pnode_printmathfenced(struct parse *p, struct pnode *pn) |
{ |
{ |
struct pnode *pp; |
struct pnode *pp; |
struct pattr *ap; |
|
|
|
TAILQ_FOREACH(ap, &pn->attrq, child) |
printf("left %s ", pnode_getattr_raw(pn, ATTRKEY_OPEN, "(")); |
if (ATTRKEY_OPEN == ap->key) { |
|
printf("left %s ", ap->rawval); |
|
break; |
|
} |
|
if (NULL == ap) |
|
printf("left ( "); |
|
|
|
pp = TAILQ_FIRST(&pn->childq); |
pp = TAILQ_FIRST(&pn->childq); |
pnode_print(p, pp); |
pnode_print(p, pp); |
Line 884 pnode_printmathfenced(struct parse *p, struct pnode *p |
|
Line 955 pnode_printmathfenced(struct parse *p, struct pnode *p |
|
pnode_print(p, pp); |
pnode_print(p, pp); |
} |
} |
|
|
TAILQ_FOREACH(ap, &pn->attrq, child) |
printf("right %s ", pnode_getattr_raw(pn, ATTRKEY_CLOSE, ")")); |
if (ATTRKEY_CLOSE == ap->key) { |
|
printf("right %s ", ap->rawval); |
|
break; |
|
} |
|
if (NULL == ap) |
|
printf("right ) "); |
|
} |
} |
|
|
/* |
/* |
Line 1049 pnode_printprologue(struct parse *p, struct pnode *pn) |
|
Line 1114 pnode_printprologue(struct parse *p, struct pnode *pn) |
|
pp = NULL == p->root ? NULL : |
pp = NULL == p->root ? NULL : |
pnode_findfirst(p->root, NODE_REFMETA); |
pnode_findfirst(p->root, NODE_REFMETA); |
|
|
|
puts(".Dd $Mdocdate" "$"); |
if (NULL != pp) { |
if (NULL != pp) { |
pnode_printrefmeta(p, pp); |
pnode_printrefmeta(p, pp); |
pnode_unlink(pp); |
pnode_unlink(pp); |
} else { |
} else |
puts(".\\\" Supplying bogus prologue..."); |
printf(".Dt %s 1\n", |
puts(".Dd $Mdocdate" "$"); |
pnode_getattr_raw(p->root, ATTRKEY_ID, "UNKNOWN")); |
puts(".Dt UNKNOWN 1"); |
puts(".Os"); |
puts(".Os"); |
|
} |
|
|
|
if (PARSE_EQN & p->flags) { |
if (PARSE_EQN & p->flags) { |
puts(".EQ"); |
puts(".EQ"); |
Line 1119 pnode_printtable(struct parse *p, struct pnode *pn) |
|
Line 1183 pnode_printtable(struct parse *p, struct pnode *pn) |
|
assert(p->newln); |
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"); |
pnode_printpara(p, pp); |
pnode_print(p, pp); |
pnode_print(p, pp); |
pnode_unlink(pp); |
pnode_unlink(pp); |
} |
} |
Line 1143 pnode_printlist(struct parse *p, struct pnode *pn) |
|
Line 1207 pnode_printlist(struct parse *p, struct pnode *pn) |
|
assert(p->newln); |
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"); |
pnode_printpara(p, pp); |
pnode_print(p, pp); |
pnode_print(p, pp); |
pnode_unlink(pp); |
pnode_unlink(pp); |
} |
} |
Line 1152 pnode_printlist(struct parse *p, struct pnode *pn) |
|
Line 1216 pnode_printlist(struct parse *p, struct pnode *pn) |
|
if (NODE_ORDEREDLIST == pn->node) |
if (NODE_ORDEREDLIST == pn->node) |
puts(".Bl -enum"); |
puts(".Bl -enum"); |
else |
else |
puts(".Bl -item"); |
puts(".Bl -bullet"); |
|
|
TAILQ_FOREACH(pp, &pn->childq, child) { |
TAILQ_FOREACH(pp, &pn->childq, child) { |
assert(p->newln); |
assert(p->newln); |
Line 1172 pnode_printvariablelist(struct parse *p, struct pnode |
|
Line 1236 pnode_printvariablelist(struct parse *p, struct pnode |
|
assert(p->newln); |
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"); |
pnode_printpara(p, pp); |
pnode_print(p, pp); |
pnode_print(p, pp); |
pnode_unlink(pp); |
pnode_unlink(pp); |
} |
} |
|
|
pnode_print(struct parse *p, struct pnode *pn) |
pnode_print(struct parse *p, struct pnode *pn) |
{ |
{ |
struct pnode *pp; |
struct pnode *pp; |
|
const char *ccp; |
char *cp; |
char *cp; |
int last, sv; |
int last, sv; |
|
|
Line 1210 pnode_print(struct parse *p, struct pnode *pn) |
|
Line 1275 pnode_print(struct parse *p, struct pnode *pn) |
|
|
|
sv = p->newln; |
sv = p->newln; |
|
|
|
/* XXX fprintf(stderr, "NODE %s\n", nodes[pn->node].name); */ |
switch (pn->node) { |
switch (pn->node) { |
case (NODE_APPLICATION): |
case (NODE_APPLICATION): |
pnode_printmopen(p); |
pnode_printmopen(p); |
Line 1222 pnode_print(struct parse *p, struct pnode *pn) |
|
Line 1288 pnode_print(struct parse *p, struct pnode *pn) |
|
pnode_printarg(p, pn); |
pnode_printarg(p, pn); |
pnode_unlinksub(pn); |
pnode_unlinksub(pn); |
break; |
break; |
|
case (NODE_AUTHOR): |
|
pnode_printmopen(p); |
|
fputs("An", stdout); |
|
break; |
|
case (NODE_AUTHORGROUP): |
|
assert(p->newln); |
|
puts(".An -split"); |
|
break; |
|
case (NODE_BOOKINFO): |
|
assert(p->newln); |
|
puts(".Sh NAME"); |
|
break; |
case (NODE_CITEREFENTRY): |
case (NODE_CITEREFENTRY): |
pnode_printmopen(p); |
pnode_printmopen(p); |
fputs("Xr", stdout); |
fputs("Xr", stdout); |
Line 1240 pnode_print(struct parse *p, struct pnode *pn) |
|
Line 1318 pnode_print(struct parse *p, struct pnode *pn) |
|
pnode_printmopen(p); |
pnode_printmopen(p); |
fputs("Dv", stdout); |
fputs("Dv", stdout); |
break; |
break; |
|
case (NODE_EDITOR): |
|
puts("editor: "); |
|
pnode_printmopen(p); |
|
fputs("An", stdout); |
|
break; |
case (NODE_EMPHASIS): |
case (NODE_EMPHASIS): |
|
case (NODE_FIRSTTERM): |
pnode_printmopen(p); |
pnode_printmopen(p); |
fputs("Em", stdout); |
fputs("Em", stdout); |
break; |
break; |
Line 1265 pnode_print(struct parse *p, struct pnode *pn) |
|
Line 1349 pnode_print(struct parse *p, struct pnode *pn) |
|
pnode_printmopen(p); |
pnode_printmopen(p); |
fputs("Fd", stdout); |
fputs("Fd", stdout); |
break; |
break; |
|
case (NODE_INDEXTERM): |
|
return; |
case (NODE_INFORMALEQUATION): |
case (NODE_INFORMALEQUATION): |
if ( ! p->newln) |
if ( ! p->newln) |
putchar('\n'); |
putchar('\n'); |
Line 1284 pnode_print(struct parse *p, struct pnode *pn) |
|
Line 1370 pnode_print(struct parse *p, struct pnode *pn) |
|
pnode_printgroup(p, pn); |
pnode_printgroup(p, pn); |
pnode_unlinksub(pn); |
pnode_unlinksub(pn); |
break; |
break; |
|
case (NODE_LEGALNOTICE): |
|
assert(p->newln); |
|
puts(".Sh LEGAL NOTICE"); |
|
break; |
|
case (NODE_LINK): |
|
ccp = pnode_getattr_raw(pn, ATTRKEY_LINKEND, NULL); |
|
if (NULL == ccp) |
|
break; |
|
pnode_printmopen(p); |
|
printf("Sx %s\n", ccp); |
|
p->newln = 1; |
|
return; |
case (NODE_LITERAL): |
case (NODE_LITERAL): |
pnode_printmopen(p); |
pnode_printmopen(p); |
fputs("Li", stdout); |
fputs("Li", stdout); |
break; |
break; |
|
case (NODE_LITERALLAYOUT): |
|
assert(p->newln); |
|
puts(".Bd -literal"); |
|
break; |
case (NODE_MML_MFENCED): |
case (NODE_MML_MFENCED): |
pnode_printmathfenced(p, pn); |
pnode_printmathfenced(p, pn); |
pnode_unlinksub(pn); |
pnode_unlinksub(pn); |
Line 1316 pnode_print(struct parse *p, struct pnode *pn) |
|
Line 1418 pnode_print(struct parse *p, struct pnode *pn) |
|
pnode_unlinksub(pn); |
pnode_unlinksub(pn); |
break; |
break; |
case (NODE_PARA): |
case (NODE_PARA): |
assert(p->newln); |
pnode_printpara(p, pn); |
if (NULL != pn->parent && |
|
NODE_LISTITEM == pn->parent->node) |
|
break; |
|
puts(".Pp"); |
|
break; |
break; |
case (NODE_PARAMETER): |
case (NODE_PARAMETER): |
/* Suppress non-text children... */ |
/* Suppress non-text children... */ |
Line 1335 pnode_print(struct parse *p, struct pnode *pn) |
|
Line 1433 pnode_print(struct parse *p, struct pnode *pn) |
|
fputs("Qo", stdout); |
fputs("Qo", stdout); |
break; |
break; |
case (NODE_PROGRAMLISTING): |
case (NODE_PROGRAMLISTING): |
/* FALLTHROUGH */ |
|
case (NODE_SCREEN): |
case (NODE_SCREEN): |
assert(p->newln); |
assert(p->newln); |
puts(".Bd -literal"); |
printf(".Bd %s\n", ATTRVAL_MONOSPACED == |
|
pnode_getattr(pn, ATTRKEY_CLASS) ? |
|
"-literal" : "-unfilled"); |
break; |
break; |
case (NODE_REFENTRYINFO): |
case (NODE_REFENTRYINFO): |
/* Suppress. */ |
/* Suppress. */ |
Line 1369 pnode_print(struct parse *p, struct pnode *pn) |
|
Line 1468 pnode_print(struct parse *p, struct pnode *pn) |
|
pnode_printrefsynopsisdiv(p, pn); |
pnode_printrefsynopsisdiv(p, pn); |
puts(".Sh SYNOPSIS"); |
puts(".Sh SYNOPSIS"); |
break; |
break; |
case (NODE_REFSECT1): |
case (NODE_PREFACE): |
/* FALLTHROUGH */ |
case (NODE_SECTION): |
case (NODE_REFSECT2): |
|
/* FALLTHROUGH */ |
|
case (NODE_REFSECT3): |
|
/* FALLTHROUGH */ |
|
case (NODE_REFSECTION): |
|
/* FALLTHROUGH */ |
|
case (NODE_NOTE): |
case (NODE_NOTE): |
/* FALLTHROUGH */ |
|
case (NODE_TIP): |
case (NODE_TIP): |
/* FALLTHROUGH */ |
|
case (NODE_CAUTION): |
case (NODE_CAUTION): |
/* FALLTHROUGH */ |
|
case (NODE_WARNING): |
case (NODE_WARNING): |
assert(p->newln); |
assert(p->newln); |
pnode_printrefsect(p, pn); |
pnode_printrefsect(p, pn); |
Line 1457 pnode_print(struct parse *p, struct pnode *pn) |
|
Line 1547 pnode_print(struct parse *p, struct pnode *pn) |
|
} |
} |
p->newln = 0; |
p->newln = 0; |
break; |
break; |
|
case (NODE_TITLE): |
|
if (pn->parent->node == NODE_BOOKINFO) { |
|
pnode_printmopen(p); |
|
fputs("Nd", stdout); |
|
} |
|
break; |
case (NODE_TYPE): |
case (NODE_TYPE): |
pnode_printmopen(p); |
pnode_printmopen(p); |
fputs("Vt", stdout); |
fputs("Vt", stdout); |
Line 1506 pnode_print(struct parse *p, struct pnode *pn) |
|
Line 1602 pnode_print(struct parse *p, struct pnode *pn) |
|
break; |
break; |
case (NODE_APPLICATION): |
case (NODE_APPLICATION): |
case (NODE_ARG): |
case (NODE_ARG): |
|
case (NODE_AUTHOR): |
case (NODE_CITEREFENTRY): |
case (NODE_CITEREFENTRY): |
case (NODE_CODE): |
case (NODE_CODE): |
case (NODE_COMMAND): |
case (NODE_COMMAND): |
case (NODE_CONSTANT): |
case (NODE_CONSTANT): |
|
case (NODE_EDITOR): |
case (NODE_EMPHASIS): |
case (NODE_EMPHASIS): |
case (NODE_ENVAR): |
case (NODE_ENVAR): |
case (NODE_FILENAME): |
case (NODE_FILENAME): |
|
case (NODE_FIRSTTERM): |
case (NODE_FUNCTION): |
case (NODE_FUNCTION): |
case (NODE_FUNCSYNOPSISINFO): |
case (NODE_FUNCSYNOPSISINFO): |
case (NODE_LITERAL): |
case (NODE_LITERAL): |
Line 1548 pnode_print(struct parse *p, struct pnode *pn) |
|
Line 1647 pnode_print(struct parse *p, struct pnode *pn) |
|
fputs(" ,", stdout); |
fputs(" ,", stdout); |
pnode_printmclose(p, sv); |
pnode_printmclose(p, sv); |
break; |
break; |
|
case (NODE_PREFACE): |
|
case (NODE_SECTION): |
|
case (NODE_NOTE): |
|
case (NODE_TIP): |
|
case (NODE_CAUTION): |
|
case (NODE_WARNING): |
|
p->level--; |
|
break; |
|
case (NODE_LITERALLAYOUT): |
|
/* FALLTHROUGH */ |
case (NODE_PROGRAMLISTING): |
case (NODE_PROGRAMLISTING): |
/* FALLTHROUGH */ |
/* FALLTHROUGH */ |
case (NODE_SCREEN): |
case (NODE_SCREEN): |
assert(p->newln); |
assert(p->newln); |
puts(".Ed"); |
puts(".Ed"); |
p->newln = 1; |
p->newln = 1; |
|
break; |
|
case (NODE_TITLE): |
|
if (pn->parent->node == NODE_BOOKINFO) { |
|
pnode_printmclose(p, 1); |
|
puts(".Sh AUTHORS"); |
|
} |
break; |
break; |
default: |
default: |
break; |
break; |