/openjdk10/hotspot/test/compiler/c2/ |
H A D | Test6603011.java | 38 // dividend and divisor combinations are tested 47 static int divi(int dividend, int divisor) { return dividend / divisor; } argument 48 static int modi(int dividend, int divisor) { return dividend % divisor; } argument 49 static long divl(long dividend, long divisor) { return dividend / divisor; } argument 50 static long modl(long dividend, long divisor) { return dividend % divisor; } argument 61 value = Integer.decode(System.getProperty("divisor")); 74 public int divisor() { return DIVISOR; } method in class:Test6603011 194 test_divisor(int divisor, ClassLoader apploader) argument [all...] |
H A D | Test6805724.java | 28 * when divisor is any (2^k-1) constant. 48 value = Long.decode(System.getProperty("divisor")); 79 long divisor = (1L << k) - 1; 80 System.setProperty("divisor", "" + divisor);
|
/openjdk10/jdk/test/java/math/BigDecimal/ |
H A D | IntegralDivisionTests.java | 62 System.err.println("divisor = " + testCase[1] + " scale = " + testCase[1].scale()); 76 BigDecimal divisor = new BigDecimal("10"); 84 failures += divideContextTestPrecs(dividend, divisor, quotients); 87 divisor = new BigDecimal("1e1"); 96 failures += divideContextTestPrecs(dividend, divisor, quotients2); 99 divisor = new BigDecimal("100"); 108 failures += divideContextTestPrecs(dividend, divisor, quotients3); 111 divisor = new BigDecimal("3"); 118 failures += divideContextTestPrecs(dividend, divisor, quotients4); 121 divisor 133 divideContextTestPrecs(BigDecimal dividend, BigDecimal divisor, BigDecimal[] quotients) argument 184 divideContextTests(BigDecimal dividend, BigDecimal divisor, BigDecimal expected, MathContext mc) argument 202 divideContextTest(BigDecimal dividend, BigDecimal divisor, BigDecimal expected, MathContext mc) argument [all...] |
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...] |
/openjdk10/hotspot/src/share/vm/opto/ |
H A D | divnode.hpp | 45 DivINode( Node *c, Node *dividend, Node *divisor ) : Node(c, dividend, divisor ) {} 58 DivLNode( Node *c, Node *dividend, Node *divisor ) : Node(c, dividend, divisor ) {} 71 DivFNode( Node *c, Node *dividend, Node *divisor ) : Node(c, dividend, divisor) {} 84 DivDNode( Node *c, Node *dividend, Node *divisor ) : Node(c,dividend, divisor) {} 143 DivModNode( Node *c, Node *dividend, Node *divisor ); 165 DivModINode( Node *c, Node *dividend, Node *divisor ) [all...] |
H A D | divnode.cpp | 90 // Convert a division by constant divisor into an alternate Ideal graph. 92 static Node *transform_int_divide( PhaseGVN *phase, Node *dividend, jint divisor ) { 95 assert( divisor != 0 && divisor != min_jint, 96 "bad divisor for transforming to long multiply" ); 98 bool d_pos = divisor >= 0; 99 jint d = d_pos ? divisor : -divisor; 197 // If the divisor is negative, swap the order of the input addends; 342 // Convert a division by constant divisor int 888 Node *divisor = in(2); // Also is mask local 1061 Node *divisor = in(2); // Also is mask local [all...] |
H A D | matcher.hpp | 399 static bool use_asm_for_ldiv_by_con( jlong divisor );
|
/openjdk10/jdk/test/java/lang/Integer/ |
H A D | Unsigned.java | 358 for(long divisor : inRange) { 365 if (divisor == 0) { 367 quotient = Integer.divideUnsigned((int) dividend, (int) divisor); 374 remainder = Integer.remainderUnsigned((int) dividend, (int) divisor); 380 quotient = Integer.divideUnsigned((int) dividend, (int) divisor); 381 longQuotient = dividend / divisor; 388 Integer.toUnsignedString((int) divisor)); 391 remainder = Integer.remainderUnsigned((int) dividend, (int) divisor); 392 longRemainder = dividend % divisor; 399 Integer.toUnsignedString((int) divisor)); [all...] |
/openjdk10/hotspot/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.loop/src/org/graalvm/compiler/loop/ |
H A D | MathUtil.java | 71 public static ValueNode divBefore(StructuredGraph graph, FixedNode before, ValueNode dividend, ValueNode divisor) { argument 72 if (isConstantOne(divisor)) { 75 SignedDivNode div = graph.add(new SignedDivNode(dividend, divisor));
|
/openjdk10/nashorn/src/jdk.scripting.nashorn/share/classes/jdk/nashorn/internal/runtime/doubleconv/ |
H A D | FastDtoa.java | 373 int divisor; 376 divisor = (int) (result >>> 32); 381 // with the divisor exponent + 1. And the divisor is the biggest power of ten 384 final int digit = integrals / divisor; 387 integrals %= divisor; 389 // Note that kappa now equals the exponent of the divisor and that the 401 (long) divisor << -one.e(), unit); 403 divisor /= 10; 480 int divisor; [all...] |
H A D | FixedDtoa.java | 363 long divisor = kFive17; 380 quotient = (int) Long.divideUnsigned(dividend, divisor); 381 remainder = Long.remainderUnsigned(dividend, divisor) << divisor_power; 383 divisor <<= divisor_power - exponent; 384 quotient = (int) Long.divideUnsigned(dividend, divisor); 385 remainder = Long.remainderUnsigned(dividend, divisor) << exponent;
|
/openjdk10/jdk/test/java/lang/ |
H A D | IntegralPrimitiveToString.java | 179 for(int divisor = 0; divisor < SOME_PRIMES.length && value < SOME_PRIMES[divisor]; divisor++) { 180 numbers.add(boxer.apply(value - SOME_PRIMES[divisor])); 181 numbers.add(boxer.apply(value + SOME_PRIMES[divisor])); 182 numbers.add(boxer.apply(value * SOME_PRIMES[divisor])); 183 numbers.add(boxer.apply(value / SOME_PRIMES[divisor])); 184 numbers.add(boxer.apply(value | SOME_PRIMES[divisor])); 185 numbers.add(boxer.apply(value & SOME_PRIMES[divisor])); [all...] |
/openjdk10/jdk/src/java.base/share/classes/java/math/ |
H A D | BigDecimal.java | 133 * <tr><th scope="row">Divide</th><td>dividend.scale() - divisor.scale()</td> 1554 * divisor)}, and whose scale is as specified. If rounding must 1561 * @param divisor value by which this {@code BigDecimal} is to be divided. 1564 * @return {@code this / divisor} 1565 * @throws ArithmeticException if {@code divisor} is zero, 1581 public BigDecimal divide(BigDecimal divisor, int scale, int roundingMode) { argument 1585 if ((divisor.intCompact != INFLATED)) { 1586 return divide(this.intCompact, this.scale, divisor.intCompact, divisor.scale, scale, roundingMode); 1588 return divide(this.intCompact, this.scale, divisor 1615 divide(BigDecimal divisor, int scale, RoundingMode roundingMode) argument 1647 divide(BigDecimal divisor, int roundingMode) argument 1666 divide(BigDecimal divisor, RoundingMode roundingMode) argument 1684 divide(BigDecimal divisor) argument 1746 divide(BigDecimal divisor, MathContext mc) argument 1800 divideToIntegralValue(BigDecimal divisor) argument 1853 divideToIntegralValue(BigDecimal divisor, MathContext mc) argument 1915 remainder(BigDecimal divisor) argument 1945 remainder(BigDecimal divisor, MathContext mc) argument 1970 divideAndRemainder(BigDecimal divisor) argument 2005 divideAndRemainder(BigDecimal divisor, MathContext mc) argument 5108 multiplyDivideAndRound(long dividend0, long dividend1, long divisor, int scale, int roundingMode, int preferredScale) argument 5146 divideAndRound128(final long dividendHi, final long dividendLo, long divisor, int sign, int scale, int roundingMode, int preferredScale) argument 5523 divide(long dividend, int dividendScale, long divisor, int divisorScale, int scale, int roundingMode) argument 5553 divide(BigInteger dividend, int dividendScale, long divisor, int divisorScale, int scale, int roundingMode) argument 5573 divide(long dividend, int dividendScale, BigInteger divisor, int divisorScale, int scale, int roundingMode) argument 5587 divide(BigInteger dividend, int dividendScale, BigInteger divisor, int divisorScale, int scale, int roundingMode) argument [all...] |
H A D | MutableBigInteger.java | 83 * the dividend and divisor. 90 * If the dividend and divisor don't share at least this many zero ints 92 * of two from the dividend and divisor. 617 * divisor a back to the dividend result at a specified offset. It is used 635 * when subtracting qhat*divisor from dividend. 1079 * divisor. The quotient is placed into quotient. The one word divisor is 1080 * specified by divisor. 1085 int divideOneWord(int divisor, MutableBigInteger quotient) { argument 1086 long divisorLong = divisor [all...] |
/openjdk10/jdk/test/java/lang/Long/ |
H A D | Unsigned.java | 399 for(BigInteger divisor : inRange) { 406 if (divisor.equals(BigInteger.ZERO)) { 408 quotient = Long.divideUnsigned(dividend.longValue(), divisor.longValue()); 415 remainder = Long.remainderUnsigned(dividend.longValue(), divisor.longValue()); 421 quotient = Long.divideUnsigned(dividend.longValue(), divisor.longValue()); 422 longQuotient = dividend.divide(divisor); 429 Long.toUnsignedString(divisor.longValue())); 432 remainder = Long.remainderUnsigned(dividend.longValue(), divisor.longValue()); 433 longRemainder = dividend.remainder(divisor); 440 Long.toUnsignedString(divisor [all...] |
/openjdk10/jdk/src/java.base/share/native/libjava/ |
H A D | StrictMath.c | 94 jdouble divisor) 96 return (jdouble) jremainder(dividend, divisor); 92 Java_java_lang_StrictMath_IEEEremainder(JNIEnv *env, jclass unused, jdouble dividend, jdouble divisor) argument
|
/openjdk10/jdk/src/java.base/share/classes/java/lang/ |
H A D | Long.java | 1639 * @param divisor the value doing the dividing 1645 public static long divideUnsigned(long dividend, long divisor) { argument 1646 if (divisor < 0L) { // signed comparison 1648 // of dividend and divisor. 1649 return (compareUnsigned(dividend, divisor)) < 0 ? 0L :1L; 1653 return dividend/divisor; 1662 divide(toUnsignedBigInteger(divisor)).longValue(); 1672 * @param divisor the value doing the dividing 1678 public static long remainderUnsigned(long dividend, long divisor) { argument 1679 if (dividend > 0 && divisor > [all...] |
H A D | Integer.java | 1516 * @param divisor the value doing the dividing 1522 public static int divideUnsigned(int dividend, int divisor) { argument 1524 return (int)(toUnsignedLong(dividend) / toUnsignedLong(divisor)); 1533 * @param divisor the value doing the dividing 1539 public static int remainderUnsigned(int dividend, int divisor) { argument 1541 return (int)(toUnsignedLong(dividend) % toUnsignedLong(divisor));
|
/openjdk10/jdk/src/java.base/share/classes/java/time/ |
H A D | Duration.java | 985 * @param divisor the value to divide the duration by, positive or negative, not zero 986 * @return a {@code Duration} based on this duration divided by the specified divisor, not null 987 * @throws ArithmeticException if the divisor is zero or if numeric overflow occurs 989 public Duration dividedBy(long divisor) { argument 990 if (divisor == 0) { 993 if (divisor == 1) { 996 return create(toBigDecimalSeconds().divide(BigDecimal.valueOf(divisor), RoundingMode.DOWN)); 1004 * @param divisor the value to divide the duration by, positive or negative, not null 1007 * @throws ArithmeticException if the divisor is zero, or if numeric overflow occurs 1010 public long dividedBy(Duration divisor) { argument [all...] |
/openjdk10/jdk/test/java/math/BigInteger/ |
H A D | SymmetricRangeTests.java | 177 private static void testDivideAndRemainder(String msg, BigInteger dividend, BigInteger divisor, argument 179 BigInteger[] qr = dividend.divideAndRemainder(divisor); 197 BigInteger divisor = BigInteger.ONE.shiftLeft(divisorPow); 199 dividend, divisor,
|
/openjdk10/jdk/src/demo/share/java2d/J2DBench/src/j2dbench/report/ |
H A D | J2DAnalyzer.java | 726 long divisor; 728 divisor = shortest; 730 divisor = longest; 733 divisor = total; 736 divisor = (total - longest - shortest); 738 score /= divisor;
|
/openjdk10/jdk/src/java.desktop/unix/native/common/java2d/opengl/J2D_GL/ |
H A D | glxext.h | 431 typedef int ( * PFNGLXWAITVIDEOSYNCSGIPROC) (int divisor, int remainder, unsigned int *count); 626 typedef int64_t ( * PFNGLXSWAPBUFFERSMSCOMLPROC) (Display *dpy, GLXDrawable drawable, int64_t target_msc, int64_t divisor, int64_t remainder); 627 typedef Bool ( * PFNGLXWAITFORMSCOMLPROC) (Display *dpy, GLXDrawable drawable, int64_t target_msc, int64_t divisor, int64_t remainder, int64_t *ust, int64_t *msc, int64_t *sbc);
|
/openjdk10/hotspot/src/cpu/ppc/vm/ |
H A D | c1_LIRGenerator_ppc.cpp | 514 LIR_Opr divisor = right.result(); local 515 if (divisor->is_register()) { 517 __ cmp(lir_cond_equal, divisor, LIR_OprFact::longConst(0)); 520 jlong const_divisor = divisor->as_constant_ptr()->as_jlong(); 568 LIR_Opr divisor = right.result(); local 569 if (divisor->is_register()) { 571 __ cmp(lir_cond_equal, divisor, LIR_OprFact::intConst(0)); 574 jint const_divisor = divisor->as_constant_ptr()->as_jint();
|
/openjdk10/hotspot/src/cpu/sparc/vm/ |
H A D | c1_LIRAssembler_sparc.cpp | 472 int divisor = -1; local 477 divisor = op->in_opr2()->as_constant_ptr()->as_jint(); 478 assert(Assembler::is_simm13(divisor), "can only handle simm13"); 485 if (Rdivisor == noreg && is_power_of_2(divisor)) { 488 if (divisor == 2) { 492 __ and3(Rscratch, divisor - 1, Rscratch); 495 __ sra(Rscratch, log2_intptr(divisor), Rresult); 498 if (divisor == 2) { 502 __ and3(Rscratch, divisor - 1,Rscratch); 505 __ andn(Rscratch, divisor [all...] |
/openjdk10/jdk/src/java.desktop/share/native/libsplashscreen/libpng/ |
H A D | png.c | 3307 png_int_32 divisor) 3309 /* Return a * times / divisor, rounded. */ 3310 if (divisor != 0) 3322 r /= divisor; 3346 if (divisor < 0) 3347 negative = !negative, D = -divisor; 3349 D = divisor; 3427 png_int_32 divisor) 3431 if (png_muldiv(&result, a, times, divisor) != 0) 3306 png_muldiv(png_fixed_point_p res, png_fixed_point a, png_int_32 times, png_int_32 divisor) argument 3426 png_muldiv_warn(png_const_structrp png_ptr, png_fixed_point a, png_int_32 times, png_int_32 divisor) argument
|