Lines Matching defs:primes
18 static unsigned long *primes;
42 * prime_bound: the upper bound for the primes to be generated
43 * starting_prime: the first prime in the list of primes that is returned
44 * return: list of primes up to the specified bound. Each prime is of type bi_ptr
94 primes = (unsigned long *)malloc(sizeof(unsigned long) * primes_length);
95 if (primes == NULL) {
103 primes[i++] = (unsigned long)current->obj;
117 /* Test whether the provided pDash or p = 2*pDash + 1 are divisible by any of the small primes
119 * specified, but it will be ignored if it exeeds the number of precalculated primes.
122 * prime_bound: the limit for the small primes to be tested against.
135 small_prime = primes[i++];
242 * i.e. > (2^(bitLength-1)+2^(bitLength-2)+1). This is done to be sure that if two primes of
265 /* some heuristic checks to limit the number of small primes to check against and the
288 /* test if p_dash or p are divisible by some small primes */
310 // test if pDash or p are divisible by some small primes