/*
* 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 . Note that this class provides a mere
* functional test , not a precise numerical verifier .
*/
public class SimdDouble {
static double [] a;
//
// Arithmetic operations.
//
/// CHECK-START: void SimdDouble.add(double) loop_optimization (before)
/// CHECK-DAG: ArrayGet loop:<<Loop:B\d+>> outer_loop:none
/// CHECK-DAG: ArraySet loop:<<Loop>> outer_loop:none
//
/// CHECK-START-ARM64: void SimdDouble.add(double) 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(double x) {
for (int i = 0 ; i < 128 ; i++)
a[i] += x;
}
/// CHECK-START: void SimdDouble.sub(double) loop_optimization (before)
/// CHECK-DAG: ArrayGet loop:<<Loop:B\d+>> outer_loop:none
/// CHECK-DAG: ArraySet loop:<<Loop>> outer_loop:none
//
/// CHECK-START-ARM64: void SimdDouble.sub(double) 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(double x) {
for (int i = 0 ; i < 128 ; i++)
a[i] -= x;
}
/// CHECK-START: void SimdDouble.mul(double) loop_optimization (before)
/// CHECK-DAG: ArrayGet loop:<<Loop:B\d+>> outer_loop:none
/// CHECK-DAG: ArraySet loop:<<Loop>> outer_loop:none
//
/// CHECK-START-ARM64: void SimdDouble.mul(double) 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(double x) {
for (int i = 0 ; i < 128 ; i++)
a[i] *= x;
}
/// CHECK-START: void SimdDouble.div(double) loop_optimization (before)
/// CHECK-DAG: ArrayGet loop:<<Loop:B\d+>> outer_loop:none
/// CHECK-DAG: ArraySet loop:<<Loop>> outer_loop:none
//
/// CHECK-START-ARM64: void SimdDouble.div(double) loop_optimization (after)
/// CHECK-DAG: VecLoad loop:<<Loop:B\d+>> outer_loop:none
/// CHECK-DAG: VecDiv loop:<<Loop>> outer_loop:none
/// CHECK-DAG: VecStore loop:<<Loop>> outer_loop:none
static void div(double x) {
for (int i = 0 ; i < 128 ; i++)
a[i] /= x;
}
/// CHECK-START: void SimdDouble.neg() loop_optimization (before)
/// CHECK-DAG: ArrayGet loop:<<Loop:B\d+>> outer_loop:none
/// CHECK-DAG: ArraySet loop:<<Loop>> outer_loop:none
//
/// CHECK-START-ARM64: void SimdDouble.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] = -a[i];
}
/// CHECK-START: void SimdDouble.abs() loop_optimization (before)
/// CHECK-DAG: ArrayGet loop:<<Loop:B\d+>> outer_loop:none
/// CHECK-DAG: ArraySet loop:<<Loop>> outer_loop:none
//
/// CHECK-START-ARM64: void SimdDouble.abs() loop_optimization (after)
/// CHECK-DAG: VecLoad loop:<<Loop:B\d+>> outer_loop:none
/// CHECK-DAG: VecAbs loop:<<Loop>> outer_loop:none
/// CHECK-DAG: VecStore loop:<<Loop>> outer_loop:none
static void abs() {
for (int i = 0 ; i < 128 ; i++)
a[i] = Math.abs(a[i]);
}
/// CHECK-START: void SimdDouble.conv(long[]) loop_optimization (before)
/// CHECK-DAG: ArrayGet loop:<<Loop:B\d+>> outer_loop:none
/// CHECK-DAG: ArraySet loop:<<Loop>> outer_loop:none
//
/// CHECK-START: void SimdDouble.conv(long[]) loop_optimization (after)
/// CHECK-NOT: VecLoad
/// CHECK-NOT: VecStore
//
// TODO: fill in when long2double is supported
static void conv(long [] b) {
for (int i = 0 ; i < 128 ; i++)
a[i] = b[i];
}
//
// 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 double [128 ];
for (int i = 0 ; i < 128 ; i++) {
a[i] = i;
}
// Arithmetic operations.
add(2 .0 );
for (int i = 0 ; i < 128 ; i++) {
expectEquals(i + 2 , a[i], "add" );
}
sub(2 .0 );
for (int i = 0 ; i < 128 ; i++) {
expectEquals(i, a[i], "sub" );
}
mul(2 .0 );
for (int i = 0 ; i < 128 ; i++) {
expectEquals(i + i, a[i], "mul" );
}
div(2 .0 );
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" );
// Abs.
abs();
expectEquals(0 , a[0 ], "abs0" );
for (int i = 1 ; i <= 11 ; i++) {
expectEquals(11 - i, a[i], "abs_lo" );
}
for (int i = 12 ; i < 127 ; i++) {
expectEquals(i - 11 , a[i], "abs_hi" );
}
expectEquals(127 , a[127 ], "abs127" );
// Conversion.
long [] b = new long [128 ];
for (int i = 0 ; i < 128 ; i++) {
b[i] = 1000 * i;
}
conv(b);
for (int i = 1 ; i < 127 ; i++) {
expectEquals(1000 .0 * i, a[i], "conv" );
}
// Done.
System.out.println("SimdDouble passed" );
}
private static void expectEquals(double expected, double result, String action) {
if (expected != result) {
throw new Error("Expected: " + expected + ", found: " + result + " for " + action);
}
}
}
Messung V0.5 in Prozent C=81 H=81 G=80
¤ Dauer der Verarbeitung: 0.12 Sekunden
(vorverarbeitet am 2026-06-29)
¤
*© Formatika GbR, Deutschland