version 1.60, 2019/03/22 17:01:10 |
version 1.63, 2019/03/22 18:02:07 |
Line 268 xml_char(void *arg, const XML_Char *p, int sz) |
|
Line 268 xml_char(void *arg, const XML_Char *p, int sz) |
|
dat = calloc(1, sizeof(struct pnode)); |
dat = calloc(1, sizeof(struct pnode)); |
if (NULL == dat) { |
if (NULL == dat) { |
perror(NULL); |
perror(NULL); |
exit(EXIT_FAILURE); |
exit(1); |
} |
} |
|
|
dat->node = ps->node = NODE_TEXT; |
dat->node = ps->node = NODE_TEXT; |
Line 286 xml_char(void *arg, const XML_Char *p, int sz) |
|
Line 286 xml_char(void *arg, const XML_Char *p, int sz) |
|
ps->cur->bsz + (size_t)sz); |
ps->cur->bsz + (size_t)sz); |
if (NULL == ps->cur->b) { |
if (NULL == ps->cur->b) { |
perror(NULL); |
perror(NULL); |
exit(EXIT_FAILURE); |
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 += (size_t)sz; |
Line 366 xml_elem_start(void *arg, const XML_Char *name, const |
|
Line 366 xml_elem_start(void *arg, const XML_Char *name, const |
|
|
|
if (NULL == (dat = calloc(1, sizeof(struct pnode)))) { |
if (NULL == (dat = calloc(1, sizeof(struct pnode)))) { |
perror(NULL); |
perror(NULL); |
exit(EXIT_FAILURE); |
exit(1); |
} |
} |
|
|
dat->node = ps->node = node->node; |
dat->node = ps->node = node->node; |
Line 504 pnode_getattr(struct pnode *pn, enum attrkey key) |
|
Line 504 pnode_getattr(struct pnode *pn, enum attrkey key) |
|
TAILQ_FOREACH(ap, &pn->attrq, child) |
TAILQ_FOREACH(ap, &pn->attrq, child) |
if (ap->key == key) |
if (ap->key == key) |
return ap->val; |
return ap->val; |
return(ATTRVAL__MAX); |
return ATTRVAL__MAX; |
} |
} |
|
|
/* |
/* |
Line 520 pnode_getattr_raw(struct pnode *pn, enum attrkey key, |
|
Line 520 pnode_getattr_raw(struct pnode *pn, enum attrkey key, |
|
if (ap->key == key) |
if (ap->key == key) |
return ATTRVAL__MAX == ap->val ? ap->rawval : |
return ATTRVAL__MAX == ap->val ? ap->rawval : |
attrvals[ap->val]; |
attrvals[ap->val]; |
return(defval); |
return defval; |
} |
} |
|
|
/* |
/* |
Line 547 bufappend(struct parse *p, struct pnode *pn) |
|
Line 547 bufappend(struct parse *p, struct pnode *pn) |
|
p->mbsz = p->bsz + pn->bsz + 1; |
p->mbsz = p->bsz + pn->bsz + 1; |
if (NULL == (p->b = realloc(p->b, p->mbsz))) { |
if (NULL == (p->b = realloc(p->b, p->mbsz))) { |
perror(NULL); |
perror(NULL); |
exit(EXIT_FAILURE); |
exit(1); |
} |
} |
} |
} |
memcpy(p->b + p->bsz, pn->b, pn->bsz); |
memcpy(p->b + p->bsz, pn->b, pn->bsz); |
Line 588 pnode_findfirst(struct pnode *pn, enum nodeid node) |
|
Line 588 pnode_findfirst(struct pnode *pn, enum nodeid node) |
|
break; |
break; |
} |
} |
|
|
return(res); |
return res; |
} |
} |
|
|
#define MACROLINE_NORM 0 |
#define MACROLINE_NORM 0 |
Line 720 pnode_printpara(struct parse *p, struct pnode *pn) |
|
Line 720 pnode_printpara(struct parse *p, struct pnode *pn) |
|
struct pnode *pp; |
struct pnode *pp; |
|
|
assert(p->newln); |
assert(p->newln); |
if (NULL == pn->parent || NODE_LISTITEM == pn->parent->node) |
if ((pp = TAILQ_PREV(pn, pnodeq, child)) == NULL && |
|
(pp = pn->parent) == NULL) |
return; |
return; |
|
|
pp = TAILQ_PREV(pn, pnodeq, child); |
switch (pp->node) { |
if (NULL == pp) |
case NODE_ENTRY: |
pp = pn->parent; |
case NODE_LISTITEM: |
if ((NODE_SECTION != pp->node && NODE_PREFACE != pp->node) || |
return; |
2 < p->level) |
case NODE_PREFACE: |
puts(".Pp"); |
case NODE_SECTION: |
|
if (p->level < 3) |
|
return; |
|
break; |
|
default: |
|
break; |
|
} |
|
puts(".Pp"); |
} |
} |
|
|
/* |
/* |
Line 763 pnode_printrefsect(struct parse *p, struct pnode *pn) |
|
Line 771 pnode_printrefsect(struct parse *p, struct pnode *pn) |
|
flags = 1 == level ? MACROLINE_UPPER : 0; |
flags = 1 == level ? MACROLINE_UPPER : 0; |
if (3 > level) { |
if (3 > level) { |
switch (pn->node) { |
switch (pn->node) { |
case (NODE_CAUTION): |
case NODE_CAUTION: |
case (NODE_NOTE): |
case NODE_NOTE: |
case (NODE_TIP): |
case NODE_TIP: |
case (NODE_WARNING): |
case NODE_WARNING: |
level = 3; |
level = 3; |
break; |
break; |
default: |
default: |
Line 780 pnode_printrefsect(struct parse *p, struct pnode *pn) |
|
Line 788 pnode_printrefsect(struct parse *p, struct pnode *pn) |
|
|
|
if (NULL == pp) { |
if (NULL == pp) { |
switch (pn->node) { |
switch (pn->node) { |
case (NODE_PREFACE): |
case NODE_PREFACE: |
title = "Preface"; |
title = "Preface"; |
break; |
break; |
case (NODE_CAUTION): |
case NODE_CAUTION: |
title = "Caution"; |
title = "Caution"; |
break; |
break; |
case (NODE_NOTE): |
case NODE_NOTE: |
title = "Note"; |
title = "Note"; |
break; |
break; |
case (NODE_TIP): |
case NODE_TIP: |
title = "Tip"; |
title = "Tip"; |
break; |
break; |
case (NODE_WARNING): |
case NODE_WARNING: |
title = "Warning"; |
title = "Warning"; |
break; |
break; |
default: |
default: |
Line 802 pnode_printrefsect(struct parse *p, struct pnode *pn) |
|
Line 810 pnode_printrefsect(struct parse *p, struct pnode *pn) |
|
} |
} |
|
|
switch (level) { |
switch (level) { |
case (1): |
case 1: |
fputs(".Sh", stdout); |
fputs(".Sh", stdout); |
break; |
break; |
case (2): |
case 2: |
fputs(".Ss", stdout); |
fputs(".Ss", stdout); |
break; |
break; |
default: |
default: |
Line 973 pnode_printmath(struct parse *p, struct pnode *pn) |
|
Line 981 pnode_printmath(struct parse *p, struct pnode *pn) |
|
pnode_print(p, pp); |
pnode_print(p, pp); |
|
|
switch (pn->node) { |
switch (pn->node) { |
case (NODE_MML_MSUP): |
case NODE_MML_MSUP: |
fputs(" sup ", stdout); |
fputs(" sup ", stdout); |
break; |
break; |
case (NODE_MML_MFRAC): |
case NODE_MML_MFRAC: |
fputs(" over ", stdout); |
fputs(" over ", stdout); |
break; |
break; |
case (NODE_MML_MSUB): |
case NODE_MML_MSUB: |
fputs(" sub ", stdout); |
fputs(" sub ", stdout); |
break; |
break; |
default: |
default: |
Line 1275 pnode_print(struct parse *p, struct pnode *pn) |
|
Line 1283 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); |
fputs("Nm", stdout); |
fputs("Nm", stdout); |
break; |
break; |
case (NODE_ANCHOR): |
case NODE_ANCHOR: |
/* Don't print anything! */ |
/* Don't print anything! */ |
return; |
return; |
case (NODE_ARG): |
case NODE_ARG: |
pnode_printarg(p, pn); |
pnode_printarg(p, pn); |
pnode_unlinksub(pn); |
pnode_unlinksub(pn); |
break; |
break; |
case (NODE_AUTHOR): |
case NODE_AUTHOR: |
pnode_printmopen(p); |
pnode_printmopen(p); |
fputs("An", stdout); |
fputs("An", stdout); |
break; |
break; |
case (NODE_AUTHORGROUP): |
case NODE_AUTHORGROUP: |
assert(p->newln); |
assert(p->newln); |
puts(".An -split"); |
puts(".An -split"); |
break; |
break; |
case (NODE_BOOKINFO): |
case NODE_BOOKINFO: |
assert(p->newln); |
assert(p->newln); |
puts(".Sh NAME"); |
puts(".Sh NAME"); |
break; |
break; |
case (NODE_CITEREFENTRY): |
case NODE_CITEREFENTRY: |
pnode_printmopen(p); |
pnode_printmopen(p); |
fputs("Xr", stdout); |
fputs("Xr", stdout); |
pnode_printciterefentry(p, pn); |
pnode_printciterefentry(p, pn); |
pnode_unlinksub(pn); |
pnode_unlinksub(pn); |
break; |
break; |
case (NODE_CODE): |
case NODE_CODE: |
pnode_printmopen(p); |
pnode_printmopen(p); |
fputs("Li", stdout); |
fputs("Li", stdout); |
break; |
break; |
case (NODE_COMMAND): |
case NODE_COMMAND: |
pnode_printmopen(p); |
pnode_printmopen(p); |
fputs("Nm", stdout); |
fputs("Nm", stdout); |
break; |
break; |
case (NODE_CONSTANT): |
case NODE_CONSTANT: |
pnode_printmopen(p); |
pnode_printmopen(p); |
fputs("Dv", stdout); |
fputs("Dv", stdout); |
break; |
break; |
case (NODE_EDITOR): |
case NODE_EDITOR: |
puts("editor: "); |
puts("editor: "); |
pnode_printmopen(p); |
pnode_printmopen(p); |
fputs("An", stdout); |
fputs("An", stdout); |
break; |
break; |
case (NODE_EMPHASIS): |
case NODE_EMPHASIS: |
case (NODE_FIRSTTERM): |
case NODE_FIRSTTERM: |
pnode_printmopen(p); |
pnode_printmopen(p); |
fputs("Em", stdout); |
fputs("Em", stdout); |
break; |
break; |
case (NODE_ENVAR): |
case NODE_ENVAR: |
pnode_printmopen(p); |
pnode_printmopen(p); |
fputs("Ev", stdout); |
fputs("Ev", stdout); |
break; |
break; |
case (NODE_FILENAME): |
case NODE_FILENAME: |
pnode_printmopen(p); |
pnode_printmopen(p); |
fputs("Pa", stdout); |
fputs("Pa", stdout); |
break; |
break; |
case (NODE_FUNCTION): |
case NODE_FUNCTION: |
pnode_printmopen(p); |
pnode_printmopen(p); |
fputs("Fn", stdout); |
fputs("Fn", stdout); |
break; |
break; |
case (NODE_FUNCPROTOTYPE): |
case NODE_FUNCPROTOTYPE: |
assert(p->newln); |
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: |
pnode_printmopen(p); |
pnode_printmopen(p); |
fputs("Fd", stdout); |
fputs("Fd", stdout); |
break; |
break; |
case (NODE_INDEXTERM): |
case NODE_INDEXTERM: |
return; |
return; |
case (NODE_INFORMALEQUATION): |
case NODE_INFORMALEQUATION: |
if ( ! p->newln) |
if ( ! p->newln) |
putchar('\n'); |
putchar('\n'); |
puts(".EQ"); |
puts(".EQ"); |
p->newln = 0; |
p->newln = 0; |
break; |
break; |
case (NODE_INLINEEQUATION): |
case NODE_INLINEEQUATION: |
fputc('$', stdout); |
fputc('$', stdout); |
p->newln = 0; |
p->newln = 0; |
break; |
break; |
case (NODE_ITEMIZEDLIST): |
case NODE_ITEMIZEDLIST: |
assert(p->newln); |
assert(p->newln); |
pnode_printlist(p, pn); |
pnode_printlist(p, pn); |
pnode_unlinksub(pn); |
pnode_unlinksub(pn); |
break; |
break; |
case (NODE_GROUP): |
case NODE_GROUP: |
pnode_printgroup(p, pn); |
pnode_printgroup(p, pn); |
pnode_unlinksub(pn); |
pnode_unlinksub(pn); |
break; |
break; |
case (NODE_LEGALNOTICE): |
case NODE_LEGALNOTICE: |
assert(p->newln); |
assert(p->newln); |
puts(".Sh LEGAL NOTICE"); |
puts(".Sh LEGAL NOTICE"); |
break; |
break; |
case (NODE_LINK): |
case NODE_LINK: |
ccp = pnode_getattr_raw(pn, ATTRKEY_LINKEND, NULL); |
ccp = pnode_getattr_raw(pn, ATTRKEY_LINKEND, NULL); |
if (NULL == ccp) |
if (NULL == ccp) |
break; |
break; |
Line 1382 pnode_print(struct parse *p, struct pnode *pn) |
|
Line 1389 pnode_print(struct parse *p, struct pnode *pn) |
|
printf("Sx %s\n", ccp); |
printf("Sx %s\n", ccp); |
p->newln = 1; |
p->newln = 1; |
return; |
return; |
case (NODE_LITERAL): |
case NODE_LITERAL: |
pnode_printmopen(p); |
pnode_printmopen(p); |
fputs("Li", stdout); |
fputs("Li", stdout); |
break; |
break; |
case (NODE_LITERALLAYOUT): |
case NODE_LITERALLAYOUT: |
assert(p->newln); |
assert(p->newln); |
puts(".Bd -literal"); |
puts(".Bd -literal"); |
break; |
break; |
case (NODE_MML_MFENCED): |
case NODE_MML_MFENCED: |
pnode_printmathfenced(p, pn); |
pnode_printmathfenced(p, pn); |
pnode_unlinksub(pn); |
pnode_unlinksub(pn); |
break; |
break; |
case (NODE_MML_MROW): |
case NODE_MML_MROW: |
case (NODE_MML_MI): |
case NODE_MML_MI: |
case (NODE_MML_MN): |
case NODE_MML_MN: |
case (NODE_MML_MO): |
case NODE_MML_MO: |
if (TAILQ_EMPTY(&pn->childq)) |
if (TAILQ_EMPTY(&pn->childq)) |
break; |
break; |
fputs(" { ", stdout); |
fputs(" { ", stdout); |
break; |
break; |
case (NODE_MML_MFRAC): |
case NODE_MML_MFRAC: |
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); |
pnode_unlinksub(pn); |
break; |
break; |
case (NODE_OPTION): |
case NODE_OPTION: |
pnode_printmopen(p); |
pnode_printmopen(p); |
fputs("Fl", stdout); |
fputs("Fl", stdout); |
break; |
break; |
case (NODE_ORDEREDLIST): |
case NODE_ORDEREDLIST: |
assert(p->newln); |
assert(p->newln); |
pnode_printlist(p, pn); |
pnode_printlist(p, pn); |
pnode_unlinksub(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... */ |
/* Suppress non-text children... */ |
pnode_printmopen(p); |
pnode_printmopen(p); |
fputs("Fa \"", stdout); |
fputs("Fa \"", stdout); |
Line 1428 pnode_print(struct parse *p, struct pnode *pn) |
|
Line 1435 pnode_print(struct parse *p, struct pnode *pn) |
|
fputs("\"", stdout); |
fputs("\"", stdout); |
pnode_unlinksub(pn); |
pnode_unlinksub(pn); |
break; |
break; |
case (NODE_QUOTE): |
case NODE_QUOTE: |
pnode_printmopen(p); |
pnode_printmopen(p); |
fputs("Qo", stdout); |
fputs("Qo", stdout); |
break; |
break; |
case (NODE_PROGRAMLISTING): |
case NODE_PROGRAMLISTING: |
case (NODE_SCREEN): |
case NODE_SCREEN: |
assert(p->newln); |
assert(p->newln); |
printf(".Bd %s\n", ATTRVAL_MONOSPACED == |
printf(".Bd %s\n", ATTRVAL_MONOSPACED == |
pnode_getattr(pn, ATTRKEY_CLASS) ? |
pnode_getattr(pn, ATTRKEY_CLASS) ? |
"-literal" : "-unfilled"); |
"-literal" : "-unfilled"); |
break; |
break; |
case (NODE_REFENTRYINFO): |
case NODE_REFENTRYINFO: |
/* Suppress. */ |
/* Suppress. */ |
pnode_unlinksub(pn); |
pnode_unlinksub(pn); |
break; |
break; |
case (NODE_REFMETA): |
case NODE_REFMETA: |
abort(); |
abort(); |
break; |
break; |
case (NODE_REFNAME): |
case NODE_REFNAME: |
/* Suppress non-text children... */ |
/* Suppress non-text children... */ |
pnode_printmopen(p); |
pnode_printmopen(p); |
fputs("Nm", stdout); |
fputs("Nm", stdout); |
Line 1454 pnode_print(struct parse *p, struct pnode *pn) |
|
Line 1461 pnode_print(struct parse *p, struct pnode *pn) |
|
pnode_printmacrolinepart(p, pn); |
pnode_printmacrolinepart(p, pn); |
pnode_unlinksub(pn); |
pnode_unlinksub(pn); |
break; |
break; |
case (NODE_REFNAMEDIV): |
case NODE_REFNAMEDIV: |
assert(p->newln); |
assert(p->newln); |
puts(".Sh NAME"); |
puts(".Sh NAME"); |
break; |
break; |
case (NODE_REFPURPOSE): |
case NODE_REFPURPOSE: |
assert(p->newln); |
assert(p->newln); |
pnode_printmopen(p); |
pnode_printmopen(p); |
fputs("Nd", stdout); |
fputs("Nd", stdout); |
break; |
break; |
case (NODE_REFSYNOPSISDIV): |
case NODE_REFSYNOPSISDIV: |
assert(p->newln); |
assert(p->newln); |
pnode_printrefsynopsisdiv(p, pn); |
pnode_printrefsynopsisdiv(p, pn); |
puts(".Sh SYNOPSIS"); |
puts(".Sh SYNOPSIS"); |
break; |
break; |
case (NODE_PREFACE): |
case NODE_PREFACE: |
case (NODE_SECTION): |
case NODE_SECTION: |
case (NODE_NOTE): |
case NODE_NOTE: |
case (NODE_TIP): |
case NODE_TIP: |
case (NODE_CAUTION): |
case NODE_CAUTION: |
case (NODE_WARNING): |
case NODE_WARNING: |
assert(p->newln); |
assert(p->newln); |
pnode_printrefsect(p, pn); |
pnode_printrefsect(p, pn); |
break; |
break; |
case (NODE_REPLACEABLE): |
case NODE_REPLACEABLE: |
pnode_printmopen(p); |
pnode_printmopen(p); |
fputs("Ar", stdout); |
fputs("Ar", stdout); |
break; |
break; |
case (NODE_SBR): |
case NODE_SBR: |
assert(p->newln); |
assert(p->newln); |
puts(".br"); |
puts(".br"); |
break; |
break; |
case (NODE_SGMLTAG): |
case NODE_SGMLTAG: |
pnode_printmopen(p); |
pnode_printmopen(p); |
fputs("Li", stdout); |
fputs("Li", stdout); |
break; |
break; |
case (NODE_STRUCTNAME): |
case NODE_STRUCTNAME: |
pnode_printmopen(p); |
pnode_printmopen(p); |
fputs("Vt", stdout); |
fputs("Vt", stdout); |
break; |
break; |
case (NODE_TABLE): |
case NODE_TABLE: |
/* FALLTHROUGH */ |
case NODE_INFORMALTABLE: |
case (NODE_INFORMALTABLE): |
|
assert(p->newln); |
assert(p->newln); |
pnode_printtable(p, pn); |
pnode_printtable(p, pn); |
pnode_unlinksub(pn); |
pnode_unlinksub(pn); |
break; |
break; |
case (NODE_TEXT): |
case NODE_TEXT: |
if (0 == p->newln) |
if (0 == p->newln) |
putchar(' '); |
putchar(' '); |
|
|
Line 1547 pnode_print(struct parse *p, struct pnode *pn) |
|
Line 1553 pnode_print(struct parse *p, struct pnode *pn) |
|
} |
} |
p->newln = 0; |
p->newln = 0; |
break; |
break; |
case (NODE_TITLE): |
case NODE_TITLE: |
if (pn->parent->node == NODE_BOOKINFO) { |
if (pn->parent->node == NODE_BOOKINFO) { |
pnode_printmopen(p); |
pnode_printmopen(p); |
fputs("Nd", stdout); |
fputs("Nd", stdout); |
} |
} |
break; |
break; |
case (NODE_TYPE): |
case NODE_TYPE: |
pnode_printmopen(p); |
pnode_printmopen(p); |
fputs("Vt", stdout); |
fputs("Vt", stdout); |
break; |
break; |
case (NODE_USERINPUT): |
case NODE_USERINPUT: |
pnode_printmopen(p); |
pnode_printmopen(p); |
fputs("Li", stdout); |
fputs("Li", stdout); |
break; |
break; |
case (NODE_VARIABLELIST): |
case NODE_VARIABLELIST: |
assert(p->newln); |
assert(p->newln); |
pnode_printvariablelist(p, pn); |
pnode_printvariablelist(p, pn); |
pnode_unlinksub(pn); |
pnode_unlinksub(pn); |
break; |
break; |
case (NODE_VARLISTENTRY): |
case NODE_VARLISTENTRY: |
assert(p->newln); |
assert(p->newln); |
pnode_printvarlistentry(p, pn); |
pnode_printvarlistentry(p, pn); |
break; |
break; |
case (NODE_VARNAME): |
case NODE_VARNAME: |
pnode_printmopen(p); |
pnode_printmopen(p); |
fputs("Va", stdout); |
fputs("Va", stdout); |
break; |
break; |
Line 1582 pnode_print(struct parse *p, struct pnode *pn) |
|
Line 1588 pnode_print(struct parse *p, struct pnode *pn) |
|
pnode_print(p, pp); |
pnode_print(p, pp); |
|
|
switch (pn->node) { |
switch (pn->node) { |
case (NODE_INFORMALEQUATION): |
case NODE_INFORMALEQUATION: |
if ( ! p->newln) |
if ( ! p->newln) |
putchar('\n'); |
putchar('\n'); |
puts(".EN"); |
puts(".EN"); |
p->newln = 1; |
p->newln = 1; |
break; |
break; |
case (NODE_INLINEEQUATION): |
case NODE_INLINEEQUATION: |
fputs("$ ", stdout); |
fputs("$ ", stdout); |
p->newln = sv; |
p->newln = sv; |
break; |
break; |
case (NODE_MML_MROW): |
case NODE_MML_MROW: |
case (NODE_MML_MI): |
case NODE_MML_MI: |
case (NODE_MML_MN): |
case NODE_MML_MN: |
case (NODE_MML_MO): |
case NODE_MML_MO: |
if (TAILQ_EMPTY(&pn->childq)) |
if (TAILQ_EMPTY(&pn->childq)) |
break; |
break; |
fputs(" } ", stdout); |
fputs(" } ", stdout); |
break; |
break; |
case (NODE_APPLICATION): |
case NODE_APPLICATION: |
case (NODE_ARG): |
case NODE_ARG: |
case (NODE_AUTHOR): |
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_EDITOR: |
case (NODE_EMPHASIS): |
case NODE_EMPHASIS: |
case (NODE_ENVAR): |
case NODE_ENVAR: |
case (NODE_FILENAME): |
case NODE_FILENAME: |
case (NODE_FIRSTTERM): |
case NODE_FIRSTTERM: |
case (NODE_FUNCTION): |
case NODE_FUNCTION: |
case (NODE_FUNCSYNOPSISINFO): |
case NODE_FUNCSYNOPSISINFO: |
case (NODE_LITERAL): |
case NODE_LITERAL: |
case (NODE_OPTION): |
case NODE_OPTION: |
case (NODE_PARAMETER): |
case NODE_PARAMETER: |
case (NODE_REPLACEABLE): |
case NODE_REPLACEABLE: |
case (NODE_REFPURPOSE): |
case NODE_REFPURPOSE: |
case (NODE_SGMLTAG): |
case NODE_SGMLTAG: |
case (NODE_STRUCTNAME): |
case NODE_STRUCTNAME: |
case (NODE_TEXT): |
case NODE_TEXT: |
case (NODE_TYPE): |
case NODE_TYPE: |
case (NODE_USERINPUT): |
case NODE_USERINPUT: |
case (NODE_VARNAME): |
case NODE_VARNAME: |
pnode_printmclosepunct(p, pn, sv); |
pnode_printmclosepunct(p, pn, sv); |
break; |
break; |
case (NODE_QUOTE): |
case NODE_QUOTE: |
pnode_printmclose(p, sv); |
pnode_printmclose(p, sv); |
sv = p->newln; |
sv = p->newln; |
pnode_printmopen(p); |
pnode_printmopen(p); |
fputs("Qc", stdout); |
fputs("Qc", stdout); |
pnode_printmclose(p, sv); |
pnode_printmclose(p, sv); |
break; |
break; |
case (NODE_REFNAME): |
case NODE_REFNAME: |
/* |
/* |
* If we're in the NAME macro and we have multiple |
* If we're in the NAME macro and we have multiple |
* <refname> macros in sequence, then print out a |
* <refname> macros in sequence, then print out a |
Line 1647 pnode_print(struct parse *p, struct pnode *pn) |
|
Line 1653 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_PREFACE: |
case (NODE_SECTION): |
case NODE_SECTION: |
case (NODE_NOTE): |
case NODE_NOTE: |
case (NODE_TIP): |
case NODE_TIP: |
case (NODE_CAUTION): |
case NODE_CAUTION: |
case (NODE_WARNING): |
case NODE_WARNING: |
p->level--; |
p->level--; |
break; |
break; |
case (NODE_LITERALLAYOUT): |
case NODE_LITERALLAYOUT: |
/* FALLTHROUGH */ |
case NODE_PROGRAMLISTING: |
case (NODE_PROGRAMLISTING): |
case NODE_SCREEN: |
/* FALLTHROUGH */ |
|
case (NODE_SCREEN): |
|
assert(p->newln); |
assert(p->newln); |
puts(".Ed"); |
puts(".Ed"); |
p->newln = 1; |
p->newln = 1; |
break; |
break; |
case (NODE_TITLE): |
case NODE_TITLE: |
if (pn->parent->node == NODE_BOOKINFO) { |
if (pn->parent->node == NODE_BOOKINFO) { |
pnode_printmclose(p, 1); |
pnode_printmclose(p, 1); |
puts(".Sh AUTHORS"); |
puts(".Sh AUTHORS"); |
Line 1715 readfile(XML_Parser xp, int fd, |
|
Line 1719 readfile(XML_Parser xp, int fd, |
|
pnode_print(&p, p.root); |
pnode_print(&p, p.root); |
pnode_free(p.root); |
pnode_free(p.root); |
free(p.b); |
free(p.b); |
return(0 != rc && ! p.stop); |
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); |
free(p.b); |
return(0); |
return 0; |
} |
} |
|
|
int |
int |
Line 1743 main(int argc, char *argv[]) |
|
Line 1747 main(int argc, char *argv[]) |
|
fname = "-"; |
fname = "-"; |
xp = NULL; |
xp = NULL; |
buf = NULL; |
buf = NULL; |
rc = 0; |
rc = 1; |
|
|
while (-1 != (ch = getopt(argc, argv, "W"))) |
while (-1 != (ch = getopt(argc, argv, "W"))) |
switch (ch) { |
switch (ch) { |
case ('W'): |
case 'W': |
warn = 1; |
warn = 1; |
break; |
break; |
default: |
default: |
Line 1779 main(int argc, char *argv[]) |
|
Line 1783 main(int argc, char *argv[]) |
|
perror(NULL); |
perror(NULL); |
else if (NULL == (xp = XML_ParserCreate(NULL))) |
else if (NULL == (xp = XML_ParserCreate(NULL))) |
perror(NULL); |
perror(NULL); |
else if ( ! readfile(xp, fd, buf, 4096, fname)) |
else if (readfile(xp, fd, buf, 4096, fname)) |
rc = 1; |
rc = 0; |
|
|
XML_ParserFree(xp); |
XML_ParserFree(xp); |
free(buf); |
free(buf); |
if (STDIN_FILENO != fd) |
if (STDIN_FILENO != fd) |
close(fd); |
close(fd); |
return(rc ? EXIT_SUCCESS : EXIT_FAILURE); |
return rc; |
|
|
usage: |
usage: |
fprintf(stderr, "usage: %s [-W] [input_filename]\n", progname); |
fprintf(stderr, "usage: %s [-W] [input_filename]\n", progname); |
return(EXIT_FAILURE); |
return 1; |
} |
} |