version 1.11, 2009/08/19 09:14:50 |
version 1.18, 2010/03/27 10:14:32 |
|
|
* ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF |
* ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF |
* OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. |
* OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. |
*/ |
*/ |
|
#ifdef HAVE_CONFIG_H |
|
#include "config.h" |
|
#endif |
|
|
|
#include <sys/types.h> |
|
|
#include <assert.h> |
#include <assert.h> |
|
#include <ctype.h> |
|
#include <limits.h> |
#include <stdlib.h> |
#include <stdlib.h> |
#include <string.h> |
#include <string.h> |
|
|
#include "libman.h" |
#include "libman.h" |
|
|
|
#define HASH_DEPTH 6 |
|
|
/* ARGUSED */ |
#define HASH_ROW(x) do { \ |
void |
if ('.' == (x)) \ |
man_hash_free(void *htab) |
(x) = 26; \ |
{ |
else if (isupper((u_char)(x))) \ |
|
(x) -= 65; \ |
|
else \ |
|
(x) -= 97; \ |
|
(x) *= HASH_DEPTH; \ |
|
} while (/* CONSTCOND */ 0) |
|
|
free(htab); |
/* |
} |
* Lookup table is indexed first by lower-case first letter (plus one |
|
* for the period, which is stored in the last row), then by lower or |
|
* uppercase second letter. Buckets correspond to the index of the |
|
* macro (the integer value of the enum stored as a char to save a bit |
|
* of space). |
|
*/ |
|
static u_char table[27 * HASH_DEPTH]; |
|
|
|
/* |
/* ARGUSED */ |
* XXX - this hash has global scope, so if intended for use as a library |
void * |
* with multiple callers, it will need re-invocation protection. |
man_hash_alloc(void) |
*/ |
|
void |
|
man_hash_init(void) |
{ |
{ |
int *htab; |
|
int i, j, x; |
int i, j, x; |
|
|
/* Initialised to -1. */ |
memset(table, UCHAR_MAX, sizeof(table)); |
|
|
htab = malloc(26 * 6 * sizeof(int)); |
assert(/* LINTED */ |
if (NULL == htab) |
MAN_MAX < UCHAR_MAX); |
return(NULL); |
|
for (i = 0; i < 26 * 6; i++) |
|
htab[i] = -1; |
|
|
|
for (i = 0; i < MAN_MAX; i++) { |
for (i = 0; i < MAN_MAX; i++) { |
x = man_macronames[i][0]; |
x = man_macronames[i][0]; |
|
|
assert((x >= 65 && x <= 90) || |
assert(isalpha((u_char)x) || '.' == x); |
(x >= 97 && x <= 122)); |
|
|
|
x -= (x <= 90) ? 65 : 97; |
HASH_ROW(x); |
x *= 6; |
|
|
|
for (j = 0; j < 6; j++) |
for (j = 0; j < HASH_DEPTH; j++) |
if (-1 == htab[x + j]) { |
if (UCHAR_MAX == table[x + j]) { |
htab[x + j] = i; |
table[x + j] = (u_char)i; |
break; |
break; |
} |
} |
|
|
assert(j < 6); |
assert(j < HASH_DEPTH); |
} |
} |
|
|
return((void *)htab); |
|
} |
} |
|
|
|
|
int |
enum mant |
man_hash_find(const void *arg, const char *tmp) |
man_hash_find(const char *tmp) |
{ |
{ |
int x, i, tok; |
int x, y, i; |
const int *htab; |
enum mant tok; |
|
|
htab = (const int *)arg; |
if ('\0' == (x = tmp[0])) |
|
|
if (0 == (x = tmp[0])) |
|
return(MAN_MAX); |
return(MAN_MAX); |
if ( ! ((x >= 65 && x <= 90) || (x >= 97 && x <= 122))) |
if ( ! (isalpha((u_char)x) || '.' == x)) |
return(MAN_MAX); |
return(MAN_MAX); |
|
|
x -= (x <= 90) ? 65 : 97; |
HASH_ROW(x); |
x *= 6; |
|
|
|
for (i = 0; i < 6; i++) { |
for (i = 0; i < HASH_DEPTH; i++) { |
if (-1 == (tok = htab[x + i])) |
if (UCHAR_MAX == (y = table[x + i])) |
return(MAN_MAX); |
return(MAN_MAX); |
|
|
|
tok = (enum mant)y; |
if (0 == strcmp(tmp, man_macronames[tok])) |
if (0 == strcmp(tmp, man_macronames[tok])) |
return(tok); |
return(tok); |
} |
} |
|
|
return(MAN_MAX); |
return(MAN_MAX); |
} |
} |
|
|