[BACK]Return to man_hash.c CVS log [TXT][DIR] Up to [cvsweb.bsd.lv] / mandoc

Annotation of mandoc/man_hash.c, Revision 1.20

1.20    ! kristaps    1: /*     $Id: man_hash.c,v 1.19 2010/05/08 07:30:19 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.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:
                     29: #include "libman.h"
                     30:
1.17      kristaps   31: #define        HASH_DEPTH       6
                     32:
                     33: #define        HASH_ROW(x) do { \
1.20    ! kristaps   34:                if (isupper((u_char)(x))) \
1.17      kristaps   35:                        (x) -= 65; \
                     36:                else \
                     37:                        (x) -= 97; \
                     38:                (x) *= HASH_DEPTH; \
                     39:        } while (/* CONSTCOND */ 0)
                     40:
                     41: /*
                     42:  * Lookup table is indexed first by lower-case first letter (plus one
                     43:  * for the period, which is stored in the last row), then by lower or
                     44:  * uppercase second letter.  Buckets correspond to the index of the
                     45:  * macro (the integer value of the enum stored as a char to save a bit
                     46:  * of space).
                     47:  */
1.20    ! kristaps   48: static u_char           table[26 * HASH_DEPTH];
1.1       kristaps   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.18      kristaps   61:        assert(/* LINTED */
                     62:                        MAN_MAX < UCHAR_MAX);
1.17      kristaps   63:
1.19      kristaps   64:        for (i = 0; i < (int)MAN_MAX; i++) {
1.5       kristaps   65:                x = man_macronames[i][0];
                     66:
1.20    ! kristaps   67:                assert(isalpha((u_char)x));
1.5       kristaps   68:
1.17      kristaps   69:                HASH_ROW(x);
                     70:
                     71:                for (j = 0; j < HASH_DEPTH; j++)
1.12      kristaps   72:                        if (UCHAR_MAX == table[x + j]) {
1.13      kristaps   73:                                table[x + j] = (u_char)i;
1.5       kristaps   74:                                break;
                     75:                        }
1.17      kristaps   76:
                     77:                assert(j < HASH_DEPTH);
1.5       kristaps   78:        }
1.1       kristaps   79: }
                     80:
1.17      kristaps   81:
                     82: enum mant
1.12      kristaps   83: man_hash_find(const char *tmp)
1.1       kristaps   84: {
1.17      kristaps   85:        int              x, y, i;
                     86:        enum mant        tok;
1.2       kristaps   87:
1.17      kristaps   88:        if ('\0' == (x = tmp[0]))
1.5       kristaps   89:                return(MAN_MAX);
1.20    ! kristaps   90:        if ( ! (isalpha((u_char)x)))
1.5       kristaps   91:                return(MAN_MAX);
                     92:
1.17      kristaps   93:        HASH_ROW(x);
1.5       kristaps   94:
1.17      kristaps   95:        for (i = 0; i < HASH_DEPTH; i++) {
                     96:                if (UCHAR_MAX == (y = table[x + i]))
1.5       kristaps   97:                        return(MAN_MAX);
1.17      kristaps   98:
                     99:                tok = (enum mant)y;
1.5       kristaps  100:                if (0 == strcmp(tmp, man_macronames[tok]))
                    101:                        return(tok);
                    102:        }
1.1       kristaps  103:
                    104:        return(MAN_MAX);
                    105: }

CVSweb