/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
|
/external/v8/test/mjsunit/asm/ |
D | uint32div.js | 9 function Uint32Div(divisor) { argument 11 name += divisor; 15 + " return ((dividend >>> 0) / " + divisor + ") >>> 0;\n" 24 var divisor = divisors[i]; variable 25 var div = Uint32Div(divisor); 27 assertEquals((dividend / divisor) >>> 0, div(dividend)); 33 function div(dividend, divisor) { argument 34 return (dividend >>> 0) / (divisor >>> 0) | 0; 40 var divisor = divisors[i]; 42 assertEquals((dividend >>> 0) / (divisor >>> 0) | 0, [all …]
|
D | int32mod-constant.js | 9 function Int32Mod(divisor) { argument 11 if (divisor < 0) { 14 name += Math.abs(divisor); 18 + " return ((dividend | 0) % " + divisor + ") | 0;\n" 28 var divisor = divisors[i]; variable 29 var mod = Int32Mod(divisor); 31 assertEquals((dividend % divisor) | 0, mod(dividend));
|
D | uint32mod.js | 11 function mod(dividend, divisor) { argument 13 divisor = divisor >>> 0; 14 return (dividend % divisor) >>> 0; 21 var divisor = divisors[i]; variable 23 assertEquals((dividend % divisor) >>> 0, mod(dividend, divisor));
|
D | int32mod.js | 11 function mod(dividend, divisor) { argument 13 divisor = divisor|0; 14 return (dividend % divisor) | 0; 22 var divisor = divisors[i]; variable 24 assertEquals((dividend % divisor) | 0, mod(dividend, divisor));
|
D | int32div.js | 9 function Int32Div(divisor) { argument 11 if (divisor < 0) { 14 name += Math.abs(divisor); 18 + " return ((dividend | 0) / " + divisor + ") | 0;\n" 28 var divisor = divisors[i]; variable 29 var div = Int32Div(divisor); 31 assertEquals((dividend / divisor) | 0, div(dividend));
|
D | int32modb.js | 11 function mod(dividend, divisor) { argument 13 divisor = divisor|0; 14 return (dividend % divisor) | 0; 22 var divisor = divisors[i]; variable 24 assertEquals((dividend % divisor) | 0, mod(dividend, divisor));
|
D | uint32mod-constant.js | 9 function Uint32Mod(divisor) { argument 11 name += divisor; 15 + " return ((dividend >>> 0) % " + divisor + ") >>> 0;\n" 24 var divisor = divisors[i]; variable 25 var mod = Uint32Mod(divisor); 27 assertEquals((dividend % divisor) >>> 0, mod(dividend));
|
/external/v8/test/mjsunit/compiler/ |
D | division-by-constant.js | 32 function ConstructDiv(divisor) { argument 33 return "return ((dividend | 0) / ((" + divisor + ") | 0)) | 0"; 43 function ConstructMod(divisor) { argument 44 return "return ((dividend | 0) % ((" + divisor + ") | 0)) | 0"; 54 function ConstructFlooringDiv(divisor) { argument 55 return "return Math.floor(dividend / (" + divisor + ")) | 0"; 105 function TestDivisionLike(ref, construct, values, divisor) { argument 107 var OptFun = new Function("dividend", construct(divisor)); 117 if (dividend === -2147483648 && divisor === -1) return; 118 assertEquals(ref(dividend, divisor), OptFun(dividend)); [all …]
|
/external/guava/guava/src/com/google/common/primitives/ |
D | UnsignedLongs.java | 182 public static long divide(long dividend, long divisor) { in divide() argument 183 if (divisor < 0) { // i.e., divisor >= 2^63: in divide() 184 if (compare(dividend, divisor) < 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() 204 return quotient + (compare(rem, divisor) >= 0 ? 1 : 0); in divide() 216 public static long remainder(long dividend, long divisor) { in remainder() argument 217 if (divisor < 0) { // i.e., divisor >= 2^63: in remainder() 218 if (compare(dividend, divisor) < 0) { in remainder() [all …]
|
/external/v8/test/mjsunit/ |
D | div-mod.js | 44 function run_tests_for(divisor) { argument 45 print("(function(left) { return left / " + divisor + "; })"); 46 var div_func = this.eval("(function(left) { return left / " + divisor + "; })"); 47 var mod_func = this.eval("(function(left) { return left % " + divisor + "; })"); 50 divmod(div_func, mod_func, 0, divisor); 51 divmod(div_func, mod_func, 1 / 0, divisor); 54 divmod(div_func, mod_func, Math.pow(2, exp), divisor); 55 divmod(div_func, mod_func, 0.9999999 * Math.pow(2, exp), divisor); 56 divmod(div_func, mod_func, 1.0000001 * Math.pow(2, exp), divisor); 60 divmod(div_func, mod_func, 1 << exp, divisor); [all …]
|
/external/llvm/test/CodeGen/ARM/Windows/ |
D | division.ll | 4 define arm_aapcs_vfpcc i32 @sdiv32(i32 %divisor, i32 %divident) { 6 %div = sdiv i32 %divident, %divisor 13 define arm_aapcs_vfpcc i32 @udiv32(i32 %divisor, i32 %divident) { 15 %div = udiv i32 %divident, %divisor 22 define arm_aapcs_vfpcc i64 @sdiv64(i64 %divisor, i64 %divident) { 24 %div = sdiv i64 %divident, %divisor 31 define arm_aapcs_vfpcc i64 @udiv64(i64 %divisor, i64 %divident) { 33 %div = udiv i64 %divident, %divisor
|
/external/icu/icu4j/main/classes/core/src/com/ibm/icu/text/ |
D | NFSubstitution.java | 640 double divisor; field in MultiplierSubstitution 656 double divisor, in MultiplierSubstitution() argument 664 this.divisor = divisor; in MultiplierSubstitution() 666 if (divisor == 0) { // this will cause recursion in MultiplierSubstitution() 678 divisor = Math.pow(radix, exponent); in setDivisor() 680 if (divisor == 0) { in setDivisor() 695 return super.equals(that) && divisor == ((MultiplierSubstitution) that).divisor; in equals() 708 return (long)Math.floor(number / divisor); in transformNumber() 722 return number / divisor; in transformNumber() 724 return Math.floor(number / divisor); in transformNumber() [all …]
|
D | CompactDecimalFormat.java | 61 private final long[] divisor; field in CompactDecimalFormat 121 this.divisor = data.divisors; in CompactDecimalFormat() 164 … long[] divisor, Map<String,String[][]> pluralAffixes, Map<String, String[]> currencyAffixes, in CompactDecimalFormat() argument 168 this.units = otherPluralVariant(pluralAffixes, divisor, debugCreationErrors); in CompactDecimalFormat() 172 this.divisor = divisor.clone(); in CompactDecimalFormat() 208 && Arrays.equals(divisor, other.divisor) in equals() 331 number /= divisor[base]; in toAmount() 356 long[] divisor, Collection<String> debugCreationErrors) { in otherPluralVariant() argument 359 if (divisor.length < CompactDecimalDataCache.MAX_DIGITS) { in otherPluralVariant() 363 for (int i = 0; i < divisor.length; ++i) { in otherPluralVariant() [all …]
|
/external/icu/android_icu4j/src/main/java/android/icu/text/ |
D | NFSubstitution.java | 641 double divisor; field in MultiplierSubstitution 657 double divisor, in MultiplierSubstitution() argument 665 this.divisor = divisor; in MultiplierSubstitution() 667 if (divisor == 0) { // this will cause recursion in MultiplierSubstitution() 679 divisor = Math.pow(radix, exponent); in setDivisor() 681 if (divisor == 0) { in setDivisor() 696 return super.equals(that) && divisor == ((MultiplierSubstitution) that).divisor; in equals() 709 return (long)Math.floor(number / divisor); in transformNumber() 723 return number / divisor; in transformNumber() 725 return Math.floor(number / divisor); in transformNumber() [all …]
|
D | CompactDecimalFormat.java | 61 private final long[] divisor; field in CompactDecimalFormat 116 this.divisor = data.divisors; in CompactDecimalFormat() 159 … long[] divisor, Map<String,String[][]> pluralAffixes, Map<String, String[]> currencyAffixes, in CompactDecimalFormat() argument 163 this.units = otherPluralVariant(pluralAffixes, divisor, debugCreationErrors); in CompactDecimalFormat() 167 this.divisor = divisor.clone(); in CompactDecimalFormat() 202 && Arrays.equals(divisor, other.divisor) in equals() 318 number /= divisor[base]; in toAmount() 343 long[] divisor, Collection<String> debugCreationErrors) { in otherPluralVariant() argument 346 if (divisor.length < CompactDecimalDataCache.MAX_DIGITS) { in otherPluralVariant() 350 for (int i = 0; i < divisor.length; ++i) { in otherPluralVariant() [all …]
|
/external/caliper/caliper/src/main/java/com/google/caliper/util/ |
D | ShortDuration.java | 151 public abstract ShortDuration dividedBy(long divisor, RoundingMode roundingMode); in dividedBy() argument 160 public abstract ShortDuration dividedBy(BigDecimal divisor, RoundingMode roundingMode); in dividedBy() argument 181 @Override public ShortDuration dividedBy(long divisor, RoundingMode roundingMode) { 182 return dividedBy(new BigDecimal(divisor), roundingMode); 184 @Override public ShortDuration dividedBy(BigDecimal divisor, RoundingMode roundingMode) { 185 checkArgument(divisor.compareTo(BigDecimal.ZERO) != 0); 215 BigDecimal divisor = ONE_IN_PICOS.get(unit); in to() local 216 return toLong(new BigDecimal(picos).divide(divisor), roundingMode); in to() 242 @Override public ShortDuration dividedBy(long divisor, RoundingMode roundingMode) { in dividedBy() argument 243 return dividedBy(new BigDecimal(divisor), roundingMode); in dividedBy() [all …]
|
/external/compiler-rt/test/builtins/Unit/ |
D | divxc3_test.c | 58 long double _Complex divisor; in test__divxc3() local 62 __real__ divisor = c; in test__divxc3() local 63 __imag__ divisor = d; in test__divxc3() local 68 switch (classify(divisor)) in test__divxc3() 93 switch (classify(divisor)) in test__divxc3() 124 switch (classify(divisor)) in test__divxc3() 149 switch (classify(divisor)) in test__divxc3() 174 switch (classify(divisor)) in test__divxc3()
|
D | divdc3_test.c | 56 double _Complex divisor; in test__divdc3() local 60 __real__ divisor = c; in test__divdc3() local 61 __imag__ divisor = d; in test__divdc3() local 66 switch (classify(divisor)) in test__divdc3() 91 switch (classify(divisor)) in test__divdc3() 122 switch (classify(divisor)) in test__divdc3() 147 switch (classify(divisor)) in test__divdc3() 172 switch (classify(divisor)) in test__divdc3()
|
D | multc3_test.c | 59 long double _Complex divisor; in test__multc3() local 63 __real__ divisor = c; in test__multc3() local 64 __imag__ divisor = d; in test__multc3() local 69 switch (classify(divisor)) in test__multc3() 94 switch (classify(divisor)) in test__multc3() 121 switch (classify(divisor)) in test__multc3() 146 switch (classify(divisor)) in test__multc3() 171 switch (classify(divisor)) in test__multc3()
|
D | mulsc3_test.c | 56 float _Complex divisor; in test__mulsc3() local 60 __real__ divisor = c; in test__mulsc3() local 61 __imag__ divisor = d; in test__mulsc3() local 66 switch (classify(divisor)) in test__mulsc3() 91 switch (classify(divisor)) in test__mulsc3() 122 switch (classify(divisor)) in test__mulsc3() 147 switch (classify(divisor)) in test__mulsc3() 172 switch (classify(divisor)) in test__mulsc3()
|
D | divsc3_test.c | 56 float _Complex divisor; in test__divsc3() local 60 __real__ divisor = c; in test__divsc3() local 61 __imag__ divisor = d; in test__divsc3() local 66 switch (classify(divisor)) in test__divsc3() 91 switch (classify(divisor)) in test__divsc3() 122 switch (classify(divisor)) in test__divsc3() 147 switch (classify(divisor)) in test__divsc3() 172 switch (classify(divisor)) in test__divsc3()
|
D | divtc3_test.c | 58 long double _Complex divisor; in test__divtc3() local 62 __real__ divisor = c; in test__divtc3() local 63 __imag__ divisor = d; in test__divtc3() local 68 switch (classify(divisor)) in test__divtc3() 93 switch (classify(divisor)) in test__divtc3() 124 switch (classify(divisor)) in test__divtc3() 149 switch (classify(divisor)) in test__divtc3() 174 switch (classify(divisor)) in test__divtc3()
|
D | muldc3_test.c | 56 double _Complex divisor; in test__muldc3() local 60 __real__ divisor = c; in test__muldc3() local 61 __imag__ divisor = d; in test__muldc3() local 66 switch (classify(divisor)) in test__muldc3() 91 switch (classify(divisor)) in test__muldc3() 118 switch (classify(divisor)) in test__muldc3() 143 switch (classify(divisor)) in test__muldc3() 168 switch (classify(divisor)) in test__muldc3()
|