version 1.12, 2010/01/01 17:14:29 |
version 1.24, 2015/04/18 17:01:58 |
|
|
/* $Id$ */ |
/* $Id$ */ |
/* |
/* |
* Copyright (c) 2008, 2009 Kristaps Dzonsons <kristaps@kth.se> |
* Copyright (c) 2008, 2009 Kristaps Dzonsons <kristaps@bsd.lv> |
* |
* |
* 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 |
|
|
* 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" |
#include "config.h" |
#endif |
|
|
|
#include <sys/types.h> |
#include <sys/types.h> |
|
|
|
|
#include <stdio.h> |
#include <stdio.h> |
#include <string.h> |
#include <string.h> |
|
|
|
#include "roff.h" |
|
#include "mdoc.h" |
#include "libmdoc.h" |
#include "libmdoc.h" |
|
|
static u_char table[27 * 12]; |
static unsigned char table[27 * 12]; |
|
|
/* |
|
* 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 |
mdoc_hash_init(void) |
mdoc_hash_init(void) |
{ |
{ |
int i, j, major; |
int i, j, major; |
const char *p; |
const char *p; |
|
|
|
if (*table != '\0') |
|
return; |
|
|
memset(table, UCHAR_MAX, sizeof(table)); |
memset(table, UCHAR_MAX, sizeof(table)); |
|
|
for (i = 0; i < MDOC_MAX; i++) { |
for (i = 0; i < (int)MDOC_MAX; i++) { |
p = mdoc_macronames[i]; |
p = mdoc_macronames[i]; |
|
|
if (isalpha((u_char)p[1])) |
if (isalpha((unsigned char)p[1])) |
major = 12 * (tolower((u_char)p[1]) - 97); |
major = 12 * (tolower((unsigned char)p[1]) - 97); |
else |
else |
major = 12 * 26; |
major = 12 * 26; |
|
|
for (j = 0; j < 12; j++) |
for (j = 0; j < 12; j++) |
if (UCHAR_MAX == table[major + j]) { |
if (UCHAR_MAX == table[major + j]) { |
table[major + j] = (u_char)i; |
table[major + j] = (unsigned char)i; |
break; |
break; |
} |
} |
|
|
Line 68 mdoc_hash_find(const char *p) |
|
Line 68 mdoc_hash_find(const char *p) |
|
|
|
if (0 == p[0]) |
if (0 == p[0]) |
return(MDOC_MAX); |
return(MDOC_MAX); |
if ( ! isalpha((u_char)p[0]) && '%' != p[0]) |
if ( ! isalpha((unsigned char)p[0]) && '%' != p[0]) |
return(MDOC_MAX); |
return(MDOC_MAX); |
|
|
if (isalpha((u_char)p[1])) |
if (isalpha((unsigned char)p[1])) |
major = 12 * (tolower((u_char)p[1]) - 97); |
major = 12 * (tolower((unsigned char)p[1]) - 97); |
else if ('1' == p[1]) |
else if ('1' == p[1]) |
major = 12 * 26; |
major = 12 * 26; |
else |
else |
return(MDOC_MAX); |
return(MDOC_MAX); |
|
|
if (p[2] && p[3]) |
if (p[2] && p[3]) |