| /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];
|
| /src/external/bsd/wpa/dist/src/crypto/ |
| dh_groups.h | 16 const u8 *prime; member in struct:dh_group
|
| /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];
|
| /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/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/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...] |
| /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/dist/crypto/rsa/ |
| rsa_gen.c | 54 /* multi-prime is only supported with the builtin key generation */
61 * have to honour it in 2-prime case and assume that it wouldn't
62 * know what to do with multi-prime key generated by builtin
78 BIGNUM *r0 = NULL, *r1 = NULL, *r2 = NULL, *tmp, *prime; local
149 /* initialize multi-prime components */
180 prime = rsa->p;
182 prime = rsa->q;
185 prime = pinfo->r;
187 BN_set_flags(prime, BN_FLG_CONSTTIME);
191 if (!BN_generate_prime_ex2(prime, bitsr[i] + adj, 0, NULL, NULL
[all...] |
| /src/crypto/external/cpl/trousers/dist/src/tspi/daa/daa_issuer/ |
| prime_gen.c | 39 /* This method generates small prime numbers up to a specified bounds using the Sieve of
43 * starting_prime: the first prime in the list of primes that is returned
44 * return: list of primes up to the specified bound. Each prime is of type bi_ptr
54 int prime; local
82 prime = 2 * i + 3;
83 for (k = i + prime; k < length; k+= prime)
86 if (prime >= starting_prime) {
87 list_add(res, (void *)prime);
118 * saved in the listOfSmallPrimes. A limit for the largest prime to be tested against can b
[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/sys/arch/mipsco/obio/ |
| asc.c | 293 int prime, err; local
323 prime = (uint32_t)paddr & 0x3f;
324 blocks = (prime + count + 63) >> 6;
337 /* If non block-aligned transfer prime FIFO manually */
338 if (prime) {
339 /* Enable DMA to prime the FIFO buffer */
349 RAMBO_FIFO, p, prime>>1);
352 while (prime > 0) {
355 prime -= 2;
|
| /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...] |
| i915_request.c | 542 unsigned long n, prime; local
551 for_each_prime_number_from(prime, 1, 8192) {
556 for (n = 0; n < prime; n++) {
583 if (prime == 1)
598 prime, div64_u64(ktime_to_ns(times[1]), prime));
697 unsigned long n, prime; local
715 for_each_prime_number_from(prime, 1, 8192) {
718 for (n = 0; n < prime; n++) {
730 if (prime == 1
[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...] |
| vmwgfx_bo.c | 43 * @prime: The prime object providing user visibility.
47 struct ttm_prime_object prime; member in struct:vmw_user_buffer_object
490 ttm_prime_object_kfree(vmw_user_bo, prime);
561 prime.base);
581 user_bo = container_of(base, struct vmw_user_buffer_object, prime.base);
634 &user_bo->prime,
646 *p_base = &user_bo->prime.base;
649 *handle = user_bo->prime.base.handle;
674 if (likely(ttm_ref_object_exists(tfile, &vmw_user_bo->prime.base))
[all...] |
| /src/sys/external/bsd/drm2/dist/include/drm/ |
| drm_file.h | 352 * @prime:
354 * Per-file buffer caches used by the PRIME buffer sharing code.
356 struct drm_prime_file_private prime; member in struct:drm_file
|
| /src/crypto/external/apache2/openssl/dist/crypto/rsa/ |
| rsa_gen.c | 54 /* multi-prime is only supported with the builtin key generation */
61 * have to honour it in 2-prime case and assume that it wouldn't
62 * know what to do with multi-prime key generated by builtin
78 * and coefficients for each prime in this key, placing the result
134 /* our first prime, p */
142 /* second prime q */
268 BIGNUM *r0 = NULL, *r1 = NULL, *r2 = NULL, *tmp, *tmp2, *prime; local
346 /* initialize multi-prime components */
377 prime = rsa->p;
379 prime = rsa->q
[all...] |
| /src/crypto/external/bsd/openssh/dist/ |
| dh.c | 64 char *strsize, *gen, *prime; local
84 /* Ensure this is a safe prime */
93 /* Ensure prime has been tested and is not composite */
112 error("moduli:%d: invalid prime length", linenum);
120 prime = strsep(&cp, " "); /* prime */
121 if (cp != NULL || *prime == '\0') {
136 if (BN_hex2bn(&dhg->p, prime) == 0) {
137 error("moduli:%d: could not parse prime value", linenum);
141 error("moduli:%d: prime has wrong size: actual %d listed %d"
[all...] |
| /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...] |
| /src/external/gpl3/gcc/dist/libgomp/ |
| hashtab.h | 103 hashval_t prime; member in struct:prime_ent
105 hashval_t inv_m2; /* inverse of prime-2 */
144 nearest prime number which is greater than N, and near a power of two. */
155 if (n > prime_tab[mid].prime)
162 if (n > prime_tab[low].prime)
215 return htab_mod_1 (hash, p->prime, p->inv, p->shift);
224 return 1 + htab_mod_1 (hash, p->prime - 2, p->inv_m2, p->shift);
245 size = prime_tab[size_prime_index].prime;
|
| /src/external/gpl3/gcc.old/dist/libgomp/ |
| hashtab.h | 103 hashval_t prime; member in struct:prime_ent
105 hashval_t inv_m2; /* inverse of prime-2 */
144 nearest prime number which is greater than N, and near a power of two. */
155 if (n > prime_tab[mid].prime)
162 if (n > prime_tab[low].prime)
215 return htab_mod_1 (hash, p->prime, p->inv, p->shift);
224 return 1 + htab_mod_1 (hash, p->prime - 2, p->inv_m2, p->shift);
245 size = prime_tab[size_prime_index].prime;
|
| /src/crypto/dist/ipsec-tools/src/racoon/ |
| oakley.h | 155 vchar_t *prime; member in struct:dhgroup
|
| /src/external/bsd/unbound/dist/edns-subnet/ |
| subnetmod.c | 554 int prime = 0; local
570 if(!(*qstate->env->attach_sub)(qstate, &qinf, qflags, prime, valrec,
|
| /src/external/gpl3/binutils/dist/libiberty/ |
| hashtab.c | 128 hashval_t prime; member in struct:prime_ent
130 hashval_t inv_m2; /* inverse of prime-2 */
169 nearest prime number which is greater than N, and near a power of two. */
180 if (n > prime_tab[mid].prime)
187 if (n > prime_tab[low].prime)
189 fprintf (stderr, "Cannot find prime bigger than %lu\n", n);
264 return htab_mod_1 (hash, p->prime, p->inv, p->shift);
273 return 1 + htab_mod_1 (hash, p->prime - 2, p->inv_m2, p->shift);
302 size = prime_tab[size_prime_index].prime;
355 size = prime_tab[size_prime_index].prime;
[all...] |
| /src/external/gpl3/binutils.old/dist/libiberty/ |
| hashtab.c | 128 hashval_t prime; member in struct:prime_ent
130 hashval_t inv_m2; /* inverse of prime-2 */
169 nearest prime number which is greater than N, and near a power of two. */
180 if (n > prime_tab[mid].prime)
187 if (n > prime_tab[low].prime)
189 fprintf (stderr, "Cannot find prime bigger than %lu\n", n);
264 return htab_mod_1 (hash, p->prime, p->inv, p->shift);
273 return 1 + htab_mod_1 (hash, p->prime - 2, p->inv_m2, p->shift);
302 size = prime_tab[size_prime_index].prime;
355 size = prime_tab[size_prime_index].prime;
[all...] |
