| ︙ | | | ︙ | |
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
|
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#import "ObjFWRT.h"
#import "private.h"
struct objc_hashtable_bucket objc_deleted_bucket;
uint32_t
objc_hash_string(const void *str_)
{
const char *str = str_;
uint32_t hash = 0;
while (*str != 0) {
hash += *str;
hash += (hash << 10);
hash ^= (hash >> 6);
str++;
}
hash += (hash << 3);
hash ^= (hash >> 11);
hash += (hash << 15);
return hash;
}
bool
objc_equal_string(const void *ptr1, const void *ptr2)
{
return (strcmp(ptr1, ptr2) == 0);
}
struct objc_hashtable *
objc_hashtable_new(uint32_t (*hash)(const void *),
bool (*equal)(const void *, const void *), uint32_t size)
|
|
|
|
|
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
|
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#import "ObjFWRT.h"
#import "private.h"
struct objc_hashtable_bucket objc_deletedBucket;
uint32_t
objc_string_hash(const void *str_)
{
const char *str = str_;
uint32_t hash = 0;
while (*str != 0) {
hash += *str;
hash += (hash << 10);
hash ^= (hash >> 6);
str++;
}
hash += (hash << 3);
hash ^= (hash >> 11);
hash += (hash << 15);
return hash;
}
bool
objc_string_equal(const void *ptr1, const void *ptr2)
{
return (strcmp(ptr1, ptr2) == 0);
}
struct objc_hashtable *
objc_hashtable_new(uint32_t (*hash)(const void *),
bool (*equal)(const void *, const void *), uint32_t size)
|
| ︙ | | | ︙ | |
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
|
return;
if ((newData = calloc(newSize, sizeof(*newData))) == NULL)
OBJC_ERROR("Not enough memory to resize hash table!");
for (uint32_t i = 0; i < table->size; i++) {
if (table->data[i] != NULL &&
table->data[i] != &objc_deleted_bucket) {
uint32_t j, last;
last = newSize;
for (j = table->data[i]->hash & (newSize - 1);
j < last && newData[j] != NULL; j++);
|
|
|
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
|
return;
if ((newData = calloc(newSize, sizeof(*newData))) == NULL)
OBJC_ERROR("Not enough memory to resize hash table!");
for (uint32_t i = 0; i < table->size; i++) {
if (table->data[i] != NULL &&
table->data[i] != &objc_deletedBucket) {
uint32_t j, last;
last = newSize;
for (j = table->data[i]->hash & (newSize - 1);
j < last && newData[j] != NULL; j++);
|
| ︙ | | | ︙ | |
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
|
indexForKey(struct objc_hashtable *table, const void *key, uint32_t *idx)
{
uint32_t i, hash;
hash = table->hash(key) & (table->size - 1);
for (i = hash; i < table->size && table->data[i] != NULL; i++) {
if (table->data[i] == &objc_deleted_bucket)
continue;
if (table->equal(table->data[i]->key, key)) {
*idx = i;
return true;
}
}
if (i < table->size)
return false;
for (i = 0; i < hash && table->data[i] != NULL; i++) {
if (table->data[i] == &objc_deleted_bucket)
continue;
if (table->equal(table->data[i]->key, key)) {
*idx = i;
return true;
}
}
|
|
|
|
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
|
indexForKey(struct objc_hashtable *table, const void *key, uint32_t *idx)
{
uint32_t i, hash;
hash = table->hash(key) & (table->size - 1);
for (i = hash; i < table->size && table->data[i] != NULL; i++) {
if (table->data[i] == &objc_deletedBucket)
continue;
if (table->equal(table->data[i]->key, key)) {
*idx = i;
return true;
}
}
if (i < table->size)
return false;
for (i = 0; i < hash && table->data[i] != NULL; i++) {
if (table->data[i] == &objc_deletedBucket)
continue;
if (table->equal(table->data[i]->key, key)) {
*idx = i;
return true;
}
}
|
| ︙ | | | ︙ | |
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
|
resize(table, table->count + 1);
hash = table->hash(key);
last = table->size;
for (i = hash & (table->size - 1); i < last && table->data[i] != NULL &&
table->data[i] != &objc_deleted_bucket; i++);
if (i >= last) {
last = hash & (table->size - 1);
for (i = 0; i < last && table->data[i] != NULL &&
table->data[i] != &objc_deleted_bucket; i++);
}
if (i >= last)
OBJC_ERROR("No free bucket!");
if ((bucket = malloc(sizeof(*bucket))) == NULL)
OBJC_ERROR("Not enough memory to allocate hash table bucket!");
|
|
|
|
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
|
resize(table, table->count + 1);
hash = table->hash(key);
last = table->size;
for (i = hash & (table->size - 1); i < last && table->data[i] != NULL &&
table->data[i] != &objc_deletedBucket; i++);
if (i >= last) {
last = hash & (table->size - 1);
for (i = 0; i < last && table->data[i] != NULL &&
table->data[i] != &objc_deletedBucket; i++);
}
if (i >= last)
OBJC_ERROR("No free bucket!");
if ((bucket = malloc(sizeof(*bucket))) == NULL)
OBJC_ERROR("Not enough memory to allocate hash table bucket!");
|
| ︙ | | | ︙ | |
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
|
{
uint32_t idx;
if (!indexForKey(table, key, &idx))
return;
free(table->data[idx]);
table->data[idx] = &objc_deleted_bucket;
table->count--;
resize(table, table->count);
}
void
objc_hashtable_free(struct objc_hashtable *table)
{
for (uint32_t i = 0; i < table->size; i++)
if (table->data[i] != NULL &&
table->data[i] != &objc_deleted_bucket)
free(table->data[i]);
free(table->data);
free(table);
}
|
|
|
|
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
|
{
uint32_t idx;
if (!indexForKey(table, key, &idx))
return;
free(table->data[idx]);
table->data[idx] = &objc_deletedBucket;
table->count--;
resize(table, table->count);
}
void
objc_hashtable_free(struct objc_hashtable *table)
{
for (uint32_t i = 0; i < table->size; i++)
if (table->data[i] != NULL &&
table->data[i] != &objc_deletedBucket)
free(table->data[i]);
free(table->data);
free(table);
}
|