Searched refs:mu (Results 1 - 19 of 19) sorted by relevance

/barrelfish-2018-10-04/lib/tommath/
H A Dbn_mp_add_d.c23 mp_digit *tmpa, *tmpc, mu; local
67 mu = *tmpc >> DIGIT_BIT;
72 *tmpc = *tmpa++ + mu;
73 mu = *tmpc >> DIGIT_BIT;
78 *tmpc++ = mu;
H A Dbn_mp_dr_reduce.c37 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;
H A Dbn_s_mp_exptmod.c25 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)) !
[all...]
H A Dbn_mp_reduce.c18 /* reduces x mod m, assumes 0 < x < m**2, mu is
22 int mp_reduce (mp_int * x, mp_int * m, mp_int * mu) argument
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) {
H A Dbn_mp_sub_d.c22 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);
H A Dbn_mp_montgomery_reduce.c23 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++) +
H A Dbn_fast_mp_montgomery_reduce.c69 /* 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++);
H A Dbn.tex1304 a decent speedup over straight division. First a $\mu$ value must be precomputed with the following function.
1311 Given a modulus in $b$ this produces the required $\mu$ value in $a$. For any given modulus this only has to
1319 This will reduce $a$ in place modulo $b$ with the precomputed $\mu$ value in $c$. $a$ must be in the range
1325 mp_int a, b, c, mu;
1328 /* initialize a,b to desired values, mp_init mu,
1332 /* get mu value */
1333 if ((result = mp_reduce_setup(&mu, b)) != MP_OKAY) \{
1334 printf("Error getting mu. \%s",
1347 if ((result = mp_reduce(&c, &b, &mu)) != MP_OKAY) \{
1361 if ((result = mp_reduce(&c, &b, &mu)) !
[all...]
H A Dtommath.tex1711 variable $\mu$ is set to zero outside the loop. Inside the loop an ``addition'' step requires three statements to produce
1713 two digits from $a$ and $b$ are added together along with the carry $\mu$. The carry of this step is extracted and stored
1714 in $\mu$ and finally the digit of the result $c_n$ is truncated within the range $0 \le c_n < \beta$.
3666 Using the notation from \cite{BARRETT} the value of $\lfloor 2^q / b \rfloor$ will be represented by the $\mu$ symbol. Using the $\mu$
3670 c = a - b \cdot \lfloor (a \cdot \mu)/2^q \rfloor
3681 For example, if $b = 1179677$ and $q = 41$ ($2^q > b^2$), then the reciprocal $\mu$ is equal to $\lfloor 2^q / b \rfloor = 1864089$. Consider reducing
3682 $a = 180388626447$ modulo $b$ using the above reduction equation. The quotient using the new formula is $\lfloor (a \cdot \mu) / 2^q \rfloor = 152913$.
3704 c = a - b \cdot \lfloor (q_0 \cdot \mu) / \beta^{m+1} \rfloor
3710 $\lfloor (q_0 \cdot \mu) / \bet
[all...]
/barrelfish-2018-10-04/include/lwip2/lwip/
H A Dsys.h63 #define sys_mutex_new(mu) ERR_OK
64 #define sys_mutex_lock(mu)
65 #define sys_mutex_unlock(mu)
66 #define sys_mutex_free(mu)
67 #define sys_mutex_valid(mu) 0
68 #define sys_mutex_set_invalid(mu)
/barrelfish-2018-10-04/lib/tommath/pre_gen/
H A Dmpi.c273 /* 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;
2310 mp_digit mu, *tmpx1, *tmpx2; local
4758 mp_digit mu; local
6583 mp_reduce(mp_int * x, mp_int * m, mp_int * mu) argument
7550 mp_digit *tmpa, *tmpc, mu; local
8892 mp_int M[TAB_SIZE], res, mu; local
[all...]
/barrelfish-2018-10-04/lib/tommath/mtest/
H A Dmpi.c180 mp_err s_mp_reduce(mp_int *x, mp_int *m, mp_int *mu);
1636 mp_int s, x, mu; local
1652 (res = mp_init(&mu)) != MP_OKAY)
1657 /* mu = b^2k / m */
1658 s_mp_add_d(&mu, 1);
1659 s_mp_lshd(&mu, 2 * USED(m));
1660 if((res = mp_div(&mu, m, &mu, NULL)) != MP_OKAY)
1672 if((res = s_mp_reduce(&s, m, &mu)) != MP_OKAY)
1680 if((res = s_mp_reduce(&x, m, &mu)) !
3368 s_mp_reduce(mp_int *x, mp_int *m, mp_int *mu) argument
[all...]
/barrelfish-2018-10-04/usr/eclipseclp/Kernel/src/
H A Dtypes.h385 pword *mu; member in struct:control::invocation_frame
416 pword *mu; member in struct:control::exception_frame
492 pword * mu; /* list of meta-unifications */ member in struct:machine
H A Dsepia.h1339 #define MU g_emu_.mu
H A Demu_c_env.c216 b_aux.invoc->mu = MU;
H A Demu.c1545 Exception(pw1)->mu = MU;
6803 MU = Exception(pw1)->mu;
6851 MU = Invoc(pw1)->mu;
/barrelfish-2018-10-04/usr/eclipseclp/Mercury/
H A Dm_map.pl9 % Main author: fjh@cs.mu.OZ.AU, conway@cs.mu.OZ.AU.
23 % Mercury CVS repository. See http://www.cs.mu.oz.au/mercury for
H A Dm_tree234.pl9 % main author: conway@cs.mu.OZ.AU.
14 % Mercury CVS repository. See http://www.cs.mu.oz.au/mercury for
/barrelfish-2018-10-04/usr/eclipseclp/Contrib/
H A Dxml_utilities.pl349 "Mu"-[924], % greek capital letter mu, U+039C
350 "mu"-[956], % greek small letter mu, U+03BC ISOgrk3

Completed in 203 milliseconds