Lines Matching defs:entry_size
250 size_t entry_size;
258 .entry_size = sizeof(struct plain_hashmap_entry),
264 .entry_size = sizeof(struct ordered_hashmap_entry),
270 .entry_size = sizeof(struct set_entry),
404 (storage_ptr(h) + idx * hashmap_type_info[h->type].entry_size);
438 (storage_ptr(h) + hashmap_type_info[h->type].entry_size * n_buckets(h));
486 memset(bucket_at(h, idx), 0, hashmap_type_info[h->type].entry_size);
499 memcpy(e_to, e_from, hashmap_type_info[h->type].entry_size);
771 p = mempset(h->direct.storage, 0, hi->entry_size * hi->n_direct_buckets);
1107 if (_unlikely_(new_n_buckets > UINT_MAX / (hi->entry_size + sizeof(dib_raw_t))))
1116 new_n_buckets * (hi->entry_size + sizeof(dib_raw_t)),
1128 old_n_buckets * (hi->entry_size + sizeof(dib_raw_t)));
1142 (hi->entry_size + sizeof(dib_raw_t));
1144 old_dibs = (dib_raw_t*)(new_storage + hi->entry_size * old_n_buckets);
1161 (n_buckets(h) - old_n_buckets) * hi->entry_size);
1188 memset(bucket_at(h, idx), 0, hi->entry_size);