-/* $Id: man_hash.c,v 1.7 2009/04/12 19:45:26 kristaps Exp $ */
+/* $Id: man_hash.c,v 1.35 2016/07/15 18:03:45 schwarze Exp $ */
/*
- * Copyright (c) 2008, 2009 Kristaps Dzonsons <kristaps@openbsd.org>
+ * 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
* 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 <stdlib.h>
+#include <ctype.h>
+#include <limits.h>
#include <string.h>
+#include "mandoc.h"
+#include "roff.h"
+#include "man.h"
+#include "libmandoc.h"
#include "libman.h"
+#define HASH_DEPTH 6
-/* ARGUSED */
-void
-man_hash_free(void *htab)
-{
+#define HASH_ROW(x) do { \
+ if (isupper((unsigned char)(x))) \
+ (x) -= 65; \
+ else \
+ (x) -= 97; \
+ (x) *= HASH_DEPTH; \
+ } while (/* CONSTCOND */ 0)
- free(htab);
-}
+/*
+ * 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];
-/* ARGUSED */
-void *
-man_hash_alloc(void)
+void
+man_hash_init(void)
{
- int *htab;
int i, j, x;
- htab = calloc(26 * 5, sizeof(int));
- if (NULL == htab)
- return(NULL);
+ if (*table != '\0')
+ return;
+
+ memset(table, UCHAR_MAX, sizeof(table));
- for (i = 1; 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));
+ assert(isalpha((unsigned char)x));
- x -= (x <= 90) ? 65 : 97;
- x *= 5;
+ HASH_ROW(x);
- for (j = 0; j < 5; j++)
- if (0 == htab[x + j]) {
- htab[x + j] = i;
+ for (j = 0; j < HASH_DEPTH; j++)
+ if (UCHAR_MAX == table[x + j]) {
+ table[x + j] = (unsigned char)i;
break;
}
- assert(j < 5);
+ assert(j < HASH_DEPTH);
}
-
- return((void *)htab);
}
-
int
-man_hash_find(const void *arg, const char *tmp)
+man_hash_find(const char *tmp)
{
- int x, i, tok;
- const int *htab;
+ int x, y, i;
+ int tok;
- htab = (const int *)arg;
+ 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 *= 5;
+ for (i = 0; i < HASH_DEPTH; i++) {
+ if (UCHAR_MAX == (y = table[x + i]))
+ return TOKEN_NONE;
- for (i = 0; i < 5; i++) {
- if (0 == (tok = htab[x + i]))
- return(MAN_MAX);
+ tok = y;
if (0 == strcmp(tmp, man_macronames[tok]))
- return(tok);
+ return tok;
}
- return(MAN_MAX);
+ return TOKEN_NONE;
}
-