| /openjdk7/jdk/test/java/math/BigDecimal/ |
| H A D | DivideTests.java | 38 BigDecimal anotherDivide(BigDecimal dividend, BigDecimal divisor) { argument
43 if (dividend.signum() == 0) // 0/0
47 if (dividend.signum() == 0) // 0/y
55 * dividend (i.e. this) and and divisor since the scales
71 BigInteger dividendIntvalue = dividend.scaleByPowerOfTen(dividend.scale()).toBigInteger().abs();
125 MathContext mc = new MathContext(dividend.precision() +
130 return dividend.divide(divisor, mc);
192 int dividend = primes[i] * primes[j];
195 if ( ((dividend/diviso
[all...] |
| H A D | IntegralDivisionTests.java | 58 System.err.println("dividend = " + testCase[0] + " scale = " + testCase[0].scale());
72 BigDecimal dividend = new BigDecimal("11003");
81 failures += divideContextTestPrecs(dividend, divisor, quotients);
83 dividend = new BigDecimal("11003");
93 failures += divideContextTestPrecs(dividend, divisor, quotients2);
95 dividend = new BigDecimal("1230000");
105 failures += divideContextTestPrecs(dividend, divisor, quotients3);
107 dividend = new BigDecimal("33");
115 failures += divideContextTestPrecs(dividend, divisor, quotients4);
117 dividend
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
66 public int divbyI (int dividend) { retur argument
67 modbyI(int dividend) argument
68 divbyL(long dividend) argument
69 modbyL(long dividend) argument
73 checkI(int dividend) argument
103 checkL(long dividend) argument
[all...] |
| /openjdk7/hotspot/src/share/vm/opto/ |
| H A D | divnode.hpp | 45 DivINode( Node *c, Node *dividend, Node *divisor ) : Node(c, dividend, divisor ) {} argument
58 DivLNode( Node *c, Node *dividend, Node *divisor ) : Node(c, dividend, divisor ) {} argument
71 DivFNode( Node *c, Node *dividend, Node *divisor ) : Node(c, dividend, divisor) {} argument
84 DivDNode( Node *c, Node *dividend, Node *divisor ) : Node(c,dividend, divisor) {} argument
143 DivModNode( Node *c, Node *dividend, Node *divisor );
165 DivModINode( Node *c, Node *dividend, Nod argument
178 DivModLNode( Node *c, Node *dividend, Node *divisor ) argument
[all...] |
| H A D | divnode.cpp | 90 static Node *transform_int_divide( PhaseGVN *phase, Node *dividend, jint divisor ) { argument
107 q = new (phase->C) SubINode(phase->intcon(0), dividend);
114 const Type *dt = phase->type(dividend);
117 // we don't need to round a positive dividend
119 } else if( dividend->Opcode() == Op_AndI ) {
122 const TypeInt *andconi_t = phase->type( dividend->in(2) )->isa_int();
127 dividend = dividend->in(1);
144 Node *sign = phase->transform(new (phase->C) RShiftINode(dividend, phase->intcon(N - 1)));
148 dividend
257 long_by_long_mulhi(PhaseGVN* phase, Node* dividend, jlong magic_const) argument
342 transform_long_divide( PhaseGVN *phase, Node *dividend, jlong divisor ) argument
1268 DivModNode( Node *c, Node *dividend, Node *divisor ) argument
[all...] |
| /openjdk7/jdk/src/share/native/java/lang/ |
| H A D | StrictMath.c | 111 jdouble dividend,
114 return (jdouble) jremainder(dividend, divisor);
110 Java_java_lang_StrictMath_IEEEremainder(JNIEnv *env, jclass unused, jdouble dividend, jdouble divisor) argument
|