version 1.25, 2015/04/19 14:00:19 |
version 1.26, 2015/10/06 18:32:19 |
|
|
/* $Id$ */ |
/* $Id$ */ |
/* |
/* |
* Copyright (c) 2008, 2009 Kristaps Dzonsons <kristaps@bsd.lv> |
* Copyright (c) 2008, 2009 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 |
Line 67 mdoc_hash_find(const char *p) |
|
Line 68 mdoc_hash_find(const char *p) |
|
int major, i, j; |
int major, i, j; |
|
|
if (0 == p[0]) |
if (0 == p[0]) |
return(TOKEN_NONE); |
return TOKEN_NONE; |
if ( ! isalpha((unsigned char)p[0]) && '%' != p[0]) |
if ( ! isalpha((unsigned char)p[0]) && '%' != p[0]) |
return(TOKEN_NONE); |
return TOKEN_NONE; |
|
|
if (isalpha((unsigned char)p[1])) |
if (isalpha((unsigned char)p[1])) |
major = 12 * (tolower((unsigned 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(TOKEN_NONE); |
return TOKEN_NONE; |
|
|
if (p[2] && p[3]) |
if (p[2] && p[3]) |
return(TOKEN_NONE); |
return TOKEN_NONE; |
|
|
for (j = 0; j < 12; j++) { |
for (j = 0; j < 12; j++) { |
if (UCHAR_MAX == (i = table[major + j])) |
if (UCHAR_MAX == (i = table[major + j])) |
break; |
break; |
if (0 == strcmp(p, mdoc_macronames[i])) |
if (0 == strcmp(p, mdoc_macronames[i])) |
return(i); |
return i; |
} |
} |
|
|
return(TOKEN_NONE); |
return TOKEN_NONE; |
} |
} |