version 1.69, 2019/03/24 16:45:46 |
version 1.72, 2019/03/25 17:28:32 |
|
|
unsigned int flags; /* document-wide flags */ |
unsigned int flags; /* document-wide flags */ |
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 */ |
char *b; /* NUL-terminated buffer for pre-print */ |
|
size_t bsz; /* current length of b */ |
|
size_t mbsz; /* max bsz allocation */ |
|
int level; /* header level, starting at 1 */ |
int level; /* header level, starting at 1 */ |
enum linestate linestate; |
enum linestate linestate; |
}; |
}; |
Line 273 xml_char(void *arg, const XML_Char *p, int sz) |
|
Line 270 xml_char(void *arg, const XML_Char *p, int sz) |
|
return; |
return; |
p += i; |
p += i; |
sz -= i; |
sz -= i; |
dat = calloc(1, sizeof(struct pnode)); |
dat = calloc(1, sizeof(*dat)); |
if (dat == NULL) { |
if (dat == NULL) { |
perror(NULL); |
perror(NULL); |
exit(1); |
exit(1); |
Line 290 xml_char(void *arg, const XML_Char *p, int sz) |
|
Line 287 xml_char(void *arg, const XML_Char *p, int sz) |
|
|
|
/* Append to current buffer. */ |
/* Append to current buffer. */ |
assert(sz >= 0); |
assert(sz >= 0); |
ps->cur->b = realloc(ps->cur->b, |
ps->cur->b = realloc(ps->cur->b, ps->cur->bsz + sz + 1); |
ps->cur->bsz + (size_t)sz); |
|
if (ps->cur->b == NULL) { |
if (ps->cur->b == NULL) { |
perror(NULL); |
perror(NULL); |
exit(1); |
exit(1); |
} |
} |
memcpy(ps->cur->b + ps->cur->bsz, p, sz); |
memcpy(ps->cur->b + ps->cur->bsz, p, sz); |
ps->cur->bsz += (size_t)sz; |
ps->cur->bsz += sz; |
|
ps->cur->b[ps->cur->bsz] = '\0'; |
ps->cur->real = ps->cur->b; |
ps->cur->real = ps->cur->b; |
} |
} |
|
|
|
|
pnode_trim(struct pnode *pn) |
pnode_trim(struct pnode *pn) |
{ |
{ |
assert(pn->node == NODE_TEXT); |
assert(pn->node == NODE_TEXT); |
for ( ; pn->bsz > 0; pn->bsz--) |
for (; pn->bsz > 0; pn->b[--pn->bsz] = '\0') |
if ( ! isspace((unsigned char)pn->b[pn->bsz - 1])) |
if ( ! isspace((unsigned char)pn->b[pn->bsz - 1])) |
break; |
break; |
} |
} |
Line 369 xml_elem_start(void *arg, const XML_Char *name, const |
|
Line 366 xml_elem_start(void *arg, const XML_Char *name, const |
|
if (node->node == NODE_INLINEEQUATION) |
if (node->node == NODE_INLINEEQUATION) |
ps->flags |= PARSE_EQN; |
ps->flags |= PARSE_EQN; |
|
|
if ((dat = calloc(1, sizeof(struct pnode))) == NULL) { |
if ((dat = calloc(1, sizeof(*dat))) == NULL) { |
perror(NULL); |
perror(NULL); |
exit(1); |
exit(1); |
} |
} |
Line 406 xml_elem_start(void *arg, const XML_Char *name, const |
|
Line 403 xml_elem_start(void *arg, const XML_Char *name, const |
|
for (val = 0; val < ATTRVAL__MAX; val++) |
for (val = 0; val < ATTRVAL__MAX; val++) |
if (strcmp(att[1], attrvals[val]) == 0) |
if (strcmp(att[1], attrvals[val]) == 0) |
break; |
break; |
pattr = calloc(1, sizeof(struct pattr)); |
pattr = calloc(1, sizeof(*pattr)); |
pattr->key = key; |
pattr->key = key; |
pattr->val = val; |
pattr->val = val; |
if (val == ATTRVAL__MAX) |
if (val == ATTRVAL__MAX) |
Line 526 pnode_getattr_raw(struct pnode *pn, enum attrkey key, |
|
Line 523 pnode_getattr_raw(struct pnode *pn, enum attrkey key, |
|
} |
} |
|
|
/* |
/* |
* Reset the lookaside buffer. |
|
*/ |
|
static void |
|
bufclear(struct parse *p) |
|
{ |
|
|
|
p->b[p->bsz = 0] = '\0'; |
|
} |
|
|
|
/* |
|
* Append NODE_TEXT contents to the current buffer, reallocating its |
|
* size if necessary. |
|
* The buffer is ALWAYS NUL-terminated. |
|
*/ |
|
static void |
|
bufappend(struct parse *p, struct pnode *pn) |
|
{ |
|
|
|
assert(pn->node == NODE_TEXT); |
|
if (p->bsz + pn->bsz + 1 > p->mbsz) { |
|
p->mbsz = p->bsz + pn->bsz + 1; |
|
if ((p->b = realloc(p->b, p->mbsz)) == NULL) { |
|
perror(NULL); |
|
exit(1); |
|
} |
|
} |
|
memcpy(p->b + p->bsz, pn->b, pn->bsz); |
|
p->bsz += pn->bsz; |
|
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 |
|
bufappend_r(struct parse *p, struct pnode *pn) |
|
{ |
|
struct pnode *pp; |
|
|
|
if (pn->node == NODE_TEXT) |
|
bufappend(p, pn); |
|
TAILQ_FOREACH(pp, &pn->childq, child) |
|
bufappend_r(p, pp); |
|
} |
|
|
|
/* |
|
* Recursively search and return the first instance of "node". |
* Recursively search and return the first instance of "node". |
*/ |
*/ |
static struct pnode * |
static struct pnode * |
Line 626 macro_line(struct parse *p, const char *name) |
|
Line 574 macro_line(struct parse *p, const char *name) |
|
macro_close(p); |
macro_close(p); |
} |
} |
|
|
#define MACROLINE_UPPER 1 |
#define ARG_SPACE 1 /* Insert whitespace before this argument. */ |
#define MACROLINE_NOWS 2 |
#define ARG_SINGLE 2 /* Quote argument if it contains whitespace. */ |
|
#define ARG_QUOTED 4 /* We are already in a quoted argument. */ |
|
#define ARG_UPPER 8 /* Covert argument to upper case. */ |
/* |
/* |
* Print an argument string on a macro line, collapsing whitespace. |
* Print an argument string on a macro line, collapsing whitespace. |
*/ |
*/ |
static void |
static void |
macro_addarg(struct parse *p, const char *arg, int fl) |
macro_addarg(struct parse *p, const char *arg, int flags) |
{ |
{ |
const char *cp; |
const char *cp; |
int wantspace; |
|
|
|
assert(p->linestate == LINE_MACRO); |
assert(p->linestate == LINE_MACRO); |
wantspace = !(fl & MACROLINE_NOWS); |
|
|
/* Quote if requested and necessary. */ |
|
|
|
if ((flags & (ARG_SINGLE | ARG_QUOTED)) == ARG_SINGLE) { |
|
for (cp = arg; *cp != '\0'; cp++) |
|
if (isspace((unsigned char)*cp)) |
|
break; |
|
if (*cp != '\0') { |
|
if (flags & ARG_SPACE) { |
|
putchar(' '); |
|
flags &= ~ ARG_SPACE; |
|
} |
|
putchar('"'); |
|
flags = ARG_QUOTED; |
|
} |
|
} |
|
|
for (cp = arg; *cp != '\0'; cp++) { |
for (cp = arg; *cp != '\0'; cp++) { |
|
|
|
/* Collapse whitespace. */ |
|
|
if (isspace((unsigned char)*cp)) { |
if (isspace((unsigned char)*cp)) { |
wantspace = 1; |
flags |= ARG_SPACE; |
continue; |
continue; |
} else if (wantspace) { |
} else if (flags & ARG_SPACE) { |
putchar(' '); |
putchar(' '); |
wantspace = 0; |
flags &= ~ ARG_SPACE; |
} |
} |
|
|
/* Escape us if we look like a macro. */ |
/* Escape us if we look like a macro. */ |
if ((cp == arg || cp[-1] == ' ') && |
|
|
if ((flags & ARG_QUOTED) == 0 && |
|
(cp == arg || isspace((unsigned char)cp[-1])) && |
isupper((unsigned char)cp[0]) && |
isupper((unsigned char)cp[0]) && |
islower((unsigned char)cp[1]) && |
islower((unsigned char)cp[1]) && |
(cp[2] == '\0' || cp[2] == ' ' || |
(cp[2] == '\0' || cp[2] == ' ' || |
(islower((unsigned char)cp[2]) && |
(islower((unsigned char)cp[2]) && |
(cp[3] == '\0' || cp[3] == ' ')))) |
(cp[3] == '\0' || cp[3] == ' ')))) |
fputs("\\&", stdout); |
fputs("\\&", stdout); |
if (fl & MACROLINE_UPPER) |
|
|
if (*cp == '"') |
|
fputs("\\(dq", stdout); |
|
else if (flags & ARG_UPPER) |
putchar(toupper((unsigned char)*cp)); |
putchar(toupper((unsigned char)*cp)); |
else |
else |
putchar(*cp); |
putchar(*cp); |
|
|
macro_argline(struct parse *p, const char *name, const char *arg) |
macro_argline(struct parse *p, const char *name, const char *arg) |
{ |
{ |
macro_open(p, name); |
macro_open(p, name); |
macro_addarg(p, arg, 0); |
macro_addarg(p, arg, ARG_SPACE); |
macro_close(p); |
macro_close(p); |
} |
} |
|
|
/* |
/* |
* Recurse nodes to print arguments on a macro line. |
* Recursively append text from the children of a node to a macro line. |
*/ |
*/ |
static void |
static void |
macro_addnode(struct parse *p, struct pnode *pn, int fl) |
macro_addnode(struct parse *p, struct pnode *pn, int flags) |
{ |
{ |
bufclear(p); |
int quote_now; |
bufappend_r(p, pn); |
|
macro_addarg(p, p->b, fl); |
assert(p->linestate == LINE_MACRO); |
|
|
|
/* |
|
* If the only child is a text node, just add that text, |
|
* letting macro_addarg() decide about quoting. |
|
*/ |
|
|
|
pn = TAILQ_FIRST(&pn->childq); |
|
if (pn != NULL && pn->node == NODE_TEXT && |
|
TAILQ_NEXT(pn, child) == NULL) { |
|
macro_addarg(p, pn->b, flags); |
|
return; |
|
} |
|
|
|
/* |
|
* If we want the argument quoted and are not already |
|
* in a quoted context, quote now. |
|
*/ |
|
|
|
quote_now = 0; |
|
if (flags & ARG_SINGLE) { |
|
if ((flags & ARG_QUOTED) == 0) { |
|
if (flags & ARG_SPACE) { |
|
putchar(' '); |
|
flags &= ~ARG_SPACE; |
|
} |
|
putchar('"'); |
|
flags |= ARG_QUOTED; |
|
quote_now = 1; |
|
} |
|
flags &= ~ARG_SINGLE; |
|
} |
|
|
|
/* |
|
* Iterate to child and sibling nodes, |
|
* inserting whitespace between nodes. |
|
*/ |
|
|
|
while (pn != NULL) { |
|
if (pn->node == NODE_TEXT) |
|
macro_addarg(p, pn->b, flags); |
|
else |
|
macro_addnode(p, pn, flags); |
|
pn = TAILQ_NEXT(pn, child); |
|
flags |= ARG_SPACE; |
|
} |
|
if (quote_now) |
|
putchar('"'); |
} |
} |
|
|
static void |
static void |
macro_nodeline(struct parse *p, const char *name, struct pnode *pn) |
macro_nodeline(struct parse *p, const char *name, struct pnode *pn, int flags) |
{ |
{ |
macro_open(p, name); |
macro_open(p, name); |
macro_addnode(p, pn, 0); |
macro_addnode(p, pn, ARG_SPACE | flags); |
macro_close(p); |
macro_close(p); |
} |
} |
|
|
Line 711 macro_closepunct(struct parse *p, struct pnode *pn) |
|
Line 732 macro_closepunct(struct parse *p, struct pnode *pn) |
|
} |
} |
|
|
static void |
static void |
|
print_text(struct parse *p, const char *word) |
|
{ |
|
switch (p->linestate) { |
|
case LINE_NEW: |
|
break; |
|
case LINE_TEXT: |
|
putchar(' '); |
|
break; |
|
case LINE_MACRO: |
|
macro_close(p); |
|
break; |
|
} |
|
fputs(word, stdout); |
|
p->linestate = LINE_TEXT; |
|
} |
|
|
|
static void |
pnode_printpara(struct parse *p, struct pnode *pn) |
pnode_printpara(struct parse *p, struct pnode *pn) |
{ |
{ |
struct pnode *pp; |
struct pnode *pp; |
Line 740 pnode_printpara(struct parse *p, struct pnode *pn) |
|
Line 778 pnode_printpara(struct parse *p, struct pnode *pn) |
|
static void |
static void |
pnode_printrefsynopsisdiv(struct parse *p, struct pnode *pn) |
pnode_printrefsynopsisdiv(struct parse *p, struct pnode *pn) |
{ |
{ |
struct pnode *pp; |
struct pnode *pp, *pq; |
|
|
TAILQ_FOREACH(pp, &pn->childq, child) |
TAILQ_FOREACH_SAFE(pp, &pn->childq, child, pq) |
if (pp->node == NODE_TITLE) { |
if (pp->node == NODE_TITLE) |
pnode_unlink(pp); |
pnode_unlink(pp); |
return; |
|
} |
macro_line(p, "Sh SYNOPSIS"); |
} |
} |
|
|
/* |
/* |
Line 763 pnode_printrefsect(struct parse *p, struct pnode *pn) |
|
Line 801 pnode_printrefsect(struct parse *p, struct pnode *pn) |
|
return; |
return; |
|
|
level = ++p->level; |
level = ++p->level; |
flags = level == 1 ? MACROLINE_UPPER : 0; |
flags = ARG_SPACE; |
|
if (level == 1) |
|
flags |= ARG_UPPER; |
if (level < 3) { |
if (level < 3) { |
switch (pn->node) { |
switch (pn->node) { |
case NODE_CAUTION: |
case NODE_CAUTION: |
Line 821 pnode_printrefsect(struct parse *p, struct pnode *pn) |
|
Line 861 pnode_printrefsect(struct parse *p, struct pnode *pn) |
|
macro_addnode(p, pp, flags); |
macro_addnode(p, pp, flags); |
pnode_unlink(pp); |
pnode_unlink(pp); |
} else |
} else |
macro_addarg(p, title, 0); |
macro_addarg(p, title, ARG_SPACE | ARG_QUOTED); |
macro_close(p); |
macro_close(p); |
} |
} |
|
|
Line 842 pnode_printciterefentry(struct parse *p, struct pnode |
|
Line 882 pnode_printciterefentry(struct parse *p, struct pnode |
|
} |
} |
macro_open(p, "Xr"); |
macro_open(p, "Xr"); |
if (title == NULL) |
if (title == NULL) |
macro_addarg(p, "unknown", 0); |
macro_addarg(p, "unknown", ARG_SPACE); |
else |
else |
macro_addnode(p, title, 0); |
macro_addnode(p, title, ARG_SPACE | ARG_SINGLE); |
if (manvol == NULL) |
if (manvol == NULL) |
macro_addarg(p, "1", 0); |
macro_addarg(p, "1", ARG_SPACE); |
else |
else |
macro_addnode(p, manvol, 0); |
macro_addnode(p, manvol, ARG_SPACE | ARG_SINGLE); |
macro_close(p); |
macro_close(p); |
|
pnode_unlinksub(pn); |
} |
} |
|
|
static void |
static void |
Line 866 pnode_printrefmeta(struct parse *p, struct pnode *pn) |
|
Line 907 pnode_printrefmeta(struct parse *p, struct pnode *pn) |
|
} |
} |
macro_open(p, "Dt"); |
macro_open(p, "Dt"); |
if (title == NULL) |
if (title == NULL) |
macro_addarg(p, "UNKNOWN", 0); |
macro_addarg(p, "UNKNOWN", ARG_SPACE); |
else |
else |
macro_addnode(p, title, MACROLINE_UPPER); |
macro_addnode(p, title, ARG_SPACE | ARG_SINGLE | ARG_UPPER); |
if (manvol == NULL) |
if (manvol == NULL) |
macro_addarg(p, "1", 0); |
macro_addarg(p, "1", ARG_SPACE); |
else |
else |
macro_addnode(p, manvol, 0); |
macro_addnode(p, manvol, ARG_SPACE | ARG_SINGLE); |
macro_close(p); |
macro_close(p); |
|
pnode_unlink(pn); |
} |
} |
|
|
static void |
static void |
Line 889 pnode_printfuncdef(struct parse *p, struct pnode *pn) |
|
Line 931 pnode_printfuncdef(struct parse *p, struct pnode *pn) |
|
func = pp; |
func = pp; |
} |
} |
if (ftype != NULL) |
if (ftype != NULL) |
macro_nodeline(p, "Ft", ftype); |
macro_argline(p, "Ft", ftype->b); |
macro_open(p, "Fo"); |
macro_open(p, "Fo"); |
if (func == NULL) |
if (func == NULL) |
macro_addarg(p, "UNKNOWN", 0); |
macro_addarg(p, "UNKNOWN", ARG_SPACE); |
else |
else |
macro_addnode(p, func, 0); |
macro_addnode(p, func, ARG_SPACE | ARG_SINGLE); |
macro_close(p); |
macro_close(p); |
} |
} |
|
|
static void |
|
pnode_printparamdef(struct parse *p, struct pnode *pn) |
|
{ |
|
struct pnode *pp, *ptype, *param; |
|
int flags; |
|
|
|
ptype = param = NULL; |
|
TAILQ_FOREACH(pp, &pn->childq, child) { |
|
if (pp->node == NODE_TEXT) |
|
ptype = pp; |
|
else if (pp->node == NODE_PARAMETER) |
|
param = pp; |
|
} |
|
macro_open(p, "Fa \""); |
|
flags = MACROLINE_NOWS; |
|
if (ptype != NULL) { |
|
macro_addnode(p, ptype, flags); |
|
flags = 0; |
|
} |
|
if (param != NULL) |
|
macro_addnode(p, param, flags); |
|
flags = MACROLINE_NOWS; |
|
macro_addarg(p, "\"", flags); |
|
macro_close(p); |
|
} |
|
|
|
/* |
/* |
* The <mml:mfenced> node is a little peculiar. |
* The <mml:mfenced> node is a little peculiar. |
* First, it can have arbitrary open and closing tokens, which default |
* First, it can have arbitrary open and closing tokens, which default |
Line 944 pnode_printmathfenced(struct parse *p, struct pnode *p |
|
Line 960 pnode_printmathfenced(struct parse *p, struct pnode *p |
|
putchar(','); |
putchar(','); |
pnode_print(p, pp); |
pnode_print(p, pp); |
} |
} |
|
|
printf("right %s ", pnode_getattr_raw(pn, ATTRKEY_CLOSE, ")")); |
printf("right %s ", pnode_getattr_raw(pn, ATTRKEY_CLOSE, ")")); |
|
pnode_unlinksub(pn); |
} |
} |
|
|
/* |
/* |
Line 978 pnode_printmath(struct parse *p, struct pnode *pn) |
|
Line 994 pnode_printmath(struct parse *p, struct pnode *pn) |
|
|
|
pp = TAILQ_NEXT(pp, child); |
pp = TAILQ_NEXT(pp, child); |
pnode_print(p, pp); |
pnode_print(p, pp); |
|
pnode_unlinksub(pn); |
} |
} |
|
|
static void |
static void |
Line 996 pnode_printfuncprototype(struct parse *p, struct pnode |
|
Line 1013 pnode_printfuncprototype(struct parse *p, struct pnode |
|
|
|
TAILQ_FOREACH(pp, &pn->childq, child) |
TAILQ_FOREACH(pp, &pn->childq, child) |
if (pp->node == NODE_PARAMDEF) |
if (pp->node == NODE_PARAMDEF) |
pnode_printparamdef(p, pp); |
macro_nodeline(p, "Fa", pp, ARG_SINGLE); |
|
|
macro_line(p, "Fc"); |
macro_line(p, "Fc"); |
|
pnode_unlinksub(pn); |
} |
} |
|
|
/* |
/* |
Line 1032 pnode_printarg(struct parse *p, struct pnode *pn) |
|
Line 1050 pnode_printarg(struct parse *p, struct pnode *pn) |
|
macro_open(p, "Ar"); |
macro_open(p, "Ar"); |
pnode_print(p, pp); |
pnode_print(p, pp); |
if (isrep && pp->node == NODE_TEXT) |
if (isrep && pp->node == NODE_TEXT) |
macro_addarg(p, "...", 0); |
macro_addarg(p, "...", ARG_SPACE); |
} |
} |
|
pnode_unlinksub(pn); |
} |
} |
|
|
static void |
static void |
Line 1076 pnode_printgroup(struct parse *p, struct pnode *pn) |
|
Line 1095 pnode_printgroup(struct parse *p, struct pnode *pn) |
|
while (np != NULL) { |
while (np != NULL) { |
if (pp->node != np->node) |
if (pp->node != np->node) |
break; |
break; |
macro_addarg(p, "|", 0); |
macro_addarg(p, "|", ARG_SPACE); |
macro_addnode(p, np, 0); |
macro_addnode(p, np, ARG_SPACE); |
pp = np; |
pp = np; |
np = TAILQ_NEXT(np, child); |
np = TAILQ_NEXT(np, child); |
} |
} |
} |
} |
if (sv) |
if (sv) |
macro_close(p); |
macro_close(p); |
|
pnode_unlinksub(pn); |
} |
} |
|
|
static void |
static void |
Line 1095 pnode_printprologue(struct parse *p, struct pnode *pn) |
|
Line 1115 pnode_printprologue(struct parse *p, struct pnode *pn) |
|
pnode_findfirst(p->root, NODE_REFMETA); |
pnode_findfirst(p->root, NODE_REFMETA); |
|
|
macro_line(p, "Dd $Mdocdate" "$"); |
macro_line(p, "Dd $Mdocdate" "$"); |
if (pp != NULL) { |
if (pp != NULL) |
pnode_printrefmeta(p, pp); |
pnode_printrefmeta(p, pp); |
pnode_unlink(pp); |
else { |
} else { |
|
macro_open(p, "Dt"); |
macro_open(p, "Dt"); |
macro_addarg(p, |
macro_addarg(p, |
pnode_getattr_raw(p->root, ATTRKEY_ID, "UNKNOWN"), 0); |
pnode_getattr_raw(p->root, ATTRKEY_ID, "UNKNOWN"), |
macro_addarg(p, "1", 0); |
ARG_SPACE | ARG_SINGLE | ARG_UPPER); |
|
macro_addarg(p, "1", ARG_SPACE); |
macro_close(p); |
macro_close(p); |
} |
} |
macro_line(p, "Os"); |
macro_line(p, "Os"); |
|
|
if (p->flags & PARSE_EQN) { |
if (p->flags & PARSE_EQN) { |
macro_line(p, "EQ"); |
macro_line(p, "EQ"); |
puts("delim $$"); |
print_text(p, "delim $$"); |
macro_line(p, "EN"); |
macro_line(p, "EN"); |
} |
} |
} |
} |
Line 1129 pnode_printvarlistentry(struct parse *p, struct pnode |
|
Line 1149 pnode_printvarlistentry(struct parse *p, struct pnode |
|
if (pp->node != NODE_TERM) |
if (pp->node != NODE_TERM) |
continue; |
continue; |
if ( ! first) |
if ( ! first) |
putchar(','); |
macro_addarg(p, ",", 0); |
pnode_print(p, pp); |
pnode_print(p, pp); |
first = 0; |
first = 0; |
} |
} |
Line 1137 pnode_printvarlistentry(struct parse *p, struct pnode |
|
Line 1157 pnode_printvarlistentry(struct parse *p, struct pnode |
|
TAILQ_FOREACH(pp, &pn->childq, child) |
TAILQ_FOREACH(pp, &pn->childq, child) |
if (pp->node != NODE_TERM) |
if (pp->node != NODE_TERM) |
pnode_print(p, pp); |
pnode_print(p, pp); |
|
pnode_unlinksub(pn); |
} |
} |
|
|
static void |
static void |
|
pnode_printtitle(struct parse *p, struct pnode *pn) |
|
{ |
|
struct pnode *pp, *pq; |
|
|
|
TAILQ_FOREACH_SAFE(pp, &pn->childq, child, pq) { |
|
if (pp->node == NODE_TITLE) { |
|
pnode_printpara(p, pp); |
|
pnode_print(p, pp); |
|
pnode_unlink(pp); |
|
} |
|
} |
|
} |
|
|
|
static void |
pnode_printrow(struct parse *p, struct pnode *pn) |
pnode_printrow(struct parse *p, struct pnode *pn) |
{ |
{ |
struct pnode *pp; |
struct pnode *pp; |
Line 1150 pnode_printrow(struct parse *p, struct pnode *pn) |
|
Line 1185 pnode_printrow(struct parse *p, struct pnode *pn) |
|
pnode_print(p, pp); |
pnode_print(p, pp); |
} |
} |
macro_line(p, "El"); |
macro_line(p, "El"); |
|
pnode_unlink(pn); |
} |
} |
|
|
static void |
static void |
Line 1157 pnode_printtable(struct parse *p, struct pnode *pn) |
|
Line 1193 pnode_printtable(struct parse *p, struct pnode *pn) |
|
{ |
{ |
struct pnode *pp; |
struct pnode *pp; |
|
|
TAILQ_FOREACH(pp, &pn->childq, child) { |
pnode_printtitle(p, pn); |
if (pp->node == NODE_TITLE) { |
|
pnode_printpara(p, pp); |
|
pnode_print(p, pp); |
|
pnode_unlink(pp); |
|
} |
|
} |
|
macro_line(p, "Bl -ohang"); |
macro_line(p, "Bl -ohang"); |
while ((pp = pnode_findfirst(pn, NODE_ROW)) != NULL) { |
while ((pp = pnode_findfirst(pn, NODE_ROW)) != NULL) { |
macro_line(p, "It Table Row"); |
macro_line(p, "It Table Row"); |
pnode_printrow(p, pp); |
pnode_printrow(p, pp); |
pnode_unlink(pp); |
|
} |
} |
macro_line(p, "El"); |
macro_line(p, "El"); |
|
pnode_unlinksub(pn); |
} |
} |
|
|
static void |
static void |
Line 1178 pnode_printlist(struct parse *p, struct pnode *pn) |
|
Line 1208 pnode_printlist(struct parse *p, struct pnode *pn) |
|
{ |
{ |
struct pnode *pp; |
struct pnode *pp; |
|
|
TAILQ_FOREACH(pp, &pn->childq, child) { |
pnode_printtitle(p, pn); |
if (pp->node == NODE_TITLE) { |
|
pnode_printpara(p, pp); |
|
pnode_print(p, pp); |
|
pnode_unlink(pp); |
|
} |
|
} |
|
macro_argline(p, "Bl", |
macro_argline(p, "Bl", |
pn->node == NODE_ORDEREDLIST ? "-enum" : "-bullet"); |
pn->node == NODE_ORDEREDLIST ? "-enum" : "-bullet"); |
TAILQ_FOREACH(pp, &pn->childq, child) { |
TAILQ_FOREACH(pp, &pn->childq, child) { |
Line 1192 pnode_printlist(struct parse *p, struct pnode *pn) |
|
Line 1216 pnode_printlist(struct parse *p, struct pnode *pn) |
|
pnode_print(p, pp); |
pnode_print(p, pp); |
} |
} |
macro_line(p, "El"); |
macro_line(p, "El"); |
|
pnode_unlinksub(pn); |
} |
} |
|
|
static void |
static void |
Line 1199 pnode_printvariablelist(struct parse *p, struct pnode |
|
Line 1224 pnode_printvariablelist(struct parse *p, struct pnode |
|
{ |
{ |
struct pnode *pp; |
struct pnode *pp; |
|
|
TAILQ_FOREACH(pp, &pn->childq, child) { |
pnode_printtitle(p, pn); |
if (pp->node == NODE_TITLE) { |
|
pnode_printpara(p, pp); |
|
pnode_print(p, pp); |
|
pnode_unlink(pp); |
|
} |
|
} |
|
macro_line(p, "Bl -tag -width Ds"); |
macro_line(p, "Bl -tag -width Ds"); |
TAILQ_FOREACH(pp, &pn->childq, child) { |
TAILQ_FOREACH(pp, &pn->childq, child) { |
if (pp->node == NODE_VARLISTENTRY) |
if (pp->node == NODE_VARLISTENTRY) |
pnode_print(p, pp); |
pnode_print(p, pp); |
else |
else |
macro_nodeline(p, "It", pp); |
macro_nodeline(p, "It", pp, 0); |
} |
} |
macro_line(p, "El"); |
macro_line(p, "El"); |
|
pnode_unlinksub(pn); |
} |
} |
|
|
/* |
/* |
Line 1245 pnode_print(struct parse *p, struct pnode *pn) |
|
Line 1265 pnode_print(struct parse *p, struct pnode *pn) |
|
return; |
return; |
case NODE_ARG: |
case NODE_ARG: |
pnode_printarg(p, pn); |
pnode_printarg(p, pn); |
pnode_unlinksub(pn); |
|
break; |
break; |
case NODE_AUTHOR: |
case NODE_AUTHOR: |
macro_open(p, "An"); |
macro_open(p, "An"); |
Line 1258 pnode_print(struct parse *p, struct pnode *pn) |
|
Line 1277 pnode_print(struct parse *p, struct pnode *pn) |
|
break; |
break; |
case NODE_CITEREFENTRY: |
case NODE_CITEREFENTRY: |
pnode_printciterefentry(p, pn); |
pnode_printciterefentry(p, pn); |
pnode_unlinksub(pn); |
|
break; |
break; |
case NODE_CITETITLE: |
case NODE_CITETITLE: |
macro_open(p, "%T"); |
macro_open(p, "%T"); |
Line 1273 pnode_print(struct parse *p, struct pnode *pn) |
|
Line 1291 pnode_print(struct parse *p, struct pnode *pn) |
|
macro_open(p, "Dv"); |
macro_open(p, "Dv"); |
break; |
break; |
case NODE_EDITOR: |
case NODE_EDITOR: |
if (p->linestate != LINE_NEW) |
print_text(p, "editor:"); |
putchar('\n'); |
|
puts("editor:"); |
|
p->linestate = LINE_TEXT; |
|
macro_open(p, "An"); |
macro_open(p, "An"); |
break; |
break; |
case NODE_EMAIL: |
case NODE_EMAIL: |
Line 1297 pnode_print(struct parse *p, struct pnode *pn) |
|
Line 1312 pnode_print(struct parse *p, struct pnode *pn) |
|
break; |
break; |
case NODE_FUNCPROTOTYPE: |
case NODE_FUNCPROTOTYPE: |
pnode_printfuncprototype(p, pn); |
pnode_printfuncprototype(p, pn); |
pnode_unlinksub(pn); |
|
break; |
break; |
case NODE_FUNCSYNOPSISINFO: |
case NODE_FUNCSYNOPSISINFO: |
macro_open(p, "Fd"); |
macro_open(p, "Fd"); |
Line 1314 pnode_print(struct parse *p, struct pnode *pn) |
|
Line 1328 pnode_print(struct parse *p, struct pnode *pn) |
|
break; |
break; |
case NODE_ITEMIZEDLIST: |
case NODE_ITEMIZEDLIST: |
pnode_printlist(p, pn); |
pnode_printlist(p, pn); |
pnode_unlinksub(pn); |
|
break; |
break; |
case NODE_GROUP: |
case NODE_GROUP: |
pnode_printgroup(p, pn); |
pnode_printgroup(p, pn); |
pnode_unlinksub(pn); |
|
break; |
break; |
case NODE_KEYSYM: |
case NODE_KEYSYM: |
macro_open(p, "Sy"); |
macro_open(p, "Sy"); |
Line 1341 pnode_print(struct parse *p, struct pnode *pn) |
|
Line 1353 pnode_print(struct parse *p, struct pnode *pn) |
|
break; |
break; |
case NODE_MML_MFENCED: |
case NODE_MML_MFENCED: |
pnode_printmathfenced(p, pn); |
pnode_printmathfenced(p, pn); |
pnode_unlinksub(pn); |
|
break; |
break; |
case NODE_MML_MROW: |
case NODE_MML_MROW: |
case NODE_MML_MI: |
case NODE_MML_MI: |
Line 1355 pnode_print(struct parse *p, struct pnode *pn) |
|
Line 1366 pnode_print(struct parse *p, struct pnode *pn) |
|
case NODE_MML_MSUB: |
case NODE_MML_MSUB: |
case NODE_MML_MSUP: |
case NODE_MML_MSUP: |
pnode_printmath(p, pn); |
pnode_printmath(p, pn); |
pnode_unlinksub(pn); |
|
break; |
break; |
case NODE_OPTION: |
case NODE_OPTION: |
macro_open(p, "Fl"); |
macro_open(p, "Fl"); |
break; |
break; |
case NODE_ORDEREDLIST: |
case NODE_ORDEREDLIST: |
pnode_printlist(p, pn); |
pnode_printlist(p, pn); |
pnode_unlinksub(pn); |
|
break; |
break; |
case NODE_PARA: |
case NODE_PARA: |
pnode_printpara(p, pn); |
pnode_printpara(p, pn); |
break; |
break; |
case NODE_PARAMETER: |
case NODE_PARAMETER: |
/* Suppress non-text children... */ |
macro_nodeline(p, "Fa", pn, ARG_SINGLE); |
macro_open(p, "Fa \""); |
|
macro_addnode(p, pn, MACROLINE_NOWS); |
|
macro_addarg(p, "\"", MACROLINE_NOWS); |
|
macro_close(p); |
|
pnode_unlinksub(pn); |
pnode_unlinksub(pn); |
break; |
break; |
case NODE_QUOTE: |
case NODE_QUOTE: |
Line 1391 pnode_print(struct parse *p, struct pnode *pn) |
|
Line 1396 pnode_print(struct parse *p, struct pnode *pn) |
|
break; |
break; |
case NODE_REFNAME: |
case NODE_REFNAME: |
/* Suppress non-text children... */ |
/* Suppress non-text children... */ |
macro_nodeline(p, "Nm", pn); |
macro_open(p, "Nm"); |
|
macro_addnode(p, pn, ARG_SPACE | ARG_SINGLE); |
pnode_unlinksub(pn); |
pnode_unlinksub(pn); |
break; |
break; |
case NODE_REFNAMEDIV: |
case NODE_REFNAMEDIV: |
Line 1402 pnode_print(struct parse *p, struct pnode *pn) |
|
Line 1408 pnode_print(struct parse *p, struct pnode *pn) |
|
break; |
break; |
case NODE_REFSYNOPSISDIV: |
case NODE_REFSYNOPSISDIV: |
pnode_printrefsynopsisdiv(p, pn); |
pnode_printrefsynopsisdiv(p, pn); |
macro_line(p, "Sh SYNOPSIS"); |
|
break; |
break; |
case NODE_PREFACE: |
case NODE_PREFACE: |
case NODE_SECTION: |
case NODE_SECTION: |
Line 1427 pnode_print(struct parse *p, struct pnode *pn) |
|
Line 1432 pnode_print(struct parse *p, struct pnode *pn) |
|
case NODE_TABLE: |
case NODE_TABLE: |
case NODE_INFORMALTABLE: |
case NODE_INFORMALTABLE: |
pnode_printtable(p, pn); |
pnode_printtable(p, pn); |
pnode_unlinksub(pn); |
|
break; |
break; |
case NODE_TEXT: |
case NODE_TEXT: |
bufclear(p); |
if (pn->bsz == 0) { |
bufappend(p, pn); |
|
if (p->bsz == 0) { |
|
assert(pn->real != pn->b); |
assert(pn->real != pn->b); |
break; |
break; |
} |
} |
Line 1447 pnode_print(struct parse *p, struct pnode *pn) |
|
Line 1449 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. |
*/ |
*/ |
cp = p->b; |
cp = pn->b; |
|
|
/* |
/* |
* There's often a superfluous "-" in its <option> tags |
* There's often a superfluous "-" in its <option> tags |
Line 1486 pnode_print(struct parse *p, struct pnode *pn) |
|
Line 1488 pnode_print(struct parse *p, struct pnode *pn) |
|
break; |
break; |
case NODE_VARIABLELIST: |
case NODE_VARIABLELIST: |
pnode_printvariablelist(p, pn); |
pnode_printvariablelist(p, pn); |
pnode_unlinksub(pn); |
|
break; |
break; |
case NODE_VARLISTENTRY: |
case NODE_VARLISTENTRY: |
pnode_printvarlistentry(p, pn); |
pnode_printvarlistentry(p, pn); |
pnode_unlinksub(pn); |
|
break; |
break; |
case NODE_VARNAME: |
case NODE_VARNAME: |
macro_open(p, "Va"); |
macro_open(p, "Va"); |
Line 1566 pnode_print(struct parse *p, struct pnode *pn) |
|
Line 1566 pnode_print(struct parse *p, struct pnode *pn) |
|
pn->parent->node == NODE_REFNAMEDIV && |
pn->parent->node == NODE_REFNAMEDIV && |
TAILQ_NEXT(pn, child) != NULL && |
TAILQ_NEXT(pn, child) != NULL && |
TAILQ_NEXT(pn, child)->node == NODE_REFNAME) |
TAILQ_NEXT(pn, child)->node == NODE_REFNAME) |
fputs(" ,", stdout); |
macro_addarg(p, ",", ARG_SPACE); |
if (sv == LINE_NEW) |
if (sv == LINE_NEW) |
macro_close(p); |
macro_close(p); |
break; |
break; |
Line 1606 readfile(XML_Parser xp, int fd, |
|
Line 1606 readfile(XML_Parser xp, int fd, |
|
|
|
memset(&p, 0, sizeof(struct parse)); |
memset(&p, 0, sizeof(struct parse)); |
|
|
p.b = malloc(p.bsz = p.mbsz = 1024); |
|
p.fname = fn; |
p.fname = fn; |
p.xml = xp; |
p.xml = xp; |
|
|
Line 1633 readfile(XML_Parser xp, int fd, |
|
Line 1632 readfile(XML_Parser xp, int fd, |
|
if (p.linestate != LINE_NEW) |
if (p.linestate != LINE_NEW) |
putchar('\n'); |
putchar('\n'); |
pnode_free(p.root); |
pnode_free(p.root); |
free(p.b); |
|
return rc != 0 && p.stop == 0; |
return rc != 0 && p.stop == 0; |
} |
} |
|
|
/* Read error has occured. */ |
/* Read error has occured. */ |
perror(fn); |
perror(fn); |
pnode_free(p.root); |
pnode_free(p.root); |
free(p.b); |
|
return 0; |
return 0; |
} |
} |
|
|