59     size_t n_buckets;  member
152   return table->n_buckets;  in hash_get_n_buckets()
233   size_t n_buckets = hash_get_n_buckets (table);  in hash_print_statistics()  local
238   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()
253     = table->bucket + table->hasher (entry, table->n_buckets);  in hash_lookup()
301     = table->bucket + table->hasher (entry, table->n_buckets);  in hash_get_next()
395 hash_string (const char *string, size_t n_buckets)  in hash_string()  argument
407   return value % n_buckets;  in hash_string()
421 hash_string (const char *string, size_t n_buckets)  in hash_string()  argument
427     value = (value * 31 + ch) % n_buckets;  in hash_string()
576   table->n_buckets = next_prime (candidate);  in hash_initialize()
577   if (xalloc_oversized (table->n_buckets, sizeof *table->bucket))  in hash_initialize()
580   table->bucket = calloc (table->n_buckets, sizeof *table->bucket);  in hash_initialize()
581   table->bucket_limit = table->bucket + table->n_buckets;  in hash_initialize()
748     = table->bucket + table->hasher (entry, table->n_buckets);  in hash_find_entry()
845 	       + new_table->hasher (data, new_table->n_buckets));  in hash_rehash()
891   table->n_buckets = new_table->n_buckets;  in hash_rehash()
951       > table->tuning->growth_threshold * table->n_buckets)  in hash_insert()
957 	  > table->tuning->growth_threshold * table->n_buckets)  in hash_insert()
962 	     ? (table->n_buckets * tuning->growth_factor)  in hash_insert()
963 	     : (table->n_buckets * tuning->growth_factor  in hash_insert()
1001 	  < table->tuning->shrink_threshold * table->n_buckets)  in hash_delete()
1007 	      < table->tuning->shrink_threshold * table->n_buckets)  in hash_delete()
1012 		 ? table->n_buckets * tuning->shrink_factor  in hash_delete()
1013 		 : (table->n_buckets * tuning->shrink_factor  in hash_delete()