Annotation of mandoc/man_hash.c, Revision 1.15
1.15 ! kristaps 1: /* $Id: man_hash.c,v 1.14 2009/09/17 07:41:28 kristaps Exp $ */
1.1 kristaps 2: /*
1.8 kristaps 3: * Copyright (c) 2008, 2009 Kristaps Dzonsons <kristaps@kth.se>
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.15 ! kristaps 17: #include <sys/types.h>
! 18:
1.5 kristaps 19: #include <assert.h>
1.12 kristaps 20: #include <limits.h>
1.1 kristaps 21: #include <stdlib.h>
22: #include <string.h>
23:
24: #include "libman.h"
25:
1.13 kristaps 26: static u_char table[26 * 6];
1.1 kristaps 27:
1.14 kristaps 28: /*
29: * XXX - this hash has global scope, so if intended for use as a library
30: * with multiple callers, it will need re-invocation protection.
31: */
1.12 kristaps 32: void
33: man_hash_init(void)
1.1 kristaps 34: {
1.5 kristaps 35: int i, j, x;
36:
1.12 kristaps 37: memset(table, UCHAR_MAX, sizeof(table));
1.5 kristaps 38:
1.9 kristaps 39: for (i = 0; i < MAN_MAX; i++) {
1.5 kristaps 40: x = man_macronames[i][0];
41: assert((x >= 65 && x <= 90) ||
42: (x >= 97 && x <= 122));
43:
44: x -= (x <= 90) ? 65 : 97;
1.11 kristaps 45: x *= 6;
1.5 kristaps 46:
1.11 kristaps 47: for (j = 0; j < 6; j++)
1.12 kristaps 48: if (UCHAR_MAX == table[x + j]) {
1.13 kristaps 49: table[x + j] = (u_char)i;
1.5 kristaps 50: break;
51: }
1.11 kristaps 52: assert(j < 6);
1.5 kristaps 53: }
1.1 kristaps 54: }
55:
56: int
1.12 kristaps 57: man_hash_find(const char *tmp)
1.1 kristaps 58: {
1.5 kristaps 59: int x, i, tok;
1.2 kristaps 60:
1.5 kristaps 61: if (0 == (x = tmp[0]))
62: return(MAN_MAX);
63: if ( ! ((x >= 65 && x <= 90) || (x >= 97 && x <= 122)))
64: return(MAN_MAX);
65:
66: x -= (x <= 90) ? 65 : 97;
1.11 kristaps 67: x *= 6;
1.5 kristaps 68:
1.11 kristaps 69: for (i = 0; i < 6; i++) {
1.12 kristaps 70: if (UCHAR_MAX == (tok = table[x + i]))
1.5 kristaps 71: return(MAN_MAX);
72: if (0 == strcmp(tmp, man_macronames[tok]))
73: return(tok);
74: }
1.1 kristaps 75:
76: return(MAN_MAX);
77: }
CVSweb