-
-
Notifications
You must be signed in to change notification settings - Fork 9
/
LockElisionBenchmark.java
223 lines (198 loc) · 5.96 KB
/
LockElisionBenchmark.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
/*
* JVM Performance Benchmarks
*
* Copyright (C) 2019 - 2024 Ionut Balosin
*
* Licensed to the Apache Software Foundation (ASF) under one
* or more contributor license agreements. See the NOTICE file
* distributed with this work for additional information
* regarding copyright ownership. The ASF licenses this file
* to you under the Apache License, Version 2.0 (the
* "License"); you may not use this file except in compliance
* with the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing,
* software distributed under the License is distributed on an
* "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
* KIND, either express or implied. See the License for the
* specific language governing permissions and limitations
* under the License.
*/
package com.ionutbalosin.jvm.performance.benchmarks.compiler;
import java.util.Random;
import java.util.concurrent.TimeUnit;
import org.openjdk.jmh.annotations.Benchmark;
import org.openjdk.jmh.annotations.BenchmarkMode;
import org.openjdk.jmh.annotations.Fork;
import org.openjdk.jmh.annotations.Measurement;
import org.openjdk.jmh.annotations.Mode;
import org.openjdk.jmh.annotations.OutputTimeUnit;
import org.openjdk.jmh.annotations.Scope;
import org.openjdk.jmh.annotations.Setup;
import org.openjdk.jmh.annotations.State;
import org.openjdk.jmh.annotations.Warmup;
/*
* Test how the compiler can elide/remove several adjacent locking blocks on non-shared objects, thus reducing the locking overhead.
* Synchronization on non-shared objects is pointless, and runtime does not have to do anything there.
*
* Escape analysis is used to determine if references to an object are limited to a local scope only and none of those references
* "escape" to a broader scope. If escape analysis figures out the objects are non-escaping, the compiler is free to eliminate the synchronizations.
*
*/
@BenchmarkMode(Mode.AverageTime)
@OutputTimeUnit(TimeUnit.NANOSECONDS)
@Warmup(iterations = 5, time = 10, timeUnit = TimeUnit.SECONDS)
@Measurement(iterations = 5, time = 10, timeUnit = TimeUnit.SECONDS)
@Fork(value = 5)
@State(Scope.Benchmark)
public class LockElisionBenchmark {
// $ java -jar */*/benchmarks.jar ".*LockElisionBenchmark.*"
private final Random random = new Random(16384);
private final int DEPTH = 8;
private int defaultValue;
private int incrementValue;
@Setup
public void setup() {
defaultValue = 32 + random.nextInt(32);
incrementValue = random.nextInt(32);
}
@Benchmark
public int nested_synchronized() {
int result = defaultValue << 1;
Object lock = new Object();
synchronized (lock) {
result += incrementValue;
synchronized (lock) {
result += incrementValue;
synchronized (lock) {
result += incrementValue;
synchronized (lock) {
result += incrementValue;
synchronized (lock) {
result += incrementValue;
synchronized (lock) {
result += incrementValue;
synchronized (lock) {
result += incrementValue;
synchronized (lock) {
result += incrementValue;
}
}
}
}
}
}
}
}
return result;
}
@Benchmark
public int recursive_method_calls() {
int result = defaultValue << 1;
result = recursiveSum(result, DEPTH);
return result;
}
@Benchmark
public int chain_method_calls() {
int result = defaultValue << 1;
result = sum(result);
result = sum(result);
result = sum(result);
result = sum(result);
result = sum(result);
result = sum(result);
result = sum(result);
result = sum(result);
return result;
}
@Benchmark
public int conditional_chain_method_calls() {
int result = defaultValue << 1;
// all conditionals are evaluated to "true"
if (result > 1 << 5) {
result = sum(result);
}
if (result > 1 << 5) {
result = sum(result);
}
if (result > 1 << 5) {
result = sum(result);
}
if (result > 1 << 5) {
result = sum(result);
}
if (result > 1 << 5) {
result = sum(result);
}
if (result > 1 << 5) {
result = sum(result);
}
if (result > 1 << 5) {
result = sum(result);
}
if (result > 1 << 5) {
result = sum(result);
}
return result;
}
@Benchmark
public int conditional_nested_method_calls() {
int result = defaultValue << 1;
// all conditionals are evaluated to "true"
if (result > 1 << 5) {
result = sum(result);
if (result > 1 << 5) {
result = sum(result);
if (result > 1 << 5) {
result = sum(result);
if (result > 1 << 5) {
result = sum(result);
if (result > 1 << 5) {
result = sum(result);
if (result > 1 << 5) {
result = sum(result);
if (result > 1 << 5) {
result = sum(result);
if (result > 1 << 5) {
result = sum(result);
}
}
}
}
}
}
}
}
return result;
}
@Benchmark
public int baseline() {
int result = defaultValue << 1;
result += incrementValue;
result += incrementValue;
result += incrementValue;
result += incrementValue;
result += incrementValue;
result += incrementValue;
result += incrementValue;
result += incrementValue;
return result;
}
public int sum(int aValue) {
Object lock = new Object();
synchronized (lock) {
return aValue + incrementValue;
}
}
public int recursiveSum(int aValue, int depth) {
Object lock = new Object();
synchronized (lock) {
if (depth == 0) {
return aValue;
}
return incrementValue + recursiveSum(aValue, depth - 1);
}
}
}