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.24

1.24    ! schwarze    1: /*     $OpenBSD: man_hash.c,v 1.23 2015/04/19 13:59:37 schwarze Exp $ */
1.1       kristaps    2: /*
1.13      schwarze    3:  * Copyright (c) 2008, 2009, 2010 Kristaps Dzonsons <kristaps@bsd.lv>
1.24    ! schwarze    4:  * Copyright (c) 2015 Ingo Schwarze <schwarze@openbsd.org>
1.1       kristaps    5:  *
                      6:  * Permission to use, copy, modify, and distribute this software for any
1.2       schwarze    7:  * purpose with or without fee is hereby granted, provided that the above
                      8:  * copyright notice and this permission notice appear in all copies.
1.1       kristaps    9:  *
1.2       schwarze   10:  * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
                     11:  * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
                     12:  * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
                     13:  * ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
                     14:  * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
                     15:  * ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
                     16:  * OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
1.1       kristaps   17:  */
1.7       schwarze   18: #include <sys/types.h>
                     19:
1.1       kristaps   20: #include <assert.h>
1.8       schwarze   21: #include <ctype.h>
1.6       schwarze   22: #include <limits.h>
1.1       kristaps   23: #include <string.h>
                     24:
1.20      schwarze   25: #include "roff.h"
1.14      schwarze   26: #include "man.h"
1.1       kristaps   27: #include "libman.h"
                     28:
1.15      schwarze   29: #define        HASH_DEPTH       6
1.8       schwarze   30:
                     31: #define        HASH_ROW(x) do { \
1.15      schwarze   32:                if (isupper((unsigned char)(x))) \
1.8       schwarze   33:                        (x) -= 65; \
                     34:                else \
                     35:                        (x) -= 97; \
                     36:                (x) *= HASH_DEPTH; \
                     37:        } while (/* CONSTCOND */ 0)
                     38:
                     39: /*
                     40:  * Lookup table is indexed first by lower-case first letter (plus one
                     41:  * for the period, which is stored in the last row), then by lower or
                     42:  * uppercase second letter.  Buckets correspond to the index of the
                     43:  * macro (the integer value of the enum stored as a char to save a bit
                     44:  * of space).
                     45:  */
1.15      schwarze   46: static unsigned char    table[26 * HASH_DEPTH];
1.1       kristaps   47:
1.17      schwarze   48:
1.1       kristaps   49: void
1.6       schwarze   50: man_hash_init(void)
1.1       kristaps   51: {
                     52:        int              i, j, x;
1.22      schwarze   53:
                     54:        if (*table != '\0')
                     55:                return;
1.1       kristaps   56:
1.6       schwarze   57:        memset(table, UCHAR_MAX, sizeof(table));
1.1       kristaps   58:
1.10      schwarze   59:        for (i = 0; i < (int)MAN_MAX; i++) {
1.1       kristaps   60:                x = man_macronames[i][0];
                     61:
1.15      schwarze   62:                assert(isalpha((unsigned char)x));
1.1       kristaps   63:
1.8       schwarze   64:                HASH_ROW(x);
                     65:
                     66:                for (j = 0; j < HASH_DEPTH; j++)
1.6       schwarze   67:                        if (UCHAR_MAX == table[x + j]) {
1.15      schwarze   68:                                table[x + j] = (unsigned char)i;
1.1       kristaps   69:                                break;
                     70:                        }
1.8       schwarze   71:
                     72:                assert(j < HASH_DEPTH);
1.1       kristaps   73:        }
                     74: }
1.8       schwarze   75:
1.21      schwarze   76: int
1.6       schwarze   77: man_hash_find(const char *tmp)
1.1       kristaps   78: {
1.8       schwarze   79:        int              x, y, i;
1.21      schwarze   80:        int              tok;
1.1       kristaps   81:
1.8       schwarze   82:        if ('\0' == (x = tmp[0]))
1.24    ! schwarze   83:                return TOKEN_NONE;
1.15      schwarze   84:        if ( ! (isalpha((unsigned char)x)))
1.24    ! schwarze   85:                return TOKEN_NONE;
1.1       kristaps   86:
1.8       schwarze   87:        HASH_ROW(x);
1.1       kristaps   88:
1.8       schwarze   89:        for (i = 0; i < HASH_DEPTH; i++) {
                     90:                if (UCHAR_MAX == (y = table[x + i]))
1.24    ! schwarze   91:                        return TOKEN_NONE;
1.8       schwarze   92:
1.21      schwarze   93:                tok = y;
1.1       kristaps   94:                if (0 == strcmp(tmp, man_macronames[tok]))
1.24    ! schwarze   95:                        return tok;
1.1       kristaps   96:        }
                     97:
1.24    ! schwarze   98:        return TOKEN_NONE;
1.1       kristaps   99: }