Home
last modified time | relevance | path

Searched refs:mht_mask (Results 1 – 3 of 3) sorted by relevance

/vim-8.2.3635/src/
H A Dmemfile.c1328 mht->mht_mask = MHT_INIT_SIZE - 1; in mf_hash_init()
1352 for (idx = 0; idx <= mht->mht_mask; idx++) in mf_hash_free_all()
1371 mhi = mht->mht_buckets[key & mht->mht_mask]; in mf_hash_find()
1387 idx = mhi->mhi_key & mht->mht_mask; in mf_hash_add_item()
1401 && (mht->mht_count >> MHT_LOG_LOAD_FACTOR) > mht->mht_mask) in mf_hash_add_item()
1419 mht->mht_buckets[mhi->mhi_key & mht->mht_mask] = mhi->mhi_next; in mf_hash_rem_item()
1447 size = (mht->mht_mask + 1) * MHT_GROWTH_FACTOR * sizeof(void *); in mf_hash_grow()
1453 while ((mht->mht_mask >> shift) != 0) in mf_hash_grow()
1456 for (i = 0; i <= mht->mht_mask; i++) in mf_hash_grow()
1497 mht->mht_mask = (mht->mht_mask + 1) * MHT_GROWTH_FACTOR - 1; in mf_hash_grow()
H A Dmemfile_test.c48 num_buckets = ht.mht_mask + 1; in test_mf_hash()
77 if (ht.mht_mask + 1 != num_buckets) in test_mf_hash()
80 assert(ht.mht_mask + 1 == num_buckets * MHT_GROWTH_FACTOR); in test_mf_hash()
H A Dstructs.h494 long_u mht_mask; // mask used for hash value (nr of items member