Lookup hashes are now static tables, ordered first-level by second character, then randomly along a chain. Improves performance by a small fraction and considerably cleans up hash sources.

1 files changed, 2 insertions, 4 deletions

diff --git a/libmdoc.h b/libmdoc.h
index b9668ee1..8ce67933 100644
--- a/libmdoc.h
+++ b/libmdoc.h
@@ -27,7 +27,6 @@ enum	mdoc_next {
 struct	mdoc {
 	void		 *data;
 	struct mdoc_cb	  cb;
-	void		 *htab;
 	int		  flags;
 #define	MDOC_HALT	 (1 << 0)	/* Error in parse. Halt. */
 #define	MDOC_LITERAL	 (1 << 1)	/* In a literal scope. */
@@ -139,9 +138,8 @@ int		  mdoc_tail_alloc(struct mdoc *, int, int, int);
 int		  mdoc_body_alloc(struct mdoc *, int, int, int);
 void		  mdoc_node_free(struct mdoc_node *);
 void		  mdoc_node_freelist(struct mdoc_node *);
-void		 *mdoc_hash_alloc(void);
-int		  mdoc_hash_find(const void *, const char *);
-void		  mdoc_hash_free(void *);
+void		  mdoc_hash_init(void);
+int		  mdoc_hash_find(const char *);
 int		  mdoc_iscdelim(char);
 int		  mdoc_isdelim(const char *);
 size_t		  mdoc_isescape(const char *);