4 * Permission is hereby granted, free of charge, to any person obtaining
5 * a copy of this software and associated documentation files (the
6 * "Software"), to deal in the Software without restriction, including
7 * without limitation the rights to use, copy, modify, merge, publish,
8 * distribute, sublicense, and/or sell copies of the Software, and to
9 * permit persons to whom the Software is furnished to do so, subject to
10 * the following conditions:
12 * The above copyright notice and this permission notice shall be
13 * included in all copies or substantial portions of the Software.
15 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
16 * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
17 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
18 * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
19 * LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
20 * OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
21 * WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
28 #include <mono/metadata/sgen-gc.h>
29 #include <mono/metadata/sgen-hash-table.h>
32 rehash (SgenHashTable *hash_table)
34 SgenHashTableEntry **old_hash = hash_table->table;
35 guint old_hash_size = hash_table->size;
36 guint i, hash, new_size;
37 SgenHashTableEntry **new_hash;
38 SgenHashTableEntry *entry, *next;
41 sgen_register_fixed_internal_mem_type (hash_table->entry_mem_type,
42 sizeof (SgenHashTableEntry*) + sizeof (gpointer) + hash_table->data_size);
45 new_size = g_spaced_primes_closest (hash_table->num_entries);
48 new_hash = sgen_alloc_internal_dynamic (new_size * sizeof (SgenHashTableEntry*), hash_table->table_mem_type, TRUE);
49 for (i = 0; i < old_hash_size; ++i) {
50 for (entry = old_hash [i]; entry; entry = next) {
51 hash = hash_table->hash_func (entry->key) % new_size;
53 entry->next = new_hash [hash];
54 new_hash [hash] = entry;
57 sgen_free_internal_dynamic (old_hash, old_hash_size * sizeof (SgenHashTableEntry*), hash_table->table_mem_type);
58 hash_table->table = new_hash;
59 hash_table->size = new_size;
63 rehash_if_necessary (SgenHashTable *hash_table)
65 if (hash_table->num_entries >= hash_table->size * 2)
69 static SgenHashTableEntry*
70 lookup (SgenHashTable *hash_table, gpointer key, guint *_hash)
72 SgenHashTableEntry *entry;
74 GEqualFunc equal = hash_table->equal_func;
76 if (!hash_table->size)
79 hash = hash_table->hash_func (key) % hash_table->size;
83 for (entry = hash_table->table [hash]; entry; entry = entry->next) {
84 if ((equal && equal (entry->key, key)) || (!equal && entry->key == key))
91 sgen_hash_table_lookup (SgenHashTable *hash_table, gpointer key)
93 SgenHashTableEntry *entry = lookup (hash_table, key, NULL);
100 sgen_hash_table_replace (SgenHashTable *hash_table, gpointer key, gpointer new_value, gpointer old_value)
103 SgenHashTableEntry *entry;
105 rehash_if_necessary (hash_table);
106 entry = lookup (hash_table, key, &hash);
110 memcpy (old_value, entry->data, hash_table->data_size);
111 memcpy (entry->data, new_value, hash_table->data_size);
115 entry = sgen_alloc_internal (hash_table->entry_mem_type);
117 memcpy (entry->data, new_value, hash_table->data_size);
119 entry->next = hash_table->table [hash];
120 hash_table->table [hash] = entry;
122 hash_table->num_entries++;
128 sgen_hash_table_set_value (SgenHashTable *hash_table, gpointer key, gpointer new_value, gpointer old_value)
131 SgenHashTableEntry *entry;
133 entry = lookup (hash_table, key, &hash);
137 memcpy (old_value, entry->data, hash_table->data_size);
138 memcpy (entry->data, new_value, hash_table->data_size);
146 sgen_hash_table_set_key (SgenHashTable *hash_table, gpointer old_key, gpointer new_key)
149 SgenHashTableEntry *entry;
151 entry = lookup (hash_table, old_key, &hash);
154 entry->key = new_key;
162 sgen_hash_table_remove (SgenHashTable *hash_table, gpointer key, gpointer data_return)
164 SgenHashTableEntry *entry, *prev;
166 GEqualFunc equal = hash_table->equal_func;
168 rehash_if_necessary (hash_table);
169 hash = hash_table->hash_func (key) % hash_table->size;
172 for (entry = hash_table->table [hash]; entry; entry = entry->next) {
173 if ((equal && equal (entry->key, key)) || (!equal && entry->key == key)) {
175 prev->next = entry->next;
177 hash_table->table [hash] = entry->next;
179 hash_table->num_entries--;
182 memcpy (data_return, entry->data, hash_table->data_size);
184 sgen_free_internal (entry, hash_table->entry_mem_type);
195 sgen_hash_table_clean (SgenHashTable *hash_table)
199 if (!hash_table->size) {
200 g_assert (!hash_table->table);
201 g_assert (!hash_table->num_entries);
205 for (i = 0; i < hash_table->size; ++i) {
206 SgenHashTableEntry *entry = hash_table->table [i];
208 SgenHashTableEntry *next = entry->next;
209 sgen_free_internal (entry, hash_table->entry_mem_type);
214 sgen_free_internal_dynamic (hash_table->table, hash_table->size * sizeof (SgenHashTableEntry*), hash_table->table_mem_type);
216 hash_table->table = NULL;
217 hash_table->size = 0;
218 hash_table->num_entries = 0;