Support .RE with an argument; needed for audio/pms(1).

[mandoc.git] / man_hash.c

diff --git a/man_hash.c b/man_hash.c
index bfa6ec7724ff7e7e669586d8a0d08f8520adae84..1cbfb1b7f8e63380f41bad644545abe27ca4d4cf 100644 (file)
--- a/man_hash.c
+++ b/man_hash.c
@@ -1,60 +1,102 @@
-/* $Id: man_hash.c,v 1.3 2009/03/26 09:55:39 kristaps Exp $ */
+/*     $Id: man_hash.c,v 1.29 2014/12/01 08:05:52 schwarze Exp $ */
 /*
- * Copyright (c) 2008, 2009 Kristaps Dzonsons <kristaps@openbsd.org>
+ * Copyright (c) 2008, 2009, 2010 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 copyright notice and this permission notice appear in all
- * copies.
+ * purpose with or without fee is hereby granted, provided that the above
+ * copyright notice and this permission notice appear in all copies.
  *
- * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL
- * WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED
- * WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE
- * AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL
- * DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR
- * PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER
- * TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR
- * PERFORMANCE OF THIS SOFTWARE.
+ * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
+ * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
+ * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
+ * ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
+ * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
+ * 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 <err.h>
-#include <stdlib.h>
-#include <stdio.h>
+#include <limits.h>
 #include <string.h>
 
+#include "man.h"
 #include "libman.h"
 
-/* ARGUSED */
+#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)
+
+/*
+ * 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];
+
+
+/*
+ * XXX - this hash has global scope, so if intended for use as a library
+ * with multiple callers, it will need re-invocation protection.
+ */
 void
-man_hash_free(void *htab)
+man_hash_init(void)
 {
+       int              i, j, x;
 
-       /* Do nothing. */
-}
+       memset(table, UCHAR_MAX, sizeof(table));
 
+       assert(MAN_MAX < UCHAR_MAX);
 
-/* ARGUSED */
-void *
-man_hash_alloc(void)
-{
+       for (i = 0; i < (int)MAN_MAX; i++) {
+               x = man_macronames[i][0];
 
-       /* Do nothing. */
-       return(NULL);
-}
+               assert(isalpha((unsigned char)x));
 
+               HASH_ROW(x);
 
-int
-man_hash_find(const void *arg, const char *tmp)
+               for (j = 0; j < HASH_DEPTH; j++)
+                       if (UCHAR_MAX == table[x + j]) {
+                               table[x + j] = (unsigned char)i;
+                               break;
+                       }
+
+               assert(j < HASH_DEPTH);
+       }
+}
+
+enum mant
+man_hash_find(const char *tmp)
 {
-       int              i;
+       int              x, y, i;
+       enum mant        tok;
+
+       if ('\0' == (x = tmp[0]))
+               return(MAN_MAX);
+       if ( ! (isalpha((unsigned char)x)))
+               return(MAN_MAX);
 
-       /* TODO */
+       HASH_ROW(x);
 
-       for (i = 0; i < MAN_MAX; i++) 
-               if (0 == strcmp(tmp, man_macronames[i]))
-                       return(i);
+       for (i = 0; i < HASH_DEPTH; i++) {
+               if (UCHAR_MAX == (y = table[x + i]))
+                       return(MAN_MAX);
+
+               tok = (enum mant)y;
+               if (0 == strcmp(tmp, man_macronames[tok]))
+                       return(tok);
+       }
 
        return(MAN_MAX);
 }
-