< prev index next >
test/jdk/jdk/incubator/vector/benchmark/src/main/java/benchmark/jdk/incubator/vector/IntScalar.java
Print this page
rev 55606 : 8221812: Fine-tune jmh test for vector api
Summary: To compare performance of vector api and auto vectorization, vector
api and scalar test cases are updated to keep aligned.
Reviewed-by: duke
*** 1,7 ****
/*
! * Copyright (c) 2018, Oracle and/or its affiliates. All rights reserved.
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
*
* This code is free software; you can redistribute it and/or modify it
* under the terms of the GNU General Public License version 2 only, as
* published by the Free Software Foundation.
--- 1,7 ----
/*
! * Copyright (c) 2018, 2019, Oracle and/or its affiliates. All rights reserved.
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
*
* This code is free software; you can redistribute it and/or modify it
* under the terms of the GNU General Public License version 2 only, as
* published by the Free Software Foundation.
*** 25,42 ****
--- 25,45 ----
import java.util.concurrent.TimeUnit;
import java.util.function.IntFunction;
import org.openjdk.jmh.annotations.*;
+ import org.openjdk.jmh.infra.Blackhole;
@BenchmarkMode(Mode.Throughput)
@OutputTimeUnit(TimeUnit.MILLISECONDS)
@State(Scope.Benchmark)
@Warmup(iterations = 3, time = 1)
@Measurement(iterations = 5, time = 1)
@Fork(value = 1, jvmArgsPrepend = {"--add-modules=jdk.incubator.vector"})
public class IntScalar extends AbstractVectorBenchmark {
+ static final int INVOC_COUNT = 1; // To align with vector benchmarks.
+
@Param("1024")
int size;
int[] fill(IntFunction<Integer> f) {
int[] array = new int[size];
*** 70,515 ****
final IntFunction<boolean[]> fmr = vl -> rms;
final IntFunction<int[]> fs = vl -> ss;
@Benchmark
! public Object add() {
int[] as = fa.apply(size);
int[] bs = fb.apply(size);
int[] rs = fr.apply(size);
for (int i = 0; i < as.length; i++) {
int a = as[i];
int b = bs[i];
rs[i] = (int)(a + b);
}
! return rs;
}
@Benchmark
! public Object addMasked() {
int[] as = fa.apply(size);
int[] bs = fb.apply(size);
int[] rs = fr.apply(size);
boolean[] ms = fm.apply(size);
for (int i = 0; i < as.length; i++) {
int a = as[i];
int b = bs[i];
if (ms[i % ms.length]) {
rs[i] = (int)(a + b);
} else {
rs[i] = a;
}
}
! return rs;
}
@Benchmark
! public Object sub() {
int[] as = fa.apply(size);
int[] bs = fb.apply(size);
int[] rs = fr.apply(size);
for (int i = 0; i < as.length; i++) {
int a = as[i];
int b = bs[i];
rs[i] = (int)(a - b);
}
! return rs;
}
@Benchmark
! public Object subMasked() {
int[] as = fa.apply(size);
int[] bs = fb.apply(size);
int[] rs = fr.apply(size);
boolean[] ms = fm.apply(size);
for (int i = 0; i < as.length; i++) {
int a = as[i];
int b = bs[i];
if (ms[i % ms.length]) {
rs[i] = (int)(a - b);
} else {
rs[i] = a;
}
}
! return rs;
}
@Benchmark
! public Object mul() {
int[] as = fa.apply(size);
int[] bs = fb.apply(size);
int[] rs = fr.apply(size);
for (int i = 0; i < as.length; i++) {
int a = as[i];
int b = bs[i];
rs[i] = (int)(a * b);
}
! return rs;
}
@Benchmark
! public Object mulMasked() {
int[] as = fa.apply(size);
int[] bs = fb.apply(size);
int[] rs = fr.apply(size);
boolean[] ms = fm.apply(size);
for (int i = 0; i < as.length; i++) {
int a = as[i];
int b = bs[i];
if (ms[i % ms.length]) {
rs[i] = (int)(a * b);
} else {
rs[i] = a;
}
}
! return rs;
}
@Benchmark
! public Object and() {
int[] as = fa.apply(size);
int[] bs = fb.apply(size);
int[] rs = fr.apply(size);
for (int i = 0; i < as.length; i++) {
int a = as[i];
int b = bs[i];
rs[i] = (int)(a & b);
}
! return rs;
}
@Benchmark
! public Object andMasked() {
int[] as = fa.apply(size);
int[] bs = fb.apply(size);
int[] rs = fr.apply(size);
boolean[] ms = fm.apply(size);
for (int i = 0; i < as.length; i++) {
int a = as[i];
int b = bs[i];
if (ms[i % ms.length]) {
rs[i] = (int)(a & b);
} else {
rs[i] = a;
}
}
! return rs;
}
@Benchmark
! public Object or() {
int[] as = fa.apply(size);
int[] bs = fb.apply(size);
int[] rs = fr.apply(size);
for (int i = 0; i < as.length; i++) {
int a = as[i];
int b = bs[i];
rs[i] = (int)(a | b);
}
! return rs;
}
@Benchmark
! public Object orMasked() {
int[] as = fa.apply(size);
int[] bs = fb.apply(size);
int[] rs = fr.apply(size);
boolean[] ms = fm.apply(size);
for (int i = 0; i < as.length; i++) {
int a = as[i];
int b = bs[i];
if (ms[i % ms.length]) {
rs[i] = (int)(a | b);
} else {
rs[i] = a;
}
}
! return rs;
}
@Benchmark
! public Object xor() {
int[] as = fa.apply(size);
int[] bs = fb.apply(size);
int[] rs = fr.apply(size);
for (int i = 0; i < as.length; i++) {
int a = as[i];
int b = bs[i];
rs[i] = (int)(a ^ b);
}
! return rs;
}
@Benchmark
! public Object xorMasked() {
int[] as = fa.apply(size);
int[] bs = fb.apply(size);
int[] rs = fr.apply(size);
boolean[] ms = fm.apply(size);
for (int i = 0; i < as.length; i++) {
int a = as[i];
int b = bs[i];
if (ms[i % ms.length]) {
rs[i] = (int)(a ^ b);
} else {
rs[i] = a;
}
}
! return rs;
}
@Benchmark
! public Object shiftR() {
int[] as = fa.apply(size);
int[] bs = fb.apply(size);
int[] rs = fr.apply(size);
for (int i = 0; i < as.length; i++) {
int a = as[i];
int b = bs[i];
rs[i] = (int)((a >>> b));
}
! return rs;
}
@Benchmark
! public Object shiftRMasked() {
int[] as = fa.apply(size);
int[] bs = fb.apply(size);
int[] rs = fr.apply(size);
boolean[] ms = fm.apply(size);
for (int i = 0; i < as.length; i++) {
int a = as[i];
int b = bs[i];
if (ms[i % ms.length]) {
rs[i] = (int)((a >>> b));
} else {
rs[i] = a;
}
}
! return rs;
}
@Benchmark
! public Object shiftL() {
int[] as = fa.apply(size);
int[] bs = fb.apply(size);
int[] rs = fr.apply(size);
for (int i = 0; i < as.length; i++) {
int a = as[i];
int b = bs[i];
rs[i] = (int)((a << b));
}
! return rs;
}
@Benchmark
! public Object shiftLMasked() {
int[] as = fa.apply(size);
int[] bs = fb.apply(size);
int[] rs = fr.apply(size);
boolean[] ms = fm.apply(size);
for (int i = 0; i < as.length; i++) {
int a = as[i];
int b = bs[i];
if (ms[i % ms.length]) {
rs[i] = (int)((a << b));
} else {
rs[i] = a;
}
}
! return rs;
}
@Benchmark
! public Object aShiftR() {
int[] as = fa.apply(size);
int[] bs = fb.apply(size);
int[] rs = fr.apply(size);
for (int i = 0; i < as.length; i++) {
int a = as[i];
int b = bs[i];
rs[i] = (int)((a >> b));
}
! return rs;
}
@Benchmark
! public Object aShiftRMasked() {
int[] as = fa.apply(size);
int[] bs = fb.apply(size);
int[] rs = fr.apply(size);
boolean[] ms = fm.apply(size);
for (int i = 0; i < as.length; i++) {
int a = as[i];
int b = bs[i];
if (ms[i % ms.length]) {
rs[i] = (int)((a >> b));
} else {
rs[i] = a;
}
}
! return rs;
}
@Benchmark
! public Object aShiftRShift() {
int[] as = fa.apply(size);
int[] bs = fb.apply(size);
int[] rs = fr.apply(size);
for (int i = 0; i < as.length; i++) {
int a = as[i];
int b = bs[i];
rs[i] = (int)((a >> b));
}
! return rs;
}
@Benchmark
! public Object aShiftRMaskedShift() {
int[] as = fa.apply(size);
int[] bs = fb.apply(size);
int[] rs = fr.apply(size);
boolean[] ms = fm.apply(size);
for (int i = 0; i < as.length; i++) {
int a = as[i];
int b = bs[i];
boolean m = ms[i % ms.length];
rs[i] = (m ? (int)((a >> b)) : a);
}
! return rs;
}
@Benchmark
! public Object shiftRShift() {
int[] as = fa.apply(size);
int[] bs = fb.apply(size);
int[] rs = fr.apply(size);
for (int i = 0; i < as.length; i++) {
int a = as[i];
int b = bs[i];
rs[i] = (int)((a >>> b));
}
! return rs;
}
@Benchmark
! public Object shiftRMaskedShift() {
int[] as = fa.apply(size);
int[] bs = fb.apply(size);
int[] rs = fr.apply(size);
boolean[] ms = fm.apply(size);
for (int i = 0; i < as.length; i++) {
int a = as[i];
int b = bs[i];
boolean m = ms[i % ms.length];
rs[i] = (m ? (int)((a >>> b)) : a);
}
! return rs;
}
@Benchmark
! public Object shiftLShift() {
int[] as = fa.apply(size);
int[] bs = fb.apply(size);
int[] rs = fr.apply(size);
for (int i = 0; i < as.length; i++) {
int a = as[i];
int b = bs[i];
rs[i] = (int)((a << b));
}
! return rs;
}
@Benchmark
! public Object shiftLMaskedShift() {
int[] as = fa.apply(size);
int[] bs = fb.apply(size);
int[] rs = fr.apply(size);
boolean[] ms = fm.apply(size);
for (int i = 0; i < as.length; i++) {
int a = as[i];
int b = bs[i];
boolean m = ms[i % ms.length];
rs[i] = (m ? (int)((a << b)) : a);
}
! return rs;
}
--- 73,566 ----
final IntFunction<boolean[]> fmr = vl -> rms;
final IntFunction<int[]> fs = vl -> ss;
@Benchmark
! public void add(Blackhole bh) {
int[] as = fa.apply(size);
int[] bs = fb.apply(size);
int[] rs = fr.apply(size);
+ for (int ic = 0; ic < INVOC_COUNT; ic++) {
for (int i = 0; i < as.length; i++) {
int a = as[i];
int b = bs[i];
rs[i] = (int)(a + b);
}
+ }
! bh.consume(rs);
}
@Benchmark
! public void addMasked(Blackhole bh) {
int[] as = fa.apply(size);
int[] bs = fb.apply(size);
int[] rs = fr.apply(size);
boolean[] ms = fm.apply(size);
+ for (int ic = 0; ic < INVOC_COUNT; ic++) {
for (int i = 0; i < as.length; i++) {
int a = as[i];
int b = bs[i];
if (ms[i % ms.length]) {
rs[i] = (int)(a + b);
} else {
rs[i] = a;
}
}
! }
! bh.consume(rs);
}
@Benchmark
! public void sub(Blackhole bh) {
int[] as = fa.apply(size);
int[] bs = fb.apply(size);
int[] rs = fr.apply(size);
+ for (int ic = 0; ic < INVOC_COUNT; ic++) {
for (int i = 0; i < as.length; i++) {
int a = as[i];
int b = bs[i];
rs[i] = (int)(a - b);
}
+ }
! bh.consume(rs);
}
@Benchmark
! public void subMasked(Blackhole bh) {
int[] as = fa.apply(size);
int[] bs = fb.apply(size);
int[] rs = fr.apply(size);
boolean[] ms = fm.apply(size);
+ for (int ic = 0; ic < INVOC_COUNT; ic++) {
for (int i = 0; i < as.length; i++) {
int a = as[i];
int b = bs[i];
if (ms[i % ms.length]) {
rs[i] = (int)(a - b);
} else {
rs[i] = a;
}
}
! }
! bh.consume(rs);
}
@Benchmark
! public void mul(Blackhole bh) {
int[] as = fa.apply(size);
int[] bs = fb.apply(size);
int[] rs = fr.apply(size);
+ for (int ic = 0; ic < INVOC_COUNT; ic++) {
for (int i = 0; i < as.length; i++) {
int a = as[i];
int b = bs[i];
rs[i] = (int)(a * b);
}
+ }
! bh.consume(rs);
}
@Benchmark
! public void mulMasked(Blackhole bh) {
int[] as = fa.apply(size);
int[] bs = fb.apply(size);
int[] rs = fr.apply(size);
boolean[] ms = fm.apply(size);
+ for (int ic = 0; ic < INVOC_COUNT; ic++) {
for (int i = 0; i < as.length; i++) {
int a = as[i];
int b = bs[i];
if (ms[i % ms.length]) {
rs[i] = (int)(a * b);
} else {
rs[i] = a;
}
}
! }
! bh.consume(rs);
}
@Benchmark
! public void and(Blackhole bh) {
int[] as = fa.apply(size);
int[] bs = fb.apply(size);
int[] rs = fr.apply(size);
+ for (int ic = 0; ic < INVOC_COUNT; ic++) {
for (int i = 0; i < as.length; i++) {
int a = as[i];
int b = bs[i];
rs[i] = (int)(a & b);
}
+ }
! bh.consume(rs);
}
@Benchmark
! public void andMasked(Blackhole bh) {
int[] as = fa.apply(size);
int[] bs = fb.apply(size);
int[] rs = fr.apply(size);
boolean[] ms = fm.apply(size);
+ for (int ic = 0; ic < INVOC_COUNT; ic++) {
for (int i = 0; i < as.length; i++) {
int a = as[i];
int b = bs[i];
if (ms[i % ms.length]) {
rs[i] = (int)(a & b);
} else {
rs[i] = a;
}
}
! }
! bh.consume(rs);
}
@Benchmark
! public void or(Blackhole bh) {
int[] as = fa.apply(size);
int[] bs = fb.apply(size);
int[] rs = fr.apply(size);
+ for (int ic = 0; ic < INVOC_COUNT; ic++) {
for (int i = 0; i < as.length; i++) {
int a = as[i];
int b = bs[i];
rs[i] = (int)(a | b);
}
+ }
! bh.consume(rs);
}
@Benchmark
! public void orMasked(Blackhole bh) {
int[] as = fa.apply(size);
int[] bs = fb.apply(size);
int[] rs = fr.apply(size);
boolean[] ms = fm.apply(size);
+ for (int ic = 0; ic < INVOC_COUNT; ic++) {
for (int i = 0; i < as.length; i++) {
int a = as[i];
int b = bs[i];
if (ms[i % ms.length]) {
rs[i] = (int)(a | b);
} else {
rs[i] = a;
}
}
! }
! bh.consume(rs);
}
@Benchmark
! public void xor(Blackhole bh) {
int[] as = fa.apply(size);
int[] bs = fb.apply(size);
int[] rs = fr.apply(size);
+ for (int ic = 0; ic < INVOC_COUNT; ic++) {
for (int i = 0; i < as.length; i++) {
int a = as[i];
int b = bs[i];
rs[i] = (int)(a ^ b);
}
+ }
! bh.consume(rs);
}
@Benchmark
! public void xorMasked(Blackhole bh) {
int[] as = fa.apply(size);
int[] bs = fb.apply(size);
int[] rs = fr.apply(size);
boolean[] ms = fm.apply(size);
+ for (int ic = 0; ic < INVOC_COUNT; ic++) {
for (int i = 0; i < as.length; i++) {
int a = as[i];
int b = bs[i];
if (ms[i % ms.length]) {
rs[i] = (int)(a ^ b);
} else {
rs[i] = a;
}
}
! }
! bh.consume(rs);
}
@Benchmark
! public void shiftR(Blackhole bh) {
int[] as = fa.apply(size);
int[] bs = fb.apply(size);
int[] rs = fr.apply(size);
+ for (int ic = 0; ic < INVOC_COUNT; ic++) {
for (int i = 0; i < as.length; i++) {
int a = as[i];
int b = bs[i];
rs[i] = (int)((a >>> b));
}
+ }
! bh.consume(rs);
}
@Benchmark
! public void shiftRMasked(Blackhole bh) {
int[] as = fa.apply(size);
int[] bs = fb.apply(size);
int[] rs = fr.apply(size);
boolean[] ms = fm.apply(size);
+ for (int ic = 0; ic < INVOC_COUNT; ic++) {
for (int i = 0; i < as.length; i++) {
int a = as[i];
int b = bs[i];
if (ms[i % ms.length]) {
rs[i] = (int)((a >>> b));
} else {
rs[i] = a;
}
}
! }
! bh.consume(rs);
}
@Benchmark
! public void shiftL(Blackhole bh) {
int[] as = fa.apply(size);
int[] bs = fb.apply(size);
int[] rs = fr.apply(size);
+ for (int ic = 0; ic < INVOC_COUNT; ic++) {
for (int i = 0; i < as.length; i++) {
int a = as[i];
int b = bs[i];
rs[i] = (int)((a << b));
}
+ }
! bh.consume(rs);
}
@Benchmark
! public void shiftLMasked(Blackhole bh) {
int[] as = fa.apply(size);
int[] bs = fb.apply(size);
int[] rs = fr.apply(size);
boolean[] ms = fm.apply(size);
+ for (int ic = 0; ic < INVOC_COUNT; ic++) {
for (int i = 0; i < as.length; i++) {
int a = as[i];
int b = bs[i];
if (ms[i % ms.length]) {
rs[i] = (int)((a << b));
} else {
rs[i] = a;
}
}
! }
! bh.consume(rs);
}
@Benchmark
! public void aShiftR(Blackhole bh) {
int[] as = fa.apply(size);
int[] bs = fb.apply(size);
int[] rs = fr.apply(size);
+ for (int ic = 0; ic < INVOC_COUNT; ic++) {
for (int i = 0; i < as.length; i++) {
int a = as[i];
int b = bs[i];
rs[i] = (int)((a >> b));
}
+ }
! bh.consume(rs);
}
@Benchmark
! public void aShiftRMasked(Blackhole bh) {
int[] as = fa.apply(size);
int[] bs = fb.apply(size);
int[] rs = fr.apply(size);
boolean[] ms = fm.apply(size);
+ for (int ic = 0; ic < INVOC_COUNT; ic++) {
for (int i = 0; i < as.length; i++) {
int a = as[i];
int b = bs[i];
if (ms[i % ms.length]) {
rs[i] = (int)((a >> b));
} else {
rs[i] = a;
}
}
! }
! bh.consume(rs);
}
@Benchmark
! public void aShiftRShift(Blackhole bh) {
int[] as = fa.apply(size);
int[] bs = fb.apply(size);
int[] rs = fr.apply(size);
+ for (int ic = 0; ic < INVOC_COUNT; ic++) {
for (int i = 0; i < as.length; i++) {
int a = as[i];
int b = bs[i];
rs[i] = (int)((a >> b));
}
+ }
! bh.consume(rs);
}
@Benchmark
! public void aShiftRMaskedShift(Blackhole bh) {
int[] as = fa.apply(size);
int[] bs = fb.apply(size);
int[] rs = fr.apply(size);
boolean[] ms = fm.apply(size);
+ for (int ic = 0; ic < INVOC_COUNT; ic++) {
for (int i = 0; i < as.length; i++) {
int a = as[i];
int b = bs[i];
boolean m = ms[i % ms.length];
rs[i] = (m ? (int)((a >> b)) : a);
}
+ }
! bh.consume(rs);
}
@Benchmark
! public void shiftRShift(Blackhole bh) {
int[] as = fa.apply(size);
int[] bs = fb.apply(size);
int[] rs = fr.apply(size);
+ for (int ic = 0; ic < INVOC_COUNT; ic++) {
for (int i = 0; i < as.length; i++) {
int a = as[i];
int b = bs[i];
rs[i] = (int)((a >>> b));
}
+ }
! bh.consume(rs);
}
@Benchmark
! public void shiftRMaskedShift(Blackhole bh) {
int[] as = fa.apply(size);
int[] bs = fb.apply(size);
int[] rs = fr.apply(size);
boolean[] ms = fm.apply(size);
+ for (int ic = 0; ic < INVOC_COUNT; ic++) {
for (int i = 0; i < as.length; i++) {
int a = as[i];
int b = bs[i];
boolean m = ms[i % ms.length];
rs[i] = (m ? (int)((a >>> b)) : a);
}
+ }
! bh.consume(rs);
}
@Benchmark
! public void shiftLShift(Blackhole bh) {
int[] as = fa.apply(size);
int[] bs = fb.apply(size);
int[] rs = fr.apply(size);
+ for (int ic = 0; ic < INVOC_COUNT; ic++) {
for (int i = 0; i < as.length; i++) {
int a = as[i];
int b = bs[i];
rs[i] = (int)((a << b));
}
+ }
! bh.consume(rs);
}
@Benchmark
! public void shiftLMaskedShift(Blackhole bh) {
int[] as = fa.apply(size);
int[] bs = fb.apply(size);
int[] rs = fr.apply(size);
boolean[] ms = fm.apply(size);
+ for (int ic = 0; ic < INVOC_COUNT; ic++) {
for (int i = 0; i < as.length; i++) {
int a = as[i];
int b = bs[i];
boolean m = ms[i % ms.length];
rs[i] = (m ? (int)((a << b)) : a);
}
+ }
! bh.consume(rs);
}
*** 522,798 ****
@Benchmark
! public Object max() {
int[] as = fa.apply(size);
int[] bs = fb.apply(size);
int[] rs = fr.apply(size);
for (int i = 0; i < as.length; i++) {
int a = as[i];
int b = bs[i];
rs[i] = (int)(Math.max(a, b));
}
! return rs;
}
@Benchmark
! public Object min() {
int[] as = fa.apply(size);
int[] bs = fb.apply(size);
int[] rs = fr.apply(size);
for (int i = 0; i < as.length; i++) {
int a = as[i];
int b = bs[i];
rs[i] = (int)(Math.min(a, b));
}
! return rs;
}
@Benchmark
! public int andAll() {
int[] as = fa.apply(size);
int r = -1;
for (int i = 0; i < as.length; i++) {
r &= as[i];
}
! return r;
}
@Benchmark
! public int orAll() {
int[] as = fa.apply(size);
int r = 0;
for (int i = 0; i < as.length; i++) {
r |= as[i];
}
! return r;
}
@Benchmark
! public int xorAll() {
int[] as = fa.apply(size);
int r = 0;
for (int i = 0; i < as.length; i++) {
r ^= as[i];
}
! return r;
}
@Benchmark
! public int addAll() {
int[] as = fa.apply(size);
int r = 0;
for (int i = 0; i < as.length; i++) {
r += as[i];
}
! return r;
}
@Benchmark
! public int mulAll() {
int[] as = fa.apply(size);
int r = 1;
for (int i = 0; i < as.length; i++) {
r *= as[i];
}
! return r;
}
@Benchmark
! public int minAll() {
int[] as = fa.apply(size);
int r = Integer.MAX_VALUE;
for (int i = 0; i < as.length; i++) {
r = (int)Math.min(r, as[i]);
}
! return r;
}
@Benchmark
! public int maxAll() {
int[] as = fa.apply(size);
int r = Integer.MIN_VALUE;
for (int i = 0; i < as.length; i++) {
r = (int)Math.max(r, as[i]);
}
! return r;
}
@Benchmark
! public boolean anyTrue() {
boolean[] ms = fm.apply(size);
boolean r = false;
for (int i = 0; i < ms.length; i++) {
r |= ms[i];
}
! return r;
}
@Benchmark
! public boolean allTrue() {
boolean[] ms = fm.apply(size);
boolean r = true;
for (int i = 0; i < ms.length; i++) {
r &= ms[i];
}
! return r;
}
@Benchmark
! public boolean lessThan() {
int[] as = fa.apply(size);
int[] bs = fb.apply(size);
boolean r = false;
for (int i = 0; i < as.length; i++) {
boolean m = (as[i] < bs[i]);
r |= m; // accumulate so JIT can't eliminate the computation
}
! return r;
}
@Benchmark
! public boolean greaterThan() {
int[] as = fa.apply(size);
int[] bs = fb.apply(size);
boolean r = false;
for (int i = 0; i < as.length; i++) {
boolean m = (as[i] > bs[i]);
r |= m; // accumulate so JIT can't eliminate the computation
}
! return r;
}
@Benchmark
! public boolean equal() {
int[] as = fa.apply(size);
int[] bs = fb.apply(size);
boolean r = false;
for (int i = 0; i < as.length; i++) {
boolean m = (as[i] == bs[i]);
r |= m; // accumulate so JIT can't eliminate the computation
}
! return r;
}
@Benchmark
! public boolean notEqual() {
int[] as = fa.apply(size);
int[] bs = fb.apply(size);
boolean r = false;
for (int i = 0; i < as.length; i++) {
boolean m = (as[i] != bs[i]);
r |= m; // accumulate so JIT can't eliminate the computation
}
! return r;
}
@Benchmark
! public boolean lessThanEq() {
int[] as = fa.apply(size);
int[] bs = fb.apply(size);
boolean r = false;
for (int i = 0; i < as.length; i++) {
boolean m = (as[i] <= bs[i]);
r |= m; // accumulate so JIT can't eliminate the computation
}
! return r;
}
@Benchmark
! public boolean greaterThanEq() {
int[] as = fa.apply(size);
int[] bs = fb.apply(size);
boolean r = false;
for (int i = 0; i < as.length; i++) {
boolean m = (as[i] >= bs[i]);
r |= m; // accumulate so JIT can't eliminate the computation
}
! return r;
}
@Benchmark
! public Object blend() {
int[] as = fa.apply(size);
int[] bs = fb.apply(size);
int[] rs = fr.apply(size);
boolean[] ms = fm.apply(size);
for (int i = 0; i < as.length; i++) {
int a = as[i];
int b = bs[i];
boolean m = ms[i % ms.length];
rs[i] = (m ? b : a);
}
! return rs;
}
! Object rearrangeShared(int window) {
int[] as = fa.apply(size);
int[] order = fs.apply(size);
int[] rs = fr.apply(size);
for (int i = 0; i < as.length; i += window) {
for (int j = 0; j < window; j++) {
int a = as[i+j];
int pos = order[j];
rs[i + pos] = a;
}
}
! return rs;
}
@Benchmark
! public Object rearrange064() {
int window = 64 / Integer.SIZE;
! return rearrangeShared(window);
}
@Benchmark
! public Object rearrange128() {
int window = 128 / Integer.SIZE;
! return rearrangeShared(window);
}
@Benchmark
! public Object rearrange256() {
int window = 256 / Integer.SIZE;
! return rearrangeShared(window);
}
@Benchmark
! public Object rearrange512() {
int window = 512 / Integer.SIZE;
! return rearrangeShared(window);
}
--- 573,902 ----
@Benchmark
! public void max(Blackhole bh) {
int[] as = fa.apply(size);
int[] bs = fb.apply(size);
int[] rs = fr.apply(size);
+ for (int ic = 0; ic < INVOC_COUNT; ic++) {
for (int i = 0; i < as.length; i++) {
int a = as[i];
int b = bs[i];
rs[i] = (int)(Math.max(a, b));
}
+ }
! bh.consume(rs);
}
@Benchmark
! public void min(Blackhole bh) {
int[] as = fa.apply(size);
int[] bs = fb.apply(size);
int[] rs = fr.apply(size);
+ for (int ic = 0; ic < INVOC_COUNT; ic++) {
for (int i = 0; i < as.length; i++) {
int a = as[i];
int b = bs[i];
rs[i] = (int)(Math.min(a, b));
}
+ }
! bh.consume(rs);
}
@Benchmark
! public void andAll(Blackhole bh) {
int[] as = fa.apply(size);
int r = -1;
+ for (int ic = 0; ic < INVOC_COUNT; ic++) {
+ r = -1;
for (int i = 0; i < as.length; i++) {
r &= as[i];
}
! }
! bh.consume(r);
}
@Benchmark
! public void orAll(Blackhole bh) {
int[] as = fa.apply(size);
int r = 0;
+ for (int ic = 0; ic < INVOC_COUNT; ic++) {
+ r = 0;
for (int i = 0; i < as.length; i++) {
r |= as[i];
}
! }
! bh.consume(r);
}
@Benchmark
! public void xorAll(Blackhole bh) {
int[] as = fa.apply(size);
int r = 0;
+ for (int ic = 0; ic < INVOC_COUNT; ic++) {
+ r = 0;
for (int i = 0; i < as.length; i++) {
r ^= as[i];
}
! }
! bh.consume(r);
}
@Benchmark
! public void addAll(Blackhole bh) {
int[] as = fa.apply(size);
int r = 0;
+ for (int ic = 0; ic < INVOC_COUNT; ic++) {
+ r = 0;
for (int i = 0; i < as.length; i++) {
r += as[i];
}
! }
! bh.consume(r);
}
@Benchmark
! public void mulAll(Blackhole bh) {
int[] as = fa.apply(size);
int r = 1;
+ for (int ic = 0; ic < INVOC_COUNT; ic++) {
+ r = 1;
for (int i = 0; i < as.length; i++) {
r *= as[i];
}
! }
! bh.consume(r);
}
@Benchmark
! public void minAll(Blackhole bh) {
int[] as = fa.apply(size);
int r = Integer.MAX_VALUE;
+ for (int ic = 0; ic < INVOC_COUNT; ic++) {
+ r = Integer.MAX_VALUE;
for (int i = 0; i < as.length; i++) {
r = (int)Math.min(r, as[i]);
}
! }
! bh.consume(r);
}
@Benchmark
! public void maxAll(Blackhole bh) {
int[] as = fa.apply(size);
int r = Integer.MIN_VALUE;
+ for (int ic = 0; ic < INVOC_COUNT; ic++) {
+ r = Integer.MIN_VALUE;
for (int i = 0; i < as.length; i++) {
r = (int)Math.max(r, as[i]);
}
! }
! bh.consume(r);
}
@Benchmark
! public void anyTrue(Blackhole bh) {
boolean[] ms = fm.apply(size);
boolean r = false;
+ for (int ic = 0; ic < INVOC_COUNT; ic++) {
+ r = false;
for (int i = 0; i < ms.length; i++) {
r |= ms[i];
}
! }
! bh.consume(r);
}
@Benchmark
! public void allTrue(Blackhole bh) {
boolean[] ms = fm.apply(size);
boolean r = true;
+ for (int ic = 0; ic < INVOC_COUNT; ic++) {
+ r = true;
for (int i = 0; i < ms.length; i++) {
r &= ms[i];
}
! }
! bh.consume(r);
}
@Benchmark
! public void lessThan(Blackhole bh) {
int[] as = fa.apply(size);
int[] bs = fb.apply(size);
boolean r = false;
+ for (int ic = 0; ic < INVOC_COUNT; ic++) {
+ r = false;
for (int i = 0; i < as.length; i++) {
boolean m = (as[i] < bs[i]);
r |= m; // accumulate so JIT can't eliminate the computation
}
+ }
! bh.consume(r);
}
@Benchmark
! public void greaterThan(Blackhole bh) {
int[] as = fa.apply(size);
int[] bs = fb.apply(size);
boolean r = false;
+ for (int ic = 0; ic < INVOC_COUNT; ic++) {
+ r = false;
for (int i = 0; i < as.length; i++) {
boolean m = (as[i] > bs[i]);
r |= m; // accumulate so JIT can't eliminate the computation
}
+ }
! bh.consume(r);
}
@Benchmark
! public void equal(Blackhole bh) {
int[] as = fa.apply(size);
int[] bs = fb.apply(size);
boolean r = false;
+ for (int ic = 0; ic < INVOC_COUNT; ic++) {
+ r = false;
for (int i = 0; i < as.length; i++) {
boolean m = (as[i] == bs[i]);
r |= m; // accumulate so JIT can't eliminate the computation
}
+ }
! bh.consume(r);
}
@Benchmark
! public void notEqual(Blackhole bh) {
int[] as = fa.apply(size);
int[] bs = fb.apply(size);
boolean r = false;
+ for (int ic = 0; ic < INVOC_COUNT; ic++) {
+ r = false;
for (int i = 0; i < as.length; i++) {
boolean m = (as[i] != bs[i]);
r |= m; // accumulate so JIT can't eliminate the computation
}
+ }
! bh.consume(r);
}
@Benchmark
! public void lessThanEq(Blackhole bh) {
int[] as = fa.apply(size);
int[] bs = fb.apply(size);
boolean r = false;
+ for (int ic = 0; ic < INVOC_COUNT; ic++) {
+ r = false;
for (int i = 0; i < as.length; i++) {
boolean m = (as[i] <= bs[i]);
r |= m; // accumulate so JIT can't eliminate the computation
}
+ }
! bh.consume(r);
}
@Benchmark
! public void greaterThanEq(Blackhole bh) {
int[] as = fa.apply(size);
int[] bs = fb.apply(size);
boolean r = false;
+ for (int ic = 0; ic < INVOC_COUNT; ic++) {
+ r = false;
for (int i = 0; i < as.length; i++) {
boolean m = (as[i] >= bs[i]);
r |= m; // accumulate so JIT can't eliminate the computation
}
+ }
! bh.consume(r);
}
@Benchmark
! public void blend(Blackhole bh) {
int[] as = fa.apply(size);
int[] bs = fb.apply(size);
int[] rs = fr.apply(size);
boolean[] ms = fm.apply(size);
+ for (int ic = 0; ic < INVOC_COUNT; ic++) {
for (int i = 0; i < as.length; i++) {
int a = as[i];
int b = bs[i];
boolean m = ms[i % ms.length];
rs[i] = (m ? b : a);
}
+ }
! bh.consume(rs);
}
! void rearrangeShared(int window, Blackhole bh) {
int[] as = fa.apply(size);
int[] order = fs.apply(size);
int[] rs = fr.apply(size);
+ for (int ic = 0; ic < INVOC_COUNT; ic++) {
for (int i = 0; i < as.length; i += window) {
for (int j = 0; j < window; j++) {
int a = as[i+j];
int pos = order[j];
rs[i + pos] = a;
}
}
+ }
! bh.consume(rs);
}
@Benchmark
! public void rearrange064(Blackhole bh) {
int window = 64 / Integer.SIZE;
! rearrangeShared(window, bh);
}
@Benchmark
! public void rearrange128(Blackhole bh) {
int window = 128 / Integer.SIZE;
! rearrangeShared(window, bh);
}
@Benchmark
! public void rearrange256(Blackhole bh) {
int window = 256 / Integer.SIZE;
! rearrangeShared(window, bh);
}
@Benchmark
! public void rearrange512(Blackhole bh) {
int window = 512 / Integer.SIZE;
! rearrangeShared(window, bh);
}
*** 812,1016 ****
@Benchmark
! public Object neg() {
int[] as = fa.apply(size);
int[] rs = fr.apply(size);
for (int i = 0; i < as.length; i++) {
int a = as[i];
rs[i] = (int)(-((int)a));
}
! return rs;
}
@Benchmark
! public Object negMasked() {
int[] as = fa.apply(size);
int[] rs = fr.apply(size);
boolean[] ms = fm.apply(size);
for (int i = 0; i < as.length; i++) {
int a = as[i];
boolean m = ms[i % ms.length];
rs[i] = (m ? (int)(-((int)a)) : a);
}
! return rs;
}
@Benchmark
! public Object abs() {
int[] as = fa.apply(size);
int[] rs = fr.apply(size);
for (int i = 0; i < as.length; i++) {
int a = as[i];
rs[i] = (int)(Math.abs((int)a));
}
! return rs;
}
@Benchmark
! public Object absMasked() {
int[] as = fa.apply(size);
int[] rs = fr.apply(size);
boolean[] ms = fm.apply(size);
for (int i = 0; i < as.length; i++) {
int a = as[i];
boolean m = ms[i % ms.length];
rs[i] = (m ? (int)(Math.abs((int)a)) : a);
}
! return rs;
}
@Benchmark
! public Object not() {
int[] as = fa.apply(size);
int[] rs = fr.apply(size);
for (int i = 0; i < as.length; i++) {
int a = as[i];
rs[i] = (int)(~((int)a));
}
! return rs;
}
@Benchmark
! public Object notMasked() {
int[] as = fa.apply(size);
int[] rs = fr.apply(size);
boolean[] ms = fm.apply(size);
for (int i = 0; i < as.length; i++) {
int a = as[i];
boolean m = ms[i % ms.length];
rs[i] = (m ? (int)(~((int)a)) : a);
}
! return rs;
}
@Benchmark
! public Object gatherBase0() {
int[] as = fa.apply(size);
int[] is = fs.apply(size);
int[] rs = fr.apply(size);
for (int i = 0; i < as.length; i++) {
int ix = 0 + is[i];
rs[i] = as[ix];
}
! return rs;
}
! Object gather(int window) {
int[] as = fa.apply(size);
int[] is = fs.apply(size);
int[] rs = fr.apply(size);
for (int i = 0; i < as.length; i += window) {
for (int j = 0; j < window; j++) {
int ix = i + is[i + j];
rs[i + j] = as[ix];
}
}
! return rs;
}
@Benchmark
! public Object gather064() {
int window = 64 / Integer.SIZE;
! return gather(window);
}
@Benchmark
! public Object gather128() {
int window = 128 / Integer.SIZE;
! return gather(window);
}
@Benchmark
! public Object gather256() {
int window = 256 / Integer.SIZE;
! return gather(window);
}
@Benchmark
! public Object gather512() {
int window = 512 / Integer.SIZE;
! return gather(window);
}
@Benchmark
! public Object scatterBase0() {
int[] as = fa.apply(size);
int[] is = fs.apply(size);
int[] rs = fr.apply(size);
for (int i = 0; i < as.length; i++) {
int ix = 0 + is[i];
rs[ix] = as[i];
}
! return rs;
}
! Object scatter(int window) {
int[] as = fa.apply(size);
int[] is = fs.apply(size);
int[] rs = fr.apply(size);
for (int i = 0; i < as.length; i += window) {
for (int j = 0; j < window; j++) {
int ix = i + is[i + j];
rs[ix] = as[i + j];
}
}
! return rs;
}
@Benchmark
! public Object scatter064() {
int window = 64 / Integer.SIZE;
! return scatter(window);
}
@Benchmark
! public Object scatter128() {
int window = 128 / Integer.SIZE;
! return scatter(window);
}
@Benchmark
! public Object scatter256() {
int window = 256 / Integer.SIZE;
! return scatter(window);
}
@Benchmark
! public Object scatter512() {
int window = 512 / Integer.SIZE;
! return scatter(window);
}
}
--- 916,1140 ----
@Benchmark
! public void neg(Blackhole bh) {
int[] as = fa.apply(size);
int[] rs = fr.apply(size);
+ for (int ic = 0; ic < INVOC_COUNT; ic++) {
for (int i = 0; i < as.length; i++) {
int a = as[i];
rs[i] = (int)(-((int)a));
}
+ }
! bh.consume(rs);
}
@Benchmark
! public void negMasked(Blackhole bh) {
int[] as = fa.apply(size);
int[] rs = fr.apply(size);
boolean[] ms = fm.apply(size);
+ for (int ic = 0; ic < INVOC_COUNT; ic++) {
for (int i = 0; i < as.length; i++) {
int a = as[i];
boolean m = ms[i % ms.length];
rs[i] = (m ? (int)(-((int)a)) : a);
}
+ }
! bh.consume(rs);
}
@Benchmark
! public void abs(Blackhole bh) {
int[] as = fa.apply(size);
int[] rs = fr.apply(size);
+ for (int ic = 0; ic < INVOC_COUNT; ic++) {
for (int i = 0; i < as.length; i++) {
int a = as[i];
rs[i] = (int)(Math.abs((int)a));
}
+ }
! bh.consume(rs);
}
@Benchmark
! public void absMasked(Blackhole bh) {
int[] as = fa.apply(size);
int[] rs = fr.apply(size);
boolean[] ms = fm.apply(size);
+ for (int ic = 0; ic < INVOC_COUNT; ic++) {
for (int i = 0; i < as.length; i++) {
int a = as[i];
boolean m = ms[i % ms.length];
rs[i] = (m ? (int)(Math.abs((int)a)) : a);
}
+ }
! bh.consume(rs);
}
@Benchmark
! public void not(Blackhole bh) {
int[] as = fa.apply(size);
int[] rs = fr.apply(size);
+ for (int ic = 0; ic < INVOC_COUNT; ic++) {
for (int i = 0; i < as.length; i++) {
int a = as[i];
rs[i] = (int)(~((int)a));
}
+ }
! bh.consume(rs);
}
@Benchmark
! public void notMasked(Blackhole bh) {
int[] as = fa.apply(size);
int[] rs = fr.apply(size);
boolean[] ms = fm.apply(size);
+ for (int ic = 0; ic < INVOC_COUNT; ic++) {
for (int i = 0; i < as.length; i++) {
int a = as[i];
boolean m = ms[i % ms.length];
rs[i] = (m ? (int)(~((int)a)) : a);
}
+ }
! bh.consume(rs);
}
@Benchmark
! public void gatherBase0(Blackhole bh) {
int[] as = fa.apply(size);
int[] is = fs.apply(size);
int[] rs = fr.apply(size);
+ for (int ic = 0; ic < INVOC_COUNT; ic++) {
for (int i = 0; i < as.length; i++) {
int ix = 0 + is[i];
rs[i] = as[ix];
}
+ }
! bh.consume(rs);
}
! void gather(int window, Blackhole bh) {
int[] as = fa.apply(size);
int[] is = fs.apply(size);
int[] rs = fr.apply(size);
+ for (int ic = 0; ic < INVOC_COUNT; ic++) {
for (int i = 0; i < as.length; i += window) {
for (int j = 0; j < window; j++) {
int ix = i + is[i + j];
rs[i + j] = as[ix];
}
}
+ }
! bh.consume(rs);
}
@Benchmark
! public void gather064(Blackhole bh) {
int window = 64 / Integer.SIZE;
! gather(window, bh);
}
@Benchmark
! public void gather128(Blackhole bh) {
int window = 128 / Integer.SIZE;
! gather(window, bh);
}
@Benchmark
! public void gather256(Blackhole bh) {
int window = 256 / Integer.SIZE;
! gather(window, bh);
}
@Benchmark
! public void gather512(Blackhole bh) {
int window = 512 / Integer.SIZE;
! gather(window, bh);
}
@Benchmark
! public void scatterBase0(Blackhole bh) {
int[] as = fa.apply(size);
int[] is = fs.apply(size);
int[] rs = fr.apply(size);
+ for (int ic = 0; ic < INVOC_COUNT; ic++) {
for (int i = 0; i < as.length; i++) {
int ix = 0 + is[i];
rs[ix] = as[i];
}
+ }
! bh.consume(rs);
}
! void scatter(int window, Blackhole bh) {
int[] as = fa.apply(size);
int[] is = fs.apply(size);
int[] rs = fr.apply(size);
+ for (int ic = 0; ic < INVOC_COUNT; ic++) {
for (int i = 0; i < as.length; i += window) {
for (int j = 0; j < window; j++) {
int ix = i + is[i + j];
rs[ix] = as[i + j];
}
}
+ }
! bh.consume(rs);
}
@Benchmark
! public void scatter064(Blackhole bh) {
int window = 64 / Integer.SIZE;
! scatter(window, bh);
}
@Benchmark
! public void scatter128(Blackhole bh) {
int window = 128 / Integer.SIZE;
! scatter(window, bh);
}
@Benchmark
! public void scatter256(Blackhole bh) {
int window = 256 / Integer.SIZE;
! scatter(window, bh);
}
@Benchmark
! public void scatter512(Blackhole bh) {
int window = 512 / Integer.SIZE;
! scatter(window, bh);
}
}
< prev index next >