1 /*
  2  * Copyright (c) 2020, 2024, 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 org.openjdk.bench.valhalla.traversal;
 24 
 25 import org.openjdk.bench.valhalla.util.SizeBase;
 26 import org.openjdk.bench.valhalla.types.Int32;
 27 import org.openjdk.bench.valhalla.types.Q32int;
 28 import org.openjdk.bench.valhalla.util.Utils;
 29 import org.openjdk.jmh.annotations.Benchmark;
 30 import org.openjdk.jmh.annotations.CompilerControl;
 31 import org.openjdk.jmh.annotations.Setup;
 32 
 33 public class Inline32 extends SizeBase {
 34 
 35     public static abstract class IntState extends SizeState {
 36         public Int32[] arr;
 37         void fill() {
 38             int[] a = Utils.makeRandomRing(arr.length);
 39             for (int i = 0; i < a.length; i++) {
 40                 arr[i] = new Q32int(a[i]);
 41             }
 42         }
 43     }
 44 
 45     public static abstract class RefState extends SizeState {
 46         public Q32int[] arr;
 47         void fill() {
 48             int[] a = Utils.makeRandomRing(arr.length);
 49             for (int i = 0; i < a.length; i++) {
 50                 arr[i] = new Q32int(a[i]);
 51             }
 52         }
 53     }
 54 
 55     public static abstract class ValState extends SizeState {
 56         public Q32int[] arr;
 57         void fill() {
 58             int[] a = Utils.makeRandomRing(arr.length);
 59             for (int i = 0; i < a.length; i++) {
 60                 arr[i] = new Q32int(a[i]);
 61             }
 62         }
 63     }
 64 
 65 
 66     public static class Int_as_Int extends IntState {
 67         @Setup
 68         public void setup() {
 69             arr = new Int32[size];
 70             fill();
 71         }
 72     }
 73 
 74     public static class Ref_as_Ref extends RefState {
 75         @Setup
 76         public void setup() {
 77             arr = new Q32int[size];
 78             fill();
 79         }
 80     }
 81 
 82     public static class Val_as_Val extends ValState {
 83         @Setup
 84         public void setup() {
 85             arr = new Q32int[size];
 86             fill();
 87         }
 88     }
 89 
 90     @Benchmark
 91     @CompilerControl(CompilerControl.Mode.DONT_INLINE)
 92     public int Int_as_Int_walk(Int_as_Int s) {
 93         int steps = 0;
 94         Int32[] values = s.arr;
 95         for (int i = values[0].intValue(); i != 0; i = values[i].intValue()) steps++;
 96         return steps;
 97     }
 98 
 99     @Benchmark
100     @CompilerControl(CompilerControl.Mode.DONT_INLINE)
101     public int Ref_as_Ref_walk(Ref_as_Ref s) {
102         int steps = 0;
103         Q32int[] values = s.arr;
104         for (int i = values[0].intValue(); i != 0; i = values[i].intValue()) steps++;
105         return steps;
106     }
107 
108     @Benchmark
109     @CompilerControl(CompilerControl.Mode.DONT_INLINE)
110     public int Val_as_Val_walk(Val_as_Val s) {
111         int steps = 0;
112         Q32int[] values = s.arr;
113         for (int i = values[0].intValue(); i != 0; i = values[i].intValue()) steps++;
114         return steps;
115     }
116 
117 }