Annotation of mandoc/man_hash.c, Revision 1.23
1.23 ! schwarze 1: /* $Id: man_hash.c,v 1.22 2010/06/19 20:46:28 kristaps 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: #ifdef HAVE_CONFIG_H
18: #include "config.h"
19: #endif
20:
1.15 kristaps 21: #include <sys/types.h>
22:
1.5 kristaps 23: #include <assert.h>
1.17 kristaps 24: #include <ctype.h>
1.12 kristaps 25: #include <limits.h>
1.1 kristaps 26: #include <stdlib.h>
27: #include <string.h>
28:
1.21 kristaps 29: #include "mandoc.h"
1.1 kristaps 30: #include "libman.h"
31:
1.17 kristaps 32: #define HASH_DEPTH 6
33:
34: #define HASH_ROW(x) do { \
1.20 kristaps 35: if (isupper((u_char)(x))) \
1.17 kristaps 36: (x) -= 65; \
37: else \
38: (x) -= 97; \
39: (x) *= HASH_DEPTH; \
40: } while (/* CONSTCOND */ 0)
41:
42: /*
43: * Lookup table is indexed first by lower-case first letter (plus one
44: * for the period, which is stored in the last row), then by lower or
45: * uppercase second letter. Buckets correspond to the index of the
46: * macro (the integer value of the enum stored as a char to save a bit
47: * of space).
48: */
1.20 kristaps 49: static u_char table[26 * HASH_DEPTH];
1.1 kristaps 50:
1.14 kristaps 51: /*
52: * XXX - this hash has global scope, so if intended for use as a library
53: * with multiple callers, it will need re-invocation protection.
54: */
1.12 kristaps 55: void
56: man_hash_init(void)
1.1 kristaps 57: {
1.5 kristaps 58: int i, j, x;
59:
1.12 kristaps 60: memset(table, UCHAR_MAX, sizeof(table));
1.5 kristaps 61:
1.18 kristaps 62: assert(/* LINTED */
63: MAN_MAX < UCHAR_MAX);
1.17 kristaps 64:
1.19 kristaps 65: for (i = 0; i < (int)MAN_MAX; i++) {
1.5 kristaps 66: x = man_macronames[i][0];
67:
1.20 kristaps 68: assert(isalpha((u_char)x));
1.5 kristaps 69:
1.17 kristaps 70: HASH_ROW(x);
71:
72: for (j = 0; j < HASH_DEPTH; j++)
1.12 kristaps 73: if (UCHAR_MAX == table[x + j]) {
1.13 kristaps 74: table[x + j] = (u_char)i;
1.5 kristaps 75: break;
76: }
1.17 kristaps 77:
78: assert(j < HASH_DEPTH);
1.5 kristaps 79: }
1.1 kristaps 80: }
81:
1.17 kristaps 82:
83: enum mant
1.12 kristaps 84: man_hash_find(const char *tmp)
1.1 kristaps 85: {
1.17 kristaps 86: int x, y, i;
87: enum mant tok;
1.2 kristaps 88:
1.17 kristaps 89: if ('\0' == (x = tmp[0]))
1.5 kristaps 90: return(MAN_MAX);
1.20 kristaps 91: if ( ! (isalpha((u_char)x)))
1.5 kristaps 92: return(MAN_MAX);
93:
1.17 kristaps 94: HASH_ROW(x);
1.5 kristaps 95:
1.17 kristaps 96: for (i = 0; i < HASH_DEPTH; i++) {
97: if (UCHAR_MAX == (y = table[x + i]))
1.5 kristaps 98: return(MAN_MAX);
1.17 kristaps 99:
100: tok = (enum mant)y;
1.5 kristaps 101: if (0 == strcmp(tmp, man_macronames[tok]))
102: return(tok);
103: }
1.1 kristaps 104:
105: return(MAN_MAX);
106: }
CVSweb