recognize ".if n" as true;

[mandoc.git] / man_html.c

diff --git a/man_html.c b/man_html.c
index b5e69343d4179128502fd5d8fda33b6930f6bcce..abb1d4424dedadf6e130a8c3332a4b1ace775646 100644 (file)
--- a/man_html.c
+++ b/man_html.c
@@ -1,4 +1,4 @@
-/*     $Id: man_html.c,v 1.27 2010/03/22 05:59:32 kristaps Exp $ */
+/*     $Id: man_html.c,v 1.35 2010/05/17 22:11:42 kristaps Exp $ */
 /*
  * Copyright (c) 2008, 2009 Kristaps Dzonsons <kristaps@kth.se>
  *
@@ -26,6 +26,7 @@
 #include <stdlib.h>
 #include <string.h>
 
+#include "mandoc.h"
 #include "out.h"
 #include "html.h"
 #include "man.h"
@@ -103,6 +104,10 @@ static     const struct htmlman mans[MAN_MAX] = {
        { man_ign_pre, NULL }, /* DT */
        { man_ign_pre, NULL }, /* UC */
        { man_ign_pre, NULL }, /* PD */
+       { man_br_pre, NULL }, /* Sp */
+       { man_ign_pre, NULL }, /* Vb */
+       { NULL, NULL }, /* Ve */
+       { man_ign_pre, NULL }, /* AT */
 };
 
 
@@ -153,7 +158,7 @@ print_man_head(MAN_ARGS)
 
        print_gen_head(h);
        bufinit(h);
-       buffmt(h, "%s(%d)", m->title, m->msec);
+       buffmt(h, "%s(%s)", m->title, m->msec);
 
        print_otag(h, TAG_TITLE, 0, NULL);
        print_text(h, h->buf);
@@ -181,6 +186,12 @@ print_man_node(MAN_ARGS)
 
        bufinit(h);
 
+       /*
+        * FIXME: embedded elements within next-line scopes (e.g., `br'
+        * within an empty `B') will cause formatting to be forgotten
+        * due to scope closing out.
+        */
+
        switch (n->type) {
        case (MAN_ROOT):
                child = man_root_pre(m, n, h);
@@ -252,7 +263,7 @@ man_root_pre(MAN_ARGS)
        if (m->vol)
                (void)strlcat(b, m->vol, BUFSIZ);
 
-       snprintf(title, BUFSIZ - 1, "%s(%d)", m->title, m->msec);
+       snprintf(title, BUFSIZ - 1, "%s(%s)", m->title, m->msec);
 
        PAIR_CLASS_INIT(&tag[0], "header");
        bufcat_style(h, "width", "100%");
@@ -335,10 +346,18 @@ man_br_pre(MAN_ARGS)
 
        SCALE_VS_INIT(&su, 1);
 
-       if (MAN_sp == n->tok && n->child)
-               a2roffsu(n->child->string, &su, SCALE_VS);
-       else if (MAN_br == n->tok)
+       switch (n->tok) {
+       case (MAN_Sp):
+               SCALE_VS_INIT(&su, 0.5);
+               break;
+       case (MAN_sp):
+               if (n->child)
+                       a2roffsu(n->child->string, &su, SCALE_VS);
+               break;
+       default:
                su.scale = 0;
+               break;
+       }
 
        bufcat_su(h, "height", &su);
        PAIR_STYLE_INIT(&tag, h);
@@ -567,6 +586,8 @@ man_IP_pre(MAN_ARGS)
        SCALE_HS_INIT(&su, INDENT);
        width = 0;
 
+       /* Width is the last token. */
+
        if (MAN_IP == n->tok && NULL != nn)
                if (NULL != (nn = nn->next)) {
                        for ( ; nn->next; nn = nn->next)
@@ -574,11 +595,14 @@ man_IP_pre(MAN_ARGS)
                        width = a2width(nn, &su);
                }
 
+       /* Width is the first token. */
+
        if (MAN_TP == n->tok && NULL != nn) {
+               /* Skip past non-text children. */
                while (nn && MAN_TEXT != nn->type)
                        nn = nn->next;
-               /* FIXME: sync with pre_TP(), man_term.c */
-               width = a2width(nn, &su);
+               if (nn)
+                       width = a2width(nn, &su);
        }
 
        if (MAN_BLOCK == n->type) {
@@ -604,12 +628,19 @@ man_IP_pre(MAN_ARGS)
        PAIR_STYLE_INIT(&tag, h);
        print_otag(h, TAG_DIV, 1, &tag);
 
-       /* With a length string, manually omit the last child. */
+       /*
+        * Without a length string, we can print all of our children.
+        */
 
        if ( ! width)
                return(1);
 
-       /* FIXME: sync with pre_TP(), man_term.c */
+       /*
+        * When a length has been specified, we need to carefully print
+        * our child context:  IP gets all children printed but the last
+        * (the width), while TP gets all children printed but the first
+        * (the width).
+        */
 
        if (MAN_IP == n->tok)
                for (nn = n->child; nn->next; nn = nn->next)