Searched refs:primes (Results 1 – 7 of 7) sorted by relevance
| /linux-6.3-rc2/lib/math/ |
| A D | prime_numbers.c | 11 struct primes { struct
14 unsigned long primes[]; argument
21 .primes = {
46 .primes = {
65 static const struct primes __rcu *primes = RCU_INITIALIZER(&small_primes); variable
111 const struct primes *p; in expand_to_next_prime()
112 struct primes *new; in expand_to_next_prime()
145 bitmap_copy(new->primes, p->primes, p->sz); in expand_to_next_prime()
163 const struct primes *p; in free_primes()
190 const struct primes *p; in next_prime_number()
[all …]
|
| /linux-6.3-rc2/lib/ |
| A D | test_printf.c | 562 const int primes[] = {2,3,5,7,11,13,17,19}; in bitmap() local
569 for (i = 0; i < ARRAY_SIZE(primes); ++i) in bitmap()
570 set_bit(primes[i], bits); in bitmap()
|
| /linux-6.3-rc2/net/netfilter/ipvs/ |
| A D | ip_vs_mh.c | 50 static int primes[] = {251, 509, 1021, 2039, 4093, variable
59 #define IP_VS_MH_TAB_SIZE primes[IP_VS_MH_TAB_INDEX]
|
| /linux-6.3-rc2/drivers/gpu/drm/nouveau/nvkm/engine/gr/ |
| A D | gf100.c | 1915 static const u8 primes[] = { in gf100_gr_oneinit_tiles() local
1935 for (i = 0; i < ARRAY_SIZE(primes); i++) { in gf100_gr_oneinit_tiles()
1936 if (gr->tpc_total % primes[i]) { in gf100_gr_oneinit_tiles()
1937 gr->screen_tile_row_offset = primes[i]; in gf100_gr_oneinit_tiles()
|
| /linux-6.3-rc2/Documentation/ABI/stable/ |
| A D | sysfs-class-tpm | 155 Num primes: 00 00 00 02 (2)
|
| /linux-6.3-rc2/tools/memory-model/Documentation/ |
| A D | recipes.txt | 284 that is expanded as additional primes are needed.
|
| /linux-6.3-rc2/Documentation/admin-guide/ |
| A D | bcache.rst | 329 disk array in the future, then multiply a series of primes by your
|
Completed in 23 milliseconds