/openjdk7/jdk/test/java/math/BigDecimal/ |
H A D | DivideTests.java | 38 BigDecimal anotherDivide(BigDecimal dividend, BigDecimal divisor) { argument 42 if (divisor.signum() == 0) { // x/0 55 * dividend (i.e. this) and and divisor since the scales 60 * divisor.intVal) to have a finite decimal expansion, 70 BigInteger divisorIntvalue = divisor.scaleByPowerOfTen(divisor.scale()).toBigInteger().abs(); 127 10.0*divisor.precision()/3.0), 130 return dividend.divide(divisor, mc); 193 int divisor = primes[m] * primes[n]; 195 if ( ((dividend/divisor) * diviso [all...] |
H A D | IntegralDivisionTests.java | 59 System.err.println("divisor = " + testCase[1] + " scale = " + testCase[1].scale()); 73 BigDecimal divisor = new BigDecimal("10"); 81 failures += divideContextTestPrecs(dividend, divisor, quotients); 84 divisor = new BigDecimal("1e1"); 93 failures += divideContextTestPrecs(dividend, divisor, quotients2); 96 divisor = new BigDecimal("100"); 105 failures += divideContextTestPrecs(dividend, divisor, quotients3); 108 divisor = new BigDecimal("3"); 115 failures += divideContextTestPrecs(dividend, divisor, quotients4); 118 divisor 130 divideContextTestPrecs(BigDecimal dividend, BigDecimal divisor, BigDecimal[] quotients) argument 181 divideContextTests(BigDecimal dividend, BigDecimal divisor, BigDecimal expected, MathContext mc) argument 199 divideContextTest(BigDecimal dividend, BigDecimal divisor, BigDecimal expected, MathContext mc) argument [all...] |
/openjdk7/hotspot/test/compiler/6603011/ |
H A D | Test.java | 36 // dividend and divisor combinations are tested 42 static int divi(int dividend, int divisor) { return dividend / divisor; } argument 43 static int modi(int dividend, int divisor) { return dividend % divisor; } argument 44 static long divl(long dividend, long divisor) { return dividend / divisor; } argument 45 static long modl(long dividend, long divisor) { return dividend % divisor; } argument 58 value = Integer.decode(System.getProperty("divisor")); 71 public int divisor() { return DIVISOR; } method in class:Test 191 test_divisor(int divisor, URLClassLoader apploader) argument [all...] |
/openjdk7/jdk/src/share/native/java/lang/ |
H A D | StrictMath.c | 112 jdouble divisor) 114 return (jdouble) jremainder(dividend, divisor); 110 Java_java_lang_StrictMath_IEEEremainder(JNIEnv *env, jclass unused, jdouble dividend, jdouble divisor) argument
|
/openjdk7/jdk/src/share/classes/java/math/ |
H A D | MutableBigInteger.java | 510 * divisor a back to the dividend result at a specified offset. It is used 528 * when subtracting qhat*divisor from dividend. 808 * divisor. The quotient is placed into quotient. The one word divisor is 809 * specified by divisor. 814 int divideOneWord(int divisor, MutableBigInteger quotient) { argument 815 long divisorLong = divisor & LONG_MASK; 833 // Normalize the divisor 834 int shift = Integer.numberOfLeadingZeros(divisor); 855 divWord(qWord, dividendEstimate, divisor); 953 divideMagnitude(int[] divisor, MutableBigInteger quotient) argument [all...] |
H A D | BigDecimal.java | 130 * <tr><td>Divide</td><td>dividend.scale() - divisor.scale()</td> 1353 * divisor)}, and whose scale is as specified. If rounding must 1360 * @param divisor value by which this {@code BigDecimal} is to be divided. 1363 * @return {@code this / divisor} 1364 * @throws ArithmeticException if {@code divisor} is zero, 1379 public BigDecimal divide(BigDecimal divisor, int scale, int roundingMode) { argument 1388 * Rescale dividend or divisor (whichever can be "upscaled" to 1393 if (checkScale((long)scale + divisor.scale) > this.scale) 1394 dividend = this.setScale(scale + divisor.scale, ROUND_UNNECESSARY); 1396 divisor 1512 divide(BigDecimal divisor, int scale, RoundingMode roundingMode) argument 1543 divide(BigDecimal divisor, int roundingMode) argument 1562 divide(BigDecimal divisor, RoundingMode roundingMode) argument 1580 divide(BigDecimal divisor) argument 1647 divide(BigDecimal divisor, MathContext mc) argument 1716 divideToIntegralValue(BigDecimal divisor) argument 1768 divideToIntegralValue(BigDecimal divisor, MathContext mc) argument 1832 remainder(BigDecimal divisor) argument 1862 remainder(BigDecimal divisor, MathContext mc) argument 1887 divideAndRemainder(BigDecimal divisor) argument 1922 divideAndRemainder(BigDecimal divisor, MathContext mc) argument [all...] |
/openjdk7/hotspot/src/share/vm/opto/ |
H A D | divnode.cpp | 88 // Convert a division by constant divisor into an alternate Ideal graph. 90 static Node *transform_int_divide( PhaseGVN *phase, Node *dividend, jint divisor ) { 93 assert( divisor != 0 && divisor != min_jint, 94 "bad divisor for transforming to long multiply" ); 96 bool d_pos = divisor >= 0; 97 jint d = d_pos ? divisor : -divisor; 195 // If the divisor is negative, swap the order of the input addends; 340 // Convert a division by constant divisor int 874 Node *divisor = in(2); // Also is mask local 1047 Node *divisor = in(2); // Also is mask local [all...] |
H A D | parse2.cpp | 696 int divisor = ti->get_con(); local 698 if (divisor > 0 && 699 (divisor & ~(divisor-1)) == divisor) { 701 Node *mask = _gvn.intcon((divisor - 1));
|
/openjdk7/jdk/src/share/native/sun/awt/libpng/ |
H A D | png.c | 1561 png_int_32 divisor) 1563 /* Return a * times / divisor, rounded. */ 1564 if (divisor != 0) 1576 r /= divisor; 1600 if (divisor < 0) 1601 negative = !negative, D = -divisor; 1603 D = divisor; 1680 png_int_32 divisor) 1684 if (png_muldiv(&result, a, times, divisor)) 1560 png_muldiv(png_fixed_point_p res, png_fixed_point a, png_int_32 times, png_int_32 divisor) argument 1679 png_muldiv_warn(png_structp png_ptr, png_fixed_point a, png_int_32 times, png_int_32 divisor) argument
|
/openjdk7/hotspot/src/cpu/sparc/vm/ |
H A D | c1_LIRAssembler_sparc.cpp | 532 int divisor = -1; local 537 divisor = op->in_opr2()->as_constant_ptr()->as_jint(); 538 assert(Assembler::is_simm13(divisor), "can only handle simm13"); 545 if (Rdivisor == noreg && is_power_of_2(divisor)) { 548 if (divisor == 2) { 552 __ and3(Rscratch, divisor - 1, Rscratch); 555 __ sra(Rscratch, log2_intptr(divisor), Rresult); 558 if (divisor == 2) { 562 __ and3(Rscratch, divisor - 1,Rscratch); 565 __ andn(Rscratch, divisor [all...] |
/openjdk7/hotspot/src/cpu/x86/vm/ |
H A D | c1_LIRAssembler_x86.cpp | 2594 int divisor = right->as_constant_ptr()->as_jint(); local 2595 assert(divisor > 0 && is_power_of_2(divisor), "must be"); 2600 if (divisor == 2) { 2603 __ andl(rdx, divisor - 1); 2606 __ sarl(lreg, log2_intptr(divisor)); 2611 __ andl(dreg, 0x80000000 | (divisor - 1)); 2614 __ orl(dreg, ~(divisor - 1));
|
/openjdk7/jdk/src/share/native/sun/security/ec/impl/ |
H A D | mpi.c | 553 single digit d. Respects the sign of its divisor (single digits are 3185 Normalize a and b for division, where b is the divisor. In order 4138 ** Divide 64-bit (Nhi,Nlo) by 32-bit divisor, which must be normalized 4141 mp_err s_mpv_div_2dx1d(mp_digit Nhi, mp_digit Nlo, mp_digit divisor, argument 4147 d1 = divisor >> MP_HALF_DIGIT_BIT; 4148 d0 = divisor & MP_HALF_DIGIT_MAX; 4154 q1--, r1 += divisor; 4155 if (r1 >= divisor && r1 < m) { 4156 q1--, r1 += divisor; 4165 q0--, r0 += divisor; [all...] |
/openjdk7/hotspot/src/share/vm/gc_implementation/parallelScavenge/ |
H A D | psParallelCompact.cpp | 1387 const double divisor = dense_prefix_live + 1.25 * compacted_region_live; local 1388 return double(reclaimable) / divisor;
|