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