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.ref;
  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.BinaryOperator;
  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 
  55     @Param("100000")
  56     private int size;
  57 
  58     private BinaryOperator<Long> op1, op2, op3;
  59 
  60     @Setup
  61     public void setup() {
  62         op1 = new BinaryOperator<Long>() {
  63             @Override
  64             public Long apply(Long l, Long r) {
  65                 return (l > r) ? l : r;
  66             }
  67         };
  68         op2 = new BinaryOperator<Long>() {
  69             @Override
  70             public Long apply(Long l, Long r) {
  71                 return (l > r) ? l : r;
  72             }
  73         };
  74         op3 = new BinaryOperator<Long>() {
  75             @Override
  76             public Long apply(Long l, Long r) {
  77                 return (l > r) ? l : r;
  78             }
  79         };
  80     }
  81 
  82     @Benchmark
  83     public long seq_invoke() {
  84         return LongStream.range(0, size).boxed().reduce(0L, op1);
  85     }
  86 
  87     @Benchmark
  88     public long seq_chain_111() {
  89         long l = 0;
  90         l += LongStream.range(0, size).boxed().reduce(0L, op1);
  91         l += LongStream.range(0, size).boxed().reduce(0L, op1);
  92         l += LongStream.range(0, size).boxed().reduce(0L, op1);
  93         return l;
  94     }
  95 
  96     @Benchmark
  97     public long seq_chain_123() {
  98         long l = 0;
  99         l += LongStream.range(0, size).boxed().reduce(0L, op1);
 100         l += LongStream.range(0, size).boxed().reduce(0L, op2);
 101         l += LongStream.range(0, size).boxed().reduce(0L, op3);
 102         return l;
 103     }
 104 
 105     @Benchmark
 106     public long par_invoke() {
 107         return LongStream.range(0, size).parallel().boxed().reduce(0L, op1);
 108     }
 109 
 110     @Benchmark
 111     public long par_chain_111() {
 112         long l = 0;
 113         l += LongStream.range(0, size).parallel().boxed().reduce(0L, op1);
 114         l += LongStream.range(0, size).parallel().boxed().reduce(0L, op1);
 115         l += LongStream.range(0, size).parallel().boxed().reduce(0L, op1);
 116         return l;
 117     }
 118 
 119     @Benchmark
 120     public long par_chain_123() {
 121         long l = 0;
 122         l += LongStream.range(0, size).parallel().boxed().reduce(0L, op1);
 123         l += LongStream.range(0, size).parallel().boxed().reduce(0L, op2);
 124         l += LongStream.range(0, size).parallel().boxed().reduce(0L, op3);
 125         return l;
 126     }
 127 
 128 }