Return to man_hash.c CVS log

Up to [local] / src / usr.bin / mandoc

Annotation of src/usr.bin/mandoc/man_hash.c, Revision 1.22

1.22    ! schwarze    1: /*     $OpenBSD: man_hash.c,v 1.21 2015/04/02 22:06:17 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 <string.h>
                     23:
1.20      schwarze   24: #include "roff.h"
1.14      schwarze   25: #include "man.h"
1.1       kristaps   26: #include "libman.h"
                     27:
1.15      schwarze   28: #define        HASH_DEPTH       6
1.8       schwarze   29:
                     30: #define        HASH_ROW(x) do { \
1.15      schwarze   31:                if (isupper((unsigned 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.15      schwarze   45: static unsigned char    table[26 * HASH_DEPTH];
1.1       kristaps   46:
1.17      schwarze   47:
1.1       kristaps   48: void
1.6       schwarze   49: man_hash_init(void)
1.1       kristaps   50: {
                     51:        int              i, j, x;
1.22    ! schwarze   52:
        !            53:        if (*table != '\0')
        !            54:                return;
1.1       kristaps   55:
1.6       schwarze   56:        memset(table, UCHAR_MAX, sizeof(table));
1.1       kristaps   57:
1.17      schwarze   58:        assert(MAN_MAX < UCHAR_MAX);
1.8       schwarze   59:
1.10      schwarze   60:        for (i = 0; i < (int)MAN_MAX; i++) {
1.1       kristaps   61:                x = man_macronames[i][0];
                     62:
1.15      schwarze   63:                assert(isalpha((unsigned char)x));
1.1       kristaps   64:
1.8       schwarze   65:                HASH_ROW(x);
                     66:
                     67:                for (j = 0; j < HASH_DEPTH; j++)
1.6       schwarze   68:                        if (UCHAR_MAX == table[x + j]) {
1.15      schwarze   69:                                table[x + j] = (unsigned char)i;
1.1       kristaps   70:                                break;
                     71:                        }
1.8       schwarze   72:
                     73:                assert(j < HASH_DEPTH);
1.1       kristaps   74:        }
                     75: }
1.8       schwarze   76:
1.21      schwarze   77: int
1.6       schwarze   78: man_hash_find(const char *tmp)
1.1       kristaps   79: {
1.8       schwarze   80:        int              x, y, i;
1.21      schwarze   81:        int              tok;
1.1       kristaps   82:
1.8       schwarze   83:        if ('\0' == (x = tmp[0]))
1.1       kristaps   84:                return(MAN_MAX);
1.15      schwarze   85:        if ( ! (isalpha((unsigned char)x)))
1.1       kristaps   86:                return(MAN_MAX);
                     87:
1.8       schwarze   88:        HASH_ROW(x);
1.1       kristaps   89:
1.8       schwarze   90:        for (i = 0; i < HASH_DEPTH; i++) {
                     91:                if (UCHAR_MAX == (y = table[x + i]))
1.1       kristaps   92:                        return(MAN_MAX);
1.8       schwarze   93:
1.21      schwarze   94:                tok = y;
1.1       kristaps   95:                if (0 == strcmp(tmp, man_macronames[tok]))
                     96:                        return(tok);
                     97:        }
                     98:
                     99:        return(MAN_MAX);
                    100: }