version 1.3, 2019/04/28 19:59:01 |
version 1.4, 2019/04/28 20:26:49 |
|
|
static void |
static void |
reorg_root(struct pnode *root) |
reorg_root(struct pnode *root) |
{ |
{ |
struct pnode *date, *descr, *name, *vol, *nc; |
struct pnode *date, *info, *name, *vol, *nc; |
|
|
if (root == NULL) |
if (root == NULL) |
return; |
return; |
Line 63 reorg_root(struct pnode *root) |
|
Line 63 reorg_root(struct pnode *root) |
|
/* Insert prologue information at the beginning. */ |
/* Insert prologue information at the beginning. */ |
|
|
if (pnode_findfirst(root, NODE_REFNAMEDIV) == NULL && |
if (pnode_findfirst(root, NODE_REFNAMEDIV) == NULL && |
((nc = pnode_findfirst(root, NODE_BOOKINFO)) != NULL || |
((info = pnode_findfirst(root, NODE_BOOKINFO)) != NULL || |
(nc = pnode_findfirst(root, NODE_REFENTRYINFO)) != NULL) && |
(info = pnode_findfirst(root, NODE_REFENTRYINFO)) != NULL)) { |
(descr = pnode_takefirst(nc, NODE_TITLE)) != NULL) |
if ((nc = pnode_takefirst(info, NODE_ABSTRACT)) != NULL) |
TAILQ_INSERT_HEAD(&root->childq, descr, child); |
TAILQ_INSERT_HEAD(&root->childq, nc, child); |
|
if ((nc = pnode_takefirst(info, NODE_TITLE)) != NULL) |
|
TAILQ_INSERT_HEAD(&root->childq, nc, child); |
|
} |
TAILQ_INSERT_HEAD(&root->childq, vol, child); |
TAILQ_INSERT_HEAD(&root->childq, vol, child); |
TAILQ_INSERT_HEAD(&root->childq, name, child); |
TAILQ_INSERT_HEAD(&root->childq, name, child); |
TAILQ_INSERT_HEAD(&root->childq, date, child); |
TAILQ_INSERT_HEAD(&root->childq, date, child); |
Line 215 reorg_recurse(struct pnode *n) |
|
Line 218 reorg_recurse(struct pnode *n) |
|
return; |
return; |
|
|
switch (n->node) { |
switch (n->node) { |
|
case NODE_ABSTRACT: |
|
default_title(n, "Abstract"); |
|
n->node = NODE_SECTION; |
|
break; |
case NODE_APPENDIX: |
case NODE_APPENDIX: |
if (n->parent == NULL) |
if (n->parent == NULL) |
reorg_refentry(n); |
reorg_refentry(n); |