| /prebuilts/ndk/current/platforms/android-19/arch-arm/usr/include/linux/ |
| calc64.h | 19 #define div_long_long_rem(dividend, divisor, remainder) do_div_llr((dividend), divisor, remainder)
|
| /prebuilts/ndk/current/platforms/android-19/arch-mips/usr/include/linux/ |
| calc64.h | 19 #define div_long_long_rem(dividend, divisor, remainder) do_div_llr((dividend), divisor, remainder)
|
| /prebuilts/ndk/current/platforms/android-19/arch-x86/usr/include/linux/ |
| calc64.h | 19 #define div_long_long_rem(dividend, divisor, remainder) do_div_llr((dividend), divisor, remainder)
|
| /prebuilts/ndk/current/platforms/android-3/arch-arm/usr/include/linux/ |
| calc64.h | 19 #define div_long_long_rem(dividend, divisor, remainder) do_div_llr((dividend), divisor, remainder)
|
| /prebuilts/ndk/current/platforms/android-4/arch-arm/usr/include/linux/ |
| calc64.h | 19 #define div_long_long_rem(dividend, divisor, remainder) do_div_llr((dividend), divisor, remainder)
|
| /prebuilts/ndk/current/platforms/android-5/arch-arm/usr/include/linux/ |
| calc64.h | 19 #define div_long_long_rem(dividend, divisor, remainder) do_div_llr((dividend), divisor, remainder)
|
| /prebuilts/ndk/current/platforms/android-8/arch-arm/usr/include/linux/ |
| calc64.h | 19 #define div_long_long_rem(dividend, divisor, remainder) do_div_llr((dividend), divisor, remainder)
|
| /prebuilts/ndk/current/platforms/android-9/arch-arm/usr/include/linux/ |
| calc64.h | 19 #define div_long_long_rem(dividend, divisor, remainder) do_div_llr((dividend), divisor, remainder)
|
| /prebuilts/ndk/current/platforms/android-9/arch-mips/usr/include/linux/ |
| calc64.h | 19 #define div_long_long_rem(dividend, divisor, remainder) do_div_llr((dividend), divisor, remainder)
|
| /prebuilts/ndk/current/platforms/android-9/arch-x86/usr/include/linux/ |
| calc64.h | 19 #define div_long_long_rem(dividend, divisor, remainder) do_div_llr((dividend), divisor, remainder)
|
| /external/v8/test/mjsunit/asm/ |
| uint32div.js | 14 + " function " + name + "(dividend) {\n"
15 + " return ((dividend >>> 0) / " + divisor + ") >>> 0;\n"
26 for (var dividend = 0; dividend < 4294967296; dividend += 3999773) {
27 assertEquals((dividend / divisor) >>> 0, div(dividend));
33 function div(dividend, divisor) {
34 return (dividend >>> 0) / (divisor >>> 0) | 0;
41 for (var dividend = 0; dividend < 4294967296; dividend += 3999773)
[all...] |
| int32div.js | 17 + " function " + name + "(dividend) {\n"
18 + " return ((dividend | 0) / " + divisor + ") | 0;\n"
30 for (var dividend = -2147483648; dividend < 2147483648; dividend += 3999773) {
31 assertEquals((dividend / divisor) | 0, div(dividend));
|
| int32mod-constant.js | 17 + " function " + name + "(dividend) {\n"
18 + " return ((dividend | 0) % " + divisor + ") | 0;\n"
30 for (var dividend = -2147483648; dividend < 2147483648; dividend += 3999773) {
31 assertEquals((dividend % divisor) | 0, mod(dividend));
|
| uint32mod-constant.js | 14 + " function " + name + "(dividend) {\n"
15 + " return ((dividend >>> 0) % " + divisor + ") >>> 0;\n"
26 for (var dividend = 0; dividend < 4294967296; dividend += 3999773) {
27 assertEquals((dividend % divisor) >>> 0, mod(dividend));
|
| /external/guava/guava/src/com/google/common/primitives/ |
| UnsignedLongs.java | 175 * Returns dividend / divisor, where the dividend and divisor are treated as unsigned 64-bit
178 * @param dividend the dividend (numerator)
182 public static long divide(long dividend, long divisor) {
184 if (compare(dividend, divisor) < 0) {
185 return 0; // dividend < divisor
187 return 1; // dividend >= divisor
191 // Optimization - use signed division if dividend < 2^63
192 if (dividend >= 0)
[all...] |
| UnsignedInts.java | 173 * Returns dividend / divisor, where the dividend and divisor are treated as unsigned 32-bit
176 * @param dividend the dividend (numerator)
180 public static int divide(int dividend, int divisor) {
181 return (int) (toLong(dividend) / toLong(divisor));
185 * Returns dividend % divisor, where the dividend and divisor are treated as unsigned 32-bit
188 * @param dividend the dividend (numerator
[all...] |
| /libcore/luni/src/main/java/java/math/ |
| Division.java | 49 static int divideArrayByInt(int[] quotient, int[] dividend, final int dividendLength,
56 long temp = (rem << 32) | (dividend[i] & 0xffffffffL);
63 * make the dividend positive shifting it right by 1 bit then
|
| /external/v8/test/mjsunit/compiler/ |
| division-by-constant.js | 33 return "return ((dividend | 0) / ((" + divisor + ") | 0)) | 0";
37 new Function("dividend", "divisor", ConstructDiv("divisor"));
44 return "return ((dividend | 0) % ((" + divisor + ") | 0)) | 0";
48 new Function("dividend", "divisor", ConstructMod("divisor"));
55 return "return Math.floor(dividend / (" + divisor + ")) | 0";
59 new Function("dividend", "divisor", ConstructFlooringDiv("divisor"));
107 var OptFun = new Function("dividend", construct(divisor));
115 function dude(dividend) {
117 if (dividend === -2147483648 && divisor === -1) return;
118 assertEquals(ref(dividend, divisor), OptFun(dividend))
[all...] |
| /external/guava/guava-tests/benchmark/com/google/common/primitives/ |
| UnsignedLongsBenchmark.java | 122 // to the given dividend, so that we don't have half of our divisions being
123 // trivial because the divisor is bigger than the dividend.
126 private static long randomDivisor(long dividend) {
128 if (dividend == -1) {
131 return UnsignedLongs.remainder(r, dividend + 1);
|
| /external/v8/test/mjsunit/ |
| div-mod.js | 95 function compute_mod(dividend, divisor) {
97 // dividend is an infinity. Return dividend if divisor is an infinity.
98 if (isNaN(dividend) || isNaN(divisor) || divisor == 0) { return NaN; }
100 if (dividend < 0) { dividend = -dividend; sign = -1; }
101 if (dividend == Infinity) { return NaN; }
103 if (divisor == Infinity) { return sign * dividend; }
112 return sign * rec_mod(dividend, divisor)
[all...] |
| /external/v8/src/ |
| fixed-dtoa.cc | 321 uint64_t dividend = significand; local
335 dividend <<= exponent - divisor_power;
336 quotient = static_cast<uint32_t>(dividend / divisor);
337 remainder = (dividend % divisor) << divisor_power;
340 quotient = static_cast<uint32_t>(dividend / divisor);
341 remainder = (dividend % divisor) << exponent;
|
| /external/v8/src/compiler/ |
| machine-operator-reducer.h | 47 Node* Int32Div(Node* dividend, int32_t divisor);
48 Node* Uint32Div(Node* dividend, uint32_t divisor);
|
| /external/compiler-rt/test/builtins/Unit/ |
| divdc3_test.c | 55 double _Complex dividend; local
58 __real__ dividend = a; local
59 __imag__ dividend = b; local
63 switch (classify(dividend))
|
| divsc3_test.c | 55 float _Complex dividend; local
58 __real__ dividend = a; local
59 __imag__ dividend = b; local
63 switch (classify(dividend))
|
| divtc3_test.c | 57 long double _Complex dividend; local
60 __real__ dividend = a; local
61 __imag__ dividend = b; local
65 switch (classify(dividend))
|
