1 /*
   2  * Copyright (c) 2015, 2015, 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 package micro.benchmarks;
  24 
  25 import java.util.Random;
  26 
  27 import org.openjdk.jmh.annotations.Benchmark;
  28 import org.openjdk.jmh.annotations.Scope;
  29 import org.openjdk.jmh.annotations.State;
  30 import org.openjdk.jmh.annotations.Warmup;
  31 
  32 import org.graalvm.compiler.microbenchmarks.graal.GraalBenchmark;
  33 
  34 /**
  35  * Benchmarks cost of Math intrinsics.
  36  */
  37 public class MathFunctionBenchmark extends GraalBenchmark {
  38 
  39     @State(Scope.Benchmark)
  40     public static class ThreadState {
  41         double[] data = randomDoubles(100);
  42         double[] result = new double[100];
  43 
  44         static double[] randomDoubles(int len) {
  45             double[] data = new double[len];
  46             Random r = new Random();
  47             for (int i = 0; i < data.length; i++) {
  48                 data[i] = r.nextDouble();
  49             }
  50             return data;
  51         }
  52     }
  53 
  54     @Benchmark
  55     @Warmup(iterations = 5)
  56     public void mathLog(ThreadState state) {
  57         double[] data = state.data;
  58         for (int i = 0; i < data.length; i++) {
  59             double[] result = state.result;
  60             result[i] = Math.log(data[i]);
  61         }
  62     }
  63 
  64     @Benchmark
  65     @Warmup(iterations = 5)
  66     public void mathLog10(ThreadState state) {
  67         double[] data = state.data;
  68         for (int i = 0; i < data.length; i++) {
  69             double[] result = state.result;
  70             result[i] = Math.log10(data[i]);
  71         }
  72     }
  73 
  74     @Benchmark
  75     @Warmup(iterations = 5)
  76     public void mathSin(ThreadState state) {
  77         double[] data = state.data;
  78         for (int i = 0; i < data.length; i++) {
  79             double[] result = state.result;
  80             result[i] = Math.sin(data[i]);
  81         }
  82     }
  83 
  84     @Benchmark
  85     @Warmup(iterations = 5)
  86     public void mathCos(ThreadState state) {
  87         double[] data = state.data;
  88         for (int i = 0; i < data.length; i++) {
  89             double[] result = state.result;
  90             result[i] = Math.cos(data[i]);
  91         }
  92     }
  93 
  94     @Benchmark
  95     @Warmup(iterations = 5)
  96     public void mathTan(ThreadState state) {
  97         double[] data = state.data;
  98         for (int i = 0; i < data.length; i++) {
  99             double[] result = state.result;
 100             result[i] = Math.tan(data[i]);
 101         }
 102     }
 103 }