=================================================================== RCS file: /cvs/mandoc/Attic/man_action.c,v retrieving revision 1.2 retrieving revision 1.5 diff -u -p -r1.2 -r1.5 --- mandoc/Attic/man_action.c 2009/03/25 16:07:36 1.2 +++ mandoc/Attic/man_action.c 2009/03/26 14:38:11 1.5 @@ -1,4 +1,4 @@ -/* $Id: man_action.c,v 1.2 2009/03/25 16:07:36 kristaps Exp $ */ +/* $Id: man_action.c,v 1.5 2009/03/26 14:38:11 kristaps Exp $ */ /* * Copyright (c) 2008, 2009 Kristaps Dzonsons * @@ -27,6 +27,9 @@ #include "libman.h" +#ifdef __linux__ +extern char *strptime(const char *, const char *, struct tm *); +#endif struct actions { int (*post)(struct man *); @@ -34,7 +37,7 @@ struct actions { static int post_TH(struct man *); -static time_t man_atotime(const char *); +static time_t man_atotime(const char *); const struct actions man_actions[MAN_MAX] = { { NULL }, /* __ */ @@ -57,6 +60,7 @@ const struct actions man_actions[MAN_MAX] = { { NULL }, /* B */ { NULL }, /* I */ { NULL }, /* IR */ + { NULL }, /* RI */ }; @@ -122,12 +126,9 @@ post_TH(struct man *m) /* TITLE MSEC ->DATE<- SOURCE VOL */ - if (NULL == (n = n->next)) { + if (NULL == (n = n->next)) m->meta.date = time(NULL); - return(1); - } - - if (0 == (m->meta.date = man_atotime(n->string))) { + else if (0 == (m->meta.date = man_atotime(n->string))) { if ( ! man_vwarn(m, n->line, n->pos, "invalid date")) return(0); m->meta.date = time(NULL); @@ -135,13 +136,13 @@ post_TH(struct man *m) /* TITLE MSEC DATE ->SOURCE<- VOL */ - if ((n = n->next)) + if (n && (n = n->next)) if (NULL == (m->meta.source = strdup(n->string))) return(man_verr(m, n->line, n->pos, "malloc")); /* TITLE MSEC DATE SOURCE ->VOL<- */ - if ((n = n->next)) + if (n && (n = n->next)) if (NULL == (m->meta.vol = strdup(n->string))) return(man_verr(m, n->line, n->pos, "malloc")); @@ -150,12 +151,20 @@ post_TH(struct man *m) * of the syntax tree (they encompass only meta-data). */ - assert(MAN_ROOT == m->last->parent->type); - m->last->parent->child = NULL; - n = m->last; - m->last = m->last->parent; - m->next = MAN_NEXT_CHILD; - assert(m->last == m->first); + if (m->last->parent->child == m->last) { + assert(MAN_ROOT == m->last->parent->type); + m->last->parent->child = NULL; + n = m->last; + m->last = m->last->parent; + m->next = MAN_NEXT_CHILD; + assert(m->last == m->first); + } 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); return(1);