| /external/llvm/test/CodeGen/X86/ |
| D | fast-isel-divrem.ll | 4 define i8 @test_sdiv8(i8 %dividend, i8 %divisor) nounwind {
6 %result = sdiv i8 %dividend, %divisor
14 define i8 @test_srem8(i8 %dividend, i8 %divisor) nounwind {
16 %result = srem i8 %dividend, %divisor
24 define i8 @test_udiv8(i8 %dividend, i8 %divisor) nounwind {
26 %result = udiv i8 %dividend, %divisor
34 define i8 @test_urem8(i8 %dividend, i8 %divisor) nounwind {
36 %result = urem i8 %dividend, %divisor
44 define i16 @test_sdiv16(i16 %dividend, i16 %divisor) nounwind {
46 %result = sdiv i16 %dividend, %divisor
[all …]
|
| D | fast-isel-divrem-x86-64.ll | 3 define i64 @test_sdiv64(i64 %dividend, i64 %divisor) nounwind {
5 %result = sdiv i64 %dividend, %divisor
13 define i64 @test_srem64(i64 %dividend, i64 %divisor) nounwind {
15 %result = srem i64 %dividend, %divisor
23 define i64 @test_udiv64(i64 %dividend, i64 %divisor) nounwind {
25 %result = udiv i64 %dividend, %divisor
33 define i64 @test_urem64(i64 %dividend, i64 %divisor) nounwind {
35 %result = urem i64 %dividend, %divisor
|
| D | div8.ll | 6 define signext i8 @test_div(i8 %dividend, i8 %divisor) nounwind ssp {
8 %dividend.addr = alloca i8, align 2
11 store i8 %dividend, i8* %dividend.addr, align 2
13 %tmp = load i8, i8* %dividend.addr, align 2
|
| /external/v8/test/mjsunit/asm/ |
| D | uint32div.js | 26 for (var dividend = 0; dividend < 4294967296; dividend += 3999773) {
27 assertEquals((dividend / divisor) >>> 0, div(dividend));
33 function div(dividend, divisor) { argument
34 return (dividend >>> 0) / (divisor >>> 0) | 0;
41 for (var dividend = 0; dividend < 4294967296; dividend += 3999773) {
42 assertEquals((dividend >>> 0) / (divisor >>> 0) | 0,
43 div(dividend, divisor));
|
| D | int32mod.js | 11 function mod(dividend, divisor) { argument
12 dividend = dividend|0;
14 return (dividend % divisor) | 0;
23 for (var dividend = -2147483648; dividend < 2147483648; dividend += 3999773) {
24 assertEquals((dividend % divisor) | 0, mod(dividend, divisor));
|
| D | uint32mod.js | 11 function mod(dividend, divisor) { argument
12 dividend = dividend >>> 0;
14 return (dividend % divisor) >>> 0;
22 for (var dividend = 0; dividend < 4294967296; dividend += 3999773) {
23 assertEquals((dividend % divisor) >>> 0, mod(dividend, divisor));
|
| D | int32modb.js | 11 function mod(dividend, divisor) { argument
12 dividend = dividend|0;
14 return (dividend % divisor) | 0;
23 for (var dividend = -2147483648; dividend < 2147483648; dividend += 3999773) {
24 assertEquals((dividend % divisor) | 0, mod(dividend, divisor));
|
| D | uint32mod-constant.js | 26 for (var dividend = 0; dividend < 4294967296; dividend += 3999773) {
27 assertEquals((dividend % divisor) >>> 0, mod(dividend));
|
| D | int32div.js | 30 for (var dividend = -2147483648; dividend < 2147483648; dividend += 3999773) {
31 assertEquals((dividend / divisor) | 0, div(dividend));
|
| D | int32mod-constant.js | 30 for (var dividend = -2147483648; dividend < 2147483648; dividend += 3999773) {
31 assertEquals((dividend % divisor) | 0, mod(dividend));
|
| /external/guava/guava/src/com/google/common/primitives/ |
| D | UnsignedLongs.java | 182 public static long divide(long dividend, long divisor) { in divide() argument
184 if (compare(dividend, divisor) < 0) { in divide()
192 if (dividend >= 0) { in divide()
193 return dividend / divisor; in divide()
202 long quotient = ((dividend >>> 1) / divisor) << 1; in divide()
203 long rem = dividend - quotient * divisor; in divide()
216 public static long remainder(long dividend, long divisor) { in remainder() argument
218 if (compare(dividend, divisor) < 0) { in remainder()
219 return dividend; // dividend < divisor in remainder()
221 return dividend - divisor; // dividend >= divisor in remainder()
[all …]
|
| D | UnsignedInts.java | 180 public static int divide(int dividend, int divisor) { in divide() argument
181 return (int) (toLong(dividend) / toLong(divisor)); in divide()
192 public static int remainder(int dividend, int divisor) { in remainder() argument
193 return (int) (toLong(dividend) % toLong(divisor)); in remainder()
|
| /external/v8/test/mjsunit/compiler/ |
| D | division-by-constant.js | 115 function dude(dividend) { argument
117 if (dividend === -2147483648 && divisor === -1) return;
118 assertEquals(ref(dividend, divisor), OptFun(dividend));
|
| /external/v8/test/mjsunit/ |
| D | div-mod.js | 95 function compute_mod(dividend, divisor) { argument
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);
|
| /external/compiler-rt/test/builtins/Unit/ |
| D | muldc3_test.c | 55 double _Complex dividend; in test__muldc3() local
58 __real__ dividend = a; in test__muldc3() local
59 __imag__ dividend = b; in test__muldc3() local
63 switch (classify(dividend)) in test__muldc3()
|
| D | divdc3_test.c | 55 double _Complex dividend; in test__divdc3() local
58 __real__ dividend = a; in test__divdc3() local
59 __imag__ dividend = b; in test__divdc3() local
63 switch (classify(dividend)) in test__divdc3()
|
| D | divtc3_test.c | 57 long double _Complex dividend; in test__divtc3() local
60 __real__ dividend = a; in test__divtc3() local
61 __imag__ dividend = b; in test__divtc3() local
65 switch (classify(dividend)) in test__divtc3()
|
| D | divsc3_test.c | 55 float _Complex dividend; in test__divsc3() local
58 __real__ dividend = a; in test__divsc3() local
59 __imag__ dividend = b; in test__divsc3() local
63 switch (classify(dividend)) in test__divsc3()
|
| D | multc3_test.c | 58 long double _Complex dividend; in test__multc3() local
61 __real__ dividend = a; in test__multc3() local
62 __imag__ dividend = b; in test__multc3() local
66 switch (classify(dividend)) in test__multc3()
|
| D | divxc3_test.c | 57 long double _Complex dividend; in test__divxc3() local
60 __real__ dividend = a; in test__divxc3() local
61 __imag__ dividend = b; in test__divxc3() local
65 switch (classify(dividend)) in test__divxc3()
|
| D | mulxc3_test.c | 57 long double _Complex dividend; in test__mulxc3() local
60 __real__ dividend = a; in test__mulxc3() local
61 __imag__ dividend = b; in test__mulxc3() local
65 switch (classify(dividend)) in test__mulxc3()
|
| D | mulsc3_test.c | 55 float _Complex dividend; in test__mulsc3() local
58 __real__ dividend = a; in test__mulsc3() local
59 __imag__ dividend = b; in test__mulsc3() local
63 switch (classify(dividend)) in test__mulsc3()
|
| /external/v8/src/ |
| D | fixed-dtoa.cc | 321 uint64_t dividend = significand; in FastFixedDtoa() local
335 dividend <<= exponent - divisor_power; in FastFixedDtoa()
336 quotient = static_cast<uint32_t>(dividend / divisor); in FastFixedDtoa()
337 remainder = (dividend % divisor) << divisor_power; in FastFixedDtoa()
340 quotient = static_cast<uint32_t>(dividend / divisor); in FastFixedDtoa()
341 remainder = (dividend % divisor) << exponent; in FastFixedDtoa()
|
| /external/v8/src/compiler/ |
| D | machine-operator-reducer.cc | 90 Node* MachineOperatorReducer::Int32Div(Node* dividend, int32_t divisor) { in Int32Div() argument
95 Node* quotient = graph()->NewNode(machine()->Int32MulHigh(), dividend, in Int32Div()
98 quotient = Int32Add(quotient, dividend); in Int32Div()
100 quotient = Int32Sub(quotient, dividend); in Int32Div()
102 return Int32Add(Word32Sar(quotient, mag.shift), Word32Shr(dividend, 31)); in Int32Div()
106 Node* MachineOperatorReducer::Uint32Div(Node* dividend, uint32_t divisor) { in Uint32Div() argument
111 dividend = Word32Shr(dividend, shift); in Uint32Div()
116 Node* quotient = graph()->NewNode(machine()->Uint32MulHigh(), dividend, in Uint32Div()
121 Int32Add(Word32Shr(Int32Sub(dividend, quotient), 1), quotient), in Uint32Div()
581 Node* const dividend = m.left().node(); in ReduceInt32Div() local
[all …]
|
| /external/guava/guava-tests/benchmark/com/google/common/primitives/ |
| D | UnsignedLongsBenchmark.java | 126 private static long randomDivisor(long dividend) { in randomDivisor() argument
128 if (dividend == -1) { in randomDivisor()
131 return UnsignedLongs.remainder(r, dividend + 1); in randomDivisor()
|