1 /*
2 * Copyright (c) 2014 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. Oracle designates this
8 * particular file as subject to the "Classpath" exception as provided
9 * by Oracle in the LICENSE file that accompanied this code.
10 *
11 * This code is distributed in the hope that it will be useful, but WITHOUT
12 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
13 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
14 * version 2 for more details (a copy is included in the LICENSE file that
15 * accompanied this code).
16 *
17 * You should have received a copy of the GNU General Public License version
18 * 2 along with this work; if not, write to the Free Software Foundation,
19 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
20 *
21 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
22 * or visit www.oracle.com if you need additional information or have any
23 * questions.
24 */
25 package org.openjdk.bench.java.util.stream.pipeline;
26
27 import org.openjdk.jmh.annotations.Benchmark;
28 import org.openjdk.jmh.annotations.BenchmarkMode;
29 import org.openjdk.jmh.annotations.Mode;
30 import org.openjdk.jmh.annotations.OutputTimeUnit;
31 import org.openjdk.jmh.annotations.Param;
32 import org.openjdk.jmh.annotations.Scope;
33 import org.openjdk.jmh.annotations.State;
34
35 import java.util.concurrent.TimeUnit;
36 import java.util.concurrent.atomic.LongAdder;
37 import java.util.function.LongPredicate;
38 import java.util.stream.LongStream;
39
40 /**
41 * Benchmark tests the pipeline fusion abilities.
42 */
43 @BenchmarkMode(Mode.Throughput)
44 @OutputTimeUnit(TimeUnit.SECONDS)
45 @State(Scope.Thread)
46 public class PipelineParMultiple {
47
48 @Param("100000")
49 private int size;
50
51 @Benchmark
52 public long bulk_into_anon() {
53 return LongStream.range(0, size).parallel()
54 .filter((x) -> true)
55 .filter((x) -> true)
56 .filter((x) -> true)
57 .filter((x) -> true)
58 .filter((x) -> true)
59 .filter((x) -> true)
60 .filter((x) -> true)
61 .filter((x) -> false)
62 .collect(LongAdder::new, LongAdder::add, (la1, la2) -> la1.add(la2.sum())).sum();
63 }
64
65 @Benchmark
66 public long bulk_into_named() {
67 LongPredicate t = (x) -> true;
68 LongPredicate f = (x) -> false;
69 return LongStream.range(0, size).parallel()
70 .filter(t)
71 .filter(t)
72 .filter(t)
73 .filter(t)
74 .filter(t)
75 .filter(t)
76 .filter(t)
77 .filter(f)
78 .collect(LongAdder::new, LongAdder::add, (la1, la2) -> la1.add(la2.sum())).sum();
79 }
80
81
82 @Benchmark
83 public long bulk_foreach_anon() {
84 LongAdder adder = new LongAdder();
85 LongStream.range(0, size).parallel().forEach((l) -> {
86 if (((LongPredicate) (x) -> true).test(l))
87 if (((LongPredicate) (x) -> true).test(l))
88 if (((LongPredicate) (x) -> true).test(l))
89 if (((LongPredicate) (x) -> true).test(l))
90 if (((LongPredicate) (x) -> true).test(l))
91 if (((LongPredicate) (x) -> true).test(l))
92 if (((LongPredicate) (x) -> true).test(l))
93 if (((LongPredicate) (x) -> false).test(l))
94 adder.add(l);
95 });
96 return adder.sum();
97 }
98
99
100 @Benchmark
101 public long bulk_foreach_named() {
102 LongAdder adder = new LongAdder();
103 LongPredicate t = (x) -> true;
104 LongPredicate f = (x) -> false;
105 LongStream.range(0, size).parallel().forEach((l) -> {
106 if (t.test(l))
107 if (t.test(l))
108 if (t.test(l))
109 if (t.test(l))
110 if (t.test(l))
111 if (t.test(l))
112 if (t.test(l))
113 if (f.test(l))
114 adder.add(l);
115 });
116 return adder.sum();
117 }
118
119 @Benchmark
120 public long bulk_ifs() {
121 LongAdder adder = new LongAdder();
122 LongStream.range(0, size).parallel().forEach((l) -> {
123 if (true)
124 if (true)
125 if (true)
126 if (true)
127 if (true)
128 if (true)
129 if (true)
130 if (false)
131 adder.add(l);
132 });
133 return adder.sum();
134 }
135
136 }