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>
31 rehash (SgenHashTable *hash_table)
33 SgenHashTableEntry **old_hash = hash_table->table;
34 guint old_hash_size = hash_table->size;
35 guint i, hash, new_size;
36 SgenHashTableEntry **new_hash;
37 SgenHashTableEntry *entry, *next;
40 sgen_register_fixed_internal_mem_type (hash_table->entry_mem_type,
41 sizeof (SgenHashTableEntry*) + sizeof (gpointer) + hash_table->data_size);
44 new_size = g_spaced_primes_closest (hash_table->num_entries);
47 new_hash = sgen_alloc_internal_dynamic (new_size * sizeof (SgenHashTableEntry*), hash_table->table_mem_type, TRUE);
48 for (i = 0; i < old_hash_size; ++i) {
49 for (entry = old_hash [i]; entry; entry = next) {
50 hash = hash_table->hash_func (entry->key) % new_size;
52 entry->next = new_hash [hash];
53 new_hash [hash] = entry;
56 sgen_free_internal_dynamic (old_hash, old_hash_size * sizeof (SgenHashTableEntry*), hash_table->table_mem_type);
57 hash_table->table = new_hash;
58 hash_table->size = new_size;
62 rehash_if_necessary (SgenHashTable *hash_table)
64 if (hash_table->num_entries >= hash_table->size * 2)
68 static SgenHashTableEntry*
69 lookup (SgenHashTable *hash_table, gpointer key, guint *_hash)
71 SgenHashTableEntry *entry;
73 GEqualFunc equal = hash_table->equal_func;
75 if (!hash_table->size)
78 hash = hash_table->hash_func (key) % hash_table->size;
82 for (entry = hash_table->table [hash]; entry; entry = entry->next) {
83 if ((equal && equal (entry->key, key)) || (!equal && entry->key == key))
90 sgen_hash_table_lookup (SgenHashTable *hash_table, gpointer key)
92 SgenHashTableEntry *entry = lookup (hash_table, key, NULL);
99 sgen_hash_table_replace (SgenHashTable *hash_table, gpointer key, gpointer new_value, gpointer old_value)
102 SgenHashTableEntry *entry;
104 rehash_if_necessary (hash_table);
105 entry = lookup (hash_table, key, &hash);
109 memcpy (old_value, entry->data, hash_table->data_size);
110 memcpy (entry->data, new_value, hash_table->data_size);
114 entry = sgen_alloc_internal (hash_table->entry_mem_type);
116 memcpy (entry->data, new_value, hash_table->data_size);
118 entry->next = hash_table->table [hash];
119 hash_table->table [hash] = entry;
121 hash_table->num_entries++;
127 sgen_hash_table_set_value (SgenHashTable *hash_table, gpointer key, gpointer new_value, gpointer old_value)
130 SgenHashTableEntry *entry;
132 entry = lookup (hash_table, key, &hash);
136 memcpy (old_value, entry->data, hash_table->data_size);
137 memcpy (entry->data, new_value, hash_table->data_size);
145 sgen_hash_table_set_key (SgenHashTable *hash_table, gpointer old_key, gpointer new_key)
148 SgenHashTableEntry *entry;
150 entry = lookup (hash_table, old_key, &hash);
153 entry->key = new_key;
161 sgen_hash_table_remove (SgenHashTable *hash_table, gpointer key, gpointer data_return)
163 SgenHashTableEntry *entry, *prev;
165 GEqualFunc equal = hash_table->equal_func;
167 rehash_if_necessary (hash_table);
168 hash = hash_table->hash_func (key) % hash_table->size;
171 for (entry = hash_table->table [hash]; entry; entry = entry->next) {
172 if ((equal && equal (entry->key, key)) || (!equal && entry->key == key)) {
174 prev->next = entry->next;
176 hash_table->table [hash] = entry->next;
178 hash_table->num_entries--;
181 memcpy (data_return, entry->data, hash_table->data_size);
183 sgen_free_internal (entry, hash_table->entry_mem_type);
194 sgen_hash_table_clean (SgenHashTable *hash_table)
198 if (!hash_table->size) {
199 g_assert (!hash_table->table);
200 g_assert (!hash_table->num_entries);
204 for (i = 0; i < hash_table->size; ++i) {
205 SgenHashTableEntry *entry = hash_table->table [i];
207 SgenHashTableEntry *next = entry->next;
208 sgen_free_internal (entry, hash_table->entry_mem_type);
213 sgen_free_internal_dynamic (hash_table->table, hash_table->size * sizeof (SgenHashTableEntry*), hash_table->table_mem_type);
215 hash_table->table = NULL;
216 hash_table->size = 0;
217 hash_table->num_entries = 0;