version 1.32, 2015/04/18 17:01:58 |
version 1.35, 2016/07/15 18:03:45 |
|
|
/* $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 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 |
Line 57 man_hash_init(void) |
|
Line 60 man_hash_init(void) |
|
|
|
memset(table, UCHAR_MAX, sizeof(table)); |
memset(table, UCHAR_MAX, sizeof(table)); |
|
|
assert(MAN_MAX < UCHAR_MAX); |
|
|
|
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]; |
|
|
Line 83 man_hash_find(const char *tmp) |
|
Line 84 man_hash_find(const char *tmp) |
|
int tok; |
int 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 = y; |
tok = y; |
if (0 == strcmp(tmp, man_macronames[tok])) |
if (0 == strcmp(tmp, man_macronames[tok])) |
return(tok); |
return tok; |
} |
} |
|
|
return(MAN_MAX); |
return TOKEN_NONE; |
} |
} |