Lines Matching refs:x
78 bool slow_is_prime_number(unsigned long x) in slow_is_prime_number() argument
80 unsigned long y = int_sqrt(x); in slow_is_prime_number()
83 if ((x % y) == 0) in slow_is_prime_number()
91 static unsigned long slow_next_prime_number(unsigned long x) in slow_next_prime_number() argument
93 while (x < ULONG_MAX && !slow_is_prime_number(++x)) in slow_next_prime_number()
96 return x; in slow_next_prime_number()
99 static unsigned long clear_multiples(unsigned long x, in clear_multiples() argument
106 m = 2 * x; in clear_multiples()
108 m = roundup(start, x); in clear_multiples()
112 m += x; in clear_multiples()
115 return x; in clear_multiples()
118 static bool expand_to_next_prime(unsigned long x) in expand_to_next_prime() argument
132 sz = 2 * x; in expand_to_next_prime()
133 if (sz < x) in expand_to_next_prime()
144 if (x < p->last) { in expand_to_next_prime()
159 BUG_ON(new->last <= x); in expand_to_next_prime()
197 unsigned long next_prime_number(unsigned long x) in next_prime_number() argument
203 while (x >= p->last) { in next_prime_number()
206 if (!expand_to_next_prime(x)) in next_prime_number()
207 return slow_next_prime_number(x); in next_prime_number()
212 x = find_next_bit(p->primes, p->last, x + 1); in next_prime_number()
215 return x; in next_prime_number()
230 bool is_prime_number(unsigned long x) in is_prime_number() argument
237 while (x >= p->sz) { in is_prime_number()
240 if (!expand_to_next_prime(x)) in is_prime_number()
241 return slow_is_prime_number(x); in is_prime_number()
246 result = test_bit(x, p->primes); in is_prime_number()