Searched refs:n_buckets (Results 1 – 3 of 3) sorted by relevance
59 size_t n_buckets; member152 return table->n_buckets; in hash_get_n_buckets()233 size_t n_buckets = hash_get_n_buckets (table); in hash_print_statistics() local238 fprintf (stream, "# buckets: %lu\n", (unsigned long int) n_buckets); in hash_print_statistics()241 (100.0 * n_buckets_used) / n_buckets); in hash_print_statistics()251 size_t n = table->hasher (key, table->n_buckets); in safe_hasher()252 if (! (n < table->n_buckets)) in safe_hasher()405 hash_string (const char *string, size_t n_buckets) in hash_string() argument415 return value % n_buckets; in hash_string()428 hash_string (const char *string, size_t n_buckets) in hash_string() argument[all …]
179 int n_buckets; /**< Total number of buckets allocated member309 table->n_buckets = DBUS_SMALL_HASH_TABLE; in _dbus_hash_table_new()317 _dbus_assert (table->mask < table->n_buckets); in _dbus_hash_table_new()373 for (i = 0; i < table->n_buckets; i++) in _dbus_hash_table_unref()390 for (i = 0; i < table->n_buckets; i++) in _dbus_hash_table_unref()560 if (real->next_bucket >= real->table->n_buckets) in _dbus_hash_iter_next()937 old_size = table->n_buckets; in rebuild_table()943 if (table->n_buckets < _DBUS_INT_MAX / 4 && in rebuild_table()945 new_buckets = table->n_buckets * 4; in rebuild_table()951 new_buckets = table->n_buckets / 4; in rebuild_table()[all …]
790 | 0xXXXXXXXX | BUCKETS[n_buckets]854 table with "``n_buckets``" buckets, and "``n_hashes``" unique 32 bit hash869 | BUCKETS | uint32_t[n_buckets] // 32 bit hash indexes891 | ... | BUCKETS[n_buckets]967 hash value and modulo it by ``n_buckets``. ``BUCKETS[3]`` contains "6" which971 ``n_buckets`` is still 3. In the case of a failed lookup we would access the