Lines Matching defs:size
55 uint32_t max_entries, size, rehash;
58 #define ENTRY(max_entries, size, rehash) \
59 { max_entries, size, rehash, \
60 REMAINDER_MAGIC(size), REMAINDER_MAGIC(rehash) }
126 ht->size = hash_sizes[ht->size_index].size;
133 ht->table = rzalloc_array(mem_ctx, struct set_entry, ht->size);
191 clone->table = ralloc_array(clone, struct set_entry, clone->size);
197 memcpy(clone->table, set->table, clone->size * sizeof(struct set_entry));
227 memset(ht->table, 0, sizeof(struct set_entry) * hash_sizes[ht->size_index].size);
246 for (entry = set->table; entry != set->table + set->size; entry++) {
268 uint32_t size = ht->size;
269 uint32_t start_address = util_fast_urem32(hash, size, ht->size_magic);
285 if (hash_address >= size)
286 hash_address -= size;
311 uint32_t size = ht->size;
312 uint32_t start_address = util_fast_urem32(hash, size, ht->size_magic);
325 if (hash_address >= size)
326 hash_address -= size;
346 hash_sizes[new_size_index].size);
354 ht->size = hash_sizes[ht->size_index].size;
405 uint32_t size = ht->size;
406 uint32_t start_address = util_fast_urem32(hash, size, ht->size_magic);
430 if (hash_address >= size)
431 hash_address -= size;
578 if (entry != ht->table + ht->size)
598 for (; entry != ht->table + ht->size; entry++) {
612 uint32_t i = rand() % ht->size;
617 for (entry = ht->table + i; entry != ht->table + ht->size; entry++) {