| /src/games/primes/ |
| pr_tbl.c | 45 * prime - prime table
57 const uint64_t prime[] = { variable
548 /* pr_limit - largest prime in the prime table */
549 const uint64_t *const pr_limit = &prime[(sizeof(prime)/sizeof(prime[0]))-1];
|
| primes.h | 50 * prime[i] is the (i-1)th prime.
56 extern const uint64_t prime[]; /* must be >=32 bit unsigned values */
57 extern const uint64_t *const pr_limit; /* largest prime in the prime array */
|
| /src/external/lgpl3/gmp/dist/tests/mpz/ |
| t-lcm.c | 99 static unsigned long prime[] = { local
120 /* New prime each time. */
122 for (i = 0; i < numberof (prime); i++)
125 mpz_set_ui (y, prime[i]);
126 mpz_mul_ui (want, want, prime[i]);
130 /* Old prime each time. */
132 for (i = 0; i < numberof (prime); i++)
134 mpz_set_ui (y, prime[i]);
139 mpz_set_ui (want, prime[0]);
140 for (i = 1; i < numberof (prime); i++
[all...] |
| /src/external/lgpl3/gmp/dist/mpz/ |
| nextprime.c | 1 /* mpz_nextprime(p,t) - compute the next prime > t and store that in p.
55 unsigned long prime; local
88 prime = 3;
91 moduli[i] = mpz_tdiv_ui (p, prime);
92 prime += primegap[i];
100 prime = 3;
107 r = (moduli[i] + incr) % prime;
108 prime += primegap[i];
|
| primorial_ui.c | 51 #define LOOP_ON_SIEVE_CONTINUE(prime,end,sieve) \
58 mp_limb_t prime; \
59 prime = id_to_n(__i)
61 #define LOOP_ON_SIEVE_BEGIN(prime,start,end,off,sieve) \
70 LOOP_ON_SIEVE_CONTINUE(prime,end,sieve)
144 LOOP_ON_SIEVE_BEGIN (prime, n_to_bit(5), n_to_bit (n), 0, sieve);
145 FACTOR_LIST_STORE (prime, prod, max_prod, factors, j);
|
| oddfac_1.c | 64 #define LOOP_ON_SIEVE_CONTINUE(prime,end,sieve) \
71 mp_limb_t prime; \
72 prime = id_to_n(__i)
74 #define LOOP_ON_SIEVE_BEGIN(prime,start,end,off,sieve) \
83 LOOP_ON_SIEVE_CONTINUE(prime,end,sieve)
151 if (__exp) { /* Store $prime^{exp}$ */ \
205 /* Handle prime = 3 separately. */
217 LOOP_ON_SIEVE_BEGIN (prime, n_to_bit (5), s, 0,sieve);
218 SWING_A_PRIME (prime, n, prod, max_prod, factors, j);
225 LOOP_ON_SIEVE_CONTINUE (prime, n_to_bit (n/3), sieve)
[all...] |
| /src/external/bsd/wpa/dist/src/common/ |
| dragonfly.c | 21 * purposes: FFC groups whose prime is >= 3072 bits and ECC groups
22 * defined over a prime field whose prime is >= 256 bits. Furthermore,
26 * timing information due to the prime not being close to a power of
44 /* FFC groups that have prime that is close to a power of two */
53 int dragonfly_get_random_qr_qnr(const struct crypto_bignum *prime,
64 if (!tmp || crypto_bignum_rand(tmp, prime) < 0) {
69 res = crypto_bignum_legendre(tmp, prime);
91 dragonfly_get_rand_1_to_p_1(const struct crypto_bignum *prime)
99 crypto_bignum_sub(prime, one, pm1) < 0 |
119 const struct crypto_bignum *prime; local
225 const struct crypto_bignum *prime; local
[all...] |
| dragonfly.h | 20 int dragonfly_get_random_qr_qnr(const struct crypto_bignum *prime,
|
| sae.c | 51 tmp->prime = crypto_ec_get_prime(tmp->ec);
69 tmp->prime_buf = crypto_bignum_init_set(tmp->dh->prime,
75 tmp->prime = tmp->prime_buf;
148 const u8 *prime, const u8 *qr, const u8 *qnr,
162 prime, sae->tmp->prime_len, pwd_value, bits) < 0)
169 cmp_prime = const_time_memcmp(pwd_value, prime, sae->tmp->prime_len);
171 * being smaller than prime. */
210 sae->tmp->dh->prime, sae->tmp->prime_len, pwd_value,
217 res = const_time_memcmp(pwd_value, sae->tmp->dh->prime,
251 crypto_bignum_sub(sae->tmp->prime, b, b) < 0 |
293 u8 prime[SAE_MAX_ECC_PRIME_LEN]; local
637 const struct crypto_bignum *a, *b, *prime; local
880 const struct crypto_bignum *prime; local
978 struct crypto_bignum *prime, *order; local
1220 struct crypto_bignum *pwe = NULL, *order = NULL, *prime = NULL; local
1950 u8 prime[SAE_MAX_ECC_PRIME_LEN]; local
[all...] |
| /src/external/lgpl3/gmp/dist/demos/ |
| primes.c | 57 unsigned int prime; member in struct:primes
75 report (mpz_t prime)
80 mpz_out_str (stdout, 10, prime);
89 gap = mpz_get_ui (prime) - prev_prime_low;
93 prev_prime_low = mpz_get_ui (prime);
201 n_primes, primes[n_primes - 1].prime);
244 unsigned long start, start2, prime; local
265 prime = primes[i].prime;
273 mpz_set_ui (tmp, prime);
[all...] |
| /src/external/bsd/unbound/dist/testdata/fast_reload_fwd.tdir/ |
| fast_reload_fwd.conf | 55 stub-prime: no
60 stub-prime: no
65 stub-prime: no
70 stub-prime: no
75 stub-prime: no
80 stub-prime: no
|
| /src/external/bsd/unbound/dist/testdata/subnet_cache_lookup.tdir/ |
| subnet_cache_lookup.conf | 27 stub-prime: no
31 stub-prime: no
35 stub-prime: no
|
| /src/external/bsd/wpa/dist/src/crypto/ |
| crypto_internal-modexp.c | 16 int crypto_dh_init(u8 generator, const u8 *prime, size_t prime_len, u8 *privkey,
23 if (os_memcmp(privkey, prime, prime_len) > 0) {
24 /* Make sure private value is smaller than prime */
29 if (crypto_mod_exp(&generator, 1, privkey, prime_len, prime, prime_len,
42 int crypto_dh_derive_secret(u8 generator, const u8 *prime, size_t prime_len,
53 os_memcmp(pubkey, prime, prime_len) >= 0))
70 bignum_set_unsigned_bin(p, prime, prime_len) < 0 ||
82 prime, prime_len, secret, len);
|
| dh_groups.h | 16 const u8 *prime; member in struct:dh_group
|
| /src/external/lgpl3/gmp/dist/tests/devel/ |
| primes.c | 71 #define LOOP_ON_SIEVE_CONTINUE(prime,end,sieve) \
78 mp_limb_t prime; \
79 prime = id_to_n(__i)
81 #define LOOP_ON_SIEVE_BEGIN(prime,start,end,off,sieve) \
90 LOOP_ON_SIEVE_CONTINUE(prime,end,sieve)
151 LOOP_ON_SIEVE_BEGIN (prime, off, off + BLOCK_SIZE * GMP_LIMB_BITS - 1,
165 } while (++begin < prime);
191 LOOP_ON_SIEVE_BEGIN (prime, n_to_bit(start) + (start % 3 == 0),
205 } while (++begin < prime);
264 LOOP_ON_SIEVE_BEGIN (prime, n_to_bit(start) + (start % 3 == 0)
[all...] |
| /src/sys/external/bsd/drm2/dist/drm/vmwgfx/ |
| ttm_object.c | 33 * While no substantial code is shared, the prime code is inspired by
607 * ttm_prime_refcount_release - refcount release method for a prime object.
612 * underlying object. At the same time it cleans up the prime object.
619 struct ttm_prime_object *prime; local
622 prime = container_of(base, struct ttm_prime_object, base);
623 BUG_ON(prime->dma_buf != NULL);
624 mutex_destroy(&prime->mutex);
625 if (prime->refcount_release)
626 prime->refcount_release(&base);
641 struct ttm_prime_object *prime local
672 struct ttm_prime_object *prime; local
709 struct ttm_prime_object *prime; local
[all...] |
| /src/external/gpl3/gdb.old/dist/gdb/testsuite/gdb.fortran/ |
| short-circuit-argument-list.exp | 34 set prime 17
36 # Reset all call counts to the initial value ($prime).
38 global prime
40 gdb_test_no_output "set var calls%function_${counter}_called=$prime"
71 " = \\\( function_no_arg_called = $prime, function_no_arg_false_called = $prime, function_one_arg_called = $prime, function_two_arg_called = $prime, function_array_called = $prime \\\)"
81 " = \\\( function_no_arg_called = [expr $prime + 1], function_no_arg_false_called = $prime, function_one_arg_called = [expr $prime + 1], function (…)
[all...] |
| /src/external/gpl3/gdb/dist/gdb/testsuite/gdb.fortran/ |
| short-circuit-argument-list.exp | 34 set prime 17
36 # Reset all call counts to the initial value ($prime).
38 global prime
40 gdb_test_no_output "set var calls%function_${counter}_called=$prime"
71 " = \\\( function_no_arg_called = $prime, function_no_arg_false_called = $prime, function_one_arg_called = $prime, function_two_arg_called = $prime, function_array_called = $prime \\\)"
81 " = \\\( function_no_arg_called = [expr $prime + 1], function_no_arg_false_called = $prime, function_one_arg_called = [expr $prime + 1], function (…)
[all...] |
| /src/external/gpl3/gcc/dist/gcc/ |
| hash-table.cc | 81 nearest prime number which is at least N, and near a power of two. */
92 if (n > prime_tab[mid].prime)
99 gcc_assert (n <= prime_tab[low].prime);
|
| /src/external/gpl3/gcc.old/dist/gcc/ |
| hash-table.cc | 81 nearest prime number which is at least N, and near a power of two. */
92 if (n > prime_tab[mid].prime)
99 gcc_assert (n <= prime_tab[low].prime);
|
| /src/sys/external/bsd/drm2/dist/drm/i915/selftests/ |
| scatterlist.c | 284 unsigned long prime; local
287 for_each_prime_number(prime, max_order) {
288 unsigned long size = BIT(prime);
329 const unsigned long max = PAGE_SIZE; /* not prime! */
331 unsigned long prime; local
334 for_each_prime_number(prime, max) {
342 err = alloc_table(&pt, prime, max, *npages, &prng,
350 if (pt.st.orig_nents != prime ||
351 pt.st.nents != prime) {
353 pt.st.nents, pt.st.orig_nents, prime);
[all...] |
| /src/crypto/external/bsd/heimdal/dist/lib/hcrypto/ |
| test_dh.c | 234 struct prime { struct
304 unsigned char *prime; local
306 prime = (unsigned char *)str2val(str, 16, &len);
307 if (prime == NULL)
309 BN_bin2bn(prime, len, p);
327 static int check_prime(ENGINE *engine, struct prime *pr)
464 struct prime *p = primes;
|
| /src/crypto/external/bsd/openssl.old/dist/crypto/rsa/ |
| rsa_gen.c | 44 /* multi-prime is only supported with the builtin key generation */
51 * have to honour it in 2-prime case and assume that it wouldn't
52 * know what to do with multi-prime key generated by builtin
67 BIGNUM *r0 = NULL, *r1 = NULL, *r2 = NULL, *tmp, *prime; local
123 /* initialize multi-prime components */
153 prime = rsa->p;
155 prime = rsa->q;
158 prime = pinfo->r;
160 BN_set_flags(prime, BN_FLG_CONSTTIME);
164 if (!BN_generate_prime_ex(prime, bitsr[i] + adj, 0, NULL, NULL, cb)
[all...] |
| /src/external/bsd/unbound/dist/util/ |
| fptr_wlist.h | 236 uint16_t qflags, int prime, int valrec, struct module_qstate** newq));
245 struct query_info* qinfo, uint16_t qflags, int prime, int valrec,
263 uint16_t flags, int prime, int valrec));
|
| /src/external/bsd/wpa/dist/src/eap_common/ |
| eap_pwd_common.c | 148 const struct crypto_bignum *prime; local
159 prime = crypto_ec_get_prime(grp->group);
162 if (crypto_bignum_to_bin(prime, prime_bin, sizeof(prime_bin),
173 if (dragonfly_get_random_qr_qnr(prime, &qr, &qnr) < 0 ||
192 * compute counter-mode password value and stretch to prime
218 * being smaller than prime. */
254 * prime) handles this in constant time.
284 crypto_bignum_sub(prime, y, y) < 0 ||
416 static int eap_pwd_element_coord_ok(const struct crypto_bignum *prime,
424 crypto_bignum_cmp(val, prime) >= 0
435 const struct crypto_bignum *prime; local
[all...] |
