/netbsd-6-1-5-RELEASE/external/gpl3/gcc/dist/gcc/testsuite/gcc.c-torture/execute/ |
H A D | pr29798.c | 12 double rho = work * work; local 14 beta = rho / oldrho; 23 oldrho = rho;
|
/netbsd-6-1-5-RELEASE/external/gpl3/gcc/dist/gcc/testsuite/gcc.c-torture/compile/ |
H A D | 920723-1.c | 13 f(int count,vector_t*pos,double r,double *rho) argument 20 rho[i] = 0; 27 rho[i] += help;
|
/netbsd-6-1-5-RELEASE/gnu/dist/gcc4/gcc/testsuite/gcc.c-torture/compile/ |
H A D | 920723-1.c | 13 f(int count,vector_t*pos,double r,double *rho) argument 20 rho[i] = 0; 27 rho[i] += help;
|
/netbsd-6-1-5-RELEASE/crypto/external/bsd/heimdal/dist/lib/hcrypto/libtommath/ |
H A D | bn_mp_montgomery_setup.c | 22 mp_montgomery_setup (mp_int * n, mp_digit * rho) argument 52 /* rho = -1/m mod b */ 53 *rho = (unsigned long)(((mp_word)1 << ((mp_word) DIGIT_BIT)) - x) & MP_MASK;
|
H A D | bn_mp_montgomery_reduce.c | 22 mp_montgomery_reduce (mp_int * x, mp_int * n, mp_digit rho) argument 37 return fast_mp_montgomery_reduce (x, n, rho); 49 /* mu = ai * rho mod b 51 * The value of rho must be precalculated via 57 mu = (mp_digit) (((mp_word)x->dp[ix]) * ((mp_word)rho) & MP_MASK);
|
H A D | bn_fast_mp_montgomery_reduce.c | 28 int fast_mp_montgomery_reduce (mp_int * x, mp_int * n, mp_digit rho) argument 78 mu = (mp_digit) (((W[ix] & MP_MASK) * rho) & MP_MASK);
|
H A D | tommath.tex | 2723 Let $\rho = lg(\beta)$ represent the number of bits in a single precision digit. By further re-arrangement of the equation the final solution is 2727 k < {{2^{\alpha}} \over {\left (2^{2\rho} - 2^{\rho + 1} + 1 \right )}} 4027 extensively in this algorithm and should be precomputed. Let $\rho$ represent the negative of the modular inverse of $n_0$ modulo $\beta$. 4029 For example, let $\beta = 10$ represent the radix. Let $n = 17$ represent the modulus which implies $k = 2$ and $\rho \equiv 7$. Let $x = 33$ 4059 \textbf{Input}. mp\_int $x$, mp\_int $n$ and a digit $\rho \equiv -1/n_0 \mbox{ (mod }n\mbox{)}$. \\ 4073 \hspace{3mm}5.1 $\mu \leftarrow x_{ix} \cdot \rho \mbox{ (mod }\beta\mbox{)}$ \\ 4101 for the Barrett algorithm. Additionally if $n > 1$ and $n$ is odd there will exist a modular inverse $\rho$. $\rho$ must be calculated in 4147 \textbf{Input}. mp\_int $x$, mp\_int $n$ and a digit $\rho \equi [all...] |
/netbsd-6-1-5-RELEASE/crypto/external/cpl/trousers/dist/src/tspi/daa/daa_issuer/ |
H A D | keypair_generator.c | 118 bi_ptr rho = NULL; local 240 rho = bi_new_ptr(); 244 bi_generate_prime(rho, DAA_PARAM_SIZE_RHO); 245 if (bi_length(rho) != DAA_PARAM_SIZE_RHO) { 246 LogError("rho bit length=%ld", bi_length(rho)); 255 } while(bi_length(r) != length || bi_equals_si(bi_mod(bi_tmp, r, rho), 0)); 257 // rho is not a dividor of r 258 bi_mul( capital_gamma, rho, r); 273 bi_mod(bi_tmp1, bi_mul(bi_tmp2, rho, [all...] |
H A D | key_correctness_proof.c | 210 if( !bi_is_probable_prime( public_key->rho)) { 211 LogError( "pk->rho not prime\nrho=\n%s", 212 bi_2_hex_char( public_key->rho)); 216 // (capitalGamma - 1) % rho should be equal to 0 218 public_key->rho), 220 LogError( "(capitalGamma - 1) %% rho != 0\nActual value:\n%s", 224 // (gamma ^ rho) % capitalGamma should be equals to 1 226 public_key->rho, 229 LogError( "(gamma ^ rho) %% capitalGamma != 1\nActual value:\n%s", 234 // (gamma ^ rho) [all...] |
/netbsd-6-1-5-RELEASE/crypto/external/cpl/trousers/dist/src/tspi/ |
H A D | tsp_daa.c | 56 Trspi_LoadBlob(offset, pk->rhoLength, blob, pk->rho); 148 if ((pk->rho = malloc(pk->rhoLength)) == NULL) 151 Trspi_UnloadBlob(offset, pk->rhoLength, blob, pk->rho); 153 pk->rho = NULL; 195 free(pk->rho);
|
/netbsd-6-1-5-RELEASE/crypto/external/cpl/trousers/dist/src/tspi/daa/daa_anonymityrevocation/ |
H A D | csencryption_result.c | 156 // exp = exp % daa_key->rho 157 bi_mod( exp, exp, daa_key->rho); 196 if( bi_cmp( randomness, daa_key->rho) >=0 || bi_cmp_si( randomness, 0) < 0) { 197 LogError("randomness >= rho || randomness < 0 \n\trandomness:%s\n\trho:%s\n", 198 bi_2_dec_char( randomness), bi_2_dec_char( daa_key->rho));
|
/netbsd-6-1-5-RELEASE/crypto/external/cpl/trousers/dist/src/tspi/daa/daa_verifier/ |
H A D | verifier_transaction.c | 100 bi_ptr rho = issuer_pk->rho; local 104 rho == NULL || 108 // exponent = exponent / rho 109 bi_div( exponent, exponent, rho); 111 LogDebug("project_into_group_gamma: rho [%ld]:%s", 112 bi_nbin_size( rho), bi_2_hex_char( rho)); 371 // ( ( capital_nv ^ issuer_pk->rho ) % issuer_pk->capitalGamma ) == 1 374 issuer_pk->rho, [all...] |
/netbsd-6-1-5-RELEASE/crypto/external/cpl/trousers/dist/src/tspi/daa/ |
H A D | daa_structs.c | 449 const bi_ptr rho, 466 pk_internal->rho = rho; 498 BI_SAVE( pk_internal->rho, file); 534 pk_internal->rho = bi_new_ptr(); 535 BI_LOAD( pk_internal->rho, file); 563 DUMP_BI( pk_internal->rho); 627 // rho 632 bi_2_byte_array( &result[index], length, pk->rho); 679 STORE_DAA_PK_BI( rho, daa_allo 442 create_DAA_PK(const bi_ptr modulus, const bi_ptr capitalS, const bi_ptr capitalZ, const bi_ptr capitalR0, const bi_ptr capitalR1, const bi_ptr gamma, const bi_ptr capitalGamma, const bi_ptr rho, const bi_array_ptr capitalRReceiver, const bi_array_ptr capitalRIssuer, const int issuerBaseNameLength, BYTE * const issuerBaseName) argument [all...] |
/netbsd-6-1-5-RELEASE/external/gpl3/gcc/dist/gcc/testsuite/gcc.target/alpha/ |
H A D | pr39740.c | 47 int Rf_envlength (SEXP rho);
|
/netbsd-6-1-5-RELEASE/external/gpl3/gcc/dist/libstdc++-v3/testsuite/26_numerics/headers/complex/ |
H A D | synopsis.cc | 70 template<class T> complex<T> polar(const T& rho, const T& theta = 0);
|
/netbsd-6-1-5-RELEASE/gnu/dist/groff/src/preproc/pic/ |
H A D | common.cpp | 105 double rho = sqrt(temp / a_4 / b_4 * temp / a_4 / b_4 * temp); local 112 position M0 = position(rho * cos(phi0), rho * sin(phi0)) + M; 113 position M1 = position(rho * cos(phi1), rho * sin(phi1)) + M; 117 solid_arc(M + cent, rho, phi0, phi1, lt);
|
/netbsd-6-1-5-RELEASE/crypto/external/bsd/openssl/dist/crypto/bn/ |
H A D | bn_gf2m.c | 942 BIGNUM *a, *z, *rho, *w, *w2, *tmp; local 982 rho = BN_CTX_get(ctx); 988 if (!BN_rand(rho, p[0], 0, 0)) goto err; 989 if (!BN_GF2m_mod_arr(rho, rho, p)) goto err; 991 if (!BN_copy(w, rho)) goto err; 998 if (!BN_GF2m_add(w, w2, rho)) goto err;
|
/netbsd-6-1-5-RELEASE/crypto/external/cpl/trousers/dist/src/include/tss/ |
H A D | tss_structs.h | 181 BYTE* rho;
member in struct:tdTSS_DAA_PK
|
/netbsd-6-1-5-RELEASE/external/bsd/wpa/dist/src/tls/ |
H A D | libtommath.c | 2634 mp_montgomery_setup (mp_int * n, mp_digit * rho) argument 2664 /* rho = -1/m mod b */ 2665 *rho = (unsigned long)(((mp_word)1 << ((mp_word) DIGIT_BIT)) - x) & MP_MASK; 2681 int fast_mp_montgomery_reduce (mp_int * x, mp_int * n, mp_digit rho) argument 2731 mu = (mp_digit) (((W[ix] & MP_MASK) * rho) & MP_MASK);
|
/netbsd-6-1-5-RELEASE/crypto/external/cpl/trousers/dist/src/trspi/ |
H A D | trousers.c | 1714 result |= Trspi_HashUpdate(c, pk->rhoLength, pk->rho);
|