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
|
free(table->data);
table->data = ndata;
table->size = nsize;
}
static inline bool
index_for_key(struct objc_hashtable *table, const void *key, uint32_t *index)
{
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)) {
*index = 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)) {
*index = i;
return true;
}
}
return false;
}
|
|
|
|
|
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
|
free(table->data);
table->data = ndata;
table->size = nsize;
}
static inline bool
index_for_key(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;
}
}
return false;
}
|