Home
last modified time | relevance | path

Searched refs:prime (Results 1 – 25 of 306) sorted by relevance

12345678910>>...13

/netbsd-src/external/lgpl3/gmp/dist/tests/mpz/
H A Dt-lcm.c99 static unsigned long prime[] = { in check_primes() local
122 for (i = 0; i < numberof (prime); i++) in check_primes()
125 mpz_set_ui (y, prime[i]); in check_primes()
126 mpz_mul_ui (want, want, prime[i]); in check_primes()
132 for (i = 0; i < numberof (prime); i++) in check_primes()
134 mpz_set_ui (y, prime[i]); in check_primes()
139 mpz_set_ui (want, prime[0]); in check_primes()
140 for (i = 1; i < numberof (prime); i++) in check_primes()
143 mpz_set_ui (y, prime[i] * prime[i-1]); in check_primes()
144 mpz_mul_ui (want, want, prime[i]); in check_primes()
[all …]
H A Dt-jac.c751 mpz_t prime[], unsigned *exp) in ref_jacobi() argument
759 int legendre = refmpz_legendre (a, prime[i]); in ref_jacobi()
779 mpz_t prime[PRIME_N]; in check_jacobi_factored() local
793 mpz_init (prime[i]); in check_jacobi_factored()
796 mpz_rrandomb (prime[i], rands, size); in check_jacobi_factored()
797 if (mpz_cmp_ui (prime[i], 3) <= 0) in check_jacobi_factored()
798 mpz_set_ui (prime[i], 3); in check_jacobi_factored()
800 mpz_nextprime (prime[i], prime[i]); in check_jacobi_factored()
815 mpz_pow_ui (t, prime[j], exp[j]); in check_jacobi_factored()
823 answer = ref_jacobi (a, b, j, prime, exp); in check_jacobi_factored()
[all …]
/netbsd-src/external/lgpl3/gmp/dist/demos/
H A Dprimes.c57 unsigned int prime; member
75 report (mpz_t prime) in report() argument
80 mpz_out_str (stdout, 10, prime); in report()
89 gap = mpz_get_ui (prime) - prev_prime_low; in report()
93 prev_prime_low = mpz_get_ui (prime); in report()
201 n_primes, primes[n_primes - 1].prime); in main()
244 unsigned long start, start2, prime; in sieve_region() local
265 prime = primes[i].prime; in sieve_region()
273 mpz_set_ui (tmp, prime); in sieve_region()
274 mpz_mul_ui (tmp, tmp, prime); in sieve_region()
[all …]
/netbsd-src/sys/external/bsd/drm2/dist/drm/vmwgfx/
H A Dttm_object.c619 struct ttm_prime_object *prime; in ttm_prime_refcount_release() local
622 prime = container_of(base, struct ttm_prime_object, base); in ttm_prime_refcount_release()
623 BUG_ON(prime->dma_buf != NULL); in ttm_prime_refcount_release()
624 mutex_destroy(&prime->mutex); in ttm_prime_refcount_release()
625 if (prime->refcount_release) in ttm_prime_refcount_release()
626 prime->refcount_release(&base); in ttm_prime_refcount_release()
641 struct ttm_prime_object *prime = in ttm_prime_dmabuf_release() local
643 struct ttm_base_object *base = &prime->base; in ttm_prime_dmabuf_release()
648 mutex_lock(&prime->mutex); in ttm_prime_dmabuf_release()
649 if (prime->dma_buf == dma_buf) in ttm_prime_dmabuf_release()
[all …]
H A Dvmwgfx_bo.c47 struct ttm_prime_object prime; member
490 ttm_prime_object_kfree(vmw_user_bo, prime); in vmw_user_bo_destroy()
561 prime.base); in vmw_user_bo_release()
581 user_bo = container_of(base, struct vmw_user_buffer_object, prime.base); in vmw_user_bo_ref_obj_release()
634 &user_bo->prime, in vmw_user_bo_alloc()
646 *p_base = &user_bo->prime.base; in vmw_user_bo_alloc()
649 *handle = user_bo->prime.base.handle; in vmw_user_bo_alloc()
674 if (likely(ttm_ref_object_exists(tfile, &vmw_user_bo->prime.base))) in vmw_user_bo_verify_access()
731 ret = ttm_ref_object_add(tfile, &user_bo->prime.base, in vmw_user_bo_synccpu_grab()
934 prime.base); in vmw_user_bo_lookup()
[all …]
/netbsd-src/crypto/external/bsd/openssl.old/dist/doc/man1/
H A Dprime.pod5 openssl-prime,
6 prime - compute prime numbers
10 B<openssl prime>
21 The B<prime> command checks if the specified numbers are prime.
41 Generate a prime number.
45 Generate a prime with B<num> bits.
49 When used with B<-generate>, generates a "safe" prime. If the number
50 generated is B<n>, then check that B<(n-1)/2> is also prime.
55 is prime. The default is 20.
/netbsd-src/external/lgpl3/gmp/dist/tests/devel/
H A Dprimes.c71 #define LOOP_ON_SIEVE_CONTINUE(prime,end,sieve) \ argument
78 mp_limb_t prime; \
79 prime = id_to_n(__i)
81 #define LOOP_ON_SIEVE_BEGIN(prime,start,end,off,sieve) \ argument
90 LOOP_ON_SIEVE_CONTINUE(prime,end,sieve)
151 LOOP_ON_SIEVE_BEGIN (prime, off, off + BLOCK_SIZE * GMP_LIMB_BITS - 1, in check_pprime()
165 } while (++begin < prime); in check_pprime()
191 LOOP_ON_SIEVE_BEGIN (prime, n_to_bit(start) + (start % 3 == 0), in check_pprime()
205 } while (++begin < prime); in check_pprime()
264 LOOP_ON_SIEVE_BEGIN (prime, n_to_bit(start) + (start % 3 == 0), in check_nprime()
[all …]
/netbsd-src/external/lgpl3/gmp/dist/mpz/
H A Dnextprime.c55 unsigned long prime; in mpz_nextprime() local
88 prime = 3; in mpz_nextprime()
91 moduli[i] = mpz_tdiv_ui (p, prime); in mpz_nextprime()
92 prime += primegap[i]; in mpz_nextprime()
100 prime = 3; in mpz_nextprime()
107 r = (moduli[i] + incr) % prime; in mpz_nextprime()
108 prime += primegap[i]; in mpz_nextprime()
H A Dprimorial_ui.c51 #define LOOP_ON_SIEVE_CONTINUE(prime,end,sieve) \ argument
58 mp_limb_t prime; \
59 prime = id_to_n(__i)
61 #define LOOP_ON_SIEVE_BEGIN(prime,start,end,off,sieve) \ argument
70 LOOP_ON_SIEVE_CONTINUE(prime,end,sieve)
144 LOOP_ON_SIEVE_BEGIN (prime, n_to_bit(5), n_to_bit (n), 0, sieve); in mpz_primorial_ui()
145 FACTOR_LIST_STORE (prime, prod, max_prod, factors, j); in mpz_primorial_ui()
H A Doddfac_1.c64 #define LOOP_ON_SIEVE_CONTINUE(prime,end,sieve) \ argument
71 mp_limb_t prime; \
72 prime = id_to_n(__i)
74 #define LOOP_ON_SIEVE_BEGIN(prime,start,end,off,sieve) \ argument
83 LOOP_ON_SIEVE_CONTINUE(prime,end,sieve)
217 LOOP_ON_SIEVE_BEGIN (prime, n_to_bit (5), s, 0,sieve); in mpz_2multiswing_1()
218 SWING_A_PRIME (prime, n, prod, max_prod, factors, j); in mpz_2multiswing_1()
225 LOOP_ON_SIEVE_CONTINUE (prime, n_to_bit (n/3), sieve); in mpz_2multiswing_1()
226 SH_SWING_A_PRIME (prime, n, prod, l_max_prod, factors, j); in mpz_2multiswing_1()
231 LOOP_ON_SIEVE_BEGIN (prime, n_to_bit (n >> 1) + 1, n_to_bit (n), 0,sieve); in mpz_2multiswing_1()
[all …]
H A Dbin_uiui.c494 #define LOOP_ON_SIEVE_CONTINUE(prime,end,sieve) \ argument
501 mp_limb_t prime; \
502 prime = id_to_n(__i)
504 #define LOOP_ON_SIEVE_BEGIN(prime,start,end,off,sieve) \ argument
513 LOOP_ON_SIEVE_CONTINUE(prime,end,sieve)
628 LOOP_ON_SIEVE_BEGIN (prime, n_to_bit (5), s, 0,sieve); in mpz_goetgheluck_bin_uiui()
629 COUNT_A_PRIME (prime, n, k, prod, max_prod, factors, j); in mpz_goetgheluck_bin_uiui()
635 LOOP_ON_SIEVE_CONTINUE (prime, n_to_bit (n >> 1),sieve); in mpz_goetgheluck_bin_uiui()
636 SH_COUNT_A_PRIME (prime, n, k, prod, max_prod, factors, j); in mpz_goetgheluck_bin_uiui()
645 LOOP_ON_SIEVE_BEGIN (prime, n_to_bit (n - k) + 1, n_to_bit (n), 0,sieve); in mpz_goetgheluck_bin_uiui()
[all …]
/netbsd-src/crypto/external/bsd/openssl/dist/doc/man1/
H A Dopenssl-prime.pod.in6 openssl-prime - compute prime numbers
10 B<openssl prime>
22 This command checks if the specified numbers are prime.
42 Generate a prime number.
46 Generate a prime with I<num> bits.
50 When used with B<-generate>, generates a "safe" prime. If the number
51 generated is I<n>, then check that C<(I<n>-1)/2> is also prime.
/netbsd-src/external/bsd/wpa/dist/src/crypto/
H A Dcrypto_internal-modexp.c16 int crypto_dh_init(u8 generator, const u8 *prime, size_t prime_len, u8 *privkey, in crypto_dh_init() argument
23 if (os_memcmp(privkey, prime, prime_len) > 0) { in crypto_dh_init()
29 if (crypto_mod_exp(&generator, 1, privkey, prime_len, prime, prime_len, in crypto_dh_init()
42 int crypto_dh_derive_secret(u8 generator, const u8 *prime, size_t prime_len, in crypto_dh_derive_secret() argument
53 os_memcmp(pubkey, prime, prime_len) >= 0)) in crypto_dh_derive_secret()
70 bignum_set_unsigned_bin(p, prime, prime_len) < 0 || in crypto_dh_derive_secret()
82 prime, prime_len, secret, len); in crypto_dh_derive_secret()
/netbsd-src/games/primes/
H A Dpr_tbl.c57 const uint64_t prime[] = { variable
549 const uint64_t *const pr_limit = &prime[(sizeof(prime)/sizeof(prime[0]))-1];
/netbsd-src/sys/external/bsd/drm2/dist/drm/i915/selftests/
H A Dscatterlist.c284 unsigned long prime; in igt_sg_alloc() local
287 for_each_prime_number(prime, max_order) { in igt_sg_alloc()
288 unsigned long size = BIT(prime); in igt_sg_alloc()
331 unsigned long prime; in igt_sg_trim() local
334 for_each_prime_number(prime, max) { in igt_sg_trim()
342 err = alloc_table(&pt, prime, max, *npages, &prng, in igt_sg_trim()
350 if (pt.st.orig_nents != prime || in igt_sg_trim()
351 pt.st.nents != prime) { in igt_sg_trim()
353 pt.st.nents, pt.st.orig_nents, prime); in igt_sg_trim()
370 if (prime > SG_MAX_SINGLE_ALLOC) in igt_sg_trim()
/netbsd-src/crypto/external/bsd/openssl.old/dist/doc/man3/
H A DBN_generate_prime.pod53 BN_generate_prime_ex() generates a pseudo-random prime number of
54 at least bit length B<bits>. The returned number is probably prime
55 with a negligible error. If B<add> is B<NULL> the returned prime
68 potential prime number.
77 When a prime has been found, B<BN_GENCB_call(cb, 2, i)> is called.
86 The prime may have to fulfill additional requirements for use in
89 If B<add> is not B<NULL>, the prime will fulfill the condition p % B<add>
93 If B<safe> is true, it will be a safe prime (i.e. a prime p so
94 that (p-1)/2 is also prime). If B<safe> is true, and B<rem> == B<NULL>
103 prime. The following tests are performed until one of them shows that
[all …]
H A DDH_generate_parameters.pod40 B<prime_len> is the length in bits of the safe prime to be generated.
45 called as described in L<BN_generate_prime(3)> while a random prime
46 number is generated, and when a prime has been found, B<BN_GENCB_call(cb, 3, 0)>
66 The parameter B<p> has been determined to not being an odd prime.
68 prime.
74 suitable, unless B<p> is known to be a strong prime.
86 The parameter B<p> is not prime.
90 The parameter B<p> is not a safe prime and no B<q> value is present.
102 The parameter B<q> is not prime.
H A DRSA_generate_key.pod24 RSA_generate_key_ex() generates a 2-prime RSA key pair and stores it in the
28 RSA_generate_multi_prime_key() generates a multi-prime RSA key pair and stores
60 While a random prime number is generated, it is called as
65 When the n-th randomly generated prime is rejected as not
70 When a random p has been found with p-1 relatively prime to B<e>,
75 The process is then repeated for prime q and other primes (if any)
76 with B<BN_GENCB_call(cb, 3, i)> where B<i> indicates the i-th prime.
/netbsd-src/crypto/external/bsd/heimdal/dist/lib/hcrypto/
H A Dtest_dh.c234 struct prime { struct
304 unsigned char *prime; in set_prime() local
306 prime = (unsigned char *)str2val(str, 16, &len); in set_prime()
307 if (prime == NULL) in set_prime()
309 BN_bin2bn(prime, len, p); in set_prime()
327 static int check_prime(ENGINE *engine, struct prime *pr) in check_prime()
464 struct prime *p = primes; in main()
/netbsd-src/crypto/external/bsd/openssl.old/dist/crypto/rsa/
H A Drsa_gen.c67 BIGNUM *r0 = NULL, *r1 = NULL, *r2 = NULL, *tmp, *prime; in rsa_builtin_keygen() local
153 prime = rsa->p; in rsa_builtin_keygen()
155 prime = rsa->q; in rsa_builtin_keygen()
158 prime = pinfo->r; in rsa_builtin_keygen()
160 BN_set_flags(prime, BN_FLG_CONSTTIME); in rsa_builtin_keygen()
164 if (!BN_generate_prime_ex(prime, bitsr[i] + adj, 0, NULL, NULL, cb)) in rsa_builtin_keygen()
184 if (!BN_cmp(prime, prev_prime)) { in rsa_builtin_keygen()
189 if (!BN_sub(r2, prime, BN_value_one())) in rsa_builtin_keygen()
218 if (!BN_mul(r1, rsa->n, prime, ctx)) in rsa_builtin_keygen()
/netbsd-src/crypto/external/cpl/trousers/dist/src/tspi/daa/daa_issuer/
H A Dprime_gen.c54 int prime; in generate_small_primes() local
82 prime = 2 * i + 3; in generate_small_primes()
83 for (k = i + prime; k < length; k+= prime) in generate_small_primes()
86 if (prime >= starting_prime) { in generate_small_primes()
87 list_add(res, (void *)prime); in generate_small_primes()
/netbsd-src/crypto/external/bsd/openssl/dist/doc/man3/
H A DDH_generate_parameters.pod49 B<prime_len> is the length in bits of the safe prime to be generated.
54 called as described in L<BN_generate_prime(3)> while a random prime
55 number is generated, and when a prime has been found, B<BN_GENCB_call(cb, 3, 0)>
75 The parameter B<p> has been determined to not being an odd prime.
77 prime.
83 suitable, unless B<p> is known to be a strong prime.
103 The parameter B<p> is not prime.
107 The parameter B<p> is not a safe prime and no B<q> value is present.
119 The parameter B<q> is not prime.
H A DRSA_generate_key.pod37 RSA_generate_key_ex() generates a 2-prime RSA key pair and stores it in the
40 RSA_generate_multi_prime_key() generates a multi-prime RSA key pair and stores
71 While a random prime number is generated, it is called as
76 When the n-th randomly generated prime is rejected as not
81 When a random p has been found with p-1 relatively prime to I<e>,
86 The process is then repeated for prime q and other primes (if any)
87 with I<BN_GENCB_call(cb, 3, i)> where I<i> indicates the i-th prime.
/netbsd-src/crypto/external/bsd/openssl/dist/crypto/rsa/
H A Drsa_gen.c78 BIGNUM *r0 = NULL, *r1 = NULL, *r2 = NULL, *tmp, *prime; in rsa_multiprime_keygen() local
180 prime = rsa->p; in rsa_multiprime_keygen()
182 prime = rsa->q; in rsa_multiprime_keygen()
185 prime = pinfo->r; in rsa_multiprime_keygen()
187 BN_set_flags(prime, BN_FLG_CONSTTIME); in rsa_multiprime_keygen()
191 if (!BN_generate_prime_ex2(prime, bitsr[i] + adj, 0, NULL, NULL, in rsa_multiprime_keygen()
212 if (!BN_cmp(prime, prev_prime)) { in rsa_multiprime_keygen()
217 if (!BN_sub(r2, prime, BN_value_one())) in rsa_multiprime_keygen()
246 if (!BN_mul(r1, rsa->n, prime, ctx)) in rsa_multiprime_keygen()
/netbsd-src/external/gpl3/gcc.old/dist/libgomp/
H A Dhashtab.h103 hashval_t prime; member
155 if (n > prime_tab[mid].prime) in higher_prime_index()
162 if (n > prime_tab[low].prime) in higher_prime_index()
215 return htab_mod_1 (hash, p->prime, p->inv, p->shift); in htab_mod()
224 return 1 + htab_mod_1 (hash, p->prime - 2, p->inv_m2, p->shift); in htab_mod_m2()
236 size = prime_tab[size_prime_index].prime; in htab_create()

12345678910>>...13