| /external/dropbear/libtommath/ |
| bn_mp_add_d.c | 23 mp_digit *tmpa, *tmpc, mu; local
67 mu = *tmpc >> DIGIT_BIT;
72 *tmpc = *tmpa++ + mu;
73 mu = *tmpc >> DIGIT_BIT;
78 *tmpc++ = mu;
|
| bn_mp_sub_d.c | 22 mp_digit *tmpa, *tmpc, mu; local
70 mu = *tmpc >> (sizeof(mp_digit) * CHAR_BIT - 1);
75 *tmpc = *tmpa++ - mu;
76 mu = *tmpc >> (sizeof(mp_digit) * CHAR_BIT - 1);
|
| bn_mp_dr_reduce.c | 37 mp_digit mu, *tmpx1, *tmpx2; local
61 mu = 0;
65 r = ((mp_word)*tmpx2++) * ((mp_word)k) + *tmpx1 + mu;
67 mu = (mp_digit)(r >> ((mp_word)DIGIT_BIT));
71 *tmpx1++ = mu;
|
| bn_mp_montgomery_reduce.c | 23 mp_digit mu; local
47 /* mu = ai * rho mod b
55 mu = (mp_digit) (((mp_word)x->dp[ix]) * ((mp_word)rho) & MP_MASK);
57 /* a = a + mu * m * b**i */
75 r = ((mp_word)mu) * ((mp_word)*tmpn++) +
|
| bn_fast_mp_montgomery_reduce.c | 69 /* mu = ai * m' mod b
75 register mp_digit mu; local
76 mu = (mp_digit) (((W[ix] & MP_MASK) * rho) & MP_MASK);
78 /* a = a + mu * m * b**i
105 *_W++ += ((mp_word)mu) * ((mp_word)*tmpn++);
|
| bn_s_mp_exptmod.c | 25 mp_int M[TAB_SIZE], res, mu; local
71 /* create mu, used for Barrett reduction */
72 if ((err = mp_init (&mu)) != MP_OKAY) {
77 if ((err = mp_reduce_setup (&mu, P)) != MP_OKAY) {
82 if ((err = mp_reduce_2k_setup_l (P, &mu)) != MP_OKAY) {
115 if ((err = redux (&M[1 << (winsize - 1)], P, &mu)) != MP_OKAY) {
127 if ((err = redux (&M[x], P, &mu)) != MP_OKAY) {
176 if ((err = redux (&res, P, &mu)) != MP_OKAY) {
193 if ((err = redux (&res, P, &mu)) != MP_OKAY) {
202 if ((err = redux (&res, P, &mu)) != MP_OKAY)
[all...] |
| /external/dropbear/libtomcrypt/src/pk/ecc/ |
| ltc_ecc_mulmod.c | 43 void *mu, *mp; local
56 if ((err = mp_init(&mu)) != CRYPT_OK) {
60 if ((err = mp_montgomery_normalization(mu, modulus)) != CRYPT_OK) {
62 mp_clear(mu);
74 mp_clear(mu);
84 if (mp_cmp_d(mu, 1) == LTC_MP_EQ) {
89 if ((err = mp_mulmod(G->x, mu, modulus, tG->x)) != CRYPT_OK) { goto done; }
90 if ((err = mp_mulmod(G->y, mu, modulus, tG->y)) != CRYPT_OK) { goto done; }
91 if ((err = mp_mulmod(G->z, mu, modulus, tG->z)) != CRYPT_OK) { goto done; }
93 mp_clear(mu);
[all...] |
| ltc_ecc_mulmod_timing.c | 41 void *mu, *mp; local
54 if ((err = mp_init(&mu)) != CRYPT_OK) {
58 if ((err = mp_montgomery_normalization(mu, modulus)) != CRYPT_OK) {
59 mp_clear(mu);
71 mp_clear(mu);
82 if ((err = mp_mulmod(G->x, mu, modulus, tG->x)) != CRYPT_OK) { goto done; }
83 if ((err = mp_mulmod(G->y, mu, modulus, tG->y)) != CRYPT_OK) { goto done; }
84 if ((err = mp_mulmod(G->z, mu, modulus, tG->z)) != CRYPT_OK) { goto done; }
85 mp_clear(mu);
86 mu = NULL
[all...] |
| ltc_ecc_mul2add.c | 46 void *mp, *mu; local
100 if ((err = mp_init(&mu)) != CRYPT_OK) {
103 if ((err = mp_montgomery_normalization(mu, modulus)) != CRYPT_OK) {
108 if ((err = mp_mulmod(A->x, mu, modulus, precomp[1]->x)) != CRYPT_OK) { goto ERR_MU; }
109 if ((err = mp_mulmod(A->y, mu, modulus, precomp[1]->y)) != CRYPT_OK) { goto ERR_MU; }
110 if ((err = mp_mulmod(A->z, mu, modulus, precomp[1]->z)) != CRYPT_OK) { goto ERR_MU; }
112 if ((err = mp_mulmod(B->x, mu, modulus, precomp[1<<2]->x)) != CRYPT_OK) { goto ERR_MU; }
113 if ((err = mp_mulmod(B->y, mu, modulus, precomp[1<<2]->y)) != CRYPT_OK) { goto ERR_MU; }
114 if ((err = mp_mulmod(B->z, mu, modulus, precomp[1<<2]->z)) != CRYPT_OK) { goto ERR_MU; }
184 mp_clear(mu);
[all...] |
| /external/iproute2/netem/ |
| stats.c | 24 double mu=0.0, sigma=0.0, sumsquare=0.0, sum=0.0, top=0.0, rho=0.0; local
43 mu = sum/(double)n;
44 sigma = sqrt((sumsquare - (double)n*mu*mu)/(double)(n-1));
47 top += ((double)x[i]-mu)*((double)x[i-1]-mu);
48 sigma2 += ((double)x[i-1] - mu)*((double)x[i-1] - mu);
53 printf("mu = %12.6f\n", mu);
[all...] |
| maketable.c | 51 arraystats(double *x, int limit, double *mu, double *sigma, double *rho)
62 *mu = sum/(double)n;
63 *sigma = sqrt((sumsquare - (double)n*(*mu)*(*mu))/(double)(n-1));
66 top += ((double)x[i]- *mu)*((double)x[i-1]- *mu);
67 sigma2 += ((double)x[i-1] - *mu)*((double)x[i-1] - *mu);
93 makedist(double *x, int limit, double mu, double sigma)
107 input = (x[i]-mu)/sigma
200 double mu, sigma, rho; local
[all...] |
| /external/dropbear/libtomcrypt/src/math/fp/ |
| ltc_ecc_fp_mulmod.c | 39 void *mu; /* copy of the montgomery constant */ member in struct:__anon3307
1115 void *mp, *mu; local
1225 void *mp, *mu; local
[all...] |
| /external/chromium/third_party/icu/source/test/iotest/ |
| stream.cpp | 59 const UChar mu[] = { 0x6D, 0x75, 0}; local
72 str4.append((UChar32)0x03BC); /* mu */
116 if (inStr2.compare(mu) != 0) {
119 log_err("Got: \"%s\", Expected: \"mu\"\n", inStrC);
|
| /external/icu4c/test/iotest/ |
| stream.cpp | 60 const UChar mu[] = { 0x6D, 0x75, 0}; local
73 str4.append((UChar32)0x03BC); /* mu */
117 if (inStr2.compare(mu) != 0) {
120 log_err("Got: \"%s\", Expected: \"mu\"\n", inStrC);
|
| /libcore/luni/src/test/java/libcore/java/util/regex/ |
| OldMatcherTest.java | 186 Matcher mu = mat.useAnchoringBounds(true); local
188 mu.hasAnchoringBounds());
190 mu = mat.useAnchoringBounds(false);
192 mu.hasAnchoringBounds());
214 Matcher mu = mat.useTransparentBounds(true); local
216 mu.hasTransparentBounds());
218 mu = mat.useTransparentBounds(false);
220 mu.hasTransparentBounds());
|
| /external/wpa_supplicant/ |
| libtommath.c | 140 static int mp_reduce(mp_int * x, mp_int * m, mp_int * mu);
1612 mp_int M[TAB_SIZE], res, mu; local
[all...] |
| /frameworks/base/media/libstagefright/codecs/amrwbenc/src/ |
| voAMRWBEnc.c | 203 Word16 tmp, gain1, gain2, exp, Q_new, mu, shift, max;
local
276 mu = PREEMPH_FAC >> 1; /* Q15 --> Q14 */
280 L_tmp -= (st->mem_preemph * mu)<<1;
286 L_tmp -= (new_speech[i - 1] * mu)<<1;
333 L_tmp -= (new_speech[i - 1] * mu)<<1;
339 L_tmp -= (st->mem_preemph * mu)<<1;
[all...] |
| /external/dropbear/libtommath/mtest/ |
| mpi.c | 180 mp_err s_mp_reduce(mp_int *x, mp_int *m, mp_int *mu);
1636 mp_int s, x, mu; local
[all...] |
| /external/wpa_supplicant_6/wpa_supplicant/src/tls/ |
| libtommath.c | 171 static int mp_reduce(mp_int * x, mp_int * m, mp_int * mu);
1870 mp_int M[TAB_SIZE], res, mu; local
2730 register mp_digit mu; local
[all...] |
| /external/dropbear/libtommath/pre_gen/ |
| mpi.c | 273 /* mu = ai * m' mod b
279 register mp_digit mu; local
280 mu = (mp_digit) (((W[ix] & MP_MASK) * rho) & MP_MASK);
282 /* a = a + mu * m * b**i
309 *_W++ += ((mp_word)mu) * ((mp_word)*tmpn++);
890 mp_digit *tmpa, *tmpc, mu; local
934 mu = *tmpc >> DIGIT_BIT;
939 *tmpc = *tmpa++ + mu;
940 mu = *tmpc >> DIGIT_BIT;
945 *tmpc++ = mu;
2305 mp_digit mu, *tmpx1, *tmpx2; local
4753 mp_digit mu; local
7540 mp_digit *tmpa, *tmpc, mu; local
8882 mp_int M[TAB_SIZE], res, mu; local
[all...] |
