| /system/extras/libpagemap/ |
| pm_memusage.c | 19 void pm_memusage_zero(pm_memusage_t *mu) {
20 mu->vss = mu->rss = mu->pss = mu->uss = 0;
|
| /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...] |
| normal.c | 18 normal(double x, double mu, double sigma)
20 return .5 + .5*erf((x-mu)/(sqrt(2.0)*sigma));
|
| paretonormal.c | 27 normal(double x, double mu, double sigma)
29 return .5 + .5*erf((x-mu)/(sqrt(2.0)*sigma));
|
| /frameworks/base/media/libstagefright/codecs/amrwb/src/ |
| preemph_amrwb_dec.cpp | 48 int16 mu, (i) Q15 : preemphasis coefficient
116 int16 mu, /* (i) Q15 : preemphasis coefficient */
125 L_tmp = msu_16by16_from_int32((int32)x[i] << 16, x[i - 1], mu);
|
| deemphasis_32.cpp | 50 int16 mu, (i) Q15 : deemphasis factor
57 32-bits filtering through 1/(1-mu z^-1)
69 Deemphasis H(z) = 1/(1 - 0.68z^(-1)) where mu = 0.67999 in Q15
124 int16 mu, /* (i) Q15 : deemphasis factor */
137 L_tmp = fxp_mac_16by16(*mem, mu, L_tmp),
149 L_tmp = fxp_mac_16by16(y[i - 1], mu, L_tmp),
158 L_tmp = fxp_mac_16by16(y[i - 1], mu, L_tmp),
|
| /frameworks/base/media/libstagefright/codecs/amrwbenc/src/ |
| deemph.c | 20 * Description:filtering through 1/(1-mu z^ -1) *
32 Word16 mu, /* (i) Q15 : deemphasis factor */
41 L_tmp = L_mac(L_tmp, *mem, mu);
47 L_tmp = L_mac(L_tmp, x[i - 1], mu);
59 Word16 mu, /* (i) Q15 : deemphasis factor */
67 L_tmp += ((*mem) * mu)<<1;
72 L_tmp += (x[i - 1] * mu)<<1;
84 Word16 mu, /* (i) Q15 : deemphasis factor */
92 fac = mu >> 1; /* Q15 --> Q14 */
|
| preemph.c | 30 Word16 mu, /* (i) Q15 : preemphasis coefficient */
43 L_tmp -= (x[i - 1] * mu)<<1;
48 L_tmp -= ((*mem) * mu)<<1;
59 Word16 mu, /* (i) Q15 : preemphasis coefficient */
72 L_tmp -= (x[i - 1] * mu)<<1;
78 L_tmp -= ((*mem) * mu)<<1;
|
| /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_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_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...] |
| bn_mp_reduce.c | 18 /* reduces x mod m, assumes 0 < x < m**2, mu is
22 int mp_reduce (mp_int * x, mp_int * m, mp_int * mu)
37 if ((res = mp_mul (&q, mu, &q)) != MP_OKAY) {
42 if ((res = s_mp_mul_high_digs (&q, mu, &q, um)) != MP_OKAY) {
46 if ((res = fast_s_mp_mul_high_digs (&q, mu, &q, um)) != MP_OKAY) {
|
| 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_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++);
|
| /external/dropbear/libtomcrypt/src/pk/ecc/ |
| 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_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_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/chromium/sdch/open-vcdiff/src/ |
| mutex.h | 263 // MutexLock(mu) acquires mu when constructed and releases it when destroyed.
266 explicit MutexLock(Mutex *mu) : mu_(mu) { mu_->Lock(); }
278 explicit ReaderMutexLock(Mutex *mu) : mu_(mu) { mu_->ReaderLock(); }
289 explicit WriterMutexLock(Mutex *mu) : mu_(mu) { mu_->WriterLock(); }
298 // Catch bug where variable name is omitted, e.g. MutexLock (&mu);
|
| /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...] |
| /frameworks/base/media/libstagefright/codecs/amrwbenc/src/asm/ARMV5E/ |
| Deemph_32_opt.s | 21 @ Word16 mu, /* (i) Q15 : deemphasis factor */
40 LDR r5, =22282 @r5---mu
45 MOV r8, r5, ASR #1 @fac = mu >> 1
|
| /frameworks/base/media/libstagefright/codecs/amrwbenc/src/asm/ARMV7/ |
| Deemph_32_neon.s | 21 @ Word16 mu, /* (i) Q15 : deemphasis factor */
40 LDR r5, =22282 @r5---mu
45 MOV r8, r5, ASR #1 @fac = mu >> 1
|
| /external/chromium/base/ |
| dynamic_annotations.cc | 47 const volatile void *mu) {}
|
| dynamic_annotations.h | 100 // Instruct the tool to create a happens-before arc between mu->Unlock() and
101 // mu->Lock(). This annotation may slow down the race detector; normally it
104 #define ANNOTATE_MUTEX_IS_USED_AS_CONDVAR(mu) \
105 AnnotateMutexIsUsedAsCondVar(__FILE__, __LINE__, mu)
270 const volatile void *mu);
333 #define ANNOTATE_MUTEX_IS_USED_AS_CONDVAR(mu) // empty
|
