Searched refs:n_buckets (Results 1 – 4 of 4) sorted by relevance
42 unsigned int n_buckets; member47 struct hash *hash_new(unsigned int n_buckets, in hash_new() argument52 n_buckets = ALIGN_POWER2(n_buckets); in hash_new()54 n_buckets * sizeof(struct hash_bucket)); in hash_new()57 hash->n_buckets = n_buckets; in hash_new()59 hash->step = n_buckets / 32; in hash_new()75 bucket_end = bucket + hash->n_buckets; in hash_free()150 unsigned int pos = hashval & (hash->n_buckets - 1); in hash_add()193 unsigned int pos = hashval & (hash->n_buckets - 1); in hash_add_unique()238 unsigned int pos = hashval & (hash->n_buckets - 1); in hash_find()[all …]
13 struct hash *hash_new(unsigned int n_buckets, void (*free_value)(void *value));
798 | 0xXXXXXXXX | BUCKETS[n_buckets]862 table with "``n_buckets``" buckets, and "``n_hashes``" unique 32 bit hash877 | BUCKETS | uint32_t[n_buckets] // 32 bit hash indexes899 | ... | BUCKETS[n_buckets]975 hash value and modulo it by ``n_buckets``. ``BUCKETS[3]`` contains "6" which979 ``n_buckets`` is still 3. In the case of a failed lookup we would access the
854 | 0xXXXXXXXX | BUCKETS[n_buckets]918 table with "``n_buckets``" buckets, and "``n_hashes``" unique 32 bit hash933 | BUCKETS | uint32_t[n_buckets] // 32 bit hash indexes955 | ... | BUCKETS[n_buckets]1031 hash value and modulo it by ``n_buckets``. ``BUCKETS[3]`` contains "6" which1035 ``n_buckets`` is still 3. In the case of a failed lookup we would access the