blob: 6fec754a5fcea42b663be07ad0334dfb82e91c2b [file] [log] [blame]
/*
* Copyright (C) 2017 The Android Open Source Project
*
* Licensed 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.
*/
/**
* Functional tests for SIMD vectorization.
*/
public class SimdShort {
static short[] a;
//
// Arithmetic operations.
//
/// CHECK-START: void SimdShort.add(int) loop_optimization (before)
/// CHECK-DAG: ArrayGet loop:<<Loop:B\d+>> outer_loop:none
/// CHECK-DAG: ArraySet loop:<<Loop>> outer_loop:none
//
/// CHECK-START-{ARM,ARM64}: void SimdShort.add(int) loop_optimization (after)
/// CHECK-DAG: VecLoad loop:<<Loop:B\d+>> outer_loop:none
/// CHECK-DAG: VecAdd loop:<<Loop>> outer_loop:none
/// CHECK-DAG: VecStore loop:<<Loop>> outer_loop:none
static void add(int x) {
for (int i = 0; i < 128; i++)
a[i] += x;
}
/// CHECK-START: void SimdShort.sub(int) loop_optimization (before)
/// CHECK-DAG: ArrayGet loop:<<Loop:B\d+>> outer_loop:none
/// CHECK-DAG: ArraySet loop:<<Loop>> outer_loop:none
//
/// CHECK-START-{ARM,ARM64}: void SimdShort.sub(int) loop_optimization (after)
/// CHECK-DAG: VecLoad loop:<<Loop:B\d+>> outer_loop:none
/// CHECK-DAG: VecSub loop:<<Loop>> outer_loop:none
/// CHECK-DAG: VecStore loop:<<Loop>> outer_loop:none
static void sub(int x) {
for (int i = 0; i < 128; i++)
a[i] -= x;
}
/// CHECK-START: void SimdShort.mul(int) loop_optimization (before)
/// CHECK-DAG: ArrayGet loop:<<Loop:B\d+>> outer_loop:none
/// CHECK-DAG: ArraySet loop:<<Loop>> outer_loop:none
//
/// CHECK-START-{ARM,ARM64}: void SimdShort.mul(int) loop_optimization (after)
/// CHECK-DAG: VecLoad loop:<<Loop:B\d+>> outer_loop:none
/// CHECK-DAG: VecMul loop:<<Loop>> outer_loop:none
/// CHECK-DAG: VecStore loop:<<Loop>> outer_loop:none
static void mul(int x) {
for (int i = 0; i < 128; i++)
a[i] *= x;
}
/// CHECK-START: void SimdShort.div(int) loop_optimization (before)
/// CHECK-DAG: ArrayGet loop:<<Loop:B\d+>> outer_loop:none
/// CHECK-DAG: ArraySet loop:<<Loop>> outer_loop:none
//
/// CHECK-START: void SimdShort.div(int) loop_optimization (after)
/// CHECK-NOT: VecDiv
//
// Not supported on any architecture.
//
static void div(int x) {
for (int i = 0; i < 128; i++)
a[i] /= x;
}
/// CHECK-START: void SimdShort.neg() loop_optimization (before)
/// CHECK-DAG: ArrayGet loop:<<Loop:B\d+>> outer_loop:none
/// CHECK-DAG: ArraySet loop:<<Loop>> outer_loop:none
//
/// CHECK-START-{ARM,ARM64}: void SimdShort.neg() loop_optimization (after)
/// CHECK-DAG: VecLoad loop:<<Loop:B\d+>> outer_loop:none
/// CHECK-DAG: VecNeg loop:<<Loop>> outer_loop:none
/// CHECK-DAG: VecStore loop:<<Loop>> outer_loop:none
static void neg() {
for (int i = 0; i < 128; i++)
a[i] = (short) -a[i];
}
/// CHECK-START: void SimdShort.not() loop_optimization (before)
/// CHECK-DAG: ArrayGet loop:<<Loop:B\d+>> outer_loop:none
/// CHECK-DAG: ArraySet loop:<<Loop>> outer_loop:none
//
/// CHECK-START-{ARM,ARM64}: void SimdShort.not() loop_optimization (after)
/// CHECK-DAG: VecLoad loop:<<Loop:B\d+>> outer_loop:none
/// CHECK-DAG: VecNot loop:<<Loop>> outer_loop:none
/// CHECK-DAG: VecStore loop:<<Loop>> outer_loop:none
static void not() {
for (int i = 0; i < 128; i++)
a[i] = (short) ~a[i];
}
/// CHECK-START: void SimdShort.shl4() loop_optimization (before)
/// CHECK-DAG: ArrayGet loop:<<Loop:B\d+>> outer_loop:none
/// CHECK-DAG: ArraySet loop:<<Loop>> outer_loop:none
//
/// CHECK-START-{ARM,ARM64}: void SimdShort.shl4() loop_optimization (after)
/// CHECK-DAG: VecLoad loop:<<Loop:B\d+>> outer_loop:none
/// CHECK-DAG: VecShl loop:<<Loop>> outer_loop:none
/// CHECK-DAG: VecStore loop:<<Loop>> outer_loop:none
static void shl4() {
for (int i = 0; i < 128; i++)
a[i] <<= 4;
}
/// CHECK-START: void SimdShort.sar2() loop_optimization (before)
/// CHECK-DAG: ArrayGet loop:<<Loop:B\d+>> outer_loop:none
/// CHECK-DAG: ArraySet loop:<<Loop>> outer_loop:none
//
/// CHECK-START-{ARM,ARM64}: void SimdShort.sar2() loop_optimization (after)
/// CHECK-DAG: VecLoad loop:<<Loop:B\d+>> outer_loop:none
/// CHECK-DAG: VecShr loop:<<Loop>> outer_loop:none
/// CHECK-DAG: VecStore loop:<<Loop>> outer_loop:none
static void sar2() {
for (int i = 0; i < 128; i++)
a[i] >>= 2;
}
/// CHECK-START: void SimdShort.shr2() loop_optimization (before)
/// CHECK-DAG: ArrayGet loop:<<Loop:B\d+>> outer_loop:none
/// CHECK-DAG: ArraySet loop:<<Loop>> outer_loop:none
//
// TODO: would need signess flip.
/// CHECK-START: void SimdShort.shr2() loop_optimization (after)
/// CHECK-NOT: VecUShr
static void shr2() {
for (int i = 0; i < 128; i++)
a[i] >>>= 2;
}
//
// Shift checks.
//
static void sar31() {
for (int i = 0; i < 128; i++)
a[i] >>= 31;
}
static void shr31() {
for (int i = 0; i < 128; i++)
a[i] >>>= 31;
}
static void shr32() {
for (int i = 0; i < 128; i++)
a[i] >>>= 32; // 0, since & 31
}
static void shr33() {
for (int i = 0; i < 128; i++)
a[i] >>>= 33; // 1, since & 31
}
//
// Loop bounds.
//
static void add() {
for (int i = 1; i < 127; i++)
a[i] += 11;
}
//
// Test Driver.
//
public static void main() {
// Set up.
a = new short[128];
for (int i = 0; i < 128; i++) {
a[i] = (short) i;
}
// Arithmetic operations.
add(2);
for (int i = 0; i < 128; i++) {
expectEquals(i + 2, a[i], "add");
}
sub(2);
for (int i = 0; i < 128; i++) {
expectEquals(i, a[i], "sub");
}
mul(2);
for (int i = 0; i < 128; i++) {
expectEquals(i + i, a[i], "mul");
}
div(2);
for (int i = 0; i < 128; i++) {
expectEquals(i, a[i], "div");
}
neg();
for (int i = 0; i < 128; i++) {
expectEquals(-i, a[i], "neg");
}
// Loop bounds.
add();
expectEquals(0, a[0], "bounds0");
for (int i = 1; i < 127; i++) {
expectEquals(11 - i, a[i], "bounds");
}
expectEquals(-127, a[127], "bounds127");
// Shifts.
for (int i = 0; i < 128; i++) {
a[i] = (short) 0xffff;
}
shl4();
for (int i = 0; i < 128; i++) {
expectEquals((short) 0xfff0, a[i], "shl4");
}
sar2();
for (int i = 0; i < 128; i++) {
expectEquals((short) 0xfffc, a[i], "sar2");
}
shr2();
for (int i = 0; i < 128; i++) {
expectEquals((short) 0xffff, a[i], "shr2"); // sic!
}
sar31();
for (int i = 0; i < 128; i++) {
expectEquals((short) 0xffff, a[i], "sar31");
}
shr31();
for (int i = 0; i < 128; i++) {
expectEquals(0x0001, a[i], "shr31");
a[i] = (short) 0x1200; // reset
}
shr32();
for (int i = 0; i < 128; i++) {
expectEquals((short) 0x1200, a[i], "shr32");
}
shr33();
for (int i = 0; i < 128; i++) {
expectEquals((short) 0x0900, a[i], "shr33");
a[i] = (short) 0xf0f1; // reset
}
not();
for (int i = 0; i < 128; i++) {
expectEquals((short) 0x0f0e, a[i], "not");
}
// Done.
System.out.println("SimdShort passed");
}
private static void expectEquals(int expected, int result, String action) {
if (expected != result) {
throw new Error("Expected: " + expected + ", found: " + result + " for " + action);
}
}
}