/openjdk10/hotspot/test/compiler/c2/ |
H A D | Test5091921.java | 44 int sum = 0; 46 sum += 2000 / indx; 47 result = sum; 49 return sum; 55 int sum = 0; 58 sum += 3000 / indx; 59 result = sum; 61 return sum; 71 int sum = 0; 74 sum [all...] |
H A D | Test7020614.java | 41 int sum = 0; 45 sum += Integer.bitCount(value); 48 doNotOptimizeOut += sum;
|
H A D | Test6866651.java | 36 static int sum() { method in class:Test6866651 46 System.err.println(String.valueOf(sum()));
|
/openjdk10/nashorn/test/opt/ |
H A D | add_constant.js | 35 var sum = 1; 37 sum *= add(x, 17); 39 return sum;
|
H A D | add.js | 35 var sum = 1; 37 sum *= add(x,x + 1); 39 return sum;
|
/openjdk10/nashorn/test/script/basic/ |
H A D | JDK-8007215.js | 32 var sum = 0; 35 sum += a; 37 return sum;
|
/openjdk10/hotspot/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.jtt/src/org/graalvm/compiler/jtt/hotpath/ |
H A D | HP_scope01.java | 36 int sum = 0; 41 sum += i; 45 sum += f; 49 sum += l; 53 sum += d; 60 sum += i; 63 sum += f; 71 sum += i + f; 78 sum += j + f; 81 sum [all...] |
H A D | HP_inline01.java | 35 int sum = 0; 37 sum += foo(i); 39 return sum;
|
H A D | HP_scope02.java | 35 int sum = 0; 36 // Although sum is not explicitly read in the tree below it is implicitly read 40 break; // We need to write back either the original value of sum, or the previous 43 sum = i; 45 return sum;
|
H A D | HP_array03.java | 37 int sum = 0; 39 sum += b.length + c.length; 41 return sum;
|
H A D | HP_array01.java | 36 int sum = 0; 39 sum += array[i]; 41 return sum;
|
H A D | HP_allocate02.java | 34 int sum = 0; 37 sum += j; 39 return sum;
|
H A D | HP_array04.java | 37 int sum = 0; 47 sum += b[i] + c[i]; 50 sum += j; 54 return sum;
|
H A D | HP_invoke01.java | 35 private static int sum; field in class:HP_invoke01 38 sum = 0; 44 return sum; 92 sum += 7; 96 sum += 194127; 100 sum += 18991; 104 sum += 91823;
|
H A D | HP_dead01.java | 35 int sum = 0; 42 sum += d; 44 return sum;
|
H A D | HP_demo01.java | 35 int sum = 0; 42 sum += ia[i] = (int) (la[i] = (long) (fa[i] = (float) (da[i] = i))); 45 return sum;
|
/openjdk10/hotspot/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.core.test/src/org/graalvm/compiler/core/test/ |
H A D | LoopUnswitchTest.java | 38 int sum = 0; 41 sum += 2; 45 sum += a; 48 return sum; 52 int sum = 0; 55 sum += 2; 57 sum += a; 60 return sum; 64 int sum = 0; 68 sum [all...] |
H A D | ConditionalEliminationTest8.java | 37 double sum = 0; 42 sum += value;
|
/openjdk10/jdk/src/java.base/share/classes/java/util/concurrent/atomic/ |
H A D | LongAdder.java | 42 * {@code long} sum. When updates (method {@link #add}) are contended 44 * contention. Method {@link #sum} (or, equivalently, {@link 46 * variables maintaining the sum. 49 * multiple threads update a common sum that is used for purposes such 75 * Creates a new adder with initial sum of zero. 111 * Returns the current sum. The returned value is <em>NOT</em> an 114 * occur while the sum is being calculated might not be 117 * @return the sum 119 public long sum() { method in class:LongAdder 121 long sum [all...] |
H A D | DoubleAdder.java | 42 * {@code double} sum. When updates (method {@link #add}) are 44 * to reduce contention. Method {@link #sum} (or, equivalently {@link 46 * variables maintaining the sum. The order of accumulation within or 79 * Creates a new adder with initial sum of zero. 106 * Returns the current sum. The returned value is <em>NOT</em> an 109 * occur while the sum is being calculated might not be 115 * @return the sum 117 public double sum() { method in class:DoubleAdder 119 double sum = Double.longBitsToDouble(base); 123 sum [all...] |
/openjdk10/jdk/test/java/util/Collection/ |
H A D | IteratorMicroBenchmark.java | 219 private static void deoptimize(int sum) { argument 220 if (sum == 42) 240 private int sum; field in class:IteratorMicroBenchmark.Check 241 public void sum(int sum) { argument 242 if (this.sum == 0) 243 this.sum = sum; 244 if (this.sum != sum) [all...] |
H A D | RemoveMicroBenchmark.java | 217 private static void deoptimize(int sum) { argument 218 if (sum == 42) 238 private int sum; field in class:RemoveMicroBenchmark.Check 239 public void sum(int sum) { argument 240 if (this.sum == 0) 241 this.sum = sum; 242 if (this.sum != sum) 315 universeRecorder(int[] sum) argument 323 emptyRecorder(int[] sum) argument [all...] |
/openjdk10/nashorn/test/examples/ |
H A D | charcodeat-benchmark.js | 43 var sum = 0; 45 sum |= f(); 47 if (sum == res) { 50 print("Verification failed " + sum + " should be " + res);
|
/openjdk10/hotspot/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.jtt/src/org/graalvm/compiler/jtt/micro/ |
H A D | BigMixedParams01.java | 37 double sum = 0; 39 sum += testA(0, -1, -1, -1, -1, 1f, 2f, 3f, 4f, -1, -1, 5f, 6f, 7f, 8f, 9f); 40 sum += testA(1, -1, -1, -1, -1, 1f, 2f, 3f, 4f, -1, -1, 5f, 6f, 7f, 8f, 9f); 41 sum += testA(2, -1, -1, -1, -1, 1f, 2f, 3f, 4f, -1, -1, 5f, 6f, 7f, 8f, 9f); 42 sum += testA(3, -1, -1, -1, -1, 1f, 2f, 3f, 4f, -1, -1, 5f, 6f, 7f, 8f, 9f); 43 sum += testA(4, -1, -1, -1, -1, 1f, 2f, 3f, 4f, -1, -1, 5f, 6f, 7f, 8f, 9f); 44 sum += testA(5, -1, -1, -1, -1, 1f, 2f, 3f, 4f, -1, -1, 5f, 6f, 7f, 8f, 9f); 45 sum += testA(6, -1, -1, -1, -1, 1f, 2f, 3f, 4f, -1, -1, 5f, 6f, 7f, 8f, 9f); 46 sum += testA(7, -1, -1, -1, -1, 1f, 2f, 3f, 4f, -1, -1, 5f, 6f, 7f, 8f, 9f); 47 sum [all...] |
/openjdk10/jdk/test/java/util/concurrent/tck/ |
H A D | LongAdderTest.java | 55 assertEquals(0, ai.sum()); 59 * add adds given value to current, and sum returns current value 64 assertEquals(2, ai.sum()); 66 assertEquals(-2, ai.sum()); 70 * decrement decrements and sum returns current value 75 assertEquals(-1, ai.sum()); 77 assertEquals(-2, ai.sum()); 86 assertEquals(1, ai.sum()); 88 assertEquals(2, ai.sum()); 92 * reset() causes subsequent sum() t [all...] |