Annotation of mandoc/man_hash.c, Revision 1.28
1.28 ! schwarze 1: /* $Id: man_hash.c,v 1.27 2014/04/20 16:46:04 schwarze Exp $ */
1.1 kristaps 2: /*
1.23 schwarze 3: * Copyright (c) 2008, 2009, 2010 Kristaps Dzonsons <kristaps@bsd.lv>
1.1 kristaps 4: *
5: * Permission to use, copy, modify, and distribute this software for any
1.7 kristaps 6: * purpose with or without fee is hereby granted, provided that the above
7: * copyright notice and this permission notice appear in all copies.
1.1 kristaps 8: *
1.7 kristaps 9: * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
10: * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
11: * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
12: * ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
13: * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
14: * ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
15: * OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
1.1 kristaps 16: */
1.16 kristaps 17: #include "config.h"
18:
1.15 kristaps 19: #include <sys/types.h>
20:
1.5 kristaps 21: #include <assert.h>
1.17 kristaps 22: #include <ctype.h>
1.12 kristaps 23: #include <limits.h>
1.1 kristaps 24: #include <string.h>
25:
1.24 kristaps 26: #include "man.h"
1.21 kristaps 27: #include "mandoc.h"
1.1 kristaps 28: #include "libman.h"
29:
1.17 kristaps 30: #define HASH_DEPTH 6
31:
32: #define HASH_ROW(x) do { \
1.25 kristaps 33: if (isupper((unsigned char)(x))) \
1.17 kristaps 34: (x) -= 65; \
35: else \
36: (x) -= 97; \
37: (x) *= HASH_DEPTH; \
38: } while (/* CONSTCOND */ 0)
39:
40: /*
41: * Lookup table is indexed first by lower-case first letter (plus one
42: * for the period, which is stored in the last row), then by lower or
43: * uppercase second letter. Buckets correspond to the index of the
44: * macro (the integer value of the enum stored as a char to save a bit
45: * of space).
46: */
1.25 kristaps 47: static unsigned char table[26 * HASH_DEPTH];
1.1 kristaps 48:
1.27 schwarze 49:
1.14 kristaps 50: /*
51: * XXX - this hash has global scope, so if intended for use as a library
52: * with multiple callers, it will need re-invocation protection.
53: */
1.12 kristaps 54: void
55: man_hash_init(void)
1.1 kristaps 56: {
1.5 kristaps 57: int i, j, x;
58:
1.12 kristaps 59: memset(table, UCHAR_MAX, sizeof(table));
1.5 kristaps 60:
1.27 schwarze 61: assert(MAN_MAX < UCHAR_MAX);
1.17 kristaps 62:
1.19 kristaps 63: for (i = 0; i < (int)MAN_MAX; i++) {
1.5 kristaps 64: x = man_macronames[i][0];
65:
1.25 kristaps 66: assert(isalpha((unsigned char)x));
1.5 kristaps 67:
1.17 kristaps 68: HASH_ROW(x);
69:
70: for (j = 0; j < HASH_DEPTH; j++)
1.12 kristaps 71: if (UCHAR_MAX == table[x + j]) {
1.25 kristaps 72: table[x + j] = (unsigned char)i;
1.5 kristaps 73: break;
74: }
1.17 kristaps 75:
76: assert(j < HASH_DEPTH);
1.5 kristaps 77: }
1.1 kristaps 78: }
1.17 kristaps 79:
80: enum mant
1.12 kristaps 81: man_hash_find(const char *tmp)
1.1 kristaps 82: {
1.17 kristaps 83: int x, y, i;
84: enum mant tok;
1.2 kristaps 85:
1.17 kristaps 86: if ('\0' == (x = tmp[0]))
1.5 kristaps 87: return(MAN_MAX);
1.25 kristaps 88: if ( ! (isalpha((unsigned char)x)))
1.5 kristaps 89: return(MAN_MAX);
90:
1.17 kristaps 91: HASH_ROW(x);
1.5 kristaps 92:
1.17 kristaps 93: for (i = 0; i < HASH_DEPTH; i++) {
94: if (UCHAR_MAX == (y = table[x + i]))
1.5 kristaps 95: return(MAN_MAX);
1.17 kristaps 96:
97: tok = (enum mant)y;
1.5 kristaps 98: if (0 == strcmp(tmp, man_macronames[tok]))
99: return(tok);
100: }
1.1 kristaps 101:
102: return(MAN_MAX);
103: }
CVSweb