| 1 |
/* |
| 2 |
* Copyright (c) 2007, Oracle and/or its affiliates. All rights reserved. |
| 3 |
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
| 4 |
* |
| 5 |
* This code is free software; you can redistribute it and/or modify it |
| 6 |
* under the terms of the GNU General Public License version 2 only, as |
| 7 |
* published by the Free Software Foundation. |
| 8 |
* |
| 9 |
* This code is distributed in the hope that it will be useful, but WITHOUT |
| 10 |
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or |
| 11 |
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
| 12 |
* version 2 for more details (a copy is included in the LICENSE file that |
| 13 |
* accompanied this code). |
| 14 |
* |
| 15 |
* You should have received a copy of the GNU General Public License version |
| 16 |
* 2 along with this work; if not, write to the Free Software Foundation, |
| 17 |
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. |
| 18 |
* |
| 19 |
* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA |
| 20 |
* or visit www.oracle.com if you need additional information or have any |
| 21 |
* questions. |
| 22 |
*/ |
| 23 |
|
| 24 |
/* |
| 25 |
* @test |
| 26 |
* @summary micro-benchmark correctness mode |
| 27 |
* @run main IteratorMicroBenchmark iterations=1 size=8 warmup=0 |
| 28 |
*/ |
| 29 |
|
| 30 |
import static java.util.concurrent.TimeUnit.MILLISECONDS; |
| 31 |
import static java.util.stream.Collectors.toList; |
| 32 |
|
| 33 |
import java.lang.ref.ReferenceQueue; |
| 34 |
import java.lang.ref.WeakReference; |
| 35 |
import java.util.ArrayDeque; |
| 36 |
import java.util.ArrayList; |
| 37 |
import java.util.Arrays; |
| 38 |
import java.util.Enumeration; |
| 39 |
import java.util.Iterator; |
| 40 |
import java.util.List; |
| 41 |
import java.util.ListIterator; |
| 42 |
import java.util.Map; |
| 43 |
import java.util.Spliterator; |
| 44 |
import java.util.Vector; |
| 45 |
import java.util.concurrent.ConcurrentSkipListMap; |
| 46 |
import java.util.concurrent.CountDownLatch; |
| 47 |
import java.util.concurrent.ThreadLocalRandom; |
| 48 |
import java.util.regex.Pattern; |
| 49 |
|
| 50 |
/** |
| 51 |
* Usage: [iterations=N] [size=N] [filter=REGEXP] [warmup=SECONDS] |
| 52 |
* |
| 53 |
* To run this in micro-benchmark mode, simply run as a normal java program. |
| 54 |
* Be patient; this program runs for a very long time. |
| 55 |
* For faster runs, restrict execution using command line args. |
| 56 |
* |
| 57 |
* @author Martin Buchholz |
| 58 |
*/ |
| 59 |
public class IteratorMicroBenchmark { |
| 60 |
abstract static class Job { |
| 61 |
private final String name; |
| 62 |
public Job(String name) { this.name = name; } |
| 63 |
public String name() { return name; } |
| 64 |
public abstract void work() throws Throwable; |
| 65 |
} |
| 66 |
|
| 67 |
static double warmupSeconds; |
| 68 |
static long warmupNanos; |
| 69 |
|
| 70 |
// --------------- GC finalization infrastructure --------------- |
| 71 |
|
| 72 |
/** No guarantees, but effective in practice. */ |
| 73 |
static void forceFullGc() { |
| 74 |
long timeoutMillis = 1000L; |
| 75 |
CountDownLatch finalized = new CountDownLatch(1); |
| 76 |
ReferenceQueue<Object> queue = new ReferenceQueue<>(); |
| 77 |
WeakReference<Object> ref = new WeakReference<>( |
| 78 |
new Object() { protected void finalize() { finalized.countDown(); }}, |
| 79 |
queue); |
| 80 |
try { |
| 81 |
for (int tries = 3; tries--> 0; ) { |
| 82 |
System.gc(); |
| 83 |
if (finalized.await(timeoutMillis, MILLISECONDS) |
| 84 |
&& queue.remove(timeoutMillis) != null |
| 85 |
&& ref.get() == null) { |
| 86 |
System.runFinalization(); // try to pick up stragglers |
| 87 |
return; |
| 88 |
} |
| 89 |
timeoutMillis *= 4; |
| 90 |
} |
| 91 |
} catch (InterruptedException unexpected) { |
| 92 |
throw new AssertionError("unexpected InterruptedException"); |
| 93 |
} |
| 94 |
throw new AssertionError("failed to do a \"full\" gc"); |
| 95 |
} |
| 96 |
|
| 97 |
/** |
| 98 |
* Runs each job for long enough that all the runtime compilers |
| 99 |
* have had plenty of time to warm up, i.e. get around to |
| 100 |
* compiling everything worth compiling. |
| 101 |
* Returns array of average times per job per run. |
| 102 |
*/ |
| 103 |
private static long[] time0(Job ... jobs) throws Throwable { |
| 104 |
long[] nanoss = new long[jobs.length]; |
| 105 |
for (int i = 0; i < jobs.length; i++) { |
| 106 |
if (warmupNanos > 0) forceFullGc(); |
| 107 |
Job job = jobs[i]; |
| 108 |
long totalTime; |
| 109 |
int runs = 0; |
| 110 |
long startTime = System.nanoTime(); |
| 111 |
do { job.work(); runs++; } |
| 112 |
while ((totalTime = System.nanoTime() - startTime) < warmupNanos); |
| 113 |
nanoss[i] = totalTime/runs; |
| 114 |
} |
| 115 |
return nanoss; |
| 116 |
} |
| 117 |
|
| 118 |
private static void time(Job ... jobs) throws Throwable { |
| 119 |
if (warmupSeconds > 0.0) time0(jobs); // Warm up run |
| 120 |
long[] nanoss = time0(jobs); // Real timing run |
| 121 |
long[] milliss = new long[jobs.length]; |
| 122 |
double[] ratios = new double[jobs.length]; |
| 123 |
|
| 124 |
final String nameHeader = "Method"; |
| 125 |
final String millisHeader = "Millis"; |
| 126 |
final String ratioHeader = "Ratio"; |
| 127 |
|
| 128 |
int nameWidth = nameHeader.length(); |
| 129 |
int millisWidth = millisHeader.length(); |
| 130 |
int ratioWidth = ratioHeader.length(); |
| 131 |
|
| 132 |
for (int i = 0; i < jobs.length; i++) { |
| 133 |
nameWidth = Math.max(nameWidth, jobs[i].name().length()); |
| 134 |
|
| 135 |
milliss[i] = nanoss[i]/(1000L * 1000L); |
| 136 |
millisWidth = Math.max(millisWidth, |
| 137 |
String.format("%d", milliss[i]).length()); |
| 138 |
|
| 139 |
ratios[i] = (double) nanoss[i] / (double) nanoss[0]; |
| 140 |
ratioWidth = Math.max(ratioWidth, |
| 141 |
String.format("%.3f", ratios[i]).length()); |
| 142 |
} |
| 143 |
|
| 144 |
String format = String.format("%%-%ds %%%dd %%%d.3f%%n", |
| 145 |
nameWidth, millisWidth, ratioWidth); |
| 146 |
String headerFormat = String.format("%%-%ds %%%ds %%%ds%%n", |
| 147 |
nameWidth, millisWidth, ratioWidth); |
| 148 |
System.out.printf(headerFormat, "Method", "Millis", "Ratio"); |
| 149 |
|
| 150 |
// Print out absolute and relative times, calibrated against first job |
| 151 |
for (int i = 0; i < jobs.length; i++) |
| 152 |
System.out.printf(format, jobs[i].name(), milliss[i], ratios[i]); |
| 153 |
} |
| 154 |
|
| 155 |
private static String keywordValue(String[] args, String keyword) { |
| 156 |
for (String arg : args) |
| 157 |
if (arg.startsWith(keyword)) |
| 158 |
return arg.substring(keyword.length() + 1); |
| 159 |
return null; |
| 160 |
} |
| 161 |
|
| 162 |
private static int intArg(String[] args, String keyword, int defaultValue) { |
| 163 |
String val = keywordValue(args, keyword); |
| 164 |
return (val == null) ? defaultValue : Integer.parseInt(val); |
| 165 |
} |
| 166 |
|
| 167 |
private static double doubleArg(String[] args, String keyword, double defaultValue) { |
| 168 |
String val = keywordValue(args, keyword); |
| 169 |
return (val == null) ? defaultValue : Double.parseDouble(val); |
| 170 |
} |
| 171 |
|
| 172 |
private static Pattern patternArg(String[] args, String keyword) { |
| 173 |
String val = keywordValue(args, keyword); |
| 174 |
return (val == null) ? null : Pattern.compile(val); |
| 175 |
} |
| 176 |
|
| 177 |
private static Job[] filter(Pattern filter, Job[] jobs) { |
| 178 |
return (filter == null) ? jobs |
| 179 |
: Arrays.stream(jobs) |
| 180 |
.filter(job -> filter.matcher(job.name()).find()) |
| 181 |
.collect(toList()) |
| 182 |
.toArray(new Job[0]); |
| 183 |
} |
| 184 |
|
| 185 |
private static void deoptimize(int sum) { |
| 186 |
if (sum == 42) |
| 187 |
System.out.println("the answer"); |
| 188 |
} |
| 189 |
|
| 190 |
private static <T> List<T> asSubList(List<T> list) { |
| 191 |
return list.subList(0, list.size()); |
| 192 |
} |
| 193 |
|
| 194 |
private static <T> Iterable<T> backwards(final List<T> list) { |
| 195 |
return new Iterable<T>() { |
| 196 |
public Iterator<T> iterator() { |
| 197 |
return new Iterator<T>() { |
| 198 |
final ListIterator<T> it = list.listIterator(list.size()); |
| 199 |
public boolean hasNext() { return it.hasPrevious(); } |
| 200 |
public T next() { return it.previous(); } |
| 201 |
public void remove() { it.remove(); }};}}; |
| 202 |
} |
| 203 |
|
| 204 |
public static void main(String[] args) throws Throwable { |
| 205 |
final int iterations = intArg(args, "iterations", 100_000); |
| 206 |
final int size = intArg(args, "size", 1000); |
| 207 |
warmupSeconds = doubleArg(args, "warmup", 7.0); |
| 208 |
final Pattern filter = patternArg(args, "filter"); |
| 209 |
|
| 210 |
warmupNanos = (long) (warmupSeconds * (1000L * 1000L * 1000L)); |
| 211 |
|
| 212 |
// System.out.printf( |
| 213 |
// "iterations=%d size=%d, warmup=%1g, filter=\"%s\"%n", |
| 214 |
// iterations, size, warmupSeconds, filter); |
| 215 |
|
| 216 |
final ConcurrentSkipListMap<Integer,Integer> m |
| 217 |
= new ConcurrentSkipListMap<>(); |
| 218 |
final ArrayList<Integer> al = new ArrayList<>(size); |
| 219 |
|
| 220 |
// Populate collections with random data |
| 221 |
final ThreadLocalRandom rnd = ThreadLocalRandom.current(); |
| 222 |
for (int i = 0; i < size; i++) { |
| 223 |
m.put(rnd.nextInt(size), rnd.nextInt(size)); |
| 224 |
al.add(rnd.nextInt(size)); |
| 225 |
} |
| 226 |
final Vector<Integer> v = new Vector<>(al); |
| 227 |
final ArrayDeque<Integer> ad = new ArrayDeque<>(al); |
| 228 |
// shuffle ArrayDeque elements so they wrap |
| 229 |
for (int i = 0, n = rnd.nextInt(size); i < n; i++) |
| 230 |
ad.addLast(ad.removeFirst()); |
| 231 |
|
| 232 |
// Also test "short" collections |
| 233 |
final int shortSize = 5; |
| 234 |
final Vector<Integer> sv = new Vector<>(v.subList(0, shortSize)); |
| 235 |
final ArrayList<Integer> sal = new ArrayList<>(sv); |
| 236 |
|
| 237 |
// Checks for correctness *and* prevents loop optimizations |
| 238 |
class Check { |
| 239 |
private int sum; |
| 240 |
public void sum(int sum) { |
| 241 |
if (this.sum == 0) |
| 242 |
this.sum = sum; |
| 243 |
if (this.sum != sum) |
| 244 |
throw new AssertionError("Sum mismatch"); |
| 245 |
} |
| 246 |
} |
| 247 |
final Check check = new Check(); |
| 248 |
final Check shortCheck = new Check(); |
| 249 |
|
| 250 |
Job[] jobs = { |
| 251 |
// new Job("Vector iterate desugared") { |
| 252 |
// public void work() throws Throwable { |
| 253 |
// for (int i = 0; i < iterations; i++) { |
| 254 |
// int sum = 0; |
| 255 |
// for (Iterator<Integer> it = v.iterator(); it.hasNext();) |
| 256 |
// sum += it.next(); |
| 257 |
// check.sum(sum);}}}, |
| 258 |
new Job("array loop") { |
| 259 |
public void work() throws Throwable { |
| 260 |
Integer[] a = al.toArray(new Integer[0]); |
| 261 |
for (int i = 0; i < iterations; i++) { |
| 262 |
int sum = 0; |
| 263 |
int size = a.length; |
| 264 |
for (int j = 0; j < size; ++j) |
| 265 |
sum += a[j]; |
| 266 |
check.sum(sum);}}}, |
| 267 |
new Job("descending array loop") { |
| 268 |
public void work() throws Throwable { |
| 269 |
Integer[] a = al.toArray(new Integer[0]); |
| 270 |
for (int i = 0; i < iterations; i++) { |
| 271 |
int sum = 0; |
| 272 |
int size = a.length; |
| 273 |
for (int j = size - 1; j >= 0; j--) |
| 274 |
sum += a[j]; |
| 275 |
check.sum(sum);}}}, |
| 276 |
new Job("Vector get loop") { |
| 277 |
public void work() throws Throwable { |
| 278 |
for (int i = 0; i < iterations; i++) { |
| 279 |
int sum = 0; |
| 280 |
int size = v.size(); |
| 281 |
for (int j = 0; j < size; ++j) |
| 282 |
sum += v.get(j); |
| 283 |
check.sum(sum);}}}, |
| 284 |
new Job("Vector iterate for loop") { |
| 285 |
public void work() throws Throwable { |
| 286 |
for (int i = 0; i < iterations; i++) { |
| 287 |
int sum = 0; |
| 288 |
for (Integer n : v) |
| 289 |
sum += n; |
| 290 |
check.sum(sum);}}}, |
| 291 |
new Job("Vector descending listIterator loop") { |
| 292 |
public void work() throws Throwable { |
| 293 |
for (int i = 0; i < iterations; i++) { |
| 294 |
int sum = 0; |
| 295 |
ListIterator<Integer> it = v.listIterator(al.size()); |
| 296 |
while (it.hasPrevious()) |
| 297 |
sum += it.previous(); |
| 298 |
check.sum(sum);}}}, |
| 299 |
new Job("Vector Enumeration loop") { |
| 300 |
public void work() throws Throwable { |
| 301 |
for (int i = 0; i < iterations; i++) { |
| 302 |
int sum = 0; |
| 303 |
Enumeration<Integer> it = v.elements(); |
| 304 |
while (it.hasMoreElements()) |
| 305 |
sum += it.nextElement(); |
| 306 |
check.sum(sum);}}}, |
| 307 |
new Job("Vector subList iterate for loop") { |
| 308 |
public void work() throws Throwable { |
| 309 |
for (int i = 0; i < iterations; i++) { |
| 310 |
int sum = 0; |
| 311 |
for (Integer n : asSubList(v)) |
| 312 |
sum += n; |
| 313 |
check.sum(sum);}}}, |
| 314 |
new Job("Vector subList subList subList iterate for loop") { |
| 315 |
public void work() throws Throwable { |
| 316 |
for (int i = 0; i < iterations; i++) { |
| 317 |
int sum = 0; |
| 318 |
for (Integer n : asSubList(asSubList(asSubList(v)))) |
| 319 |
sum += n; |
| 320 |
check.sum(sum);}}}, |
| 321 |
new Job("Vector backwards wrapper ListIterator for loop") { |
| 322 |
public void work() throws Throwable { |
| 323 |
for (int i = 0; i < iterations; i++) { |
| 324 |
int sum = 0; |
| 325 |
for (Integer n : backwards(v)) |
| 326 |
sum += n; |
| 327 |
check.sum(sum);}}}, |
| 328 |
new Job("Vector backwards wrapper subList ListIterator for loop") { |
| 329 |
public void work() throws Throwable { |
| 330 |
for (int i = 0; i < iterations; i++) { |
| 331 |
int sum = 0; |
| 332 |
for (Integer n : backwards(asSubList(v))) |
| 333 |
sum += n; |
| 334 |
check.sum(sum);}}}, |
| 335 |
// new Job("Vector iterate for loop invokeinterface") { |
| 336 |
// public void work() throws Throwable { |
| 337 |
// final List<Integer> l = v; |
| 338 |
// for (int i = 0; i < iterations; i++) { |
| 339 |
// int sum = 0; |
| 340 |
// for (Integer n : l) |
| 341 |
// sum += n; |
| 342 |
// check.sum(sum);}}}, |
| 343 |
// new Job("Vector subList iterate for loop invokeinterface") { |
| 344 |
// public void work() throws Throwable { |
| 345 |
// final List<Integer> l = v; |
| 346 |
// for (int i = 0; i < iterations; i++) { |
| 347 |
// int sum = 0; |
| 348 |
// for (Integer n : asSubList(l)) |
| 349 |
// sum += n; |
| 350 |
// check.sum(sum);}}}, |
| 351 |
new Job("Short Vector get loop") { |
| 352 |
public void work() throws Throwable { |
| 353 |
for (int i = 0; i < (iterations * size / shortSize); i++) { |
| 354 |
int sum = 0; |
| 355 |
int size = sv.size(); |
| 356 |
for (int j = 0; j < size; ++j) |
| 357 |
sum += sv.get(j); |
| 358 |
shortCheck.sum(sum);}}}, |
| 359 |
new Job("Short Vector iterate for loop") { |
| 360 |
public void work() throws Throwable { |
| 361 |
for (int i = 0; i < (iterations * size / shortSize); i++) { |
| 362 |
int sum = 0; |
| 363 |
for (Integer n : sv) |
| 364 |
sum += n; |
| 365 |
shortCheck.sum(sum);}}}, |
| 366 |
new Job("Short Vector sublist iterate for loop") { |
| 367 |
public void work() throws Throwable { |
| 368 |
for (int i = 0; i < (iterations * size / shortSize); i++) { |
| 369 |
int sum = 0; |
| 370 |
for (Integer n : asSubList(sv)) |
| 371 |
sum += n; |
| 372 |
shortCheck.sum(sum);}}}, |
| 373 |
new Job("ArrayList get loop") { |
| 374 |
public void work() throws Throwable { |
| 375 |
for (int i = 0; i < iterations; i++) { |
| 376 |
int sum = 0; |
| 377 |
int size = al.size(); |
| 378 |
for (int j = 0; j < size; ++j) |
| 379 |
sum += al.get(j); |
| 380 |
check.sum(sum);}}}, |
| 381 |
new Job("ArrayList iterate for loop") { |
| 382 |
public void work() throws Throwable { |
| 383 |
for (int i = 0; i < iterations; i++) { |
| 384 |
int sum = 0; |
| 385 |
for (Integer n : al) |
| 386 |
sum += n; |
| 387 |
check.sum(sum);}}}, |
| 388 |
new Job("ArrayDeque iterate for loop") { |
| 389 |
public void work() throws Throwable { |
| 390 |
for (int i = 0; i < iterations; i++) { |
| 391 |
int sum = 0; |
| 392 |
for (Integer n : ad) |
| 393 |
sum += n; |
| 394 |
check.sum(sum);}}}, |
| 395 |
new Job("ArrayList descending listIterator loop") { |
| 396 |
public void work() throws Throwable { |
| 397 |
for (int i = 0; i < iterations; i++) { |
| 398 |
int sum = 0; |
| 399 |
ListIterator<Integer> it = al.listIterator(al.size()); |
| 400 |
while (it.hasPrevious()) |
| 401 |
sum += it.previous(); |
| 402 |
check.sum(sum);}}}, |
| 403 |
new Job("ArrayList listIterator loop") { |
| 404 |
public void work() throws Throwable { |
| 405 |
for (int i = 0; i < iterations; i++) { |
| 406 |
int sum = 0; |
| 407 |
ListIterator<Integer> it = al.listIterator(); |
| 408 |
while (it.hasNext()) |
| 409 |
sum += it.next(); |
| 410 |
check.sum(sum);}}}, |
| 411 |
new Job("ArrayDeque.descendingIterator() loop") { |
| 412 |
public void work() throws Throwable { |
| 413 |
for (int i = 0; i < iterations; i++) { |
| 414 |
int sum = 0; |
| 415 |
Iterator<Integer> it = ad.descendingIterator(); |
| 416 |
while (it.hasNext()) |
| 417 |
sum += it.next(); |
| 418 |
check.sum(sum);}}}, |
| 419 |
new Job("ArrayList.forEach") { |
| 420 |
public void work() throws Throwable { |
| 421 |
int[] sum = new int[1]; |
| 422 |
for (int i = 0; i < iterations; i++) { |
| 423 |
sum[0] = 0; |
| 424 |
al.forEach(n -> sum[0] += n); |
| 425 |
check.sum(sum[0]);}}}, |
| 426 |
new Job("ArrayDeque.forEach") { |
| 427 |
public void work() throws Throwable { |
| 428 |
int[] sum = new int[1]; |
| 429 |
for (int i = 0; i < iterations; i++) { |
| 430 |
sum[0] = 0; |
| 431 |
ad.forEach(n -> sum[0] += n); |
| 432 |
check.sum(sum[0]);}}}, |
| 433 |
new Job("Vector.forEach") { |
| 434 |
public void work() throws Throwable { |
| 435 |
int[] sum = new int[1]; |
| 436 |
for (int i = 0; i < iterations; i++) { |
| 437 |
sum[0] = 0; |
| 438 |
v.forEach(n -> sum[0] += n); |
| 439 |
check.sum(sum[0]);}}}, |
| 440 |
new Job("ArrayList.iterator().forEachRemaining()") { |
| 441 |
public void work() throws Throwable { |
| 442 |
int[] sum = new int[1]; |
| 443 |
for (int i = 0; i < iterations; i++) { |
| 444 |
sum[0] = 0; |
| 445 |
al.iterator().forEachRemaining(n -> sum[0] += n); |
| 446 |
check.sum(sum[0]);}}}, |
| 447 |
new Job("ArrayDeque.descendingIterator().forEachRemaining()") { |
| 448 |
public void work() throws Throwable { |
| 449 |
int[] sum = new int[1]; |
| 450 |
for (int i = 0; i < iterations; i++) { |
| 451 |
sum[0] = 0; |
| 452 |
ad.descendingIterator().forEachRemaining(n -> sum[0] += n); |
| 453 |
check.sum(sum[0]);}}}, |
| 454 |
new Job("ArrayDeque.iterator().forEachRemaining()") { |
| 455 |
public void work() throws Throwable { |
| 456 |
int[] sum = new int[1]; |
| 457 |
for (int i = 0; i < iterations; i++) { |
| 458 |
sum[0] = 0; |
| 459 |
ad.iterator().forEachRemaining(n -> sum[0] += n); |
| 460 |
check.sum(sum[0]);}}}, |
| 461 |
new Job("Vector.iterator().forEachRemaining()") { |
| 462 |
public void work() throws Throwable { |
| 463 |
int[] sum = new int[1]; |
| 464 |
for (int i = 0; i < iterations; i++) { |
| 465 |
sum[0] = 0; |
| 466 |
v.iterator().forEachRemaining(n -> sum[0] += n); |
| 467 |
check.sum(sum[0]);}}}, |
| 468 |
new Job("ArrayList.spliterator().forEachRemaining()") { |
| 469 |
public void work() throws Throwable { |
| 470 |
int[] sum = new int[1]; |
| 471 |
for (int i = 0; i < iterations; i++) { |
| 472 |
sum[0] = 0; |
| 473 |
al.spliterator().forEachRemaining(n -> sum[0] += n); |
| 474 |
check.sum(sum[0]);}}}, |
| 475 |
new Job("ArrayDeque.spliterator().forEachRemaining()") { |
| 476 |
public void work() throws Throwable { |
| 477 |
int[] sum = new int[1]; |
| 478 |
for (int i = 0; i < iterations; i++) { |
| 479 |
sum[0] = 0; |
| 480 |
ad.spliterator().forEachRemaining(n -> sum[0] += n); |
| 481 |
check.sum(sum[0]);}}}, |
| 482 |
new Job("Vector.spliterator().forEachRemaining()") { |
| 483 |
public void work() throws Throwable { |
| 484 |
int[] sum = new int[1]; |
| 485 |
for (int i = 0; i < iterations; i++) { |
| 486 |
sum[0] = 0; |
| 487 |
v.spliterator().forEachRemaining(n -> sum[0] += n); |
| 488 |
check.sum(sum[0]);}}}, |
| 489 |
new Job("ArrayList.spliterator().tryAdvance()") { |
| 490 |
public void work() throws Throwable { |
| 491 |
int[] sum = new int[1]; |
| 492 |
for (int i = 0; i < iterations; i++) { |
| 493 |
sum[0] = 0; |
| 494 |
Spliterator<Integer> spliterator = al.spliterator(); |
| 495 |
do {} while (spliterator.tryAdvance(n -> sum[0] += n)); |
| 496 |
check.sum(sum[0]);}}}, |
| 497 |
new Job("ArrayDeque.spliterator().tryAdvance()") { |
| 498 |
public void work() throws Throwable { |
| 499 |
int[] sum = new int[1]; |
| 500 |
for (int i = 0; i < iterations; i++) { |
| 501 |
sum[0] = 0; |
| 502 |
Spliterator<Integer> spliterator = ad.spliterator(); |
| 503 |
do {} while (spliterator.tryAdvance(n -> sum[0] += n)); |
| 504 |
check.sum(sum[0]);}}}, |
| 505 |
new Job("Vector.spliterator().tryAdvance()") { |
| 506 |
public void work() throws Throwable { |
| 507 |
int[] sum = new int[1]; |
| 508 |
for (int i = 0; i < iterations; i++) { |
| 509 |
sum[0] = 0; |
| 510 |
Spliterator<Integer> spliterator = v.spliterator(); |
| 511 |
do {} while (spliterator.tryAdvance(n -> sum[0] += n)); |
| 512 |
check.sum(sum[0]);}}}, |
| 513 |
new Job("ArrayList.removeIf") { |
| 514 |
public void work() throws Throwable { |
| 515 |
int[] sum = new int[1]; |
| 516 |
for (int i = 0; i < iterations; i++) { |
| 517 |
sum[0] = 0; |
| 518 |
al.removeIf(n -> { sum[0] += n; return false; }); |
| 519 |
check.sum(sum[0]);}}}, |
| 520 |
new Job("ArrayDeque.removeIf") { |
| 521 |
public void work() throws Throwable { |
| 522 |
int[] sum = new int[1]; |
| 523 |
for (int i = 0; i < iterations; i++) { |
| 524 |
sum[0] = 0; |
| 525 |
ad.removeIf(n -> { sum[0] += n; return false; }); |
| 526 |
check.sum(sum[0]);}}}, |
| 527 |
new Job("Vector.removeIf") { |
| 528 |
public void work() throws Throwable { |
| 529 |
int[] sum = new int[1]; |
| 530 |
for (int i = 0; i < iterations; i++) { |
| 531 |
sum[0] = 0; |
| 532 |
v.removeIf(n -> { sum[0] += n; return false; }); |
| 533 |
check.sum(sum[0]);}}}, |
| 534 |
new Job("ArrayList subList .removeIf") { |
| 535 |
public void work() throws Throwable { |
| 536 |
int[] sum = new int[1]; |
| 537 |
List<Integer> sl = asSubList(al); |
| 538 |
for (int i = 0; i < iterations; i++) { |
| 539 |
sum[0] = 0; |
| 540 |
sl.removeIf(n -> { sum[0] += n; return false; }); |
| 541 |
check.sum(sum[0]);}}}, |
| 542 |
new Job("ArrayList subList get loop") { |
| 543 |
public void work() throws Throwable { |
| 544 |
List<Integer> sl = asSubList(al); |
| 545 |
for (int i = 0; i < iterations; i++) { |
| 546 |
int sum = 0; |
| 547 |
int size = sl.size(); |
| 548 |
for (int j = 0; j < size; ++j) |
| 549 |
sum += sl.get(j); |
| 550 |
check.sum(sum);}}}, |
| 551 |
new Job("ArrayList subList iterate for loop") { |
| 552 |
public void work() throws Throwable { |
| 553 |
for (int i = 0; i < iterations; i++) { |
| 554 |
int sum = 0; |
| 555 |
for (Integer n : asSubList(al)) |
| 556 |
sum += n; |
| 557 |
check.sum(sum);}}}, |
| 558 |
new Job("ArrayList subList subList subList iterate for loop") { |
| 559 |
public void work() throws Throwable { |
| 560 |
for (int i = 0; i < iterations; i++) { |
| 561 |
int sum = 0; |
| 562 |
for (Integer n : asSubList(asSubList(asSubList(al)))) |
| 563 |
sum += n; |
| 564 |
check.sum(sum);}}}, |
| 565 |
new Job("ArrayList backwards wrapper ListIterator for loop") { |
| 566 |
public void work() throws Throwable { |
| 567 |
for (int i = 0; i < iterations; i++) { |
| 568 |
int sum = 0; |
| 569 |
for (Integer n : backwards(al)) |
| 570 |
sum += n; |
| 571 |
check.sum(sum);}}}, |
| 572 |
new Job("ArrayList backwards wrapper subList ListIterator for loop") { |
| 573 |
public void work() throws Throwable { |
| 574 |
for (int i = 0; i < iterations; i++) { |
| 575 |
int sum = 0; |
| 576 |
for (Integer n : backwards(asSubList(al))) |
| 577 |
sum += n; |
| 578 |
check.sum(sum);}}}, |
| 579 |
// new Job("ArrayList iterate desugared") { |
| 580 |
// public void work() throws Throwable { |
| 581 |
// for (int i = 0; i < iterations; i++) { |
| 582 |
// int sum = 0; |
| 583 |
// for (Iterator<Integer> it = al.iterator(); it.hasNext();) |
| 584 |
// sum += it.next(); |
| 585 |
// check.sum(sum);}}}, |
| 586 |
new Job("Short ArrayList get loop") { |
| 587 |
public void work() throws Throwable { |
| 588 |
for (int i = 0; i < (iterations * size / shortSize); i++) { |
| 589 |
int sum = 0; |
| 590 |
int size = sal.size(); |
| 591 |
for (int j = 0; j < size; ++j) |
| 592 |
sum += sal.get(j); |
| 593 |
shortCheck.sum(sum);}}}, |
| 594 |
new Job("Short ArrayList iterate for loop") { |
| 595 |
public void work() throws Throwable { |
| 596 |
for (int i = 0; i < (iterations * size / shortSize); i++) { |
| 597 |
int sum = 0; |
| 598 |
for (Integer n : sal) |
| 599 |
sum += n; |
| 600 |
shortCheck.sum(sum);}}}, |
| 601 |
new Job("Short ArrayList sublist iterate for loop") { |
| 602 |
public void work() throws Throwable { |
| 603 |
for (int i = 0; i < (iterations * size / shortSize); i++) { |
| 604 |
int sum = 0; |
| 605 |
for (Integer n : asSubList(sal)) |
| 606 |
sum += n; |
| 607 |
shortCheck.sum(sum);}}}, |
| 608 |
new Job("Vector ArrayList alternating iteration") { |
| 609 |
public void work() throws Throwable { |
| 610 |
for (int i = 0; i < iterations; i++) { |
| 611 |
int sum = 0; |
| 612 |
Iterator<Integer> it1 = v.iterator(); |
| 613 |
Iterator<Integer> it2 = al.iterator(); |
| 614 |
while (it1.hasNext()) |
| 615 |
sum += it1.next() + it2.next(); |
| 616 |
check.sum(sum/2);}}}, |
| 617 |
new Job("Vector ArrayList alternating invokeVirtual iteration") { |
| 618 |
public void work() throws Throwable { |
| 619 |
for (int i = 0; i < iterations; i++) { |
| 620 |
int sum = 0; |
| 621 |
List<Iterator<Integer>> its = new ArrayList<>(2); |
| 622 |
its.add(v.iterator()); |
| 623 |
its.add(al.iterator()); |
| 624 |
for (int k = 0; its.get(k).hasNext(); k = (k == 0) ? 1 : 0) |
| 625 |
sum += its.get(k).next(); |
| 626 |
check.sum(sum/2);}}}, |
| 627 |
new Job("ConcurrentSkipListMap entrySet iterate") { |
| 628 |
public void work() throws Throwable { |
| 629 |
for (int i = 0; i < iterations; i++) { |
| 630 |
int sum = 0; |
| 631 |
for (Map.Entry<Integer,Integer> e : m.entrySet()) |
| 632 |
sum += e.getKey(); |
| 633 |
deoptimize(sum);}}}, |
| 634 |
new Job("ArrayList.toArray()") { |
| 635 |
public void work() throws Throwable { |
| 636 |
int[] sum = new int[1]; |
| 637 |
for (int i = 0; i < iterations; i++) { |
| 638 |
sum[0] = 0; |
| 639 |
for (Object o : al.toArray()) |
| 640 |
sum[0] += (Integer) o; |
| 641 |
check.sum(sum[0]);}}}, |
| 642 |
new Job("ArrayList.toArray(a)") { |
| 643 |
public void work() throws Throwable { |
| 644 |
Integer[] a = new Integer[size]; |
| 645 |
int[] sum = new int[1]; |
| 646 |
for (int i = 0; i < iterations; i++) { |
| 647 |
sum[0] = 0; |
| 648 |
al.toArray(a); |
| 649 |
for (Object o : a) |
| 650 |
sum[0] += (Integer) o; |
| 651 |
check.sum(sum[0]);}}}, |
| 652 |
new Job("ArrayList subList .toArray()") { |
| 653 |
public void work() throws Throwable { |
| 654 |
int[] sum = new int[1]; |
| 655 |
for (int i = 0; i < iterations; i++) { |
| 656 |
sum[0] = 0; |
| 657 |
for (Object o : asSubList(al).toArray()) |
| 658 |
sum[0] += (Integer) o; |
| 659 |
check.sum(sum[0]);}}}, |
| 660 |
new Job("ArrayList subList .toArray(a)") { |
| 661 |
public void work() throws Throwable { |
| 662 |
Integer[] a = new Integer[size]; |
| 663 |
int[] sum = new int[1]; |
| 664 |
for (int i = 0; i < iterations; i++) { |
| 665 |
sum[0] = 0; |
| 666 |
asSubList(al).toArray(a); |
| 667 |
for (Object o : a) |
| 668 |
sum[0] += (Integer) o; |
| 669 |
check.sum(sum[0]);}}}, |
| 670 |
new Job("ArrayDeque.toArray()") { |
| 671 |
public void work() throws Throwable { |
| 672 |
int[] sum = new int[1]; |
| 673 |
for (int i = 0; i < iterations; i++) { |
| 674 |
sum[0] = 0; |
| 675 |
for (Object o : ad.toArray()) |
| 676 |
sum[0] += (Integer) o; |
| 677 |
check.sum(sum[0]);}}}, |
| 678 |
new Job("ArrayDeque.toArray(a)") { |
| 679 |
public void work() throws Throwable { |
| 680 |
Integer[] a = new Integer[size]; |
| 681 |
int[] sum = new int[1]; |
| 682 |
for (int i = 0; i < iterations; i++) { |
| 683 |
sum[0] = 0; |
| 684 |
ad.toArray(a); |
| 685 |
for (Object o : a) |
| 686 |
sum[0] += (Integer) o; |
| 687 |
check.sum(sum[0]);}}}, |
| 688 |
new Job("Vector.toArray()") { |
| 689 |
public void work() throws Throwable { |
| 690 |
int[] sum = new int[1]; |
| 691 |
for (int i = 0; i < iterations; i++) { |
| 692 |
sum[0] = 0; |
| 693 |
for (Object o : v.toArray()) |
| 694 |
sum[0] += (Integer) o; |
| 695 |
check.sum(sum[0]);}}}, |
| 696 |
new Job("Vector.toArray(a)") { |
| 697 |
public void work() throws Throwable { |
| 698 |
Integer[] a = new Integer[size]; |
| 699 |
int[] sum = new int[1]; |
| 700 |
for (int i = 0; i < iterations; i++) { |
| 701 |
sum[0] = 0; |
| 702 |
v.toArray(a); |
| 703 |
for (Object o : a) |
| 704 |
sum[0] += (Integer) o; |
| 705 |
check.sum(sum[0]);}}}, |
| 706 |
}; |
| 707 |
|
| 708 |
time(filter(filter, jobs)); |
| 709 |
} |
| 710 |
} |
