Return to man_hash.c CVS log

Up to [cvsweb.bsd.lv] / mandoc

Annotation of mandoc/man_hash.c, Revision 1.36

1.36    ! schwarze    1: /*     $Id: man_hash.c,v 1.35 2016/07/15 18:03:45 schwarze Exp $ */
1.1       kristaps    2: /*
1.23      schwarze    3:  * Copyright (c) 2008, 2009, 2010 Kristaps Dzonsons <kristaps@bsd.lv>
1.36    ! 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.7       kristaps    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.7       kristaps   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.16      kristaps   18: #include "config.h"
                     19:
1.15      kristaps   20: #include <sys/types.h>
                     21:
1.5       kristaps   22: #include <assert.h>
1.17      kristaps   23: #include <ctype.h>
1.12      kristaps   24: #include <limits.h>
1.1       kristaps   25: #include <string.h>
                     26:
1.35      schwarze   27: #include "mandoc.h"
1.30      schwarze   28: #include "roff.h"
1.24      kristaps   29: #include "man.h"
1.35      schwarze   30: #include "libmandoc.h"
1.1       kristaps   31: #include "libman.h"
                     32:
1.17      kristaps   33: #define        HASH_DEPTH       6
                     34:
                     35: #define        HASH_ROW(x) do { \
1.25      kristaps   36:                if (isupper((unsigned char)(x))) \
1.17      kristaps   37:                        (x) -= 65; \
                     38:                else \
                     39:                        (x) -= 97; \
                     40:                (x) *= HASH_DEPTH; \
                     41:        } while (/* CONSTCOND */ 0)
                     42:
                     43: /*
                     44:  * Lookup table is indexed first by lower-case first letter (plus one
                     45:  * for the period, which is stored in the last row), then by lower or
                     46:  * uppercase second letter.  Buckets correspond to the index of the
                     47:  * macro (the integer value of the enum stored as a char to save a bit
                     48:  * of space).
                     49:  */
1.25      kristaps   50: static unsigned char    table[26 * HASH_DEPTH];
1.1       kristaps   51:
1.27      schwarze   52:
1.12      kristaps   53: void
                     54: man_hash_init(void)
1.1       kristaps   55: {
1.5       kristaps   56:        int              i, j, x;
1.32      schwarze   57:
                     58:        if (*table != '\0')
                     59:                return;
1.5       kristaps   60:
1.12      kristaps   61:        memset(table, UCHAR_MAX, sizeof(table));
1.5       kristaps   62:
1.36    ! schwarze   63:        for (i = 0; i < (int)(MAN_MAX - MAN_TH); i++) {
        !            64:                x = *roff_name[MAN_TH + i];
1.5       kristaps   65:
1.25      kristaps   66:                assert(isalpha((unsigned char)x));
1.5       kristaps   67:
1.17      kristaps   68:                HASH_ROW(x);
                     69:
                     70:                for (j = 0; j < HASH_DEPTH; j++)
1.12      kristaps   71:                        if (UCHAR_MAX == table[x + j]) {
1.25      kristaps   72:                                table[x + j] = (unsigned char)i;
1.5       kristaps   73:                                break;
                     74:                        }
1.17      kristaps   75:
                     76:                assert(j < HASH_DEPTH);
1.5       kristaps   77:        }
1.1       kristaps   78: }
1.17      kristaps   79:
1.36    ! schwarze   80: enum roff_tok
1.12      kristaps   81: man_hash_find(const char *tmp)
1.1       kristaps   82: {
1.17      kristaps   83:        int              x, y, i;
1.2       kristaps   84:
1.17      kristaps   85:        if ('\0' == (x = tmp[0]))
1.34      schwarze   86:                return TOKEN_NONE;
1.25      kristaps   87:        if ( ! (isalpha((unsigned char)x)))
1.34      schwarze   88:                return TOKEN_NONE;
1.5       kristaps   89:
1.17      kristaps   90:        HASH_ROW(x);
1.5       kristaps   91:
1.17      kristaps   92:        for (i = 0; i < HASH_DEPTH; i++) {
                     93:                if (UCHAR_MAX == (y = table[x + i]))
1.34      schwarze   94:                        return TOKEN_NONE;
1.17      kristaps   95:
1.36    ! schwarze   96:                if (strcmp(tmp, roff_name[MAN_TH + y]) == 0)
        !            97:                        return MAN_TH + y;
1.5       kristaps   98:        }
1.1       kristaps   99:
1.34      schwarze  100:        return TOKEN_NONE;
1.1       kristaps  101: }