version 1.2, 2008/12/15 02:23:12 |
version 1.7, 2009/03/08 11:41:22 |
|
|
|
|
#include "private.h" |
#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 |
void |
mdoc_hash_free(void *htab) |
mdoc_tokhash_free(void *htab) |
{ |
{ |
|
|
free(htab); |
free(htab); |
Line 35 mdoc_hash_free(void *htab) |
|
Line 40 mdoc_hash_free(void *htab) |
|
|
|
|
|
void * |
void * |
mdoc_hash_alloc(void) |
mdoc_tokhash_alloc(void) |
{ |
{ |
int i, major, minor, ind; |
int i, major, minor, ind; |
const void **htab; |
const void **htab; |
Line 80 mdoc_hash_alloc(void) |
|
Line 85 mdoc_hash_alloc(void) |
|
|
|
|
|
int |
int |
mdoc_hash_find(const void *arg, const char *tmp) |
mdoc_tokhash_find(const void *arg, const char *tmp) |
{ |
{ |
int major, minor, ind, slot; |
int major, minor, ind, slot; |
const void **htab; |
const void **htab; |
Line 112 mdoc_hash_find(const void *arg, const char *tmp) |
|
Line 117 mdoc_hash_find(const void *arg, const char *tmp) |
|
minor = tmp[1] - 97; |
minor = tmp[1] - 97; |
|
|
ind = (major * 27) + minor; |
ind = (major * 27) + minor; |
|
if (ind < 0 || ind >= (27 * 26)) |
|
return(MDOC_MAX); |
|
|
if (NULL == htab[ind]) |
if (NULL == htab[ind]) |
return(MDOC_MAX); |
return(MDOC_MAX); |
Line 120 mdoc_hash_find(const void *arg, const char *tmp) |
|
Line 127 mdoc_hash_find(const void *arg, const char *tmp) |
|
(void *)mdoc_macros; |
(void *)mdoc_macros; |
assert(0 == (size_t)slot % sizeof(struct mdoc_macro)); |
assert(0 == (size_t)slot % sizeof(struct mdoc_macro)); |
slot /= sizeof(struct mdoc_macro); |
slot /= sizeof(struct mdoc_macro); |
|
|
|
/* |
|
* FIXME: is this necessary, or do we only need to check the |
|
* remaining characters (2+)? |
|
*/ |
|
|
if (0 != strcmp(mdoc_macronames[slot], tmp)) |
if (0 != strcmp(mdoc_macronames[slot], tmp)) |
return(MDOC_MAX); |
return(MDOC_MAX); |