Fill mode changes don't break next-line scope in all cases,

[mandoc.git] / mdoc_hash.c

diff --git a/mdoc_hash.c b/mdoc_hash.c
index 757437c0c5e8a63afad841fb640866a4e9cef335..13cf227a2f252a0e88a00ac5049faed36b91e58a 100644 (file)
--- a/mdoc_hash.c
+++ b/mdoc_hash.c
@@ -1,6 +1,6 @@
-/*     $Id: mdoc_hash.c,v 1.10 2009/09/16 20:49:06 kristaps Exp $ */
+/*     $Id: mdoc_hash.c,v 1.25 2015/04/19 14:00:19 schwarze Exp $ */
 /*
- * Copyright (c) 2008, 2009 Kristaps Dzonsons <kristaps@kth.se>
+ * Copyright (c) 2008, 2009 Kristaps Dzonsons <kristaps@bsd.lv>
  *
  * Permission to use, copy, modify, and distribute this software for any
  * purpose with or without fee is hereby granted, provided that the above
@@ -14,6 +14,8 @@
  * ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
  * OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
  */
+#include "config.h"
+
 #include <sys/types.h>
 
 #include <assert.h>
@@ -23,9 +25,11 @@
 #include <stdio.h>
 #include <string.h>
 
+#include "roff.h"
+#include "mdoc.h"
 #include "libmdoc.h"
 
-static u_char           table[27 * 12];
+static unsigned char    table[27 * 12];
 
 
 void
@@ -34,19 +38,22 @@ mdoc_hash_init(void)
        int              i, j, major;
        const char      *p;
 
+       if (*table != '\0')
+               return;
+
        memset(table, UCHAR_MAX, sizeof(table));
 
-       for (i = 0; i < MDOC_MAX; i++) {
+       for (i = 0; i < (int)MDOC_MAX; i++) {
                p = mdoc_macronames[i];
 
-               if (isalpha((u_char)p[1]))
-                       major = 12 * (tolower((u_char)p[1]) - 97);
+               if (isalpha((unsigned char)p[1]))
+                       major = 12 * (tolower((unsigned char)p[1]) - 97);
                else
                        major = 12 * 26;
 
                for (j = 0; j < 12; j++)
                        if (UCHAR_MAX == table[major + j]) {
-                               table[major + j] = (u_char)i;
+                               table[major + j] = (unsigned char)i;
                                break;
                        }
 
@@ -54,26 +61,25 @@ mdoc_hash_init(void)
        }
 }
 
-
 int
 mdoc_hash_find(const char *p)
 {
        int               major, i, j;
 
        if (0 == p[0])
-               return(MDOC_MAX);
-       if ( ! isalpha((u_char)p[0]) && '%' != p[0])
-               return(MDOC_MAX);
+               return(TOKEN_NONE);
+       if ( ! isalpha((unsigned char)p[0]) && '%' != p[0])
+               return(TOKEN_NONE);
 
-       if (isalpha((u_char)p[1]))
-               major = 12 * (tolower((u_char)p[1]) - 97);
+       if (isalpha((unsigned char)p[1]))
+               major = 12 * (tolower((unsigned char)p[1]) - 97);
        else if ('1' == p[1])
                major = 12 * 26;
-       else 
-               return(MDOC_MAX);
+       else
+               return(TOKEN_NONE);
 
        if (p[2] && p[3])
-               return(MDOC_MAX);
+               return(TOKEN_NONE);
 
        for (j = 0; j < 12; j++) {
                if (UCHAR_MAX == (i = table[major + j]))
@@ -82,6 +88,5 @@ mdoc_hash_find(const char *p)
                        return(i);
        }
 
-       return(MDOC_MAX);
+       return(TOKEN_NONE);
 }
-