13 	.sz = 64,
38 	.sz = 32,
122 	unsigned long sz, y;  in expand_to_next_prime()  local
132 	sz = 2 * x;  in expand_to_next_prime()
133 	if (sz < x)  in expand_to_next_prime()
136 	sz = round_up(sz, BITS_PER_LONG);  in expand_to_next_prime()
137 	new = kmalloc(sizeof(*new) + bitmap_size(sz),  in expand_to_next_prime()
153 	bitmap_fill(new->primes, sz);  in expand_to_next_prime()
154 	bitmap_copy(new->primes, p->primes, p->sz);  in expand_to_next_prime()
155 	for (y = 2UL; y < sz; y = find_next_bit(new->primes, sz, y + 1))  in expand_to_next_prime()
156 		new->last = clear_multiples(y, new->primes, p->sz, sz);  in expand_to_next_prime()
157 	new->sz = sz;  in expand_to_next_prime()
237 	while (x >= p->sz) {  in is_prime_number()