test: simple test of packed BCD.
[nasm/perl-rewrite.git] / hashtbl.h
blob2e6bf118e61802119292a7fd93c4d61e230ab566
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 /* Some reasonable initial sizes... */
38 #define HASH_SMALL 4
39 #define HASH_MEDIUM 16
40 #define HASH_LARGE 256
42 void hash_init(struct hash_table *head, size_t size);
43 void **hash_find(struct hash_table *head, const char *string,
44 struct hash_insert *insert);
45 void **hash_findi(struct hash_table *head, const char *string,
46 struct hash_insert *insert);
47 void **hash_add(struct hash_insert *insert, const char *string, void *data);
48 void *hash_iterate(const struct hash_table *head,
49 struct hash_tbl_node **iterator,
50 const char **key);
51 void hash_free(struct hash_table *head);
53 #endif /* NASM_HASHTBL_H */