- free(m->last->args->argv[i].value[0]);
- m->last->args->argv[i].value[0] = strdup(buf);
- if (NULL == m->last->args->argv[i].value[0])
- return(verr(m, EMALLOC));
+ free(n->args->argv[i].value[0]);
+ n->args->argv[i].value[0] = strdup(buf);
+ if (NULL == n->args->argv[i].value[0])
+ return(mdoc_nerr(m, n, EMALLOC));
+
+ return(1);
+}
+
+
+/* ARGSUSED */
+static int
+post_bl_head(POST_ARGS)
+{
+ int i, c;
+ struct mdoc_node *np, *nn, *nnp;
+
+ if (NULL == n->child)
+ return(1);
+
+ np = n->parent;
+ assert(np->args);
+
+ for (c = 0; c < (int)np->args->argc; c++)
+ if (MDOC_Column == np->args->argv[c].arg)
+ break;
+
+ /* Only process -column. */
+
+ if (c == (int)np->args->argc)
+ return(1);
+
+ assert(0 == np->args->argv[c].sz);
+
+ /*
+ * Accomodate for new-style groff column syntax. Shuffle the
+ * child nodes, all of which must be TEXT, as arguments for the
+ * column field. Then, delete the head children.
+ */
+
+ np->args->argv[c].sz = (size_t)n->nchild;
+ np->args->argv[c].value = malloc
+ ((size_t)n->nchild * sizeof(char *));
+
+ for (i = 0, nn = n->child; nn; i++) {
+ np->args->argv[c].value[i] = nn->string;
+ nn->string = NULL;
+ nnp = nn;
+ nn = nn->next;
+ mdoc_node_free(nnp);
+ }
+
+ n->nchild = 0;
+ n->child = NULL;