Slightly faster implementation of the deadman counter
[nasm/avx512.git] / hashtbl.h
blobc8f23bd469cf7d9dbbd6e4716494b887191961d0
1 /*
2 * hashtbl.h
4 * Efficient dictionary hash table class.
5 */
7 #ifndef NASM_HASHTBL_H
8 #define NASM_HASHTBL_H
10 #include <inttypes.h>
11 #include <stddef.h>
12 #include "nasmlib.h"
14 struct hash_tbl_node {
15 uint64_t hash;
16 const char *key;
17 void *data;
20 struct hash_table {
21 struct hash_tbl_node *table;
22 size_t load;
23 size_t size;
24 size_t max_load;
27 struct hash_insert {
28 uint64_t hash;
29 struct hash_table *head;
30 struct hash_tbl_node *where;
33 uint64_t crc64(uint64_t crc, const char *string);
34 uint64_t crc64i(uint64_t crc, const char *string);
35 #define CRC64_INIT UINT64_C(0xffffffffffffffff)
37 struct hash_table *hash_init(void);
38 void **hash_find(struct hash_table *head, const char *string,
39 struct hash_insert *insert);
40 void **hash_findi(struct hash_table *head, const char *string,
41 struct hash_insert *insert);
42 void **hash_add(struct hash_insert *insert, const char *string, void *data);
43 void *hash_iterate(const struct hash_table *head,
44 struct hash_tbl_node **iterator,
45 const char **key);
46 void hash_free(struct hash_table *head);
48 #endif /* NASM_HASHTBL_H */