mandoc/hash.c - diff

Return to hash.c CVS log

Up to [cvsweb.bsd.lv] / mandoc

Diff for /mandoc/Attic/hash.c between version 1.2 and 1.9

version 1.2, 2008/12/15 02:23:12

version 1.9, 2009/03/10 10:20:03

Line 25

#include "private.h"

* Routines for the perfect-hash hashtable used by the parser to look up

* tokens by their string-ified names (`.Fl' -> MDOC_Fl). The

* allocation penalty for this is 27 * 26 * sizeof(ptr).

void

mdoc_hash_free(void *htab)

mdoc_tokhash_free(void *htab)

{

free(htab);

Line 35 mdoc_hash_free(void *htab)

Line 40 mdoc_hash_free(void *htab)

void *

mdoc_hash_alloc(void)

mdoc_tokhash_alloc(void)

{

int i, major, minor, ind;

const void **htab;

Line 80 mdoc_hash_alloc(void)

Line 85 mdoc_hash_alloc(void)

int

mdoc_hash_find(const void *arg, const char *tmp)

mdoc_tokhash_find(const void *arg, const char *tmp)

{

int major, minor, ind, slot;

const void **htab;

Line 90 mdoc_hash_find(const void *arg, const char *tmp)

Line 95 mdoc_hash_find(const void *arg, const char *tmp)

if (0 == tmp[0] || 0 == tmp[1])

return(MDOC_MAX);

if (tmp[2] && tmp[3])

return(MDOC_MAX);

if ( ! (tmp[0] == 37 || (tmp[0] >= 65 && tmp[0] <= 90)))

return(MDOC_MAX);

Line 112 mdoc_hash_find(const void *arg, const char *tmp)

Line 119 mdoc_hash_find(const void *arg, const char *tmp)

minor = tmp[1] - 97;

ind = (major * 27) + minor;

if (ind < 0 || ind >= (27 * 26))

return(MDOC_MAX);

if (NULL == htab[ind])

return(MDOC_MAX);

Line 121 mdoc_hash_find(const void *arg, const char *tmp)

Line 130 mdoc_hash_find(const void *arg, const char *tmp)

assert(0 == (size_t)slot % sizeof(struct mdoc_macro));

slot /= sizeof(struct mdoc_macro);

if (0 != strcmp(mdoc_macronames[slot], tmp))

if (mdoc_macronames[slot][0] != tmp[0])

return(MDOC_MAX);

if (mdoc_macronames[slot][1] != tmp[1])

return(MDOC_MAX);

if (tmp[2] && mdoc_macronames[slot][2] != tmp[2])

return(MDOC_MAX);

return(slot);

}

CVSweb