56 	table->entries = isl_calloc_array(ctx, struct isl_hash_table_entry,  in isl_hash_table_init()
58 	if (!table->entries)  in isl_hash_table_init()
82 	struct isl_hash_table_entry *entries;  in grow_table()  local
85 	entries = table->entries;  in grow_table()
88 	table->entries = isl_calloc_array(ctx, struct isl_hash_table_entry,  in grow_table()
90 	if (!table->entries) {  in grow_table()
91 		table->entries = entries;  in grow_table()
102 		if (!entries[h].data)  in grow_table()
105 		entry = isl_hash_table_find(ctx, table, entries[h].hash,  in grow_table()
109 			free(table->entries);  in grow_table()
110 			table->entries = entries;  in grow_table()
115 		*entry = entries[h];  in grow_table()
118 	free(entries);  in grow_table()
140 	free(table->entries);  in isl_hash_table_clear()
168 	for (h = key_bits; table->entries[h].data; h = (h+1) % size) {  in isl_hash_table_find()
171 		if (table->entries[h].hash != key_hash)  in isl_hash_table_find()
173 		equal = eq(table->entries[h].data, val);  in isl_hash_table_find()
177 			return &table->entries[h];  in isl_hash_table_find()
190 	table->entries[h].hash = key_hash;  in isl_hash_table_find()
192 	return &table->entries[h];  in isl_hash_table_find()
201 	if (!table->entries)  in isl_hash_table_foreach()
206 		if (table->entries[h].data &&  in isl_hash_table_foreach()
207 		    fn(&table->entries[h].data, user) < 0)  in isl_hash_table_foreach()
224 	h = entry - table->entries;  in isl_hash_table_remove()
227 	for (h2 = h+1; table->entries[h2 % size].data; h2++) {  in isl_hash_table_remove()
228 		uint32_t bits = isl_hash_bits(table->entries[h2 % size].hash,  in isl_hash_table_remove()
233 		*entry = table->entries[h2 % size];  in isl_hash_table_remove()
235 		entry = &table->entries[h % size];  in isl_hash_table_remove()