| /external/dropbear/libtommath/ |
| bn_mp_mul.c | 43 int digs = a->used + b->used + 1; local
46 if ((digs < MP_WARRAY) &&
49 res = fast_s_mp_mul_digs (a, b, c, digs);
|
| bn_mp_radix_size.c | 21 int res, digs; local
43 /* digs is the digit count */
44 digs = 0;
48 ++digs;
65 ++digs;
69 /* return digs + 1, the 1 is for the NULL byte that would be required. */
70 *size = digs + 1;
|
| bn_mp_toradix.c | 21 int res, digs; local
49 digs = 0;
56 ++digs;
62 bn_reverse ((unsigned char *)_s, digs);
|
| bn_mp_toradix_n.c | 24 int res, digs; local
58 digs = 0;
69 ++digs;
75 bn_reverse ((unsigned char *)_s, digs);
|
| bn_mp_montgomery_reduce.c | 22 int ix, res, digs; local
31 digs = n->used * 2 + 1;
32 if ((digs < MP_WARRAY) &&
39 if (x->alloc < digs) {
40 if ((res = mp_grow (x, digs)) != MP_OKAY) {
44 x->used = digs;
|
| /external/dnsmasq/src/ |
| rfc1035.c | 95 unsigned int count, digs; local
106 digs = ((count-1)>>2)+1;
108 /* output is \[x<hex>/siz]. which is digs+9 chars */
109 if (cp - (unsigned char *)name + digs + 9 >= MAXDNAME)
117 for (j=0; j<digs; j++)
[all...] |
| option.c | 670 int i, addrs, digs, is_addr, is_hex, is_dec, is_string, dots; local
741 addrs = digs = 1;
751 digs++;
795 if (is_hex && digs > 1)
797 new->len = digs;
799 parse_hex(comma, new->val, digs, (flags & DHOPT_MATCH) ? &new->u.wildcard_mask : NULL, NULL);
[all...] |
| /external/wpa_supplicant/ |
| 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; local
467 if ((digs < MP_WARRAY) &&
470 res = fast_s_mp_mul_digs (a, b, c, digs);
[all...] |
| /external/wpa_supplicant_6/wpa_supplicant/src/tls/ |
| 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; local
507 if ((digs < MP_WARRAY) &&
510 res = fast_s_mp_mul_digs (a, b, c, digs);
[all...] |
| /external/dropbear/libtommath/pre_gen/ |
| mpi.c | 414 int fast_s_mp_mul_digs (mp_int * a, mp_int * b, mp_int * c, int digs)
421 if (c->alloc < digs) {
422 if ((res = mp_grow (c, digs)) != MP_OKAY) {
428 pa = MIN(digs, a->used + b->used);
510 * output digits *above* digs. See the comments for fast_s_mul_digs
518 int fast_s_mp_mul_high_digs (mp_int * a, mp_int * b, mp_int * c, int digs)
535 for (ix = digs; ix < pa; ix++) {
571 tmpc = c->dp + digs;
572 for (ix = digs; ix < pa; ix++) {
4752 int ix, res, digs; local
4958 int digs = a->used + b->used + 1; local
6215 int res, digs; local
8359 int res, digs; local
8441 int res, digs; local
[all...] |
