| /* |
| * 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. |
| */ |
| |
| /** |
| * Tests for SAD (sum of absolute differences). |
| */ |
| public class SimdSadShort { |
| |
| private static int $inline$seven() { |
| return 7; |
| } |
| |
| // TODO: lower precision still coming, b/64091002 |
| |
| private static short sadShort2Short(short[] s1, short[] s2) { |
| int min_length = Math.min(s1.length, s2.length); |
| short sad = 0; |
| for (int i = 0; i < min_length; i++) { |
| sad += Math.abs(s1[i] - s2[i]); |
| } |
| return sad; |
| } |
| |
| private static short sadShort2ShortAlt(short[] s1, short[] s2) { |
| int min_length = Math.min(s1.length, s2.length); |
| short sad = 0; |
| for (int i = 0; i < min_length; i++) { |
| short s = s1[i]; |
| short p = s2[i]; |
| sad += s >= p ? s - p : p - s; |
| } |
| return sad; |
| } |
| |
| private static short sadShort2ShortAlt2(short[] s1, short[] s2) { |
| int min_length = Math.min(s1.length, s2.length); |
| short sad = 0; |
| for (int i = 0; i < min_length; i++) { |
| short s = s1[i]; |
| short p = s2[i]; |
| int x = s - p; |
| if (x < 0) x = -x; |
| sad += x; |
| } |
| return sad; |
| } |
| |
| /// CHECK-START: int SimdSadShort.sadShort2Int(short[], short[]) loop_optimization (before) |
| /// CHECK-DAG: <<Cons0:i\d+>> IntConstant 0 loop:none |
| /// CHECK-DAG: <<Cons1:i\d+>> IntConstant 1 loop:none |
| /// CHECK-DAG: <<Phi2:i\d+>> Phi [<<Cons0>>,{{i\d+}}] loop:<<Loop:B\d+>> outer_loop:none |
| /// CHECK-DAG: <<Phi1:i\d+>> Phi [<<Cons0>>,{{i\d+}}] loop:<<Loop>> outer_loop:none |
| /// CHECK-DAG: <<Get1:s\d+>> ArrayGet [{{l\d+}},<<Phi1>>] loop:<<Loop>> outer_loop:none |
| /// CHECK-DAG: <<Get2:s\d+>> ArrayGet [{{l\d+}},<<Phi1>>] loop:<<Loop>> outer_loop:none |
| /// CHECK-DAG: <<Sub:i\d+>> Sub [<<Get1>>,<<Get2>>] loop:<<Loop>> outer_loop:none |
| /// CHECK-DAG: <<Intrin:i\d+>> Abs [<<Sub>>] loop:<<Loop>> outer_loop:none |
| /// CHECK-DAG: Add [<<Phi2>>,<<Intrin>>] loop:<<Loop>> outer_loop:none |
| /// CHECK-DAG: Add [<<Phi1>>,<<Cons1>>] loop:<<Loop>> outer_loop:none |
| // |
| /// CHECK-START-ARM64: int SimdSadShort.sadShort2Int(short[], short[]) loop_optimization (after) |
| /// CHECK-DAG: <<Cons0:i\d+>> IntConstant 0 loop:none |
| /// CHECK-IF: hasIsaFeature("sve") |
| // |
| // SAD idiom is not supported for SVE. |
| /// CHECK-NOT: VecSADAccumulate |
| // |
| /// CHECK-ELSE: |
| // |
| /// CHECK-DAG: <<Cons8:i\d+>> IntConstant 8 loop:none |
| /// CHECK-DAG: <<Set:d\d+>> VecSetScalars [<<Cons0>>] loop:none |
| /// CHECK-DAG: <<Phi1:i\d+>> Phi [<<Cons0>>,{{i\d+}}] loop:<<Loop:B\d+>> outer_loop:none |
| /// CHECK-DAG: <<Phi2:d\d+>> Phi [<<Set>>,{{d\d+}}] loop:<<Loop>> outer_loop:none |
| /// CHECK-DAG: <<Load1:d\d+>> VecLoad [{{l\d+}},<<Phi1>>] loop:<<Loop>> outer_loop:none |
| /// CHECK-DAG: <<Load2:d\d+>> VecLoad [{{l\d+}},<<Phi1>>] loop:<<Loop>> outer_loop:none |
| /// CHECK-DAG: <<SAD:d\d+>> VecSADAccumulate [<<Phi2>>,<<Load1>>,<<Load2>>] loop:<<Loop>> outer_loop:none |
| /// CHECK-DAG: Add [<<Phi1>>,<<Cons8>>] loop:<<Loop>> outer_loop:none |
| // |
| /// CHECK-FI: |
| private static int sadShort2Int(short[] s1, short[] s2) { |
| int min_length = Math.min(s1.length, s2.length); |
| int sad = 0; |
| for (int i = 0; i < min_length; i++) { |
| sad += Math.abs(s1[i] - s2[i]); |
| } |
| return sad; |
| } |
| |
| /// CHECK-START: int SimdSadShort.sadShort2IntAlt(short[], short[]) loop_optimization (before) |
| /// CHECK-DAG: <<Cons0:i\d+>> IntConstant 0 loop:none |
| /// CHECK-DAG: <<Cons1:i\d+>> IntConstant 1 loop:none |
| /// CHECK-DAG: <<Phi2:i\d+>> Phi [<<Cons0>>,{{i\d+}}] loop:<<Loop:B\d+>> outer_loop:none |
| /// CHECK-DAG: <<Phi1:i\d+>> Phi [<<Cons0>>,{{i\d+}}] loop:<<Loop>> outer_loop:none |
| /// CHECK-DAG: <<Get1:s\d+>> ArrayGet [{{l\d+}},<<Phi1>>] loop:<<Loop>> outer_loop:none |
| /// CHECK-DAG: <<Get2:s\d+>> ArrayGet [{{l\d+}},<<Phi1>>] loop:<<Loop>> outer_loop:none |
| /// CHECK-DAG: <<Sub:i\d+>> Sub [<<Get2>>,<<Get1>>] loop:<<Loop>> outer_loop:none |
| /// CHECK-DAG: <<Intrin:i\d+>> Abs [<<Sub>>] loop:<<Loop>> outer_loop:none |
| /// CHECK-DAG: Add [<<Phi2>>,<<Intrin>>] loop:<<Loop>> outer_loop:none |
| /// CHECK-DAG: Add [<<Phi1>>,<<Cons1>>] loop:<<Loop>> outer_loop:none |
| // |
| /// CHECK-START-ARM64: int SimdSadShort.sadShort2IntAlt(short[], short[]) loop_optimization (after) |
| /// CHECK-DAG: <<Cons0:i\d+>> IntConstant 0 loop:none |
| /// CHECK-IF: hasIsaFeature("sve") |
| // |
| // SAD idiom is not supported for SVE. |
| /// CHECK-NOT: VecSADAccumulate |
| // |
| /// CHECK-ELSE: |
| // |
| /// CHECK-DAG: <<Cons8:i\d+>> IntConstant 8 loop:none |
| /// CHECK-DAG: <<Set:d\d+>> VecSetScalars [<<Cons0>>] loop:none |
| /// CHECK-DAG: <<Phi1:i\d+>> Phi [<<Cons0>>,{{i\d+}}] loop:<<Loop:B\d+>> outer_loop:none |
| /// CHECK-DAG: <<Phi2:d\d+>> Phi [<<Set>>,{{d\d+}}] loop:<<Loop>> outer_loop:none |
| /// CHECK-DAG: <<Load1:d\d+>> VecLoad [{{l\d+}},<<Phi1>>] loop:<<Loop>> outer_loop:none |
| /// CHECK-DAG: <<Load2:d\d+>> VecLoad [{{l\d+}},<<Phi1>>] loop:<<Loop>> outer_loop:none |
| /// CHECK-DAG: <<SAD:d\d+>> VecSADAccumulate [<<Phi2>>,<<Load2>>,<<Load1>>] loop:<<Loop>> outer_loop:none |
| /// CHECK-DAG: Add [<<Phi1>>,<<Cons8>>] loop:<<Loop>> outer_loop:none |
| // |
| /// CHECK-FI: |
| private static int sadShort2IntAlt(short[] s1, short[] s2) { |
| int min_length = Math.min(s1.length, s2.length); |
| int sad = 0; |
| for (int i = 0; i < min_length; i++) { |
| short s = s1[i]; |
| short p = s2[i]; |
| sad += s >= p ? s - p : p - s; |
| } |
| return sad; |
| } |
| |
| /// CHECK-START: int SimdSadShort.sadShort2IntAlt2(short[], short[]) loop_optimization (before) |
| /// CHECK-DAG: <<Cons0:i\d+>> IntConstant 0 loop:none |
| /// CHECK-DAG: <<Cons1:i\d+>> IntConstant 1 loop:none |
| /// CHECK-DAG: <<Phi2:i\d+>> Phi [<<Cons0>>,{{i\d+}}] loop:<<Loop:B\d+>> outer_loop:none |
| /// CHECK-DAG: <<Phi1:i\d+>> Phi [<<Cons0>>,{{i\d+}}] loop:<<Loop>> outer_loop:none |
| /// CHECK-DAG: <<Get1:s\d+>> ArrayGet [{{l\d+}},<<Phi1>>] loop:<<Loop>> outer_loop:none |
| /// CHECK-DAG: <<Get2:s\d+>> ArrayGet [{{l\d+}},<<Phi1>>] loop:<<Loop>> outer_loop:none |
| /// CHECK-DAG: <<Sub:i\d+>> Sub [<<Get1>>,<<Get2>>] loop:<<Loop>> outer_loop:none |
| /// CHECK-DAG: <<Intrin:i\d+>> Abs [<<Sub>>] loop:<<Loop>> outer_loop:none |
| /// CHECK-DAG: Add [<<Phi2>>,<<Intrin>>] loop:<<Loop>> outer_loop:none |
| /// CHECK-DAG: Add [<<Phi1>>,<<Cons1>>] loop:<<Loop>> outer_loop:none |
| // |
| /// CHECK-START-ARM64: int SimdSadShort.sadShort2IntAlt2(short[], short[]) loop_optimization (after) |
| /// CHECK-DAG: <<Cons0:i\d+>> IntConstant 0 loop:none |
| /// CHECK-IF: hasIsaFeature("sve") |
| // |
| // SAD idiom is not supported for SVE. |
| /// CHECK-NOT: VecSADAccumulate |
| // |
| /// CHECK-ELSE: |
| // |
| /// CHECK-DAG: <<Cons8:i\d+>> IntConstant 8 loop:none |
| /// CHECK-DAG: <<Set:d\d+>> VecSetScalars [<<Cons0>>] loop:none |
| /// CHECK-DAG: <<Phi1:i\d+>> Phi [<<Cons0>>,{{i\d+}}] loop:<<Loop:B\d+>> outer_loop:none |
| /// CHECK-DAG: <<Phi2:d\d+>> Phi [<<Set>>,{{d\d+}}] loop:<<Loop>> outer_loop:none |
| /// CHECK-DAG: <<Load1:d\d+>> VecLoad [{{l\d+}},<<Phi1>>] loop:<<Loop>> outer_loop:none |
| /// CHECK-DAG: <<Load2:d\d+>> VecLoad [{{l\d+}},<<Phi1>>] loop:<<Loop>> outer_loop:none |
| /// CHECK-DAG: <<SAD:d\d+>> VecSADAccumulate [<<Phi2>>,<<Load1>>,<<Load2>>] loop:<<Loop>> outer_loop:none |
| /// CHECK-DAG: Add [<<Phi1>>,<<Cons8>>] loop:<<Loop>> outer_loop:none |
| // |
| /// CHECK-FI: |
| private static int sadShort2IntAlt2(short[] s1, short[] s2) { |
| int min_length = Math.min(s1.length, s2.length); |
| int sad = 0; |
| for (int i = 0; i < min_length; i++) { |
| short s = s1[i]; |
| short p = s2[i]; |
| int x = s - p; |
| if (x < 0) x = -x; |
| sad += x; |
| } |
| return sad; |
| } |
| |
| /// CHECK-START: int SimdSadShort.sadShort2IntConstant1(short[]) loop_optimization (before) |
| /// CHECK-DAG: <<Cons0:i\d+>> IntConstant 0 loop:none |
| /// CHECK-DAG: <<Cons1:i\d+>> IntConstant 1 loop:none |
| /// CHECK-DAG: <<Cons:i\d+>> IntConstant -7 loop:none |
| /// CHECK-DAG: <<Phi2:i\d+>> Phi [<<Cons0>>,{{i\d+}}] loop:<<Loop:B\d+>> outer_loop:none |
| /// CHECK-DAG: <<Phi1:i\d+>> Phi [<<Cons0>>,{{i\d+}}] loop:<<Loop>> outer_loop:none |
| /// CHECK-DAG: <<Get1:s\d+>> ArrayGet [{{l\d+}},<<Phi1>>] loop:<<Loop>> outer_loop:none |
| /// CHECK-DAG: <<Add:i\d+>> Add [<<Get1>>,<<Cons>>] loop:<<Loop>> outer_loop:none |
| /// CHECK-DAG: <<Intrin:i\d+>> Abs [<<Add>>] loop:<<Loop>> outer_loop:none |
| /// CHECK-DAG: Add [<<Phi2>>,<<Intrin>>] loop:<<Loop>> outer_loop:none |
| /// CHECK-DAG: Add [<<Phi1>>,<<Cons1>>] loop:<<Loop>> outer_loop:none |
| // |
| /// CHECK-START-ARM64: int SimdSadShort.sadShort2IntConstant1(short[]) loop_optimization (after) |
| /// CHECK-DAG: <<Cons0:i\d+>> IntConstant 0 loop:none |
| /// CHECK-DAG: <<Cons1:i\d+>> IntConstant 1 loop:none |
| /// CHECK-DAG: <<Cons:i\d+>> IntConstant 7 loop:none |
| /// CHECK-IF: hasIsaFeature("sve") |
| // |
| // SAD idiom is not supported for SVE. |
| /// CHECK-NOT: VecSADAccumulate |
| // |
| /// CHECK-ELSE: |
| // |
| /// CHECK-DAG: <<Cons8:i\d+>> IntConstant 8 loop:none |
| /// CHECK-DAG: <<Rep:d\d+>> VecReplicateScalar [<<Cons>>] loop:none |
| /// CHECK-DAG: <<Set:d\d+>> VecSetScalars [<<Cons0>>] loop:none |
| /// CHECK-DAG: <<Phi1:i\d+>> Phi [<<Cons0>>,{{i\d+}}] loop:<<Loop:B\d+>> outer_loop:none |
| /// CHECK-DAG: <<Phi2:d\d+>> Phi [<<Set>>,{{d\d+}}] loop:<<Loop>> outer_loop:none |
| /// CHECK-DAG: <<Load1:d\d+>> VecLoad [{{l\d+}},<<Phi1>>] loop:<<Loop>> outer_loop:none |
| /// CHECK-DAG: <<SAD:d\d+>> VecSADAccumulate [<<Phi2>>,<<Load1>>,<<Rep>>] loop:<<Loop>> outer_loop:none |
| /// CHECK-DAG: Add [<<Phi1>>,<<Cons8>>] loop:<<Loop>> outer_loop:none |
| // |
| /// CHECK-FI: |
| private static int sadShort2IntConstant1(short[] s) { |
| int sad = 0; |
| for (int i = 0; i < s.length; i++) { |
| sad += Math.abs(s[i] - 7); // s[i] + -7 |
| } |
| return sad; |
| } |
| |
| /// CHECK-START: int SimdSadShort.sadShort2IntConstant2(short[]) loop_optimization (before) |
| /// CHECK-DAG: <<Cons0:i\d+>> IntConstant 0 loop:none |
| /// CHECK-DAG: <<Cons1:i\d+>> IntConstant 1 loop:none |
| /// CHECK-DAG: <<Cons:i\d+>> IntConstant 7 loop:none |
| /// CHECK-DAG: <<Phi2:i\d+>> Phi [<<Cons0>>,{{i\d+}}] loop:<<Loop:B\d+>> outer_loop:none |
| /// CHECK-DAG: <<Phi1:i\d+>> Phi [<<Cons0>>,{{i\d+}}] loop:<<Loop>> outer_loop:none |
| /// CHECK-DAG: <<Get1:s\d+>> ArrayGet [{{l\d+}},<<Phi1>>] loop:<<Loop>> outer_loop:none |
| /// CHECK-DAG: <<Sub:i\d+>> Sub [<<Get1>>,<<Cons>>] loop:<<Loop>> outer_loop:none |
| /// CHECK-DAG: <<Intrin:i\d+>> Abs [<<Sub>>] loop:<<Loop>> outer_loop:none |
| /// CHECK-DAG: Add [<<Phi2>>,<<Intrin>>] loop:<<Loop>> outer_loop:none |
| /// CHECK-DAG: Add [<<Phi1>>,<<Cons1>>] loop:<<Loop>> outer_loop:none |
| // |
| /// CHECK-START-ARM64: int SimdSadShort.sadShort2IntConstant2(short[]) loop_optimization (after) |
| /// CHECK-DAG: <<Cons0:i\d+>> IntConstant 0 loop:none |
| /// CHECK-DAG: <<Cons1:i\d+>> IntConstant 1 loop:none |
| /// CHECK-DAG: <<Cons:i\d+>> IntConstant 7 loop:none |
| /// CHECK-IF: hasIsaFeature("sve") |
| // |
| // SAD idiom is not supported for SVE. |
| /// CHECK-NOT: VecSADAccumulate |
| // |
| /// CHECK-ELSE: |
| // |
| /// CHECK-DAG: <<Cons8:i\d+>> IntConstant 8 loop:none |
| /// CHECK-DAG: <<Rep:d\d+>> VecReplicateScalar [<<Cons>>] loop:none |
| /// CHECK-DAG: <<Set:d\d+>> VecSetScalars [<<Cons0>>] loop:none |
| /// CHECK-DAG: <<Phi1:i\d+>> Phi [<<Cons0>>,{{i\d+}}] loop:<<Loop:B\d+>> outer_loop:none |
| /// CHECK-DAG: <<Phi2:d\d+>> Phi [<<Set>>,{{d\d+}}] loop:<<Loop>> outer_loop:none |
| /// CHECK-DAG: <<Load1:d\d+>> VecLoad [{{l\d+}},<<Phi1>>] loop:<<Loop>> outer_loop:none |
| /// CHECK-DAG: <<SAD:d\d+>> VecSADAccumulate [<<Phi2>>,<<Load1>>,<<Rep>>] loop:<<Loop>> outer_loop:none |
| /// CHECK-DAG: Add [<<Phi1>>,<<Cons8>>] loop:<<Loop>> outer_loop:none |
| // |
| /// CHECK-FI: |
| private static int sadShort2IntConstant2(short[] s) { |
| int sad = 0; |
| for (int i = 0; i < s.length; i++) { |
| sad += Math.abs(s[i] - $inline$seven()); // s[i] - 7 |
| } |
| return sad; |
| } |
| |
| /// CHECK-START: int SimdSadShort.sadShort2IntConstant3(short[]) loop_optimization (before) |
| /// CHECK-DAG: <<Cons0:i\d+>> IntConstant 0 loop:none |
| /// CHECK-DAG: <<Cons1:i\d+>> IntConstant 1 loop:none |
| /// CHECK-DAG: <<Cons:i\d+>> IntConstant 7 loop:none |
| /// CHECK-DAG: <<Phi2:i\d+>> Phi [<<Cons0>>,{{i\d+}}] loop:<<Loop:B\d+>> outer_loop:none |
| /// CHECK-DAG: <<Phi1:i\d+>> Phi [<<Cons0>>,{{i\d+}}] loop:<<Loop>> outer_loop:none |
| /// CHECK-DAG: <<Get1:s\d+>> ArrayGet [{{l\d+}},<<Phi1>>] loop:<<Loop>> outer_loop:none |
| /// CHECK-DAG: <<Add:i\d+>> Add [<<Get1>>,<<Cons>>] loop:<<Loop>> outer_loop:none |
| /// CHECK-DAG: <<Intrin:i\d+>> Abs [<<Add>>] loop:<<Loop>> outer_loop:none |
| /// CHECK-DAG: Add [<<Phi2>>,<<Intrin>>] loop:<<Loop>> outer_loop:none |
| /// CHECK-DAG: Add [<<Phi1>>,<<Cons1>>] loop:<<Loop>> outer_loop:none |
| // |
| /// CHECK-START-ARM64: int SimdSadShort.sadShort2IntConstant3(short[]) loop_optimization (after) |
| /// CHECK-DAG: <<Cons0:i\d+>> IntConstant 0 loop:none |
| /// CHECK-DAG: <<Cons1:i\d+>> IntConstant 1 loop:none |
| /// CHECK-DAG: <<Cons:i\d+>> IntConstant -7 loop:none |
| /// CHECK-IF: hasIsaFeature("sve") |
| // |
| // SAD idiom is not supported for SVE. |
| /// CHECK-NOT: VecSADAccumulate |
| // |
| /// CHECK-ELSE: |
| // |
| /// CHECK-DAG: <<Cons8:i\d+>> IntConstant 8 loop:none |
| /// CHECK-DAG: <<Rep:d\d+>> VecReplicateScalar [<<Cons>>] loop:none |
| /// CHECK-DAG: <<Set:d\d+>> VecSetScalars [<<Cons0>>] loop:none |
| /// CHECK-DAG: <<Phi1:i\d+>> Phi [<<Cons0>>,{{i\d+}}] loop:<<Loop:B\d+>> outer_loop:none |
| /// CHECK-DAG: <<Phi2:d\d+>> Phi [<<Set>>,{{d\d+}}] loop:<<Loop>> outer_loop:none |
| /// CHECK-DAG: <<Load1:d\d+>> VecLoad [{{l\d+}},<<Phi1>>] loop:<<Loop>> outer_loop:none |
| /// CHECK-DAG: <<SAD:d\d+>> VecSADAccumulate [<<Phi2>>,<<Load1>>,<<Rep>>] loop:<<Loop>> outer_loop:none |
| /// CHECK-DAG: Add [<<Phi1>>,<<Cons8>>] loop:<<Loop>> outer_loop:none |
| // |
| /// CHECK-FI: |
| private static int sadShort2IntConstant3(short[] s) { |
| int sad = 0; |
| for (int i = 0; i < s.length; i++) { |
| sad += Math.abs(s[i] + $inline$seven()); // hidden s[i] - (-7) |
| } |
| return sad; |
| } |
| |
| /// CHECK-START: long SimdSadShort.sadShort2Long(short[], short[]) loop_optimization (before) |
| /// CHECK-DAG: <<Cons0:i\d+>> IntConstant 0 loop:none |
| /// CHECK-DAG: <<Cons1:i\d+>> IntConstant 1 loop:none |
| /// CHECK-DAG: <<ConsL:j\d+>> LongConstant 0 loop:none |
| /// CHECK-DAG: <<Phi1:i\d+>> Phi [<<Cons0>>,{{i\d+}}] loop:<<Loop:B\d+>> outer_loop:none |
| /// CHECK-DAG: <<Phi2:j\d+>> Phi [<<ConsL>>,{{j\d+}}] loop:<<Loop>> outer_loop:none |
| /// CHECK-DAG: <<Get1:s\d+>> ArrayGet [{{l\d+}},<<Phi1>>] loop:<<Loop>> outer_loop:none |
| /// CHECK-DAG: <<Get2:s\d+>> ArrayGet [{{l\d+}},<<Phi1>>] loop:<<Loop>> outer_loop:none |
| /// CHECK-DAG: <<Cnv1:j\d+>> TypeConversion [<<Get1>>] loop:<<Loop>> outer_loop:none |
| /// CHECK-DAG: <<Cnv2:j\d+>> TypeConversion [<<Get2>>] loop:<<Loop>> outer_loop:none |
| /// CHECK-DAG: <<Sub:j\d+>> Sub [<<Cnv1>>,<<Cnv2>>] loop:<<Loop>> outer_loop:none |
| /// CHECK-DAG: <<Intrin:j\d+>> Abs [<<Sub>>] loop:<<Loop>> outer_loop:none |
| /// CHECK-DAG: Add [<<Phi2>>,<<Intrin>>] loop:<<Loop>> outer_loop:none |
| /// CHECK-DAG: Add [<<Phi1>>,<<Cons1>>] loop:<<Loop>> outer_loop:none |
| // |
| /// CHECK-START-ARM64: long SimdSadShort.sadShort2Long(short[], short[]) loop_optimization (after) |
| /// CHECK-DAG: <<Cons0:i\d+>> IntConstant 0 loop:none |
| /// CHECK-DAG: <<ConsL:j\d+>> LongConstant 0 loop:none |
| /// CHECK-IF: hasIsaFeature("sve") |
| // |
| // SAD idiom is not supported for SVE. |
| /// CHECK-NOT: VecSADAccumulate |
| // |
| /// CHECK-ELSE: |
| // |
| /// CHECK-DAG: <<Cons8:i\d+>> IntConstant 8 loop:none |
| /// CHECK-DAG: <<Set:d\d+>> VecSetScalars [<<ConsL>>] loop:none |
| /// CHECK-DAG: <<Phi1:i\d+>> Phi [<<Cons0>>,{{i\d+}}] loop:<<Loop:B\d+>> outer_loop:none |
| /// CHECK-DAG: <<Phi2:d\d+>> Phi [<<Set>>,{{d\d+}}] loop:<<Loop>> outer_loop:none |
| /// CHECK-DAG: <<Load1:d\d+>> VecLoad [{{l\d+}},<<Phi1>>] loop:<<Loop>> outer_loop:none |
| /// CHECK-DAG: <<Load2:d\d+>> VecLoad [{{l\d+}},<<Phi1>>] loop:<<Loop>> outer_loop:none |
| /// CHECK-DAG: <<SAD:d\d+>> VecSADAccumulate [<<Phi2>>,<<Load1>>,<<Load2>>] loop:<<Loop>> outer_loop:none |
| /// CHECK-DAG: Add [<<Phi1>>,<<Cons8>>] loop:<<Loop>> outer_loop:none |
| // |
| /// CHECK-FI: |
| private static long sadShort2Long(short[] s1, short[] s2) { |
| int min_length = Math.min(s1.length, s2.length); |
| long sad = 0; |
| for (int i = 0; i < min_length; i++) { |
| long x = s1[i]; |
| long y = s2[i]; |
| sad += Math.abs(x - y); |
| } |
| return sad; |
| } |
| |
| /// CHECK-START: long SimdSadShort.sadShort2LongAt1(short[], short[]) loop_optimization (before) |
| /// CHECK-DAG: <<Cons0:i\d+>> IntConstant 0 loop:none |
| /// CHECK-DAG: <<Cons1:i\d+>> IntConstant 1 loop:none |
| /// CHECK-DAG: <<ConsL:j\d+>> LongConstant 1 loop:none |
| /// CHECK-DAG: <<Phi1:i\d+>> Phi [<<Cons0>>,{{i\d+}}] loop:<<Loop:B\d+>> outer_loop:none |
| /// CHECK-DAG: <<Phi2:j\d+>> Phi [<<ConsL>>,{{j\d+}}] loop:<<Loop>> outer_loop:none |
| /// CHECK-DAG: <<Get1:s\d+>> ArrayGet [{{l\d+}},<<Phi1>>] loop:<<Loop>> outer_loop:none |
| /// CHECK-DAG: <<Get2:s\d+>> ArrayGet [{{l\d+}},<<Phi1>>] loop:<<Loop>> outer_loop:none |
| /// CHECK-DAG: <<Cnv1:j\d+>> TypeConversion [<<Get1>>] loop:<<Loop>> outer_loop:none |
| /// CHECK-DAG: <<Cnv2:j\d+>> TypeConversion [<<Get2>>] loop:<<Loop>> outer_loop:none |
| /// CHECK-DAG: <<Sub:j\d+>> Sub [<<Cnv1>>,<<Cnv2>>] loop:<<Loop>> outer_loop:none |
| /// CHECK-DAG: <<Intrin:j\d+>> Abs [<<Sub>>] loop:<<Loop>> outer_loop:none |
| /// CHECK-DAG: Add [<<Phi2>>,<<Intrin>>] loop:<<Loop>> outer_loop:none |
| /// CHECK-DAG: Add [<<Phi1>>,<<Cons1>>] loop:<<Loop>> outer_loop:none |
| // |
| /// CHECK-START-ARM64: long SimdSadShort.sadShort2LongAt1(short[], short[]) loop_optimization (after) |
| /// CHECK-DAG: <<Cons0:i\d+>> IntConstant 0 loop:none |
| /// CHECK-DAG: <<ConsL:j\d+>> LongConstant 1 loop:none |
| /// CHECK-IF: hasIsaFeature("sve") |
| // |
| // SAD idiom is not supported for SVE. |
| /// CHECK-NOT: VecSADAccumulate |
| // |
| /// CHECK-ELSE: |
| // |
| /// CHECK-DAG: <<Cons8:i\d+>> IntConstant 8 loop:none |
| /// CHECK-DAG: <<Set:d\d+>> VecSetScalars [<<ConsL>>] loop:none |
| /// CHECK-DAG: <<Phi1:i\d+>> Phi [<<Cons0>>,{{i\d+}}] loop:<<Loop:B\d+>> outer_loop:none |
| /// CHECK-DAG: <<Phi2:d\d+>> Phi [<<Set>>,{{d\d+}}] loop:<<Loop>> outer_loop:none |
| /// CHECK-DAG: <<Load1:d\d+>> VecLoad [{{l\d+}},<<Phi1>>] loop:<<Loop>> outer_loop:none |
| /// CHECK-DAG: <<Load2:d\d+>> VecLoad [{{l\d+}},<<Phi1>>] loop:<<Loop>> outer_loop:none |
| /// CHECK-DAG: <<SAD:d\d+>> VecSADAccumulate [<<Phi2>>,<<Load1>>,<<Load2>>] loop:<<Loop>> outer_loop:none |
| /// CHECK-DAG: Add [<<Phi1>>,<<Cons8>>] loop:<<Loop>> outer_loop:none |
| // |
| /// CHECK-FI: |
| private static long sadShort2LongAt1(short[] s1, short[] s2) { |
| int min_length = Math.min(s1.length, s2.length); |
| long sad = 1; // starts at 1 |
| for (int i = 0; i < min_length; i++) { |
| long x = s1[i]; |
| long y = s2[i]; |
| sad += Math.abs(x - y); |
| } |
| return sad; |
| } |
| |
| public static void main() { |
| // Cross-test the two most extreme values individually. |
| short[] s1 = { 0, -32768, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 }; |
| short[] s2 = { 0, 32767, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 }; |
| expectEquals(-1, sadShort2Short(s1, s2)); |
| expectEquals(-1, sadShort2Short(s2, s1)); |
| expectEquals(-1, sadShort2ShortAlt(s1, s2)); |
| expectEquals(-1, sadShort2ShortAlt(s2, s1)); |
| expectEquals(-1, sadShort2ShortAlt2(s1, s2)); |
| expectEquals(-1, sadShort2ShortAlt2(s2, s1)); |
| expectEquals(65535, sadShort2Int(s1, s2)); |
| expectEquals(65535, sadShort2Int(s2, s1)); |
| expectEquals(65535, sadShort2IntAlt(s1, s2)); |
| expectEquals(65535, sadShort2IntAlt(s2, s1)); |
| expectEquals(65535, sadShort2IntAlt2(s1, s2)); |
| expectEquals(65535, sadShort2IntAlt2(s2, s1)); |
| expectEquals(32880, sadShort2IntConstant1(s1)); |
| expectEquals(32880, sadShort2IntConstant2(s1)); |
| expectEquals(32866, sadShort2IntConstant3(s1)); |
| expectEquals(65535L, sadShort2Long(s1, s2)); |
| expectEquals(65535L, sadShort2Long(s2, s1)); |
| expectEquals(65536L, sadShort2LongAt1(s1, s2)); |
| expectEquals(65536L, sadShort2LongAt1(s2, s1)); |
| |
| // Use cross-values to test all cases. |
| short[] interesting = { |
| (short) 0x0000, |
| (short) 0x0001, |
| (short) 0x0002, |
| (short) 0x1234, |
| (short) 0x8000, |
| (short) 0x8001, |
| (short) 0x7fff, |
| (short) 0xffff |
| }; |
| int n = interesting.length; |
| int m = n * n + 1; |
| s1 = new short[m]; |
| s2 = new short[m]; |
| int k = 0; |
| for (int i = 0; i < n; i++) { |
| for (int j = 0; j < n; j++) { |
| s1[k] = interesting[i]; |
| s2[k] = interesting[j]; |
| k++; |
| } |
| } |
| s1[k] = 10; |
| s2[k] = 2; |
| expectEquals(-18932, sadShort2Short(s1, s2)); |
| expectEquals(-18932, sadShort2ShortAlt(s1, s2)); |
| expectEquals(-18932, sadShort2ShortAlt2(s1, s2)); |
| expectEquals(1291788, sadShort2Int(s1, s2)); |
| expectEquals(1291788, sadShort2IntAlt(s1, s2)); |
| expectEquals(1291788, sadShort2IntAlt2(s1, s2)); |
| expectEquals(823907, sadShort2IntConstant1(s1)); |
| expectEquals(823907, sadShort2IntConstant2(s1)); |
| expectEquals(823953, sadShort2IntConstant3(s1)); |
| expectEquals(1291788L, sadShort2Long(s1, s2)); |
| expectEquals(1291789L, sadShort2LongAt1(s1, s2)); |
| |
| System.out.println("SimdSadShort passed"); |
| } |
| |
| private static void expectEquals(int expected, int result) { |
| if (expected != result) { |
| throw new Error("Expected: " + expected + ", found: " + result); |
| } |
| } |
| |
| private static void expectEquals(long expected, long result) { |
| if (expected != result) { |
| throw new Error("Expected: " + expected + ", found: " + result); |
| } |
| } |
| } |