/* $Id$ */ /* * Copyright (c) 2008, 2009 Kristaps Dzonsons * Copyright (c) 2015, 2017 Ingo Schwarze * * Permission to use, copy, modify, and distribute this software for any * purpose with or without fee is hereby granted, provided that the above * copyright notice and this permission notice appear in all copies. * * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR * ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN * ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF * OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. */ #include "config.h" #include #include #include #include #include #include #include #include "mandoc.h" #include "roff.h" #include "mdoc.h" #include "libmandoc.h" #include "libmdoc.h" static unsigned char table[27 * 12]; void mdoc_hash_init(void) { int i, j, major; const char *p; if (*table != '\0') return; memset(table, UCHAR_MAX, sizeof(table)); for (i = 0; i < (int)(MDOC_MAX - MDOC_Dd); i++) { p = roff_name[MDOC_Dd + i]; if (isalpha((unsigned char)p[1])) major = 12 * (tolower((unsigned char)p[1]) - 97); else major = 12 * 26; for (j = 0; j < 12; j++) if (UCHAR_MAX == table[major + j]) { table[major + j] = (unsigned char)i; break; } assert(j < 12); } } enum roff_tok mdoc_hash_find(const char *p) { int major, i, j; if (0 == p[0]) return TOKEN_NONE; if ( ! isalpha((unsigned char)p[0]) && '%' != p[0]) return TOKEN_NONE; if (isalpha((unsigned char)p[1])) major = 12 * (tolower((unsigned char)p[1]) - 97); else if ('1' == p[1]) major = 12 * 26; else return TOKEN_NONE; if (p[2] && p[3]) return TOKEN_NONE; for (j = 0; j < 12; j++) { if (UCHAR_MAX == (i = table[major + j])) break; if (strcmp(p, roff_name[MDOC_Dd + i]) == 0) return MDOC_Dd + i; } return TOKEN_NONE; }