version 1.30, 2015/04/02 21:36:49 |
version 1.36, 2017/04/24 23:06:18 |
|
|
/* $Id$ */ |
/* $Id$ */ |
/* |
/* |
* Copyright (c) 2008, 2009, 2010 Kristaps Dzonsons <kristaps@bsd.lv> |
* Copyright (c) 2008, 2009, 2010 Kristaps Dzonsons <kristaps@bsd.lv> |
|
* Copyright (c) 2015, 2017 Ingo Schwarze <schwarze@openbsd.org> |
* |
* |
* Permission to use, copy, modify, and distribute this software for any |
* Permission to use, copy, modify, and distribute this software for any |
* purpose with or without fee is hereby granted, provided that the above |
* purpose with or without fee is hereby granted, provided that the above |
|
|
#include <limits.h> |
#include <limits.h> |
#include <string.h> |
#include <string.h> |
|
|
|
#include "mandoc.h" |
#include "roff.h" |
#include "roff.h" |
#include "man.h" |
#include "man.h" |
|
#include "libmandoc.h" |
#include "libman.h" |
#include "libman.h" |
|
|
#define HASH_DEPTH 6 |
#define HASH_DEPTH 6 |
|
|
static unsigned 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 |
|
* with multiple callers, it will need re-invocation protection. |
|
*/ |
|
void |
void |
man_hash_init(void) |
man_hash_init(void) |
{ |
{ |
int i, j, x; |
int i, j, x; |
|
|
|
if (*table != '\0') |
|
return; |
|
|
memset(table, UCHAR_MAX, sizeof(table)); |
memset(table, UCHAR_MAX, sizeof(table)); |
|
|
assert(MAN_MAX < UCHAR_MAX); |
for (i = 0; i < (int)(MAN_MAX - MAN_TH); i++) { |
|
x = *roff_name[MAN_TH + i]; |
|
|
for (i = 0; i < (int)MAN_MAX; i++) { |
|
x = man_macronames[i][0]; |
|
|
|
assert(isalpha((unsigned char)x)); |
assert(isalpha((unsigned char)x)); |
|
|
HASH_ROW(x); |
HASH_ROW(x); |
Line 77 man_hash_init(void) |
|
Line 77 man_hash_init(void) |
|
} |
} |
} |
} |
|
|
enum mant |
enum roff_tok |
man_hash_find(const char *tmp) |
man_hash_find(const char *tmp) |
{ |
{ |
int x, y, i; |
int x, y, i; |
enum mant tok; |
|
|
|
if ('\0' == (x = tmp[0])) |
if ('\0' == (x = tmp[0])) |
return(MAN_MAX); |
return TOKEN_NONE; |
if ( ! (isalpha((unsigned char)x))) |
if ( ! (isalpha((unsigned char)x))) |
return(MAN_MAX); |
return TOKEN_NONE; |
|
|
HASH_ROW(x); |
HASH_ROW(x); |
|
|
for (i = 0; i < HASH_DEPTH; i++) { |
for (i = 0; i < HASH_DEPTH; i++) { |
if (UCHAR_MAX == (y = table[x + i])) |
if (UCHAR_MAX == (y = table[x + i])) |
return(MAN_MAX); |
return TOKEN_NONE; |
|
|
tok = (enum mant)y; |
if (strcmp(tmp, roff_name[MAN_TH + y]) == 0) |
if (0 == strcmp(tmp, man_macronames[tok])) |
return MAN_TH + y; |
return(tok); |
|
} |
} |
|
|
return(MAN_MAX); |
return TOKEN_NONE; |
} |
} |