| /external/dropbear/libtommath/ |
| bn_mp_div_3.c | 15 * Tom St Denis, tomstdenis@gmail.com, http://math.libtomcrypt.com
|
| bn_mp_grow.c | 15 * Tom St Denis, tomstdenis@gmail.com, http://math.libtomcrypt.com
|
| bn_mp_lcm.c | 15 * Tom St Denis, tomstdenis@gmail.com, http://math.libtomcrypt.com
|
| bn_mp_lshd.c | 15 * Tom St Denis, tomstdenis@gmail.com, http://math.libtomcrypt.com
|
| bn_mp_mod_2d.c | 15 * Tom St Denis, tomstdenis@gmail.com, http://math.libtomcrypt.com
|
| bn_mp_montgomery_calc_normalization.c | 15 * Tom St Denis, tomstdenis@gmail.com, http://math.libtomcrypt.com
|
| bn_mp_montgomery_setup.c | 15 * Tom St Denis, tomstdenis@gmail.com, http://math.libtomcrypt.com
|
| bn_mp_mul.c | 15 * Tom St Denis, tomstdenis@gmail.com, http://math.libtomcrypt.com
|
| bn_mp_mul_d.c | 15 * Tom St Denis, tomstdenis@gmail.com, http://math.libtomcrypt.com
|
| bn_mp_prime_fermat.c | 15 * Tom St Denis, tomstdenis@gmail.com, http://math.libtomcrypt.com
|
| bn_mp_prime_is_prime.c | 15 * Tom St Denis, tomstdenis@gmail.com, http://math.libtomcrypt.com
|
| bn_mp_radix_size.c | 15 * Tom St Denis, tomstdenis@gmail.com, http://math.libtomcrypt.com
|
| bn_mp_rshd.c | 15 * Tom St Denis, tomstdenis@gmail.com, http://math.libtomcrypt.com
|
| bn_mp_sqrt.c | 15 * Tom St Denis, tomstdenis@gmail.com, http://math.libtomcrypt.com
|
| bn_mp_sub.c | 15 * Tom St Denis, tomstdenis@gmail.com, http://math.libtomcrypt.com
|
| bn_mp_toradix.c | 15 * Tom St Denis, tomstdenis@gmail.com, http://math.libtomcrypt.com
|
| /external/e2fsprogs/install-utils/ |
| convfstab | 3 # M.Weller (eowmob@exp-math.uni-essen.de) 13.11.1994.
|
| /external/iproute2/netem/ |
| paretonormal.c | 16 #include <math.h>
|
| stats.c | 12 #include <math.h>
|
| /external/srec/srec/crec/ |
| rec_norm.c | 26 #include <math.h>
|
| /external/stlport/stlport/stl/config/ |
| _android.h | 52 // The system math library doesn't have long double variants, e.g
|
| /external/v8/benchmarks/ |
| raytrace.js | 163 var d = Math.abs(this.red - color.red) + Math.abs(this.green - color.green) + Math.abs(this.blue - color.blue);
177 var r = Math.floor(this.red*255);
178 var g = Math.floor(this.green*255);
179 var b = Math.floor(this.blue*255);
184 var r = Math.floor(this.red*255);
185 var g = Math.floor(this.green*255);
186 var b = Math.floor(this.blue*255);
211 return Math.pow((intensity - distance) / strength, 0.2)
[all...] |
| /external/v8/test/mjsunit/ |
| call-non-function.js | 48 TryCall(Math);
|
| /external/webkit/JavaScriptCore/tests/mozilla/ecma_2/Statements/ |
| try-001.js | 45 if ( Math.floor(value) != value || isNaN(value) ) {
|
| /external/webkit/JavaScriptCore/tests/mozilla/js1_5/Array/ |
| regress-157652.js | 89 * > allows array lengths to be anything less than Math.pow(2,32), so the
93 * > = Math.pow(2, 30). So shouldn't I also get one for every LEN between
94 * > that and Math.pow(2, 32)? For some reason, I start to hang with 100% CPU
95 * > as LEN hits, say, Math.pow(2, 31) and higher. SpiderMonkey gives OOM
|
