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>
30 #include <mono/utils/mono-counters.h>
32 #ifdef HEAVY_STATISTICS
33 static long long stat_lookups;
34 static long long stat_lookup_iterations;
35 static long long stat_lookup_max_iterations;
39 rehash (SgenHashTable *hash_table)
41 SgenHashTableEntry **old_hash = hash_table->table;
42 guint old_hash_size = hash_table->size;
43 guint i, hash, new_size;
44 SgenHashTableEntry **new_hash;
45 SgenHashTableEntry *entry, *next;
48 sgen_register_fixed_internal_mem_type (hash_table->entry_mem_type,
49 sizeof (SgenHashTableEntry*) + sizeof (gpointer) + hash_table->data_size);
52 new_size = g_spaced_primes_closest (hash_table->num_entries);
55 new_hash = sgen_alloc_internal_dynamic (new_size * sizeof (SgenHashTableEntry*), hash_table->table_mem_type, TRUE);
56 for (i = 0; i < old_hash_size; ++i) {
57 for (entry = old_hash [i]; entry; entry = next) {
58 hash = hash_table->hash_func (entry->key) % new_size;
60 entry->next = new_hash [hash];
61 new_hash [hash] = entry;
64 sgen_free_internal_dynamic (old_hash, old_hash_size * sizeof (SgenHashTableEntry*), hash_table->table_mem_type);
65 hash_table->table = new_hash;
66 hash_table->size = new_size;
70 rehash_if_necessary (SgenHashTable *hash_table)
72 if (hash_table->num_entries >= hash_table->size * 2)
75 SGEN_ASSERT (1, hash_table->size, "rehash guarantees size > 0");
78 static SgenHashTableEntry*
79 lookup (SgenHashTable *hash_table, gpointer key, guint *_hash)
81 SgenHashTableEntry *entry;
83 GEqualFunc equal = hash_table->equal_func;
84 #ifdef HEAVY_STATISTICS
85 long long iterations = 0;
89 if (!hash_table->size)
92 hash = hash_table->hash_func (key) % hash_table->size;
96 for (entry = hash_table->table [hash]; entry; entry = entry->next) {
97 #ifdef HEAVY_STATISTICS
98 ++stat_lookup_iterations;
100 if (iterations > stat_lookup_max_iterations)
101 stat_lookup_max_iterations = iterations;
103 if ((equal && equal (entry->key, key)) || (!equal && entry->key == key))
110 sgen_hash_table_lookup (SgenHashTable *hash_table, gpointer key)
112 SgenHashTableEntry *entry = lookup (hash_table, key, NULL);
119 sgen_hash_table_replace (SgenHashTable *hash_table, gpointer key, gpointer new_value, gpointer old_value)
122 SgenHashTableEntry *entry;
124 rehash_if_necessary (hash_table);
125 entry = lookup (hash_table, key, &hash);
129 memcpy (old_value, entry->data, hash_table->data_size);
130 memcpy (entry->data, new_value, hash_table->data_size);
134 entry = sgen_alloc_internal (hash_table->entry_mem_type);
136 memcpy (entry->data, new_value, hash_table->data_size);
138 entry->next = hash_table->table [hash];
139 hash_table->table [hash] = entry;
141 hash_table->num_entries++;
147 sgen_hash_table_set_value (SgenHashTable *hash_table, gpointer key, gpointer new_value, gpointer old_value)
150 SgenHashTableEntry *entry;
152 entry = lookup (hash_table, key, &hash);
156 memcpy (old_value, entry->data, hash_table->data_size);
157 memcpy (entry->data, new_value, hash_table->data_size);
165 sgen_hash_table_set_key (SgenHashTable *hash_table, gpointer old_key, gpointer new_key)
168 SgenHashTableEntry *entry;
170 entry = lookup (hash_table, old_key, &hash);
173 entry->key = new_key;
181 sgen_hash_table_remove (SgenHashTable *hash_table, gpointer key, gpointer data_return)
183 SgenHashTableEntry *entry, *prev;
185 GEqualFunc equal = hash_table->equal_func;
187 rehash_if_necessary (hash_table);
188 hash = hash_table->hash_func (key) % hash_table->size;
191 for (entry = hash_table->table [hash]; entry; entry = entry->next) {
192 if ((equal && equal (entry->key, key)) || (!equal && entry->key == key)) {
194 prev->next = entry->next;
196 hash_table->table [hash] = entry->next;
198 hash_table->num_entries--;
201 memcpy (data_return, entry->data, hash_table->data_size);
203 sgen_free_internal (entry, hash_table->entry_mem_type);
214 sgen_hash_table_clean (SgenHashTable *hash_table)
218 if (!hash_table->size) {
219 SGEN_ASSERT (1, !hash_table->table, "clean should reset hash_table->table");
220 SGEN_ASSERT (1, !hash_table->num_entries, "clean should reset hash_table->num_entries");
224 for (i = 0; i < hash_table->size; ++i) {
225 SgenHashTableEntry *entry = hash_table->table [i];
227 SgenHashTableEntry *next = entry->next;
228 sgen_free_internal (entry, hash_table->entry_mem_type);
233 sgen_free_internal_dynamic (hash_table->table, hash_table->size * sizeof (SgenHashTableEntry*), hash_table->table_mem_type);
235 hash_table->table = NULL;
236 hash_table->size = 0;
237 hash_table->num_entries = 0;
241 sgen_init_hash_table (void)
243 #ifdef HEAVY_STATISTICS
244 mono_counters_register ("Hash table lookups", MONO_COUNTER_GC | MONO_COUNTER_LONG, &stat_lookups);
245 mono_counters_register ("Hash table lookup iterations", MONO_COUNTER_GC | MONO_COUNTER_LONG, &stat_lookup_iterations);
246 mono_counters_register ("Hash table lookup max iterations", MONO_COUNTER_GC | MONO_COUNTER_LONG, &stat_lookup_max_iterations);