/* * 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 SimdLong { static long[] a; // // Arithmetic operations. // /// CHECK-START: void SimdLong.add(long) loop_optimization (before) /// CHECK-DAG: ArrayGet loop:<> outer_loop:none /// CHECK-DAG: ArraySet loop:<> outer_loop:none // /// CHECK-START-ARM64: void SimdLong.add(long) loop_optimization (after) /// CHECK-DAG: VecLoad loop:<> outer_loop:none /// CHECK-DAG: VecAdd loop:<> outer_loop:none /// CHECK-DAG: VecStore loop:<> outer_loop:none static void add(long x) { for (int i = 0; i < 128; i++) a[i] += x; } /// CHECK-START: void SimdLong.sub(long) loop_optimization (before) /// CHECK-DAG: ArrayGet loop:<> outer_loop:none /// CHECK-DAG: ArraySet loop:<> outer_loop:none // /// CHECK-START-ARM64: void SimdLong.sub(long) loop_optimization (after) /// CHECK-DAG: VecLoad loop:<> outer_loop:none /// CHECK-DAG: VecSub loop:<> outer_loop:none /// CHECK-DAG: VecStore loop:<> outer_loop:none static void sub(long x) { for (int i = 0; i < 128; i++) a[i] -= x; } /// CHECK-START: void SimdLong.mul(long) loop_optimization (before) /// CHECK-DAG: ArrayGet loop:<> outer_loop:none /// CHECK-DAG: ArraySet loop:<> outer_loop:none // // Not directly supported for longs. // /// CHECK-START-ARM64: void SimdLong.mul(long) loop_optimization (after) /// CHECK-NOT: VecMul static void mul(long x) { for (int i = 0; i < 128; i++) a[i] *= x; } /// CHECK-START: void SimdLong.div(long) loop_optimization (before) /// CHECK-DAG: ArrayGet loop:<> outer_loop:none /// CHECK-DAG: ArraySet loop:<> outer_loop:none // /// CHECK-START: void SimdLong.div(long) loop_optimization (after) /// CHECK-NOT: VecDiv // // Not supported on any architecture. // static void div(long x) { for (int i = 0; i < 128; i++) a[i] /= x; } /// CHECK-START: void SimdLong.neg() loop_optimization (before) /// CHECK-DAG: ArrayGet loop:<> outer_loop:none /// CHECK-DAG: ArraySet loop:<> outer_loop:none // /// CHECK-START-ARM64: void SimdLong.neg() loop_optimization (after) /// CHECK-DAG: VecLoad loop:<> outer_loop:none /// CHECK-DAG: VecNeg loop:<> outer_loop:none /// CHECK-DAG: VecStore loop:<> outer_loop:none static void neg() { for (int i = 0; i < 128; i++) a[i] = -a[i]; } /// CHECK-START: void SimdLong.not() loop_optimization (before) /// CHECK-DAG: ArrayGet loop:<> outer_loop:none /// CHECK-DAG: ArraySet loop:<> outer_loop:none // /// CHECK-START-ARM64: void SimdLong.not() loop_optimization (after) /// CHECK-DAG: VecLoad loop:<> outer_loop:none /// CHECK-DAG: VecNot loop:<> outer_loop:none /// CHECK-DAG: VecStore loop:<> outer_loop:none static void not() { for (int i = 0; i < 128; i++) a[i] = ~a[i]; } /// CHECK-START: void SimdLong.shl4() loop_optimization (before) /// CHECK-DAG: ArrayGet loop:<> outer_loop:none /// CHECK-DAG: ArraySet loop:<> outer_loop:none // /// CHECK-START-ARM64: void SimdLong.shl4() loop_optimization (after) /// CHECK-DAG: VecLoad loop:<> outer_loop:none /// CHECK-DAG: VecShl loop:<> outer_loop:none /// CHECK-DAG: VecStore loop:<> outer_loop:none static void shl4() { for (int i = 0; i < 128; i++) a[i] <<= 4; } /// CHECK-START: void SimdLong.sar2() loop_optimization (before) /// CHECK-DAG: ArrayGet loop:<> outer_loop:none /// CHECK-DAG: ArraySet loop:<> outer_loop:none // /// CHECK-START-ARM64: void SimdLong.sar2() loop_optimization (after) /// CHECK-DAG: VecLoad loop:<> outer_loop:none /// CHECK-DAG: VecShr loop:<> outer_loop:none /// CHECK-DAG: VecStore loop:<> outer_loop:none static void sar2() { for (int i = 0; i < 128; i++) a[i] >>= 2; } /// CHECK-START: void SimdLong.shr2() loop_optimization (before) /// CHECK-DAG: ArrayGet loop:<> outer_loop:none /// CHECK-DAG: ArraySet loop:<> outer_loop:none // /// CHECK-START-ARM64: void SimdLong.shr2() loop_optimization (after) /// CHECK-DAG: VecLoad loop:<> outer_loop:none /// CHECK-DAG: VecUShr loop:<> outer_loop:none /// CHECK-DAG: VecStore loop:<> outer_loop:none static void shr2() { for (int i = 0; i < 128; i++) a[i] >>>= 2; } // // Shift checks. // // Expose constants to optimizing compiler, but not to front-end. public static int $opt$inline$IntConstant64() { return 64; } public static int $opt$inline$IntConstant65() { return 65; } public static int $opt$inline$IntConstantMinus254() { return -254; } /// CHECK-START: void SimdLong.shr64() instruction_simplifier$after_inlining (before) /// CHECK-DAG: <> IntConstant 64 loop:none /// CHECK-DAG: <> ArrayGet loop:<> outer_loop:none /// CHECK-DAG: <> UShr [<>,<>] loop:<> outer_loop:none /// CHECK-DAG: ArraySet [{{l\d+}},{{i\d+}},<>] loop:<> outer_loop:none // /// CHECK-START: void SimdLong.shr64() instruction_simplifier$after_inlining (after) /// CHECK-DAG: <> ArrayGet loop:<> outer_loop:none /// CHECK-DAG: ArraySet [{{l\d+}},{{i\d+}},<>] loop:<> outer_loop:none // /// CHECK-START-ARM64: void SimdLong.shr64() loop_optimization (after) /// CHECK-DAG: <> VecLoad loop:<> outer_loop:none /// CHECK-DAG: VecStore [{{l\d+}},{{i\d+}},<>] loop:<> outer_loop:none static void shr64() { // TODO: remove a[i] = a[i] altogether? for (int i = 0; i < 128; i++) a[i] >>>= $opt$inline$IntConstant64(); // 0, since & 63 } /// CHECK-START: void SimdLong.shr65() instruction_simplifier$after_inlining (before) /// CHECK-DAG: <> IntConstant 65 loop:none /// CHECK-DAG: <> ArrayGet loop:<> outer_loop:none /// CHECK-DAG: <> UShr [<>,<>] loop:<> outer_loop:none /// CHECK-DAG: ArraySet [{{l\d+}},{{i\d+}},<>] loop:<> outer_loop:none // /// CHECK-START: void SimdLong.shr65() instruction_simplifier$after_inlining (after) /// CHECK-DAG: <> IntConstant 1 loop:none /// CHECK-DAG: <> ArrayGet loop:<> outer_loop:none /// CHECK-DAG: <> UShr [<>,<>] loop:<> outer_loop:none /// CHECK-DAG: ArraySet [{{l\d+}},{{i\d+}},<>] loop:<> outer_loop:none // /// CHECK-START-ARM64: void SimdLong.shr65() loop_optimization (after) /// CHECK-DAG: <> IntConstant 1 loop:none /// CHECK-DAG: <> VecLoad loop:<> outer_loop:none /// CHECK-DAG: <> VecUShr [<>,<>] loop:<> outer_loop:none /// CHECK-DAG: VecStore [{{l\d+}},{{i\d+}},<>] loop:<> outer_loop:none static void shr65() { for (int i = 0; i < 128; i++) a[i] >>>= $opt$inline$IntConstant65(); // 1, since & 63 } /// CHECK-START: void SimdLong.shrMinus254() instruction_simplifier$after_inlining (before) /// CHECK-DAG: <> IntConstant -254 loop:none /// CHECK-DAG: <> ArrayGet loop:<> outer_loop:none /// CHECK-DAG: <> UShr [<>,<>] loop:<> outer_loop:none /// CHECK-DAG: ArraySet [{{l\d+}},{{i\d+}},<>] loop:<> outer_loop:none // /// CHECK-START: void SimdLong.shrMinus254() instruction_simplifier$after_inlining (after) /// CHECK-DAG: <> IntConstant 2 loop:none /// CHECK-DAG: <> ArrayGet loop:<> outer_loop:none /// CHECK-DAG: <> UShr [<>,<>] loop:<> outer_loop:none /// CHECK-DAG: ArraySet [{{l\d+}},{{i\d+}},<>] loop:<> outer_loop:none // /// CHECK-START-ARM64: void SimdLong.shrMinus254() loop_optimization (after) /// CHECK-DAG: <> IntConstant 2 loop:none /// CHECK-DAG: <> VecLoad loop:<> outer_loop:none /// CHECK-DAG: <> VecUShr [<>,<>] loop:<> outer_loop:none /// CHECK-DAG: VecStore [{{l\d+}},{{i\d+}},<>] loop:<> outer_loop:none static void shrMinus254() { for (int i = 0; i < 128; i++) a[i] >>>= $opt$inline$IntConstantMinus254(); // 2, since & 63 } // // Loop bounds. // static void bounds() { for (int i = 1; i < 127; i++) a[i] += 11; } // // Test Driver. // public static void main() { // Set up. a = new long[128]; for (int i = 0; i < 128; i++) { a[i] = i; } // Arithmetic operations. add(2L); for (int i = 0; i < 128; i++) { expectEquals(i + 2, a[i], "add"); } sub(2L); for (int i = 0; i < 128; i++) { expectEquals(i, a[i], "sub"); } mul(2L); for (int i = 0; i < 128; i++) { expectEquals(i + i, a[i], "mul"); } div(2L); 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. bounds(); 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] = 0xffffffffffffffffL; } shl4(); for (int i = 0; i < 128; i++) { expectEquals(0xfffffffffffffff0L, a[i], "shl4"); } sar2(); for (int i = 0; i < 128; i++) { expectEquals(0xfffffffffffffffcL, a[i], "sar2"); } shr2(); for (int i = 0; i < 128; i++) { expectEquals(0x3fffffffffffffffL, a[i], "shr2"); } shr64(); for (int i = 0; i < 128; i++) { expectEquals(0x3fffffffffffffffL, a[i], "shr64"); } shr65(); for (int i = 0; i < 128; i++) { expectEquals(0x1fffffffffffffffL, a[i], "shr65"); } shrMinus254(); for (int i = 0; i < 128; i++) { expectEquals(0x07ffffffffffffffL, a[i], "shrMinus254"); } // Bit-wise not operator. not(); for (int i = 0; i < 128; i++) { expectEquals(0xf800000000000000L, a[i], "not"); } // Done. System.out.println("SimdLong passed"); } private static void expectEquals(long expected, long result, String action) { if (expected != result) { throw new Error("Expected: " + expected + ", found: " + result + " for " + action); } } }