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.ops.value;
  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.Setup;
  34 import org.openjdk.jmh.annotations.State;
  35 
  36 import java.util.concurrent.TimeUnit;
  37 import java.util.function.LongBinaryOperator;
  38 import java.util.stream.LongStream;
  39 
  40 /**
  41  * Benchmark for reduce()-base operation.
  42  */
  43 @BenchmarkMode(Mode.Throughput)
  44 @OutputTimeUnit(TimeUnit.SECONDS)
  45 @State(Scope.Thread)
  46 public class ReduceBase {
  47 
  48     /**
  49      * Implementation notes:
  50      *   - parallel version requires thread-safe sink, we use the same for sequential version for better comparison
  51      *   - operations are explicit inner classes to untangle unwanted lambda effects
  52      *   - the result of applying consecutive operations is the same, in order to have the same number of elements in sink
  53      */
  54     @Param("100000")
  55     private int size;
  56 
  57     private LongBinaryOperator op1, op2, op3;
  58 
  59     @Setup
  60     public void setup() {
  61         op1 = new LongBinaryOperator() {
  62             @Override
  63             public long applyAsLong(long l, long r) {
  64                 return (l > r) ? l : r;
  65             }
  66         };
  67         op2 = new LongBinaryOperator() {
  68             @Override
  69             public long applyAsLong(long l, long r) {
  70                 return (l > r) ? l : r;
  71             }
  72         };
  73         op3 = new LongBinaryOperator() {
  74             @Override
  75             public long applyAsLong(long l, long r) {
  76                 return (l > r) ? l : r;
  77             }
  78         };
  79     }
  80 
  81     @Benchmark
  82     public long seq_invoke() {
  83         return LongStream.range(0, size).reduce(0L, op1);
  84     }
  85 
  86     @Benchmark
  87     public long seq_chain_111() {
  88         long l = 0;
  89         l += LongStream.range(0, size).reduce(0L, op1);
  90         l += LongStream.range(0, size).reduce(0L, op1);
  91         l += LongStream.range(0, size).reduce(0L, op1);
  92         return l;
  93     }
  94 
  95     @Benchmark
  96     public long seq_chain_123() {
  97         long l = 0;
  98         l += LongStream.range(0, size).reduce(0L, op1);
  99         l += LongStream.range(0, size).reduce(0L, op2);
 100         l += LongStream.range(0, size).reduce(0L, op3);
 101         return l;
 102     }
 103 
 104     @Benchmark
 105     public long par_invoke() {
 106         return LongStream.range(0, size).parallel().reduce(0L, op1);
 107     }
 108 
 109     @Benchmark
 110     public long par_chain_111() {
 111         long l = 0;
 112         l += LongStream.range(0, size).parallel().reduce(0L, op1);
 113         l += LongStream.range(0, size).parallel().reduce(0L, op1);
 114         l += LongStream.range(0, size).parallel().reduce(0L, op1);
 115         return l;
 116     }
 117 
 118     @Benchmark
 119     public long par_chain_123() {
 120         long l = 0;
 121         l += LongStream.range(0, size).parallel().reduce(0L, op1);
 122         l += LongStream.range(0, size).parallel().reduce(0L, op2);
 123         l += LongStream.range(0, size).parallel().reduce(0L, op3);
 124         return l;
 125     }
 126 
 127 }