=================================================================== RCS file: /cvs/mandoc/Attic/hash.c,v retrieving revision 1.5 retrieving revision 1.7 diff -u -p -r1.5 -r1.7 --- mandoc/Attic/hash.c 2009/01/20 13:44:05 1.5 +++ mandoc/Attic/hash.c 2009/03/08 11:41:22 1.7 @@ -1,4 +1,4 @@ -/* $Id: hash.c,v 1.5 2009/01/20 13:44:05 kristaps Exp $ */ +/* $Id: hash.c,v 1.7 2009/03/08 11:41:22 kristaps Exp $ */ /* * Copyright (c) 2008 Kristaps Dzonsons * @@ -28,10 +28,9 @@ /* * Routines for the perfect-hash hashtable used by the parser to look up * tokens by their string-ified names (`.Fl' -> MDOC_Fl). The - * allocation penalty for this is 27 * 26 * sizeof(ptr). + * allocation penalty for this is 27 * 26 * sizeof(ptr). */ - void mdoc_tokhash_free(void *htab) { @@ -128,6 +127,11 @@ mdoc_tokhash_find(const void *arg, const char *tmp) (void *)mdoc_macros; assert(0 == (size_t)slot % sizeof(struct mdoc_macro)); slot /= sizeof(struct mdoc_macro); + + /* + * FIXME: is this necessary, or do we only need to check the + * remaining characters (2+)? + */ if (0 != strcmp(mdoc_macronames[slot], tmp)) return(MDOC_MAX);