| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/ |
| fpformat.py | 64 def roundfrac(intpart, fraction, digs):
65 """Round or extend the fraction to size digs."""
67 if f <= digs:
68 return intpart, fraction + '0'*(digs-f)
70 if i+digs < 0:
71 return '0'*-digs, ''
73 nextdigit = total[i+digs]
75 n = i + digs - 1
85 if digs >= 0:
86 return intpart, fraction[:digs]
[all...] |
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/ |
| fpformat.py | 64 def roundfrac(intpart, fraction, digs):
65 """Round or extend the fraction to size digs."""
67 if f <= digs:
68 return intpart, fraction + '0'*(digs-f)
70 if i+digs < 0:
71 return '0'*-digs, ''
73 nextdigit = total[i+digs]
75 n = i + digs - 1
85 if digs >= 0:
86 return intpart, fraction[:digs]
[all...] |
| /external/dropbear/libtommath/ |
| 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_s_mp_mul_digs.c | 18 /* multiplies |a| * |b| and only computes upto digs digits of result
22 int s_mp_mul_digs (mp_int * a, mp_int * b, mp_int * c, int digs)
31 if (((digs) < MP_WARRAY) &&
34 return fast_s_mp_mul_digs (a, b, c, digs);
37 if ((res = mp_init_size (&t, digs)) != MP_OKAY) {
40 t.used = digs;
48 /* limit ourselves to making digs digits of output */
49 pb = MIN (b->used, digs - ix);
74 /* set carry if it is placed below digs */
75 if (ix + iy < digs) {
[all...] |
| 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;
|
| bn_s_mp_mul_high_digs.c | 18 /* multiplies |a| * |b| and does not compute the lower digs digits
22 s_mp_mul_high_digs (mp_int * a, mp_int * b, mp_int * c, int digs)
34 return fast_s_mp_mul_high_digs (a, b, c, digs);
53 tmpt = &(t.dp[digs]);
56 tmpy = b->dp + (digs - ix);
58 for (iy = digs - ix; iy < pb; iy++) {
|
| 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_fast_s_mp_mul_digs.c | 34 int fast_s_mp_mul_digs (mp_int * a, mp_int * b, mp_int * c, int digs)
41 if (c->alloc < digs) {
42 if ((res = mp_grow (c, digs)) != MP_OKAY) {
48 pa = MIN(digs, a->used + b->used);
|
| bn_fast_s_mp_mul_high_digs.c | 19 * output digits *above* digs. See the comments for fast_s_mul_digs
27 int fast_s_mp_mul_high_digs (mp_int * a, mp_int * b, mp_int * c, int digs)
44 for (ix = digs; ix < pa; ix++) {
80 tmpc = c->dp + digs;
81 for (ix = digs; ix < pa; ix++) {
|
| 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);
|
| /external/antlr/antlr-3.4/runtime/Ruby/test/functional/parser/ |
| actions.rb | 211 nums returns [ds]: digs+=DIGIT+
212 { $ds = $digs.map { |t| t.value } };
|
| /external/wpa_supplicant_8/src/tls/ |
| libtommath.c | 141 static int s_mp_mul_digs (mp_int * a, mp_int * b, mp_int * c, int digs);
143 static int s_mp_mul_high_digs(mp_int * a, mp_int * b, mp_int * c, int digs);
146 static int fast_s_mp_mul_digs (mp_int * a, mp_int * b, mp_int * c, int digs);
518 int digs = a->used + b->used + 1; local
520 if ((digs < MP_WARRAY) &&
523 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...] |
| /external/chromium_org/third_party/openssl/openssl/crypto/srp/ |
| srp_vfy.c | 480 unsigned char digs[SHA_DIGEST_LENGTH]; local
511 EVP_DigestFinal_ex(&ctxt, digs, NULL);
513 if (SRP_user_pwd_set_sv_BN(user, BN_bin2bn(digs,SHA_DIGEST_LENGTH,NULL), BN_bin2bn(digv,SHA_DIGEST_LENGTH, NULL)))
|
| /external/openssl/crypto/srp/ |
| srp_vfy.c | 480 unsigned char digs[SHA_DIGEST_LENGTH]; local
511 EVP_DigestFinal_ex(&ctxt, digs, NULL);
513 if (SRP_user_pwd_set_sv_BN(user, BN_bin2bn(digs,SHA_DIGEST_LENGTH,NULL), BN_bin2bn(digv,SHA_DIGEST_LENGTH, NULL)))
|
| /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/marisa-trie/ |
| configure | [all...] |
| /external/stressapptest/ |
| configure | [all...] |
