1 /*
 2  * Copyright (c) 2016, 2018, 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.util.Utils;
27 import org.openjdk.jmh.annotations.Benchmark;
28 import org.openjdk.jmh.annotations.CompilerControl;
29 import org.openjdk.jmh.annotations.Setup;
30 
31 public class Primitive64 extends SizeBase {
32 
33     public static class LongState extends SizeState {
34         public long[] arr;
35 
36         @Setup
37         public void setup() {
38             int[] a = Utils.makeRandomRing(size);
39             arr = new long[a.length];
40             for (int i = 0; i < a.length; i++) {
41                 arr[i] = a[i];
42             }
43         }
44 
45     }
46 
47     @Benchmark
48     @CompilerControl(CompilerControl.Mode.DONT_INLINE)
49     public int walk(LongState s) {
50         int steps = 0;
51         long[] values = s.arr;
52         for (int i = (int) values[0]; i != 0; i = (int) values[i]) steps++;
53         return steps;
54     }
55 
56 }
57