gcclibs/libiberty/hashtab.c

126   hashval_t prime;
128   hashval_t inv_m2;	/* inverse of prime-2 */
167    nearest prime number which is greater than N, and near a power of two. */
178       if (n > prime_tab[mid].prime)
185   if (n > prime_tab[low].prime)
187       fprintf (stderr, "Cannot find prime bigger than %lu\n", n);
270   return htab_mod_1 (hash, p->prime, p->inv, p->shift);
279   return 1 + htab_mod_1 (hash, p->prime - 2, p->inv_m2, p->shift);
295   size = prime_tab[size_prime_index].prime;
330   size = prime_tab[size_prime_index].prime;
428       int nsize = prime_tab[nindex].prime;
512       nsize = prime_tab[nindex].prime;
793    prime numbers or the appropriate identity.  This was the best one.
878 mod a prime (mod is sooo slow!).  If you need less than 32 bits,