Annotation of src/usr.bin/mandoc/mdoc_hash.c, Revision 1.8
1.8 ! schwarze 1: /* $Id: mdoc_hash.c,v 1.7 2010/03/02 00:38:59 schwarze Exp $ */
1.1 kristaps 2: /*
1.2 schwarze 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.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.5 schwarze 17: #include <sys/types.h>
18:
1.1 kristaps 19: #include <assert.h>
20: #include <ctype.h>
1.6 schwarze 21: #include <limits.h>
1.1 kristaps 22: #include <stdlib.h>
23: #include <stdio.h>
24: #include <string.h>
25:
26: #include "libmdoc.h"
27:
1.7 schwarze 28: static u_char table[27 * 13];
1.1 kristaps 29:
1.6 schwarze 30: /*
31: * XXX - this hash has global scope, so if intended for use as a library
32: * with multiple callers, it will need re-invocation protection.
33: */
1.1 kristaps 34: void
1.6 schwarze 35: mdoc_hash_init(void)
1.1 kristaps 36: {
1.6 schwarze 37: int i, j, major;
38: const char *p;
1.1 kristaps 39:
1.6 schwarze 40: memset(table, UCHAR_MAX, sizeof(table));
1.1 kristaps 41:
1.3 schwarze 42: for (i = 0; i < MDOC_MAX; i++) {
1.6 schwarze 43: p = mdoc_macronames[i];
1.1 kristaps 44:
1.6 schwarze 45: if (isalpha((u_char)p[1]))
1.7 schwarze 46: major = 13 * (tolower((u_char)p[1]) - 97);
1.6 schwarze 47: else
1.7 schwarze 48: major = 13 * 26;
1.6 schwarze 49:
1.7 schwarze 50: for (j = 0; j < 13; j++)
1.6 schwarze 51: if (UCHAR_MAX == table[major + j]) {
52: table[major + j] = (u_char)i;
53: break;
54: }
1.1 kristaps 55:
1.7 schwarze 56: assert(j < 13);
1.1 kristaps 57: }
58: }
59:
1.8 ! schwarze 60: enum mdoct
1.6 schwarze 61: mdoc_hash_find(const char *p)
1.1 kristaps 62: {
1.6 schwarze 63: int major, i, j;
1.1 kristaps 64:
1.6 schwarze 65: if (0 == p[0])
1.1 kristaps 66: return(MDOC_MAX);
1.6 schwarze 67: if ( ! isalpha((u_char)p[0]) && '%' != p[0])
1.4 schwarze 68: return(MDOC_MAX);
69:
1.6 schwarze 70: if (isalpha((u_char)p[1]))
1.7 schwarze 71: major = 13 * (tolower((u_char)p[1]) - 97);
1.6 schwarze 72: else if ('1' == p[1])
1.7 schwarze 73: major = 13 * 26;
1.6 schwarze 74: else
1.1 kristaps 75: return(MDOC_MAX);
76:
1.6 schwarze 77: if (p[2] && p[3])
1.1 kristaps 78: return(MDOC_MAX);
79:
1.7 schwarze 80: for (j = 0; j < 13; j++) {
1.6 schwarze 81: if (UCHAR_MAX == (i = table[major + j]))
82: break;
83: if (0 == strcmp(p, mdoc_macronames[i]))
1.8 ! schwarze 84: return((enum mdoct)i);
1.1 kristaps 85: }
86:
87: return(MDOC_MAX);
88: }