version 1.53, 2019/03/22 16:25:42 |
version 1.55, 2019/03/22 16:35:41 |
Line 690 pnode_printmclosepunct(struct parse *p, struct pnode * |
|
Line 690 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; |
|
switch (pp->node) { |
|
case (NODE_CHAPTER): |
|
case (NODE_PREFACE): |
|
case (NODE_REFSECT1): |
|
case (NODE_REFSECT2): |
|
case (NODE_REFSECT3): |
|
case (NODE_REFSECTION): |
|
case (NODE_SECT1): |
|
case (NODE_SECT2): |
|
case (NODE_SECTION): |
|
if (2 > p->level) |
|
return; |
|
break; |
|
default: |
|
break; |
|
} |
|
puts(".Pp"); |
|
} |
|
|
/* |
/* |
* If the SYNOPSIS macro has a superfluous title, kill it. |
* If the SYNOPSIS macro has a superfluous title, kill it. |
*/ |
*/ |
Line 765 pnode_printrefsect(struct parse *p, struct pnode *pn) |
|
Line 796 pnode_printrefsect(struct parse *p, struct pnode *pn) |
|
fputs(".Ss", stdout); |
fputs(".Ss", stdout); |
break; |
break; |
default: |
default: |
puts(".Pp"); |
pnode_printpara(p, pn); |
fputs(".Sy", stdout); |
fputs(".Sy", stdout); |
break; |
break; |
} |
} |
Line 1161 pnode_printtable(struct parse *p, struct pnode *pn) |
|
Line 1192 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 1185 pnode_printlist(struct parse *p, struct pnode *pn) |
|
Line 1216 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 1214 pnode_printvariablelist(struct parse *p, struct pnode |
|
Line 1245 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); |
} |
} |
Line 1325 pnode_print(struct parse *p, struct pnode *pn) |
|
Line 1356 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 1380 pnode_print(struct parse *p, struct pnode *pn) |
|
Line 1413 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... */ |