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