version 1.24, 2011/03/22 14:33:05 |
version 1.25, 2011/07/24 18:15:14 |
|
|
#define HASH_DEPTH 6 |
#define HASH_DEPTH 6 |
|
|
#define HASH_ROW(x) do { \ |
#define HASH_ROW(x) do { \ |
if (isupper((u_char)(x))) \ |
if (isupper((unsigned char)(x))) \ |
(x) -= 65; \ |
(x) -= 65; \ |
else \ |
else \ |
(x) -= 97; \ |
(x) -= 97; \ |
|
|
* macro (the integer value of the enum stored as a char to save a bit |
* macro (the integer value of the enum stored as a char to save a bit |
* of space). |
* of space). |
*/ |
*/ |
static u_char table[26 * HASH_DEPTH]; |
static unsigned char table[26 * HASH_DEPTH]; |
|
|
/* |
/* |
* XXX - this hash has global scope, so if intended for use as a library |
* XXX - this hash has global scope, so if intended for use as a library |
Line 66 man_hash_init(void) |
|
Line 66 man_hash_init(void) |
|
for (i = 0; i < (int)MAN_MAX; i++) { |
for (i = 0; i < (int)MAN_MAX; i++) { |
x = man_macronames[i][0]; |
x = man_macronames[i][0]; |
|
|
assert(isalpha((u_char)x)); |
assert(isalpha((unsigned char)x)); |
|
|
HASH_ROW(x); |
HASH_ROW(x); |
|
|
for (j = 0; j < HASH_DEPTH; j++) |
for (j = 0; j < HASH_DEPTH; j++) |
if (UCHAR_MAX == table[x + j]) { |
if (UCHAR_MAX == table[x + j]) { |
table[x + j] = (u_char)i; |
table[x + j] = (unsigned char)i; |
break; |
break; |
} |
} |
|
|
Line 89 man_hash_find(const char *tmp) |
|
Line 89 man_hash_find(const char *tmp) |
|
|
|
if ('\0' == (x = tmp[0])) |
if ('\0' == (x = tmp[0])) |
return(MAN_MAX); |
return(MAN_MAX); |
if ( ! (isalpha((u_char)x))) |
if ( ! (isalpha((unsigned char)x))) |
return(MAN_MAX); |
return(MAN_MAX); |
|
|
HASH_ROW(x); |
HASH_ROW(x); |