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
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
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
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
|
#include <stdint.h>
#include <string.h>
#import "runtime.h"
#import "runtime-private.h"
uint32_t
objc_hash_string(const char *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;
}
struct objc_hashtable*
objc_hashtable_new(uint32_t size)
{
struct objc_hashtable *h;
uint32_t i;
if ((h = malloc(sizeof(struct objc_hashtable))) == NULL)
OBJC_ERROR("Not enough memory to allocate hash table!");
h->count = 0;
h->last_idx = size - 1;
h->data = malloc(size * sizeof(struct objc_hashtable_bucket*));
if (h->data == NULL)
OBJC_ERROR("Not enough memory to allocate hash table!");
for (i = 0; i < size; i++)
h->data[i] = NULL;
h;
insert(struct objc_hashtable *h, const char *key, const void *obj)
{
uint32_t i, hash, last;
struct objc_hashtable_bucket *bucket;
hash = objc_hash_string(key);
if (h->count + 1 > UINT32_MAX / 4)
OBJC_ERROR("Integer overflow!");
if ((h->count + 1) * 4 / (h->last_idx + 1) >= 3) {
struct objc_hashtable_bucket **ndata;
uint32_t nsize = (h->last_idx + 1) * 2;
if (nsize == 0)
OBJC_ERROR("Integer overflow!");
ndata = malloc(nsize * sizeof(struct objc_hashtable_bucket*));
if (ndata == NULL)
OBJC_ERROR("Not enough memory to insert into hash "
"table!");
for (i = 0; i < nsize; i++)
ndata[i] = NULL;
for (i = 0; i <= h->last_idx; i++) {
if (h->data[i] != NULL) {
uint32_t j;
last = nsize;
for (j = h->data[i]->hash & (nsize - 1);
j < last && ndata[j] != NULL; j++);
if (j >= last) {
last = h->data[i]->hash & (nsize - 1);
for (j = 0; j < last &&
ndata[j] != NULL; j++);
}
if (j >= last)
OBJC_ERROR("No free bucket!");
ndata[j] = h->data[i];
}
}
free(h->data);
h->data = ndata;
h->last_idx = nsize - 1;
}
last = h->last_idx + 1;
for (i = hash & h->last_idx; i < last && h->data[i] != NULL; i++);
if (i >= last) {
last = hash & h->last_idx;
for (i = 0; i < last && h->data[i] != NULL; i++);
}
if (i >= last)
OBJC_ERROR("No free bucket!");
if ((bucket = malloc(sizeof(struct objc_hashtable_bucket))) == NULL)
OBJC_ERROR("Not enough memory to allocate hash table bucket!");
bucket->key = key;
bucket->hash = hash;
bucket->obj = obj;
h->data[i] = bucket;
h->count++;
}
static inline int64_t
index_for_key(struct objc_hashtable *h, const char *key)
{
uint32_t i, hash;
hash = objc_hash_string(key) & h->last_idx;
for (i = hash; i <= h->last_idx && h->data[i] != NULL; i++)
if (!strcmp(h->data[i]->key, key))
return i;
if (i <= h->last_idx)
return -1;
for (i = 0; i < hash && h->data[i] != NULL; i++)
if (!strcmp(h->data[i]->key, key))
return i;
return -1;
}
void
objc_hashtable_set(struct objc_hashtable *h, const char *key, const void *obj)
{
int64_t idx = index_for_key(h, key);
if (idx < 0) {
insert(h, key, obj);
return;
}
h->data[idx]->obj = obj;
}
void*
objc_hashtable_get(struct objc_hashtable *h, const char *key)
{
int64_t idx = index_for_key(h, key);
if (idx < 0)
return NULL;
return (void*)h->data[idx]->obj;
}
void
objc_hashtable_free(struct objc_hashtable *h)
{
uint32_t i;
for (i = 0; i <= h->last_idx; i++)
if (h->data[i] != NULL)
free(h->data[i]);
free(h->data);
free(h);
}
|
|
>
>
>
>
>
>
>
|
>
|
<
|
>
>
>
|
|
|
|
<
<
<
|
|
|
|
|
|
|
|
>
>
>
|
<
|
<
<
<
|
|
|
|
|
>
|
|
|
|
|
|
>
|
|
|
|
|
|
|
|
|
|
|
|
|
>
|
|
|
|
|
|
|
|
|
|
|
|
|
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
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
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
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
|
#include <stdint.h>
#include <string.h>
#import "runtime.h"
#import "runtime-private.h"
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 *obj1, const void *obj2)
{
return !strcmp(obj1, obj2);
}
struct objc_hashtable*
objc_hashtable_new(uint32_t (*hash)(const void*),
bool (*equal)(const void*, const void*), uint32_t size)
{
struct objc_hashtable *table;
if ((table = malloc(sizeof(struct objc_hashtable))) == NULL)
OBJC_ERROR("Not enough memory to allocate hash table!");
table->hash = hash;
table->equal = equal;
table->count = 0;
table->size = size;
table->data = calloc(size, sizeof(struct objc_hashtable_bucket*));
if (table->data == NULL)
OBJC_ERROR("Not enough memory to allocate hash table!");
return table;
}
static void
insert(struct objc_hashtable *table, const void *key, const void *obj)
{
uint32_t i, hash, last;
struct objc_hashtable_bucket *bucket;
hash = table->hash(key);
if (table->count + 1 > UINT32_MAX / 4)
OBJC_ERROR("Integer overflow!");
if ((table->count + 1) * 4 / table->size >= 3) {
struct objc_hashtable_bucket **newData;
uint32_t newSize;
if (table->size > UINT32_MAX / 2)
OBJC_ERROR("Integer overflow!");
newSize = table->size * 2;
if ((newData = calloc(newSize,
sizeof(struct objc_hashtable_bucket*))) == NULL)
OBJC_ERROR("Not enough memory to insert into hash "
"table!");
for (i = 0; i < table->size; i++) {
if (table->data[i] != NULL) {
uint32_t j;
last = newSize;
for (j = table->data[i]->hash & (newSize - 1);
j < last && newData[j] != NULL; j++);
if (j >= last) {
last = table->data[i]->hash &
(newSize - 1);
for (j = 0; j < last &&
newData[j] != NULL; j++);
}
if (j >= last)
OBJC_ERROR("No free bucket!");
newData[j] = table->data[i];
}
}
free(table->data);
table->data = newData;
table->size = newSize;
}
last = table->size;
for (i = hash & (table->size - 1);
i < last && table->data[i] != NULL; i++);
if (i >= last) {
last = hash & (table->size - 1);
for (i = 0; i < last && table->data[i] != NULL; i++);
}
if (i >= last)
OBJC_ERROR("No free bucket!");
if ((bucket = malloc(sizeof(struct objc_hashtable_bucket))) == NULL)
OBJC_ERROR("Not enough memory to allocate hash table bucket!");
bucket->key = key;
bucket->hash = hash;
bucket->obj = obj;
table->data[i] = bucket;
table->count++;
}
static inline int64_t
index_for_key(struct objc_hashtable *table, const void *key)
{
uint32_t i, hash;
hash = table->hash(key) & (table->size - 1);
for (i = hash; i < table->size && table->data[i] != NULL; i++)
if (table->equal(table->data[i]->key, key))
return i;
if (i < table->size)
return -1;
for (i = 0; i < hash && table->data[i] != NULL; i++)
if (table->equal(table->data[i]->key, key))
return i;
return -1;
}
void
objc_hashtable_set(struct objc_hashtable *table, const void *key,
const void *obj)
{
int64_t idx = index_for_key(table, key);
if (idx < 0) {
insert(table, key, obj);
return;
}
table->data[idx]->obj = obj;
}
void*
objc_hashtable_get(struct objc_hashtable *table, const void *key)
{
int64_t idx = index_for_key(table, key);
if (idx < 0)
return NULL;
return (void*)table->data[idx]->obj;
}
void
objc_hashtable_free(struct objc_hashtable *table)
{
uint32_t i;
for (i = 0; i < table->size; i++)
if (table->data[i] != NULL)
free(table->data[i]);
free(table->data);
free(table);
}
|