* We try to be clever about how big we make the hash tables.  Pick * a prime number close to the "suggested" number of elements that * will be in the hash table.  We shoot for minimum collisions (i.e. * one element in each bucket).  We use 64 as the minimum table size.
* We try to be clever about how big we make the hash tables.  Use a * prime number close to the "suggested" number of elements that will * be in the hash table.  Use 64 as the minimum hash table size.
__db_tablesize(n_buckets)	u_int n_buckets;{	int i;	/*	 * We try to be clever about how big we make the hash tables.  Pick	 * a prime number close to the "suggested" number of elements that	 * will be in the hash table.  We shoot for minimum collisions (i.e.	 * one element in each bucket).  We use 64 as the minimum table size.	 *	 * Ref: Sedgewick, Algorithms in C, "Hash Functions"	 */	if (n_buckets < 64)		n_buckets = 64;	for (i = 0;; ++i) {		if (list[i].power == 0) {			--i;			break;		}		if (list[i].power >= n_buckets)			break;	}	return (list[i].prime);}