version 1.25, 2010/01/01 17:14:27 |
version 1.27, 2010/03/23 11:30:48 |
Line 68 const struct actions man_actions[MAN_MAX] = { |
|
Line 68 const struct actions man_actions[MAN_MAX] = { |
|
{ NULL }, /* DT */ |
{ NULL }, /* DT */ |
{ NULL }, /* UC */ |
{ NULL }, /* UC */ |
{ NULL }, /* PD */ |
{ NULL }, /* PD */ |
|
{ NULL }, /* Sp */ |
|
{ post_nf }, /* Vb */ |
|
{ post_fi }, /* Ve */ |
}; |
}; |
|
|
|
|
Line 178 post_TH(struct man *m) |
|
Line 181 post_TH(struct man *m) |
|
if (n && (n = n->next)) |
if (n && (n = n->next)) |
m->meta.vol = mandoc_strdup(n->string); |
m->meta.vol = mandoc_strdup(n->string); |
|
|
/* |
n = m->last; |
* The end document shouldn't have the prologue macros as part |
man_node_unlink(m, n); |
* of the syntax tree (they encompass only meta-data). |
|
*/ |
|
|
|
if (m->last->parent->child == m->last) { |
|
m->last->parent->child = NULL; |
|
n = m->last; |
|
m->last = m->last->parent; |
|
m->next = MAN_NEXT_CHILD; |
|
} else { |
|
assert(m->last->prev); |
|
m->last->prev->next = NULL; |
|
n = m->last; |
|
m->last = m->last->prev; |
|
m->next = MAN_NEXT_SIBLING; |
|
} |
|
|
|
man_node_freelist(n); |
man_node_freelist(n); |
return(1); |
return(1); |
} |
} |