=================================================================== RCS file: /cvs/docbook2mdoc/docbook2mdoc.c,v retrieving revision 1.118 retrieving revision 1.119 diff -u -p -r1.118 -r1.119 --- docbook2mdoc/docbook2mdoc.c 2019/04/13 15:54:45 1.118 +++ docbook2mdoc/docbook2mdoc.c 2019/04/14 12:38:33 1.119 @@ -1,4 +1,4 @@ -/* $Id: docbook2mdoc.c,v 1.118 2019/04/13 15:54:45 schwarze Exp $ */ +/* $Id: docbook2mdoc.c,v 1.119 2019/04/14 12:38:33 schwarze Exp $ */ /* * Copyright (c) 2014 Kristaps Dzonsons * Copyright (c) 2019 Ingo Schwarze @@ -30,6 +30,7 @@ */ static void pnode_print(struct format *, struct pnode *); +static void pnode_printrefentry(struct format *, struct pnode *); static void @@ -196,14 +197,16 @@ pnode_printrefsynopsisdiv(struct format *f, struct pno * Start a hopefully-named `Sh' section. */ static void -pnode_printrefsect(struct format *f, struct pnode *n) +pnode_printsection(struct format *f, struct pnode *n) { struct pnode *nc, *ncc; const char *title; int flags, level; - if (n->parent == NULL) + if (n->parent == NULL) { + pnode_printrefentry(f, n); return; + } level = ++f->level; flags = ARG_SPACE; @@ -652,7 +655,7 @@ pnode_printlink(struct format *f, struct pnode *n) static void pnode_printprologue(struct format *f, struct pnode *root) { - struct pnode *date, *refmeta, *name, *vol, *descr, *nc; + struct pnode *date, *refmeta, *name, *vol, *descr, *nc, *nn; const char *sname; /* Collect information. */ @@ -661,8 +664,8 @@ pnode_printprologue(struct format *f, struct pnode *ro date = pnode_takefirst(root, NODE_DATE); name = vol = NULL; - if ((refmeta = pnode_takefirst(root, NODE_REFMETA)) != NULL) { - TAILQ_FOREACH(nc, &refmeta->childq, child) { + if ((refmeta = pnode_findfirst(root, NODE_REFMETA)) != NULL) { + TAILQ_FOREACH_SAFE(nc, &refmeta->childq, child, nn) { switch (nc->node) { case NODE_REFENTRYTITLE: name = nc; @@ -671,8 +674,9 @@ pnode_printprologue(struct format *f, struct pnode *ro vol = nc; break; default: - break; + continue; } + TAILQ_REMOVE(&refmeta->childq, nc, child); } } @@ -715,10 +719,141 @@ pnode_printprologue(struct format *f, struct pnode *ro /* Clean up. */ pnode_unlink(date); - pnode_unlink(refmeta); + pnode_unlink(name); + pnode_unlink(vol); pnode_unlink(descr); } +static void +pnode_printrefentry(struct format *f, struct pnode *n) +{ + struct pnode *info, *meta, *nc, *title; + struct pnode *match, *later; + + /* Collect nodes that remained behind when writing the prologue. */ + + meta = NULL; + info = pnode_takefirst(n, NODE_BOOKINFO); + if (info != NULL && TAILQ_FIRST(&info->childq) == NULL) { + pnode_unlink(info); + info = NULL; + } + if (info == NULL) { + info = pnode_takefirst(n, NODE_REFENTRYINFO); + if (info != NULL && TAILQ_FIRST(&info->childq) == NULL) { + pnode_unlink(info); + info = NULL; + } + meta = pnode_takefirst(n, NODE_REFMETA); + if (meta != NULL && TAILQ_FIRST(&meta->childq) == NULL) { + pnode_unlink(meta); + meta = NULL; + } + } + if (info == NULL && meta == NULL) + return; + + /* + * Find the best place to put this information. + * Use the last existing AUTHORS node, if any. + * Otherwise, put it behind all standard sections that + * conventionally precede AUTHORS, and also behind any + * non-standard sections that follow the last of these, + * but before the next standard section. + */ + + match = later = NULL; + TAILQ_FOREACH(nc, &n->childq, child) { + switch (nc->node) { + case NODE_REFENTRY: + case NODE_REFNAMEDIV: + case NODE_REFSYNOPSISDIV: + case NODE_PREFACE: + later = NULL; + continue; + case NODE_APPENDIX: + case NODE_INDEX: + if (later == NULL) + later = nc; + continue; + default: + break; + } + if ((title = pnode_findfirst(nc, NODE_TITLE)) == NULL || + (title = TAILQ_FIRST(&title->childq)) == NULL || + title->node != NODE_TEXT) + continue; + if (strcasecmp(title->b, "AUTHORS") == 0 || + strcasecmp(title->b, "AUTHOR") == 0) + match = nc; + else if (strcasecmp(title->b, "NAME") == 0 || + strcasecmp(title->b, "SYNOPSIS") == 0 || + strcasecmp(title->b, "DESCRIPTION") == 0 || + strcasecmp(title->b, "RETURN VALUES") == 0 || + strcasecmp(title->b, "ENVIRONMENT") == 0 || + strcasecmp(title->b, "FILES") == 0 || + strcasecmp(title->b, "EXIT STATUS") == 0 || + strcasecmp(title->b, "EXAMPLES") == 0 || + strcasecmp(title->b, "DIAGNOSTICS") == 0 || + strcasecmp(title->b, "ERRORS") == 0 || + strcasecmp(title->b, "SEE ALSO") == 0 || + strcasecmp(title->b, "STANDARDS") == 0 || + strcasecmp(title->b, "HISTORY") == 0) + later = NULL; + else if ((strcasecmp(title->b, "CAVEATS") == 0 || + strcasecmp(title->b, "BUGS") == 0) && + later == NULL) + later = nc; + } + + /* + * If no AUTHORS section was found, create one from scratch, + * and insert that at the place selected earlier. + */ + + if (match == NULL) { + if ((match = calloc(1, sizeof(*match))) == NULL) { + perror(NULL); + exit(1); + } + match->node = NODE_SECTION; + match->spc = 1; + match->parent = n; + TAILQ_INIT(&match->childq); + TAILQ_INIT(&match->attrq); + if ((nc = pnode_alloc(match)) == NULL) { + perror(NULL); + exit(1); + } + nc->node = NODE_TITLE; + nc->spc = 1; + if ((nc = pnode_alloc(nc)) == NULL) { + perror(NULL); + exit(1); + } + nc->node = NODE_TEXT; + if ((nc->b = strdup("AUTHORS")) == NULL) { + perror(NULL); + exit(1); + } + nc->spc = 1; + if (later == NULL) + TAILQ_INSERT_TAIL(&n->childq, match, child); + else + TAILQ_INSERT_BEFORE(later, match, child); + } + + /* + * Dump the stuff excised at the beginning + * into this AUTHORS section. + */ + + if (info != NULL) + TAILQ_INSERT_TAIL(&match->childq, info, child); + if (meta != NULL) + TAILQ_INSERT_TAIL(&match->childq, meta, child); +} + /* * We can have multiple elements within a , which * we should comma-separate as list headers. @@ -1046,9 +1181,8 @@ pnode_print(struct format *f, struct pnode *n) case NODE_SYSTEMITEM: pnode_printsystemitem(f, n); break; - case NODE_REFENTRYINFO: - /* Suppress. */ - pnode_unlinksub(n); + case NODE_REFENTRY: + pnode_printrefentry(f, n); break; case NODE_REFNAME: /* More often, these appear inside NODE_REFNAMEDIV. */ @@ -1071,7 +1205,7 @@ pnode_print(struct format *f, struct pnode *n) case NODE_TIP: case NODE_CAUTION: case NODE_WARNING: - pnode_printrefsect(f, n); + pnode_printsection(f, n); break; case NODE_REPLACEABLE: macro_open(f, "Ar");