| /external/dropbear/libtommath/ |
| D | bn_s_mp_mul_digs.c | 22 int s_mp_mul_digs (mp_int * a, mp_int * b, mp_int * c, int digs) in s_mp_mul_digs() argument
31 if (((digs) < MP_WARRAY) && in s_mp_mul_digs()
34 return fast_s_mp_mul_digs (a, b, c, digs); in s_mp_mul_digs()
37 if ((res = mp_init_size (&t, digs)) != MP_OKAY) { in s_mp_mul_digs()
40 t.used = digs; in s_mp_mul_digs()
49 pb = MIN (b->used, digs - ix); in s_mp_mul_digs()
75 if (ix + iy < digs) { in s_mp_mul_digs()
|
| D | bn_mp_montgomery_reduce.c | 22 int ix, res, digs; in mp_montgomery_reduce() local
31 digs = n->used * 2 + 1; in mp_montgomery_reduce()
32 if ((digs < MP_WARRAY) && in mp_montgomery_reduce()
39 if (x->alloc < digs) { in mp_montgomery_reduce()
40 if ((res = mp_grow (x, digs)) != MP_OKAY) { in mp_montgomery_reduce()
44 x->used = digs; in mp_montgomery_reduce()
|
| D | bn_mp_radix_size.c | 21 int res, digs; in mp_radix_size() local
44 digs = 0; in mp_radix_size()
48 ++digs; in mp_radix_size()
65 ++digs; in mp_radix_size()
70 *size = digs + 1; in mp_radix_size()
|
| D | bn_s_mp_mul_high_digs.c | 22 s_mp_mul_high_digs (mp_int * a, mp_int * b, mp_int * c, int digs) in s_mp_mul_high_digs() argument
34 return fast_s_mp_mul_high_digs (a, b, c, digs); in s_mp_mul_high_digs()
53 tmpt = &(t.dp[digs]); in s_mp_mul_high_digs()
56 tmpy = b->dp + (digs - ix); in s_mp_mul_high_digs()
58 for (iy = digs - ix; iy < pb; iy++) { in s_mp_mul_high_digs()
|
| D | bn_mp_toradix.c | 21 int res, digs; in mp_toradix() local
49 digs = 0; in mp_toradix()
56 ++digs; in mp_toradix()
62 bn_reverse ((unsigned char *)_s, digs); in mp_toradix()
|
| D | bn_mp_toradix_n.c | 24 int res, digs; in mp_toradix_n() local
58 digs = 0; in mp_toradix_n()
69 ++digs; in mp_toradix_n()
75 bn_reverse ((unsigned char *)_s, digs); in mp_toradix_n()
|
| D | bn_fast_s_mp_mul_digs.c | 34 int fast_s_mp_mul_digs (mp_int * a, mp_int * b, mp_int * c, int digs) in fast_s_mp_mul_digs() argument
41 if (c->alloc < digs) { in fast_s_mp_mul_digs()
42 if ((res = mp_grow (c, digs)) != MP_OKAY) { in fast_s_mp_mul_digs()
48 pa = MIN(digs, a->used + b->used); in fast_s_mp_mul_digs()
|
| D | bn_fast_s_mp_mul_high_digs.c | 27 int fast_s_mp_mul_high_digs (mp_int * a, mp_int * b, mp_int * c, int digs) in fast_s_mp_mul_high_digs() argument
44 for (ix = digs; ix < pa; ix++) { in fast_s_mp_mul_high_digs()
80 tmpc = c->dp + digs; in fast_s_mp_mul_high_digs()
81 for (ix = digs; ix < pa; ix++) { in fast_s_mp_mul_high_digs()
|
| D | bn_mp_mul.c | 43 int digs = a->used + b->used + 1; in mp_mul() local
46 if ((digs < MP_WARRAY) && in mp_mul()
49 res = fast_s_mp_mul_digs (a, b, c, digs); in mp_mul()
|
| D | tommath.h | 556 int fast_s_mp_mul_digs(mp_int *a, mp_int *b, mp_int *c, int digs);
557 int s_mp_mul_digs(mp_int *a, mp_int *b, mp_int *c, int digs);
558 int fast_s_mp_mul_high_digs(mp_int *a, mp_int *b, mp_int *c, int digs);
559 int s_mp_mul_high_digs(mp_int *a, mp_int *b, mp_int *c, int digs);
|
| D | changes.txt | 41 -- Fixed bug in comba that would lead to possible erroneous outputs when "pa < digs"
|
| /external/wpa_supplicant/ |
| D | libtommath.c | 107 static int s_mp_mul_digs (mp_int * a, mp_int * b, mp_int * c, int digs);
109 static int s_mp_mul_high_digs(mp_int * a, mp_int * b, mp_int * c, int digs);
111 static int fast_s_mp_mul_digs (mp_int * a, mp_int * b, mp_int * c, int digs);
465 int digs = a->used + b->used + 1; in mp_mul() local
467 if ((digs < MP_WARRAY) && in mp_mul()
470 res = fast_s_mp_mul_digs (a, b, c, digs); in mp_mul()
2068 static int s_mp_mul_digs (mp_int * a, mp_int * b, mp_int * c, int digs) in s_mp_mul_digs() argument
2077 if (((digs) < MP_WARRAY) && in s_mp_mul_digs()
2080 return fast_s_mp_mul_digs (a, b, c, digs); in s_mp_mul_digs()
2083 if ((res = mp_init_size (&t, digs)) != MP_OKAY) { in s_mp_mul_digs()
[all …]
|
| /external/wpa_supplicant_6/wpa_supplicant/src/tls/ |
| D | libtommath.c | 130 static int s_mp_mul_digs (mp_int * a, mp_int * b, mp_int * c, int digs);
132 static int s_mp_mul_high_digs(mp_int * a, mp_int * b, mp_int * c, int digs);
134 static int fast_s_mp_mul_digs (mp_int * a, mp_int * b, mp_int * c, int digs);
505 int digs = a->used + b->used + 1; in mp_mul() local
507 if ((digs < MP_WARRAY) && in mp_mul()
510 res = fast_s_mp_mul_digs (a, b, c, digs); in mp_mul()
2326 static int s_mp_mul_digs (mp_int * a, mp_int * b, mp_int * c, int digs) in s_mp_mul_digs() argument
2335 if (((digs) < MP_WARRAY) && in s_mp_mul_digs()
2338 return fast_s_mp_mul_digs (a, b, c, digs); in s_mp_mul_digs()
2341 if ((res = mp_init_size (&t, digs)) != MP_OKAY) { in s_mp_mul_digs()
[all …]
|
| /external/wpa_supplicant_8/src/tls/ |
| D | libtommath.c | 130 static int s_mp_mul_digs (mp_int * a, mp_int * b, mp_int * c, int digs);
132 static int s_mp_mul_high_digs(mp_int * a, mp_int * b, mp_int * c, int digs);
134 static int fast_s_mp_mul_digs (mp_int * a, mp_int * b, mp_int * c, int digs);
505 int digs = a->used + b->used + 1; in mp_mul() local
507 if ((digs < MP_WARRAY) && in mp_mul()
510 res = fast_s_mp_mul_digs (a, b, c, digs); in mp_mul()
2326 static int s_mp_mul_digs (mp_int * a, mp_int * b, mp_int * c, int digs) in s_mp_mul_digs() argument
2335 if (((digs) < MP_WARRAY) && in s_mp_mul_digs()
2338 return fast_s_mp_mul_digs (a, b, c, digs); in s_mp_mul_digs()
2341 if ((res = mp_init_size (&t, digs)) != MP_OKAY) { in s_mp_mul_digs()
[all …]
|
| /external/dropbear/libtommath/pre_gen/ |
| D | mpi.c | 414 int fast_s_mp_mul_digs (mp_int * a, mp_int * b, mp_int * c, int digs) in fast_s_mp_mul_digs() argument
421 if (c->alloc < digs) { in fast_s_mp_mul_digs()
422 if ((res = mp_grow (c, digs)) != MP_OKAY) { in fast_s_mp_mul_digs()
428 pa = MIN(digs, a->used + b->used); in fast_s_mp_mul_digs()
518 int fast_s_mp_mul_high_digs (mp_int * a, mp_int * b, mp_int * c, int digs) in fast_s_mp_mul_high_digs() argument
535 for (ix = digs; ix < pa; ix++) { in fast_s_mp_mul_high_digs()
571 tmpc = c->dp + digs; in fast_s_mp_mul_high_digs()
572 for (ix = digs; ix < pa; ix++) { in fast_s_mp_mul_high_digs()
4752 int ix, res, digs; in mp_montgomery_reduce() local
4761 digs = n->used * 2 + 1; in mp_montgomery_reduce()
[all …]
|
| /external/bison/m4/ |
| D | stdbool.m4 | 93 char digs[] = "0123456789";
94 int xlcbug = 1 / (&(digs + 5)[-2 + (bool) 1] == &digs[4] ? 1 : -1);
|
| /external/dnsmasq/src/ |
| D | rfc1035.c | 95 unsigned int count, digs; in extract_name() local
106 digs = ((count-1)>>2)+1; in extract_name()
109 if (cp - (unsigned char *)name + digs + 9 >= MAXDNAME) in extract_name()
117 for (j=0; j<digs; j++) in extract_name()
|
| D | option.c | 670 int i, addrs, digs, is_addr, is_hex, is_dec, is_string, dots; in parse_dhcp_opt() local
741 addrs = digs = 1; in parse_dhcp_opt()
751 digs++; in parse_dhcp_opt()
795 if (is_hex && digs > 1) in parse_dhcp_opt()
797 new->len = digs; in parse_dhcp_opt()
799 parse_hex(comma, new->val, digs, (flags & DHOPT_MATCH) ? &new->u.wildcard_mask : NULL, NULL); in parse_dhcp_opt()
|
| /external/bison/ |
| D | configure | 6751 char digs[] = "0123456789";
6752 int xlcbug = 1 / (&(digs + 5)[-2 + (bool) 1] == &digs[4] ? 1 : -1);
|