Lines Matching refs:entry_size
255 size_t entry_size;
263 .entry_size = sizeof(struct plain_hashmap_entry),
269 .entry_size = sizeof(struct ordered_hashmap_entry),
275 .entry_size = sizeof(struct set_entry),
350 (storage_ptr(h) + idx * hashmap_type_info[h->type].entry_size);
384 (storage_ptr(h) + hashmap_type_info[h->type].entry_size * n_buckets(h));
432 memzero(bucket_at(h, idx), hashmap_type_info[h->type].entry_size);
445 memcpy(e_to, e_from, hashmap_type_info[h->type].entry_size);
721 p = mempset(h->direct.storage, 0, hi->entry_size * hi->n_direct_buckets);
1061 if (_unlikely_(new_n_buckets > UINT_MAX / (hi->entry_size + sizeof(dib_raw_t))))
1070 new_n_buckets * (hi->entry_size + sizeof(dib_raw_t)),
1082 old_n_buckets * (hi->entry_size + sizeof(dib_raw_t)));
1096 (hi->entry_size + sizeof(dib_raw_t));
1098 old_dibs = (dib_raw_t*)(new_storage + hi->entry_size * old_n_buckets);
1115 (n_buckets(h) - old_n_buckets) * hi->entry_size);
1142 memzero(bucket_at(h, idx), hi->entry_size);