| /external/compiler-rt/lib/msan/lit_tests/Linux/ |
| H A D | glob_nomatch.cc | 15 int res = glob(buf, 0, 0, &globbuf); local
16 assert(res == GLOB_NOMATCH);
|
| H A D | tcgetattr.cc | 15 int res = tcgetattr(fd, &t); local
16 assert(!res);
|
| /external/compiler-rt/lib/msan/lit_tests/ |
| H A D | ioctl.cc | 14 int res = ioctl(fd, FIOGETOWN, &z); local
15 assert(res == 0);
|
| H A D | ioctl_custom.cc | 25 int res = ioctl(fd, SIOCGIFCONF, (void *)&ifc); local
29 assert(res == 0);
|
| /external/dropbear/libtomcrypt/src/pk/dsa/ |
| H A D | dsa_verify_key.c | 29 int res, err; local
38 if ((err = mp_prime_is_prime(key->q, 8, &res)) != CRYPT_OK) {
41 if (res == 0) {
45 if ((err = mp_prime_is_prime(key->p, 8, &res)) != CRYPT_OK) {
48 if (res == 0) {
|
| /external/dropbear/libtommath/ |
| H A D | bn_mp_add.c | 21 int sa, sb, res; local
32 res = s_mp_add (a, b, c);
40 res = s_mp_sub (b, a, c);
43 res = s_mp_sub (a, b, c);
46 return res;
|
| 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_copy.c | 22 int res, n; local
31 if ((res = mp_grow (b, a->used)) != MP_OKAY) {
32 return res;
|
| H A D | bn_mp_expt_d.c | 21 int res, x; local
24 if ((res = mp_init_copy (&g, a)) != MP_OKAY) {
25 return res;
33 if ((res = mp_sqr (c, c)) != MP_OKAY) {
35 return res;
40 if ((res = mp_mul (c, &g, c)) != MP_OKAY) {
42 return res;
|
| H A D | bn_mp_init_multi.c | 21 mp_err res = MP_OKAY; /* Assume ok until proven otherwise */ local
45 res = MP_MEM;
52 return res; /* Assumed ok, if error flagged above. */
|
| 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_lshd.c | 21 int x, res; local
30 if ((res = mp_grow (a, a->used + b)) != MP_OKAY) {
31 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_add (b, &t, c);
37 res = MP_OKAY;
42 return res;
|
| H A D | bn_mp_mod_2d.c | 22 int x, res; local
32 res = mp_copy (a, c);
33 return res;
37 if ((res = mp_copy (a, c)) != MP_OKAY) {
38 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_mul.c | 21 int res, neg; local
27 res = mp_toom_mul(a, b, c);
33 res = mp_karatsuba_mul (a, b, c);
49 res = fast_s_mp_mul_digs (a, b, c, digs);
53 res = s_mp_mul (a, b, c); /* uses s_mp_mul_digs */
55 res = MP_VAL;
60 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_prime_is_divisible.c | 26 mp_digit res; local
33 if ((err = mp_mod_d (a, ltm_prime_tab[ix], &res)) != MP_OKAY) {
38 if (res == 0) {
|
| 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...] |
| H A D | bn_mp_reduce_2k.c | 22 int p, res; local
24 if ((res = mp_init(&q)) != MP_OKAY) {
25 return res;
31 if ((res = mp_div_2d(a, p, &q, a)) != MP_OKAY) {
37 if ((res = mp_mul_d(&q, d, &q)) != MP_OKAY) {
43 if ((res = s_mp_add(a, &q, a)) != MP_OKAY) {
54 return res;
|
| H A D | bn_mp_reduce_2k_l.c | 25 int p, res; local
27 if ((res = mp_init(&q)) != MP_OKAY) {
28 return res;
34 if ((res = mp_div_2d(a, p, &q, a)) != MP_OKAY) {
39 if ((res = mp_mul(&q, d, &q)) != MP_OKAY) {
44 if ((res = s_mp_add(a, &q, a)) != MP_OKAY) {
55 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_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_sqrt.c | 21 int res; local
35 if ((res = mp_init_copy(&t1, arg)) != MP_OKAY) {
36 return res;
39 if ((res = mp_init(&t2)) != MP_OKAY) {
47 if ((res = mp_div(arg,&t1,&t2,NULL)) != MP_OKAY) {
50 if ((res = mp_add(&t1,&t2,&t1)) != MP_OKAY) {
53 if ((res = mp_div_2(&t1,&t1)) != MP_OKAY) {
58 if ((res = mp_div(arg,&t1,&t2,NULL)) != MP_OKAY) {
61 if ((res = mp_add(&t1,&t2,&t1)) != MP_OKAY) {
64 if ((res
[all...] |
| H A D | bn_mp_sub.c | 22 int sa, sb, res; local
33 res = s_mp_add (a, b, c);
43 res = s_mp_sub (a, b, c);
49 res = s_mp_sub (b, a, c);
52 return res;
|