Searched refs:divn (Results 1 – 3 of 3) sorted by relevance
279 unsigned long int divn = 3; in is_prime() local280 unsigned long int sq = divn * divn; in is_prime()282 while (sq < candidate && candidate % divn != 0) in is_prime()284 ++divn; in is_prime()285 sq += 4 * divn; in is_prime()286 ++divn; in is_prime()289 return candidate % divn != 0; in is_prime()
593 size_t divn = 3; in is_prime() local594 size_t sq = divn * divn; in is_prime()598 while (sq < candidate && candidate % divn != 0) in is_prime()600 ++divn; in is_prime()601 sq += 4 * divn; in is_prime()602 ++divn; in is_prime()605 return candidate % divn != 0; in is_prime()
913 unsigned long int divn = 3; in is_prime() local914 unsigned long int sq = divn * divn; in is_prime()916 while (sq < candidate && candidate % divn != 0) in is_prime()918 ++divn; in is_prime()919 sq += 4 * divn; in is_prime()920 ++divn; in is_prime()923 return candidate % divn != 0; in is_prime()