summaryrefslogtreecommitdiffstats
path: root/libman.h
diff options
context:
space:
mode:
authorKristaps Dzonsons <kristaps@bsd.lv>2009-09-16 14:40:56 +0000
committerKristaps Dzonsons <kristaps@bsd.lv>2009-09-16 14:40:56 +0000
commit6345042a457de84d0b4fdb0ffe8e21052479fdbc (patch)
treea033285b86728a45a837dff5d7d34369d7055e0a /libman.h
parent464bf99c7bec33718cdc95c963d3e5d3a28b3124 (diff)
downloadmandoc-6345042a457de84d0b4fdb0ffe8e21052479fdbc.tar.gz
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.
Diffstat (limited to 'libman.h')
-rw-r--r--libman.h6
1 files changed, 2 insertions, 4 deletions
diff --git a/libman.h b/libman.h
index d8b305a4..2078143a 100644
--- a/libman.h
+++ b/libman.h
@@ -27,7 +27,6 @@ enum man_next {
struct man {
void *data;
struct man_cb cb;
- void *htab;
int pflags;
int flags;
#define MAN_HALT (1 << 0)
@@ -95,9 +94,8 @@ int man_body_alloc(struct man *, int, int, int);
int man_elem_alloc(struct man *, int, int, int);
void man_node_free(struct man_node *);
void man_node_freelist(struct man_node *);
-void *man_hash_alloc(void);
-int man_hash_find(const void *, const char *);
-void man_hash_free(void *);
+void man_hash_init(void);
+int man_hash_find(const char *);
int man_macroend(struct man *);
int man_args(struct man *, int, int *, char *, char **);
#define ARGS_ERROR (-1)