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.array.sum;
24
25 import org.openjdk.bench.valhalla.array.util.StatesQOpt;
26 import org.openjdk.bench.valhalla.types.Int32;
27 import org.openjdk.bench.valhalla.types.Opt;
28 import org.openjdk.bench.valhalla.types.QOpt;
29 import org.openjdk.jmh.annotations.Benchmark;
30 import org.openjdk.jmh.annotations.CompilerControl;
31
32 public class InlineOpt extends StatesQOpt {
33
34 @Benchmark
35 @CompilerControl(CompilerControl.Mode.DONT_INLINE)
36 public int Val_as_Val_fields(Val_as_Val st) {
37 int s = 0;
38 QOpt<Int32>[] arr = st.arr;
39 for(int i=0; i < arr.length; i++) {
40 s += arr[i].value.intValue();
41 }
42 return s;
43 }
44
45 @Benchmark
46 @CompilerControl(CompilerControl.Mode.DONT_INLINE)
47 public int Val_as_Ref_fields(Val_as_Ref st) {
48 int s = 0;
49 QOpt<Int32>[] arr = st.arr;
50 for(int i=0; i < arr.length; i++) {
51 s += arr[i].value.intValue();
52 }
53 return s;
54 }
55
56 @Benchmark
57 @CompilerControl(CompilerControl.Mode.DONT_INLINE)
58 public int Ref_as_Ref_fields(Ref_as_Ref st) {
59 int s = 0;
60 QOpt<Int32>[] arr = st.arr;
61 for(int i=0; i < arr.length; i++) {
62 s += arr[i].value.intValue();
63 }
64 return s;
65 }
66
67 @Benchmark
68 @CompilerControl(CompilerControl.Mode.DONT_INLINE)
69 public int Val_as_Val_sum(Val_as_Val st) {
70 int s = 0;
71 QOpt<Int32>[] arr = st.arr;
72 for(int i=0; i < arr.length; i++) {
73 s += arr[i].get().intValue();
74 }
75 return s;
76 }
77
78 @Benchmark
79 @CompilerControl(CompilerControl.Mode.DONT_INLINE)
80 public int Val_as_Ref_sum(Val_as_Ref st) {
81 int s = 0;
82 QOpt<Int32>[] arr = st.arr;
83 for(int i=0; i < arr.length; i++) {
84 s += arr[i].get().intValue();
85 }
86 return s;
87 }
88
89 @Benchmark
90 @CompilerControl(CompilerControl.Mode.DONT_INLINE)
91 public int Ref_as_Ref_sum(Ref_as_Ref st) {
92 int s = 0;
93 QOpt<Int32>[] arr = st.arr;
94 for(int i=0; i < arr.length; i++) {
95 s += arr[i].get().intValue();
96 }
97 return s;
98 }
99
100 @Benchmark
101 @CompilerControl(CompilerControl.Mode.DONT_INLINE)
102 public int Val_as_Int_sum(Val_as_Int st) {
103 int s = 0;
104 Opt<Int32>[] arr = st.arr;
105 for(int i=0; i < arr.length; i++) {
106 s += arr[i].get().intValue();
107 }
108 return s;
109 }
110
111 @Benchmark
112 @CompilerControl(CompilerControl.Mode.DONT_INLINE)
113 public int Int_as_Int_sum(Int_as_Int st) {
114 int s = 0;
115 Opt<Int32>[] arr = st.arr;
116 for(int i=0; i < arr.length; i++) {
117 s += arr[i].get().intValue();
118 }
119 return s;
120 }
121
122 }