primes           1864 drivers/gpu/drm/nouveau/nvkm/engine/gr/gf100.c 	static const u8 primes[] = {
primes           1884 drivers/gpu/drm/nouveau/nvkm/engine/gr/gf100.c 		for (i = 0; i < ARRAY_SIZE(primes); i++) {
primes           1885 drivers/gpu/drm/nouveau/nvkm/engine/gr/gf100.c 			if (gr->tpc_total % primes[i]) {
primes           1886 drivers/gpu/drm/nouveau/nvkm/engine/gr/gf100.c 				gr->screen_tile_row_offset = primes[i];
primes             14 lib/math/prime_numbers.c 	unsigned long primes[];
primes             18 lib/math/prime_numbers.c static const struct primes small_primes = {
primes             21 lib/math/prime_numbers.c 	.primes = {
primes             43 lib/math/prime_numbers.c static const struct primes small_primes = {
primes             46 lib/math/prime_numbers.c 	.primes = {
primes             65 lib/math/prime_numbers.c static const struct primes __rcu *primes = RCU_INITIALIZER(&small_primes);
primes            111 lib/math/prime_numbers.c 	const struct primes *p;
primes            112 lib/math/prime_numbers.c 	struct primes *new;
primes            134 lib/math/prime_numbers.c 	p = rcu_dereference_protected(primes, lockdep_is_held(&lock));
primes            144 lib/math/prime_numbers.c 	bitmap_fill(new->primes, sz);
primes            145 lib/math/prime_numbers.c 	bitmap_copy(new->primes, p->primes, p->sz);
primes            146 lib/math/prime_numbers.c 	for (y = 2UL; y < sz; y = find_next_bit(new->primes, sz, y + 1))
primes            147 lib/math/prime_numbers.c 		new->last = clear_multiples(y, new->primes, p->sz, sz);
primes            152 lib/math/prime_numbers.c 	rcu_assign_pointer(primes, new);
primes            154 lib/math/prime_numbers.c 		kfree_rcu((struct primes *)p, rcu);
primes            163 lib/math/prime_numbers.c 	const struct primes *p;
primes            166 lib/math/prime_numbers.c 	p = rcu_dereference_protected(primes, lockdep_is_held(&lock));
primes            168 lib/math/prime_numbers.c 		rcu_assign_pointer(primes, &small_primes);
primes            169 lib/math/prime_numbers.c 		kfree_rcu((struct primes *)p, rcu);
primes            190 lib/math/prime_numbers.c 	const struct primes *p;
primes            193 lib/math/prime_numbers.c 	p = rcu_dereference(primes);
primes            201 lib/math/prime_numbers.c 		p = rcu_dereference(primes);
primes            203 lib/math/prime_numbers.c 	x = find_next_bit(p->primes, p->last, x + 1);
primes            223 lib/math/prime_numbers.c 	const struct primes *p;
primes            227 lib/math/prime_numbers.c 	p = rcu_dereference(primes);
primes            235 lib/math/prime_numbers.c 		p = rcu_dereference(primes);
primes            237 lib/math/prime_numbers.c 	result = test_bit(x, p->primes);
primes            246 lib/math/prime_numbers.c 	const struct primes *p;
primes            252 lib/math/prime_numbers.c 	p = rcu_dereference(primes);
primes            255 lib/math/prime_numbers.c 		bitmap_print_to_pagebuf(true, buf, p->primes, p->sz);
primes            257 lib/math/prime_numbers.c 		p->last, p->sz, p->primes[BITS_TO_LONGS(p->sz) - 1], buf);
primes            539 lib/test_printf.c 	const int primes[] = {2,3,5,7,11,13,17,19};
primes            546 lib/test_printf.c 	for (i = 0; i < ARRAY_SIZE(primes); ++i)
primes            547 lib/test_printf.c 		set_bit(primes[i], bits);
primes             50 net/netfilter/ipvs/ip_vs_mh.c static int primes[] = {251, 509, 1021, 2039, 4093,
primes             59 net/netfilter/ipvs/ip_vs_mh.c #define IP_VS_MH_TAB_SIZE               primes[IP_VS_MH_TAB_INDEX]