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

1.26    ! schwarze    1: /*     $OpenBSD: man_hash.c,v 1.25 2016/07/15 18:02:32 schwarze Exp $ */
1.1       kristaps    2: /*
1.13      schwarze    3:  * Copyright (c) 2008, 2009, 2010 Kristaps Dzonsons <kristaps@bsd.lv>
1.26    ! schwarze    4:  * Copyright (c) 2015, 2017 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.25      schwarze   25: #include "mandoc.h"
1.20      schwarze   26: #include "roff.h"
1.14      schwarze   27: #include "man.h"
1.25      schwarze   28: #include "libmandoc.h"
1.1       kristaps   29: #include "libman.h"
                     30:
1.15      schwarze   31: #define        HASH_DEPTH       6
1.8       schwarze   32:
                     33: #define        HASH_ROW(x) do { \
1.15      schwarze   34:                if (isupper((unsigned char)(x))) \
1.8       schwarze   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.15      schwarze   48: static unsigned char    table[26 * HASH_DEPTH];
1.1       kristaps   49:
1.17      schwarze   50:
1.1       kristaps   51: void
1.6       schwarze   52: man_hash_init(void)
1.1       kristaps   53: {
                     54:        int              i, j, x;
1.22      schwarze   55:
                     56:        if (*table != '\0')
                     57:                return;
1.1       kristaps   58:
1.6       schwarze   59:        memset(table, UCHAR_MAX, sizeof(table));
1.1       kristaps   60:
1.26    ! schwarze   61:        for (i = 0; i < (int)(MAN_MAX - MAN_TH); i++) {
        !            62:                x = *roff_name[MAN_TH + i];
1.1       kristaps   63:
1.15      schwarze   64:                assert(isalpha((unsigned char)x));
1.1       kristaps   65:
1.8       schwarze   66:                HASH_ROW(x);
                     67:
                     68:                for (j = 0; j < HASH_DEPTH; j++)
1.6       schwarze   69:                        if (UCHAR_MAX == table[x + j]) {
1.15      schwarze   70:                                table[x + j] = (unsigned char)i;
1.1       kristaps   71:                                break;
                     72:                        }
1.8       schwarze   73:
                     74:                assert(j < HASH_DEPTH);
1.1       kristaps   75:        }
                     76: }
1.8       schwarze   77:
1.26    ! schwarze   78: enum roff_tok
1.6       schwarze   79: man_hash_find(const char *tmp)
1.1       kristaps   80: {
1.8       schwarze   81:        int              x, y, i;
1.1       kristaps   82:
1.8       schwarze   83:        if ('\0' == (x = tmp[0]))
1.24      schwarze   84:                return TOKEN_NONE;
1.15      schwarze   85:        if ( ! (isalpha((unsigned char)x)))
1.24      schwarze   86:                return TOKEN_NONE;
1.1       kristaps   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.24      schwarze   92:                        return TOKEN_NONE;
1.8       schwarze   93:
1.26    ! schwarze   94:                if (strcmp(tmp, roff_name[MAN_TH + y]) == 0)
        !            95:                        return MAN_TH + y;
1.1       kristaps   96:        }
                     97:
1.24      schwarze   98:        return TOKEN_NONE;
1.1       kristaps   99: }