Make HTML tags lower case for better stylistic agreement with what

[mandoc.git] / man_hash.c

diff --git a/man_hash.c b/man_hash.c
index 115a99812189a857e6de8e88a83edad198e8f3ed..8573994e5d530933181adeab397d9f18518d9b81 100644 (file)
--- a/man_hash.c
+++ b/man_hash.c
@@ -1,6 +1,7 @@
-/*     $Id: man_hash.c,v 1.12 2009/09/16 14:40:56 kristaps Exp $ */
+/*     $Id: man_hash.c,v 1.34 2015/10/06 18:32:19 schwarze Exp $ */
 /*
- * Copyright (c) 2008, 2009 Kristaps Dzonsons <kristaps@kth.se>
+ * Copyright (c) 2008, 2009, 2010 Kristaps Dzonsons <kristaps@bsd.lv>
+ * Copyright (c) 2015 Ingo Schwarze <schwarze@openbsd.org>
  *
  * Permission to use, copy, modify, and distribute this software for any
  * purpose with or without fee is hereby granted, provided that the above
@@ -14,15 +15,37 @@
  * 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>
+#include <ctype.h>
 #include <limits.h>
-#include <stdlib.h>
 #include <string.h>
 
+#include "roff.h"
+#include "man.h"
 #include "libman.h"
 
+#define        HASH_DEPTH       6
+
+#define        HASH_ROW(x) do { \
+               if (isupper((unsigned char)(x))) \
+                       (x) -= 65; \
+               else \
+                       (x) -= 97; \
+               (x) *= HASH_DEPTH; \
+       } while (/* CONSTCOND */ 0)
 
-static unsigned char   table[26 * 6];
+/*
+ * Lookup table is indexed first by lower-case first letter (plus one
+ * for the period, which is stored in the last row), then by lower or
+ * uppercase second letter.  Buckets correspond to the index of the
+ * macro (the integer value of the enum stored as a char to save a bit
+ * of space).
+ */
+static unsigned char    table[26 * HASH_DEPTH];
 
 
 void
@@ -30,45 +53,49 @@ man_hash_init(void)
 {
        int              i, j, x;
 
+       if (*table != '\0')
+               return;
+
        memset(table, UCHAR_MAX, sizeof(table));
 
-       for (i = 0; i < MAN_MAX; i++) {
+       for (i = 0; i < (int)MAN_MAX; i++) {
                x = man_macronames[i][0];
-               assert((x >= 65 && x <= 90) ||
-                               (x >= 97 && x <= 122));
 
-               x -= (x <= 90) ? 65 : 97;
-               x *= 6;
+               assert(isalpha((unsigned char)x));
+
+               HASH_ROW(x);
 
-               for (j = 0; j < 6; j++)
+               for (j = 0; j < HASH_DEPTH; j++)
                        if (UCHAR_MAX == table[x + j]) {
-                               table[x + j] = i;
+                               table[x + j] = (unsigned char)i;
                                break;
                        }
-               assert(j < 6);
+
+               assert(j < HASH_DEPTH);
        }
 }
 
-
 int
 man_hash_find(const char *tmp)
 {
-       int              x, i, tok;
+       int              x, y, i;
+       int              tok;
+
+       if ('\0' == (x = tmp[0]))
+               return TOKEN_NONE;
+       if ( ! (isalpha((unsigned char)x)))
+               return TOKEN_NONE;
 
-       if (0 == (x = tmp[0]))
-               return(MAN_MAX);
-       if ( ! ((x >= 65 && x <= 90) || (x >= 97 && x <= 122)))
-               return(MAN_MAX);
+       HASH_ROW(x);
 
-       x -= (x <= 90) ? 65 : 97;
-       x *= 6;
+       for (i = 0; i < HASH_DEPTH; i++) {
+               if (UCHAR_MAX == (y = table[x + i]))
+                       return TOKEN_NONE;
 
-       for (i = 0; i < 6; i++) {
-               if (UCHAR_MAX == (tok = table[x + i]))
-                       return(MAN_MAX);
+               tok = y;
                if (0 == strcmp(tmp, man_macronames[tok]))
-                       return(tok);
+                       return tok;
        }
 
-       return(MAN_MAX);
+       return TOKEN_NONE;
 }