use*_*780 2 java performance jit
听说Java支持“Loop Unswitching”,所以就在JMH上简单测试了一下。
我认为在 JIT 之后它们会完全相同。为什么是这样?
private final int TIMES = 1_000_000;
private boolean bool;
private Random r = new Random(93);
@Setup(Level.Invocation)
public void fresh() {
bool = r.nextBoolean();
}
@Benchmark
public void test1(Blackhole bh) {
for (int i = 0; i < TIMES; i++) {
if (bool) {
bh.consume(1);
} else {
bh.consume(2);
}
}
}
@Benchmark
public void test2(Blackhole bh) {
if (bool) {
for (int i = 0; i < TIMES; i++) {
bh.consume(1);
}
} else {
for (int i = 0; i < TIMES; i++) {
bh.consume(2);
}
}
}
Run Code Online (Sandbox Code Playgroud)
检测结果
private final int TIMES = 1_000_000;
private boolean bool;
private Random r = new Random(93);
@Setup(Level.Invocation)
public void fresh() {
bool = r.nextBoolean();
}
@Benchmark
public void test1(Blackhole bh) {
for (int i = 0; i < TIMES; i++) {
if (bool) {
bh.consume(1);
} else {
bh.consume(2);
}
}
}
@Benchmark
public void test2(Blackhole bh) {
if (bool) {
for (int i = 0; i < TIMES; i++) {
bh.consume(1);
}
} else {
for (int i = 0; i < TIMES; i++) {
bh.consume(2);
}
}
}
Run Code Online (Sandbox Code Playgroud)
测试环境
Benchmark Mode Cnt Score Error Units
LoopUnswitching.test1 avgt 25 1995.192 ± 3.497 us/op
LoopUnswitching.test2 avgt 25 1644.951 ± 4.904 us/op
Run Code Online (Sandbox Code Playgroud)
JMH 禁用Blackhole.consume方法内联。非内联方法对 JVM 来说是一个黑匣子——编译器不知道此类方法是否修改字段、抛出异常、将其注册为垃圾等。JIT 编译器无法在此类方法调用中应用许多优化。(想象黑盒方法使用反射来修改bool字段,因此循环取消切换将失效)。
当编译范围包括整个循环体时,HotSpot JVM 仍然支持循环取消切换,并且已知条件在整个循环中保持不变。
考虑修改后的基准:
@State(Scope.Benchmark)
public class LoopUnswitching {
private static final int TIMES = 10_000;
private final Random r = new Random(93);
private final int[] x = r.ints(TIMES).toArray();
private final int[] y = r.ints(TIMES).toArray();
private boolean bool;
@Setup(Level.Invocation)
public void setup() {
bool = r.nextBoolean();
}
@Benchmark
public int test1() {
int sum = 0;
for (int i = 0; i < TIMES; i++) {
if (bool) {
sum += x[i];
} else {
sum += y[i];
}
}
return sum;
}
@Benchmark
public int test2() {
int sum = 0;
if (bool) {
for (int i = 0; i < TIMES; i++) {
sum += x[i];
}
} else {
for (int i = 0; i < TIMES; i++) {
sum += y[i];
}
}
return sum;
}
}
Run Code Online (Sandbox Code Playgroud)
在这种情况下,test1和的性能test2将类似:
Benchmark Mode Cnt Score Error Units
LoopUnswitching.test1 avgt 10 2910,432 ± 3,287 ns/op
LoopUnswitching.test2 avgt 10 2912,922 ± 9,367 ns/op
Run Code Online (Sandbox Code Playgroud)