| /external/dropbear/libtommath/ |
| bn_mp_reduce_2k.c | 18 /* reduces a modulo n where n is of the form 2**p - d */
|
| bn_mp_reduce_2k_l.c | 18 /* reduces a modulo n where n is of the form 2**p - d
|
| bn_mp_dr_reduce.c | 18 /* reduce "x" in place modulo "n" using the Diminished Radix algorithm.
|
| /external/v8/src/ |
| macros.py | 128 macro HOUR_FROM_TIME(time) = (Modulo($floor(time / 3600000), 24));
129 macro MIN_FROM_TIME(time) = (Modulo($floor(time / 60000), 60));
130 macro SEC_FROM_TIME(time) = (Modulo($floor(time / 1000), 60));
131 macro MS_FROM_TIME(time) = (Modulo(time, 1000));
|
| conversions-inl.h | 87 if (x < 0 || x >= two32) x = modulo(x, two32);
|
| /prebuilt/linux-x86/toolchain/arm-eabi-4.4.0/lib/gcc/arm-eabi/4.4.0/plugin/include/ada/gcc-interface/ |
| ada-tree.def | 44 /* Same as PLUS_EXPR, except that no modulo reduction is applied.
48 /* Same as MINUS_EXPR, except that no modulo reduction is applied.
|
| /external/icu4c/i18n/ |
| bocsu.h | 59 * of byte values available, the modulo is used for one trail byte, and the remainder
135 * Integer division and modulo with negative numerators
136 * yields negative modulo results and quotients that are one more than
|
| /bionic/libc/tzcode/ |
| tzfile.h | 167 ** Since everything in isleap is modulo 400 (or a factor of 400), we know that
173 ** This is true even if % means modulo rather than Fortran remainder
|
| /external/icu4c/tools/tzcode/ |
| tzfile.h | 167 ** Since everything in isleap is modulo 400 (or a factor of 400), we know that
173 ** This is true even if % means modulo rather than Fortran remainder
|
| /external/qemu/distrib/zlib-1.2.3/ |
| adler32.c | 96 /* do length NMAX blocks -- requires just one modulo operation */
108 /* do remaining bytes (less than NMAX, still just one modulo) */
|
| /external/v8/test/mjsunit/ |
| div-mod.js | 90 // Test extreme corner cases of modulo.
92 // Computes the modulo by slow but lossless operations.
|
| /external/zlib/ |
| adler32.c | 96 /* do length NMAX blocks -- requires just one modulo operation */
108 /* do remaining bytes (less than NMAX, still just one modulo) */
|
| /prebuilt/linux-x86/toolchain/arm-eabi-4.4.0/lib/gcc/arm-eabi/4.4.0/plugin/include/ |
| double-int.h | 44 operations that do not perform arithmetics modulo 2^precision (comparisons,
104 /* The following operations perform arithmetics modulo 2^precision,
|
| /system/core/libcutils/ |
| tzfile.h | 167 ** Since everything in isleap is modulo 400 (or a factor of 400), we know that
173 ** This is true even if % means modulo rather than Fortran remainder
|
| /bionic/libc/stdlib/ |
| strtoumax.c | 74 /* BIONIC: avoid division and modulo for common cases */
|
| /external/bluetooth/glib/docs/reference/glib/tmpl/ |
| timers.sgml | 87 in microseconds (that is, the total number of microseconds elapsed, modulo
|
| /external/e2fsprogs/intl/ |
| plural-exp.h | 47 module, /* Modulo operation. */
|
| /external/openssl/crypto/bn/ |
| bn_gf2m.c | 444 /* Compute the product of two polynomials a and b, reduce modulo p, and store
493 /* Compute the product of two polynomials a and b, reduce modulo p, and store
579 /* Invert a, reduce modulo p, and store the result in r. r could be a.
640 /* Invert xx, reduce modulo p, and store the result in r. r could be xx.
666 /* Divide y by x, reduce modulo p, and store the result in r. r could be x
692 /* Divide y by x, reduce modulo p, and store the result in r. r could be x
765 /* Divide yy by xx, reduce modulo p, and store the result in r. r could be xx
793 /* Compute the bth power of a, reduce modulo p, and store
833 /* Compute the bth power of a, reduce modulo p, and store
862 /* Compute the square root of a, reduce modulo p, and stor
[all...] |
| bntest.c | 828 fprintf(stderr,"Modulo test failed!\n");
897 fprintf(stderr,"Modulo multiply test failed!\n");
950 fprintf(stderr,"Modulo exponentiation test failed!\n");
1001 fprintf(stderr,"Modulo exponentiation test failed!\n");
1157 fprintf(stderr,"GF(2^m) modulo test failed!\n");
[all...] |
| /bionic/libc/bionic/ |
| arc4random.c | 246 * avoiding "modulo bias".
252 * after reduction modulo upper_bound.
|
| /external/webkit/WebKitTools/iExploder/htdocs/ |
| iexploder.rb | 266 @offset = @subtest_num.modulo(@htmlMaxTags)
329 test.offset = test.subtest_num.modulo(max)
|
| /dalvik/libcore/security/src/main/java/org/bouncycastle/crypto/generators/ |
| DSAParametersGenerator.java | 42 * modulo 2^a.length in case of overflow.
|
| PKCS12ParametersGenerator.java | 54 * modulo 2^b.length in case of overflow.
|
| /external/webkit/JavaScriptCore/tests/mozilla/ecma/TypeConversion/ |
| 9.6.js | 35 4 compute result(3) modulo 2^32:
|
| /system/wlan/ti/wilink_6_1/TWD/Data_Service/ |
| RxQueue.c | 316 * in case the modulo receive packet with SN equal to winStart:
321 * in case the modulo receive packet that SN between winStart to winEnd:
324 * in case the modulo receive packet that SN higher then winEnd:
329 * in case the modulo receive BA event packet:
[all...] |
