13 	unsigned long last, sz;  member
20 	.sz = 64,
45 	.sz = 32,
113 	unsigned long sz, y;  in expand_to_next_prime()  local
123 	sz = 2 * x;  in expand_to_next_prime()
124 	if (sz < x)  in expand_to_next_prime()
127 	sz = round_up(sz, BITS_PER_LONG);  in expand_to_next_prime()
128 	new = kmalloc(sizeof(*new) + bitmap_size(sz),  in expand_to_next_prime()
144 	bitmap_fill(new->primes, sz);  in expand_to_next_prime()
145 	bitmap_copy(new->primes, p->primes, p->sz);  in expand_to_next_prime()
146 	for (y = 2UL; y < sz; y = find_next_bit(new->primes, sz, y + 1))  in expand_to_next_prime()
147 		new->last = clear_multiples(y, new->primes, p->sz, sz);  in expand_to_next_prime()
148 	new->sz = sz;  in expand_to_next_prime()
228 	while (x >= p->sz) {  in is_prime_number()
255 		bitmap_print_to_pagebuf(true, buf, p->primes, p->sz);  in dump_primes()
257 		p->last, p->sz, p->primes[BITS_TO_LONGS(p->sz) - 1], buf);  in dump_primes()