Lines Matching full:nbuckets
124 size += ht->nbuckets * sizeof(_Py_hashtable_entry_t *); in _Py_hashtable_size()
135 size_t index = key_hash & (ht->nbuckets - 1); in _Py_hashtable_get_entry_generic()
157 size_t index = key_hash & (ht->nbuckets - 1); in _Py_hashtable_get_entry_ptr()
177 size_t index = key_hash & (ht->nbuckets - 1); in _Py_hashtable_steal()
200 if ((float)ht->nentries / (float)ht->nbuckets < HASHTABLE_LOW) { in _Py_hashtable_steal()
233 if ((float)ht->nentries / (float)ht->nbuckets > HASHTABLE_HIGH) { in _Py_hashtable_set()
241 size_t index = entry->key_hash & (ht->nbuckets - 1); in _Py_hashtable_set()
265 for (size_t hv = 0; hv < ht->nbuckets; hv++) { in _Py_hashtable_foreach()
283 if (new_size == ht->nbuckets) { in hashtable_rehash()
295 for (size_t bucket = 0; bucket < ht->nbuckets; bucket++) { in hashtable_rehash()
309 ht->nbuckets = new_size; in hashtable_rehash()
336 ht->nbuckets = HASHTABLE_MIN_SIZE; in _Py_hashtable_new_full()
339 size_t buckets_size = ht->nbuckets * sizeof(ht->buckets[0]); in _Py_hashtable_new_full()
387 for (size_t i=0; i < ht->nbuckets; i++) { in _Py_hashtable_clear()
406 for (size_t i = 0; i < ht->nbuckets; i++) { in _Py_hashtable_destroy()