Switch the preprocessor over to using the hash table library

Switch the preprocessor over to using the hash table library.  On my
system, this improves the runtime of the output of test/pref/macro.pl
from over 600 seconds to 7 seconds.

Macros have an odd mix of case-sensitive and case-insensitive
behaviour, plus there are matching parameters for arguments, etc.  As
a result, we use case-insensitive hash tables and use a linked list to
store all the possible isomorphs.

1 files changed, 3 insertions, 2 deletions

diff --git a/labels.c b/labels.c
index ae2cbb8..5a1fd13 100644
--- a/labels.c
+++ b/labels.c
@@ -100,7 +100,7 @@ static union label *find_label(char *label, int create)
 {
     char *prev;
     int prevlen, len;
-    union label *lptr;
+    union label *lptr, **lpp;
     char label_str[IDLEN_MAX];
     struct hash_insert ip;
 
@@ -118,7 +118,8 @@ static union label *find_label(char *label, int create)
 	prevlen = 0;
     }
 
-    lptr = hash_find(ltab, label, &ip);
+    lpp = (union label **) hash_find(ltab, label, &ip);
+    lptr = lpp ? *lpp : NULL;
 
     if (lptr || !create)
 	return lptr;