/barrelfish-2018-10-04/lib/tommath/ |
H A D | bn_mp_addmod.c | 22 int res; local 25 if ((res = mp_init (&t)) != MP_OKAY) { 26 return res; 29 if ((res = mp_add (a, b, &t)) != MP_OKAY) { 31 return res; 33 res = mp_mod (&t, c, d); 35 return res;
|
H A D | bn_mp_mulmod.c | 21 int res; local 24 if ((res = mp_init (&t)) != MP_OKAY) { 25 return res; 28 if ((res = mp_mul (a, b, &t)) != MP_OKAY) { 30 return res; 32 res = mp_mod (&t, c, d); 34 return res;
|
H A D | bn_mp_sqrmod.c | 22 int res; local 25 if ((res = mp_init (&t)) != MP_OKAY) { 26 return res; 29 if ((res = mp_sqr (a, &t)) != MP_OKAY) { 31 return res; 33 res = mp_mod (&t, b, c); 35 return res;
|
H A D | bn_mp_submod.c | 22 int res; local 26 if ((res = mp_init (&t)) != MP_OKAY) { 27 return res; 30 if ((res = mp_sub (a, b, &t)) != MP_OKAY) { 32 return res; 34 res = mp_mod (&t, c, d); 36 return res;
|
H A D | bn_mp_get_int.c | 22 unsigned long res; local 32 res = DIGIT(a,i); 35 res = (res << DIGIT_BIT) | DIGIT(a,i); 39 return res & 0xFFFFFFFFUL;
|
H A D | bn_mp_init_copy.c | 21 int res; local 23 if ((res = mp_init (a)) != MP_OKAY) { 24 return res;
|
H A D | bn_mp_to_signed_bin.c | 21 int res; local 23 if ((res = mp_to_unsigned_bin (a, b + 1)) != MP_OKAY) { 24 return res;
|
H A D | bn_mp_reduce_2k_setup_l.c | 21 int res; local 24 if ((res = mp_init(&tmp)) != MP_OKAY) { 25 return res; 28 if ((res = mp_2expt(&tmp, mp_count_bits(a))) != MP_OKAY) { 32 if ((res = s_mp_sub(&tmp, a, d)) != MP_OKAY) { 38 return res;
|
H A D | bn_mp_mod.c | 23 int res; local 25 if ((res = mp_init (&t)) != MP_OKAY) { 26 return res; 29 if ((res = mp_div (a, b, NULL, &t)) != MP_OKAY) { 31 return res; 35 res = MP_OKAY; 38 res = mp_add (b, &t, c); 42 return res;
|
H A D | bn_mp_expt_d.c | 21 int res; local 24 if ((res = mp_init_copy (&g, a)) != MP_OKAY) { 25 return res; 34 if ((res = mp_mul (c, &g, c)) != MP_OKAY) { 36 return res; 41 if (b > 1 && (res = mp_sqr (&g, &g)) != MP_OKAY) { 43 return res;
|
H A D | bn_mp_montgomery_calc_normalization.c | 26 int x, bits, res; local 32 if ((res = mp_2expt (a, (b->used - 1) * DIGIT_BIT + bits - 1)) != MP_OKAY) { 33 return res; 43 if ((res = mp_mul_2 (a, a)) != MP_OKAY) { 44 return res; 47 if ((res = s_mp_sub (a, b, a)) != MP_OKAY) { 48 return res;
|
H A D | bn_mp_rand.c | 22 int res; local 35 if ((res = mp_add_d (a, d, a)) != MP_OKAY) { 36 return res; 40 if ((res = mp_lshd (a, 1)) != MP_OKAY) { 41 return res; 44 if ((res = mp_add_d (a, ((mp_digit) abs (rand ())), a)) != MP_OKAY) { 45 return res;
|
H A D | bn_mp_reduce_2k_setup.c | 21 int res, p; local 24 if ((res = mp_init(&tmp)) != MP_OKAY) { 25 return res; 29 if ((res = mp_2expt(&tmp, p)) != MP_OKAY) { 31 return res; 34 if ((res = s_mp_sub(&tmp, a, &tmp)) != MP_OKAY) { 36 return res;
|
H A D | bn_mp_sqr.c | 22 int res; local 27 res = mp_toom_sqr(a, b); 33 res = mp_karatsuba_sqr (a, b); 42 res = fast_s_mp_sqr (a, b); 46 res = s_mp_sqr (a, b); 48 res = MP_VAL; 52 return res;
|
H A D | bn_mp_toom_mul.c | 28 int res, B; local 31 if ((res = mp_init_multi(&w0, &w1, &w2, &w3, &w4, 34 return res; 41 if ((res = mp_mod_2d(a, DIGIT_BIT * B, &a0)) != MP_OKAY) { 45 if ((res = mp_copy(a, &a1)) != MP_OKAY) { 51 if ((res = mp_copy(a, &a2)) != MP_OKAY) { 57 if ((res = mp_mod_2d(b, DIGIT_BIT * B, &b0)) != MP_OKAY) { 61 if ((res = mp_copy(b, &b1)) != MP_OKAY) { 67 if ((res = mp_copy(b, &b2)) != MP_OKAY) { 73 if ((res [all...] |
H A D | bn_mp_lcm.c | 21 int res; local 25 if ((res = mp_init_multi (&t1, &t2, NULL)) != MP_OKAY) { 26 return res; 30 if ((res = mp_gcd (a, b, &t1)) != MP_OKAY) { 37 if ((res = mp_div(a, &t1, &t2, NULL)) != MP_OKAY) { 40 res = mp_mul(b, &t2, c); 43 if ((res = mp_div(b, &t1, &t2, NULL)) != MP_OKAY) { 46 res = mp_mul(a, &t2, c); 54 return res;
|
H A D | bn_mp_reduce.c | 25 int res, um = m->used; local 28 if ((res = mp_init_copy (&q, x)) != MP_OKAY) { 29 return res; 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) { 51 res = MP_VAL; 61 if ((res = mp_mod_2d (x, DIGIT_BIT * (um + 1), x)) != MP_OKAY) { 66 if ((res = s_mp_mul_digs (&q, m, &q, um + 1)) != MP_OKAY) { 71 if ((res [all...] |
/barrelfish-2018-10-04/include/arch/x86_64/concurrent/arch/ |
H A D | cas.h | 28 register uintptr_t res; local 30 : "+m" (*address), "=a" (res) 33 return res; 44 register bool res; local 47 : "+m" (*address), "=q" (res) 50 return res;
|
/barrelfish-2018-10-04/usr/eclipseclp/Kernel/src/ |
H A D | eg_cc_yield.cc | 49 int res; local 59 res = EC_resume(X_or_Cut); 63 switch (res) 68 res = EC_resume(X_or_Cut); 78 res = EC_resume(X_or_Cut); 84 res = EC_resume(EC_atom("stop"), X_or_Cut); 86 res = EC_resume(EC_atom("cont"), X_or_Cut); 90 std::cout << "bad return code: " << res << "\n"; local
|
H A D | eg_c_external.c | 53 int res; local 55 res = ec_get_string_length(ec_arg(1), &s, &len); 56 if (res != PSUCCEED) return res; 70 int res; local 76 res = ec_get_long(car, &x); 77 if (res != PSUCCEED) return res; 80 res = ec_get_nil(list); 81 if (res ! [all...] |
/barrelfish-2018-10-04/lib/libc/quad/ |
H A D | negdi2.c | 49 union uu aa, res; local 52 res.ul[L] = -aa.ul[L]; 53 res.ul[H] = -aa.ul[H] - (res.ul[L] > 0); 54 return (res.q);
|
/barrelfish-2018-10-04/usr/eclipseclp/CPViz/viz/src/ie/ucc/cccc/viz/ |
H A D | VizParentCollection.java | 57 FullDomain[] res = new FullDomain[size()+1];
59 res[entry.getSingleIndex()]= entry.getDomainAsList();
61 return res;
64 FullDomainMap res = new FullDomainMap();
66 res.put(entry.getXYIndex(), entry.getDomainAsList());
68 return res;
75 Tuple[] res = new Tuple[size()+1];
77 res[entry.getSingleIndex()]= entry.asTuple();
79 return res;
86 Pair[] res [all...] |
H A D | Pair.java | 44 int res = 17;
45 res = 31*res+x;
46 res = 31*res+y;
47 return res;
|
H A D | ValueKey.java | 43 int res = 17;
44 res = 31*res+name.hashCode();
45 res = 31*res+value;
46 return res;
|
H A D | FullDomain.java | 47 int res = li.next();
49 res = Math.min(res,li.next());
51 return res;
59 int res = li.next();
61 res = Math.max(res,li.next());
63 return res;
|