outbin: Cleanup bin_cleanup
[nasm/avx512.git] / hashtbl.h
blobdd00ddb3adf05ea12bf24bba19f08b0b7a53594f
1 /* ----------------------------------------------------------------------- *
2 *
3 * Copyright 1996-2009 The NASM Authors - All Rights Reserved
4 * See the file AUTHORS included with the NASM distribution for
5 * the specific copyright holders.
7 * Redistribution and use in source and binary forms, with or without
8 * modification, are permitted provided that the following
9 * conditions are met:
11 * * Redistributions of source code must retain the above copyright
12 * notice, this list of conditions and the following disclaimer.
13 * * Redistributions in binary form must reproduce the above
14 * copyright notice, this list of conditions and the following
15 * disclaimer in the documentation and/or other materials provided
16 * with the distribution.
18 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND
19 * CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
20 * INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
21 * MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
22 * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR
23 * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
24 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
25 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
26 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
27 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
28 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
29 * OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE,
30 * EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
32 * ----------------------------------------------------------------------- */
35 * hashtbl.h
37 * Efficient dictionary hash table class.
40 #ifndef NASM_HASHTBL_H
41 #define NASM_HASHTBL_H
43 #include <inttypes.h>
44 #include <stddef.h>
45 #include "nasmlib.h"
47 struct hash_tbl_node {
48 uint64_t hash;
49 const char *key;
50 void *data;
53 struct hash_table {
54 struct hash_tbl_node *table;
55 size_t load;
56 size_t size;
57 size_t max_load;
60 struct hash_insert {
61 uint64_t hash;
62 struct hash_table *head;
63 struct hash_tbl_node *where;
66 uint64_t crc64(uint64_t crc, const char *string);
67 uint64_t crc64i(uint64_t crc, const char *string);
68 #define CRC64_INIT UINT64_C(0xffffffffffffffff)
70 /* Some reasonable initial sizes... */
71 #define HASH_SMALL 4
72 #define HASH_MEDIUM 16
73 #define HASH_LARGE 256
75 void hash_init(struct hash_table *head, size_t size);
76 void **hash_find(struct hash_table *head, const char *string,
77 struct hash_insert *insert);
78 void **hash_findi(struct hash_table *head, const char *string,
79 struct hash_insert *insert);
80 void **hash_add(struct hash_insert *insert, const char *string, void *data);
81 void *hash_iterate(const struct hash_table *head,
82 struct hash_tbl_node **iterator,
83 const char **key);
84 void hash_free(struct hash_table *head);
86 #endif /* NASM_HASHTBL_H */