Aart Bik | c8e93c7 | 2017-05-10 10:49:22 -0700 | [diff] [blame] | 1 | /* |
| 2 | * Copyright (C) 2017 The Android Open Source Project |
| 3 | * |
| 4 | * Licensed under the Apache License, Version 2.0 (the "License"); |
| 5 | * you may not use this file except in compliance with the License. |
| 6 | * You may obtain a copy of the License at |
| 7 | * |
| 8 | * http://www.apache.org/licenses/LICENSE-2.0 |
| 9 | * |
| 10 | * Unless required by applicable law or agreed to in writing, software |
| 11 | * distributed under the License is distributed on an "AS IS" BASIS, |
| 12 | * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. |
| 13 | * See the License for the specific language governing permissions and |
| 14 | * limitations under the License. |
| 15 | */ |
| 16 | |
| 17 | /** |
| 18 | * Tests for MIN/MAX vectorization. |
| 19 | */ |
Vladimir Marko | 2aaa44f | 2018-03-27 15:02:47 +0100 | [diff] [blame] | 20 | public class ShortSimdMinMax { |
Aart Bik | c8e93c7 | 2017-05-10 10:49:22 -0700 | [diff] [blame] | 21 | |
Vladimir Marko | 2aaa44f | 2018-03-27 15:02:47 +0100 | [diff] [blame] | 22 | /// CHECK-START: void ShortSimdMinMax.doitMin(short[], short[], short[]) loop_optimization (before) |
Aart Bik | c8e93c7 | 2017-05-10 10:49:22 -0700 | [diff] [blame] | 23 | /// CHECK-DAG: <<Phi:i\d+>> Phi loop:<<Loop:B\d+>> outer_loop:none |
| 24 | /// CHECK-DAG: <<Get1:s\d+>> ArrayGet loop:<<Loop>> outer_loop:none |
| 25 | /// CHECK-DAG: <<Get2:s\d+>> ArrayGet loop:<<Loop>> outer_loop:none |
Aart Bik | 1f8d51b | 2018-02-15 10:42:37 -0800 | [diff] [blame] | 26 | /// CHECK-DAG: <<Min:i\d+>> Min [<<Get1>>,<<Get2>>] loop:<<Loop>> outer_loop:none |
Aart Bik | c8e93c7 | 2017-05-10 10:49:22 -0700 | [diff] [blame] | 27 | /// CHECK-DAG: <<Cnv:s\d+>> TypeConversion [<<Min>>] loop:<<Loop>> outer_loop:none |
| 28 | /// CHECK-DAG: ArraySet [{{l\d+}},<<Phi>>,<<Cnv>>] loop:<<Loop>> outer_loop:none |
| 29 | // |
Vladimir Marko | 2aaa44f | 2018-03-27 15:02:47 +0100 | [diff] [blame] | 30 | /// CHECK-START-{ARM,ARM64,MIPS64}: void ShortSimdMinMax.doitMin(short[], short[], short[]) loop_optimization (after) |
Aart Bik | 8c6c357 | 2017-10-25 11:48:48 -0700 | [diff] [blame] | 31 | /// CHECK-DAG: <<Get1:d\d+>> VecLoad loop:<<Loop:B\d+>> outer_loop:none |
| 32 | /// CHECK-DAG: <<Get2:d\d+>> VecLoad loop:<<Loop>> outer_loop:none |
Vladimir Marko | d5d2f2c | 2017-09-26 12:37:26 +0100 | [diff] [blame] | 33 | /// CHECK-DAG: <<Min:d\d+>> VecMin [<<Get1>>,<<Get2>>] packed_type:Int16 loop:<<Loop>> outer_loop:none |
Aart Bik | 8c6c357 | 2017-10-25 11:48:48 -0700 | [diff] [blame] | 34 | /// CHECK-DAG: VecStore [{{l\d+}},{{i\d+}},<<Min>>] loop:<<Loop>> outer_loop:none |
Aart Bik | c8e93c7 | 2017-05-10 10:49:22 -0700 | [diff] [blame] | 35 | private static void doitMin(short[] x, short[] y, short[] z) { |
| 36 | int min = Math.min(x.length, Math.min(y.length, z.length)); |
| 37 | for (int i = 0; i < min; i++) { |
| 38 | x[i] = (short) Math.min(y[i], z[i]); |
| 39 | } |
| 40 | } |
| 41 | |
Vladimir Marko | 2aaa44f | 2018-03-27 15:02:47 +0100 | [diff] [blame] | 42 | /// CHECK-START: void ShortSimdMinMax.doitMinUnsigned(short[], short[], short[]) instruction_simplifier (before) |
Aart Bik | 304c8a5 | 2017-05-23 11:01:13 -0700 | [diff] [blame] | 43 | /// CHECK-DAG: <<IMAX:i\d+>> IntConstant 65535 loop:none |
| 44 | /// CHECK-DAG: <<Phi:i\d+>> Phi loop:<<Loop:B\d+>> outer_loop:none |
| 45 | /// CHECK-DAG: <<Get1:s\d+>> ArrayGet loop:<<Loop>> outer_loop:none |
| 46 | /// CHECK-DAG: <<Get2:s\d+>> ArrayGet loop:<<Loop>> outer_loop:none |
| 47 | /// CHECK-DAG: <<And1:i\d+>> And [<<Get1>>,<<IMAX>>] loop:<<Loop>> outer_loop:none |
| 48 | /// CHECK-DAG: <<And2:i\d+>> And [<<Get2>>,<<IMAX>>] loop:<<Loop>> outer_loop:none |
| 49 | /// CHECK-DAG: <<Min:i\d+>> InvokeStaticOrDirect [<<And1>>,<<And2>>] intrinsic:MathMinIntInt loop:<<Loop>> outer_loop:none |
| 50 | /// CHECK-DAG: <<Cnv:s\d+>> TypeConversion [<<Min>>] loop:<<Loop>> outer_loop:none |
Vladimir Marko | 61b9228 | 2017-10-11 13:23:17 +0100 | [diff] [blame] | 51 | /// CHECK-DAG: ArraySet [{{l\d+}},{{i\d+}},<<Cnv>>] loop:<<Loop>> outer_loop:none |
| 52 | // |
Vladimir Marko | 2aaa44f | 2018-03-27 15:02:47 +0100 | [diff] [blame] | 53 | /// CHECK-START: void ShortSimdMinMax.doitMinUnsigned(short[], short[], short[]) loop_optimization (before) |
Vladimir Marko | 61b9228 | 2017-10-11 13:23:17 +0100 | [diff] [blame] | 54 | /// CHECK-DAG: <<Phi:i\d+>> Phi loop:<<Loop:B\d+>> outer_loop:none |
| 55 | /// CHECK-DAG: <<Get1:c\d+>> ArrayGet loop:<<Loop>> outer_loop:none |
| 56 | /// CHECK-DAG: <<Get2:c\d+>> ArrayGet loop:<<Loop>> outer_loop:none |
Aart Bik | 1f8d51b | 2018-02-15 10:42:37 -0800 | [diff] [blame] | 57 | /// CHECK-DAG: <<Min:i\d+>> Min [<<Get1>>,<<Get2>>] loop:<<Loop>> outer_loop:none |
Vladimir Marko | 61b9228 | 2017-10-11 13:23:17 +0100 | [diff] [blame] | 58 | /// CHECK-DAG: <<Cnv:s\d+>> TypeConversion [<<Min>>] loop:<<Loop>> outer_loop:none |
Aart Bik | 304c8a5 | 2017-05-23 11:01:13 -0700 | [diff] [blame] | 59 | /// CHECK-DAG: ArraySet [{{l\d+}},<<Phi>>,<<Cnv>>] loop:<<Loop>> outer_loop:none |
| 60 | // |
Vladimir Marko | 2aaa44f | 2018-03-27 15:02:47 +0100 | [diff] [blame] | 61 | /// CHECK-START-{ARM,ARM64,MIPS64}: void ShortSimdMinMax.doitMinUnsigned(short[], short[], short[]) loop_optimization (after) |
Aart Bik | 8c6c357 | 2017-10-25 11:48:48 -0700 | [diff] [blame] | 62 | /// CHECK-DAG: <<Get1:d\d+>> VecLoad loop:<<Loop:B\d+>> outer_loop:none |
| 63 | /// CHECK-DAG: <<Get2:d\d+>> VecLoad loop:<<Loop>> outer_loop:none |
Aart Bik | 4d1a9d4 | 2017-10-19 14:40:55 -0700 | [diff] [blame] | 64 | /// CHECK-DAG: <<Min:d\d+>> VecMin [<<Get1>>,<<Get2>>] packed_type:Uint16 loop:<<Loop>> outer_loop:none |
Aart Bik | 8c6c357 | 2017-10-25 11:48:48 -0700 | [diff] [blame] | 65 | /// CHECK-DAG: VecStore [{{l\d+}},{{i\d+}},<<Min>>] loop:<<Loop>> outer_loop:none |
Aart Bik | 304c8a5 | 2017-05-23 11:01:13 -0700 | [diff] [blame] | 66 | private static void doitMinUnsigned(short[] x, short[] y, short[] z) { |
| 67 | int min = Math.min(x.length, Math.min(y.length, z.length)); |
| 68 | for (int i = 0; i < min; i++) { |
| 69 | x[i] = (short) Math.min(y[i] & 0xffff, z[i] & 0xffff); |
| 70 | } |
| 71 | } |
| 72 | |
Vladimir Marko | 2aaa44f | 2018-03-27 15:02:47 +0100 | [diff] [blame] | 73 | /// CHECK-START: void ShortSimdMinMax.doitMax(short[], short[], short[]) loop_optimization (before) |
Aart Bik | c8e93c7 | 2017-05-10 10:49:22 -0700 | [diff] [blame] | 74 | /// CHECK-DAG: <<Phi:i\d+>> Phi loop:<<Loop:B\d+>> outer_loop:none |
| 75 | /// CHECK-DAG: <<Get1:s\d+>> ArrayGet loop:<<Loop>> outer_loop:none |
| 76 | /// CHECK-DAG: <<Get2:s\d+>> ArrayGet loop:<<Loop>> outer_loop:none |
Aart Bik | 1f8d51b | 2018-02-15 10:42:37 -0800 | [diff] [blame] | 77 | /// CHECK-DAG: <<Max:i\d+>> Max [<<Get1>>,<<Get2>>] loop:<<Loop>> outer_loop:none |
Aart Bik | c8e93c7 | 2017-05-10 10:49:22 -0700 | [diff] [blame] | 78 | /// CHECK-DAG: <<Cnv:s\d+>> TypeConversion [<<Max>>] loop:<<Loop>> outer_loop:none |
| 79 | /// CHECK-DAG: ArraySet [{{l\d+}},<<Phi>>,<<Cnv>>] loop:<<Loop>> outer_loop:none |
| 80 | // |
Vladimir Marko | 2aaa44f | 2018-03-27 15:02:47 +0100 | [diff] [blame] | 81 | /// CHECK-START-{ARM,ARM64,MIPS64}: void ShortSimdMinMax.doitMax(short[], short[], short[]) loop_optimization (after) |
Aart Bik | 8c6c357 | 2017-10-25 11:48:48 -0700 | [diff] [blame] | 82 | /// CHECK-DAG: <<Get1:d\d+>> VecLoad loop:<<Loop:B\d+>> outer_loop:none |
| 83 | /// CHECK-DAG: <<Get2:d\d+>> VecLoad loop:<<Loop>> outer_loop:none |
Vladimir Marko | d5d2f2c | 2017-09-26 12:37:26 +0100 | [diff] [blame] | 84 | /// CHECK-DAG: <<Max:d\d+>> VecMax [<<Get1>>,<<Get2>>] packed_type:Int16 loop:<<Loop>> outer_loop:none |
Aart Bik | 8c6c357 | 2017-10-25 11:48:48 -0700 | [diff] [blame] | 85 | /// CHECK-DAG: VecStore [{{l\d+}},{{i\d+}},<<Max>>] loop:<<Loop>> outer_loop:none |
Aart Bik | c8e93c7 | 2017-05-10 10:49:22 -0700 | [diff] [blame] | 86 | private static void doitMax(short[] x, short[] y, short[] z) { |
| 87 | int min = Math.min(x.length, Math.min(y.length, z.length)); |
| 88 | for (int i = 0; i < min; i++) { |
| 89 | x[i] = (short) Math.max(y[i], z[i]); |
| 90 | } |
| 91 | } |
| 92 | |
Vladimir Marko | 2aaa44f | 2018-03-27 15:02:47 +0100 | [diff] [blame] | 93 | /// CHECK-START: void ShortSimdMinMax.doitMaxUnsigned(short[], short[], short[]) instruction_simplifier (before) |
Aart Bik | 304c8a5 | 2017-05-23 11:01:13 -0700 | [diff] [blame] | 94 | /// CHECK-DAG: <<IMAX:i\d+>> IntConstant 65535 loop:none |
| 95 | /// CHECK-DAG: <<Phi:i\d+>> Phi loop:<<Loop:B\d+>> outer_loop:none |
| 96 | /// CHECK-DAG: <<Get1:s\d+>> ArrayGet loop:<<Loop>> outer_loop:none |
| 97 | /// CHECK-DAG: <<Get2:s\d+>> ArrayGet loop:<<Loop>> outer_loop:none |
| 98 | /// CHECK-DAG: <<And1:i\d+>> And [<<Get1>>,<<IMAX>>] loop:<<Loop>> outer_loop:none |
| 99 | /// CHECK-DAG: <<And2:i\d+>> And [<<Get2>>,<<IMAX>>] loop:<<Loop>> outer_loop:none |
| 100 | /// CHECK-DAG: <<Max:i\d+>> InvokeStaticOrDirect [<<And1>>,<<And2>>] intrinsic:MathMaxIntInt loop:<<Loop>> outer_loop:none |
| 101 | /// CHECK-DAG: <<Cnv:s\d+>> TypeConversion [<<Max>>] loop:<<Loop>> outer_loop:none |
Vladimir Marko | 61b9228 | 2017-10-11 13:23:17 +0100 | [diff] [blame] | 102 | /// CHECK-DAG: ArraySet [{{l\d+}},{{i\d+}},<<Cnv>>] loop:<<Loop>> outer_loop:none |
| 103 | // |
Vladimir Marko | 2aaa44f | 2018-03-27 15:02:47 +0100 | [diff] [blame] | 104 | /// CHECK-START: void ShortSimdMinMax.doitMaxUnsigned(short[], short[], short[]) loop_optimization (before) |
Vladimir Marko | 61b9228 | 2017-10-11 13:23:17 +0100 | [diff] [blame] | 105 | /// CHECK-DAG: <<Phi:i\d+>> Phi loop:<<Loop:B\d+>> outer_loop:none |
| 106 | /// CHECK-DAG: <<Get1:c\d+>> ArrayGet loop:<<Loop>> outer_loop:none |
| 107 | /// CHECK-DAG: <<Get2:c\d+>> ArrayGet loop:<<Loop>> outer_loop:none |
Aart Bik | 1f8d51b | 2018-02-15 10:42:37 -0800 | [diff] [blame] | 108 | /// CHECK-DAG: <<Max:i\d+>> Max [<<Get1>>,<<Get2>>] loop:<<Loop>> outer_loop:none |
Vladimir Marko | 61b9228 | 2017-10-11 13:23:17 +0100 | [diff] [blame] | 109 | /// CHECK-DAG: <<Cnv:s\d+>> TypeConversion [<<Max>>] loop:<<Loop>> outer_loop:none |
Aart Bik | 304c8a5 | 2017-05-23 11:01:13 -0700 | [diff] [blame] | 110 | /// CHECK-DAG: ArraySet [{{l\d+}},<<Phi>>,<<Cnv>>] loop:<<Loop>> outer_loop:none |
| 111 | // |
Vladimir Marko | 2aaa44f | 2018-03-27 15:02:47 +0100 | [diff] [blame] | 112 | /// CHECK-START-{ARM,ARM64,MIPS64}: void ShortSimdMinMax.doitMaxUnsigned(short[], short[], short[]) loop_optimization (after) |
Aart Bik | 8c6c357 | 2017-10-25 11:48:48 -0700 | [diff] [blame] | 113 | /// CHECK-DAG: <<Get1:d\d+>> VecLoad loop:<<Loop:B\d+>> outer_loop:none |
| 114 | /// CHECK-DAG: <<Get2:d\d+>> VecLoad loop:<<Loop>> outer_loop:none |
Aart Bik | 4d1a9d4 | 2017-10-19 14:40:55 -0700 | [diff] [blame] | 115 | /// CHECK-DAG: <<Max:d\d+>> VecMax [<<Get1>>,<<Get2>>] packed_type:Uint16 loop:<<Loop>> outer_loop:none |
Aart Bik | 8c6c357 | 2017-10-25 11:48:48 -0700 | [diff] [blame] | 116 | /// CHECK-DAG: VecStore [{{l\d+}},{{i\d+}},<<Max>>] loop:<<Loop>> outer_loop:none |
Aart Bik | 304c8a5 | 2017-05-23 11:01:13 -0700 | [diff] [blame] | 117 | private static void doitMaxUnsigned(short[] x, short[] y, short[] z) { |
| 118 | int min = Math.min(x.length, Math.min(y.length, z.length)); |
| 119 | for (int i = 0; i < min; i++) { |
| 120 | x[i] = (short) Math.max(y[i] & 0xffff, z[i] & 0xffff); |
| 121 | } |
| 122 | } |
| 123 | |
Vladimir Marko | 2aaa44f | 2018-03-27 15:02:47 +0100 | [diff] [blame] | 124 | /// CHECK-START: void ShortSimdMinMax.doitMin100(short[], short[]) loop_optimization (before) |
Aart Bik | dbbac8f | 2017-09-01 13:06:08 -0700 | [diff] [blame] | 125 | /// CHECK-DAG: <<I100:i\d+>> IntConstant 100 loop:none |
| 126 | /// CHECK-DAG: <<Phi:i\d+>> Phi loop:<<Loop:B\d+>> outer_loop:none |
| 127 | /// CHECK-DAG: <<Get:s\d+>> ArrayGet loop:<<Loop>> outer_loop:none |
Aart Bik | 1f8d51b | 2018-02-15 10:42:37 -0800 | [diff] [blame] | 128 | /// CHECK-DAG: <<Min:i\d+>> Min [<<Get>>,<<I100>>] loop:<<Loop>> outer_loop:none |
Aart Bik | dbbac8f | 2017-09-01 13:06:08 -0700 | [diff] [blame] | 129 | /// CHECK-DAG: <<Cnv:s\d+>> TypeConversion [<<Min>>] loop:<<Loop>> outer_loop:none |
| 130 | /// CHECK-DAG: ArraySet [{{l\d+}},<<Phi>>,<<Cnv>>] loop:<<Loop>> outer_loop:none |
| 131 | // |
Aart Bik | 5aac921 | 2018-04-03 14:06:43 -0700 | [diff] [blame] | 132 | /// CHECK-START-{ARM,ARM64,MIPS64}: void ShortSimdMinMax.doitMin100(short[], short[]) loop_optimization (after) |
Lena Djokic | 38e380b | 2017-10-30 16:17:10 +0100 | [diff] [blame] | 133 | /// CHECK-DAG: <<I100:i\d+>> IntConstant 100 loop:none |
| 134 | /// CHECK-DAG: <<Repl:d\d+>> VecReplicateScalar [<<I100>>] loop:none |
| 135 | /// CHECK-DAG: <<Get:d\d+>> VecLoad loop:<<Loop:B\d+>> outer_loop:none |
| 136 | /// CHECK-DAG: <<Min:d\d+>> VecMin [<<Get>>,<<Repl>>] packed_type:Int16 loop:<<Loop>> outer_loop:none |
| 137 | /// CHECK-DAG: VecStore [{{l\d+}},{{i\d+}},<<Min>>] loop:<<Loop>> outer_loop:none |
Aart Bik | dbbac8f | 2017-09-01 13:06:08 -0700 | [diff] [blame] | 138 | private static void doitMin100(short[] x, short[] y) { |
| 139 | int min = Math.min(x.length, y.length); |
| 140 | for (int i = 0; i < min; i++) { |
| 141 | x[i] = (short) Math.min(y[i], 100); |
| 142 | } |
| 143 | } |
| 144 | |
Aart Bik | 5aac921 | 2018-04-03 14:06:43 -0700 | [diff] [blame] | 145 | /// CHECK-START-{ARM,ARM64,MIPS64}: void ShortSimdMinMax.doitMinMax(short[], short[]) loop_optimization (after) |
| 146 | /// CHECK-DAG: <<I11:i\d+>> IntConstant -1111 loop:none |
| 147 | /// CHECK-DAG: <<I23:i\d+>> IntConstant 2323 loop:none |
| 148 | /// CHECK-DAG: <<Rpl1:d\d+>> VecReplicateScalar [<<I23>>] loop:none |
| 149 | /// CHECK-DAG: <<Rpl2:d\d+>> VecReplicateScalar [<<I11>>] loop:none |
| 150 | /// CHECK-DAG: <<Get:d\d+>> VecLoad loop:<<Loop:B\d+>> outer_loop:none |
| 151 | /// CHECK-DAG: <<Min:d\d+>> VecMin [<<Get>>,<<Rpl1>>] packed_type:Int16 loop:<<Loop>> outer_loop:none |
| 152 | /// CHECK-DAG: <<Max:d\d+>> VecMax [<<Min>>,<<Rpl2>>] packed_type:Int16 loop:<<Loop>> outer_loop:none |
| 153 | /// CHECK-DAG: VecStore [{{l\d+}},{{i\d+}},<<Max>>] loop:<<Loop>> outer_loop:none |
| 154 | private static void doitMinMax(short[] x, short[] y) { |
| 155 | int n = Math.min(x.length, y.length); |
| 156 | for (int i = 0; i < n; i++) { |
| 157 | x[i] = (short) Math.max(-1111, Math.min(y[i], 2323)); |
| 158 | } |
| 159 | } |
| 160 | |
| 161 | /// CHECK-START-{ARM,ARM64,MIPS64}: void ShortSimdMinMax.doitMinMaxUnsigned(short[], short[]) loop_optimization (after) |
| 162 | /// CHECK-DAG: <<I11:i\d+>> IntConstant 1111 loop:none |
| 163 | /// CHECK-DAG: <<I23:i\d+>> IntConstant 2323 loop:none |
| 164 | /// CHECK-DAG: <<Rpl1:d\d+>> VecReplicateScalar [<<I23>>] loop:none |
| 165 | /// CHECK-DAG: <<Rpl2:d\d+>> VecReplicateScalar [<<I11>>] loop:none |
| 166 | /// CHECK-DAG: <<Get:d\d+>> VecLoad loop:<<Loop:B\d+>> outer_loop:none |
| 167 | /// CHECK-DAG: <<Min:d\d+>> VecMin [<<Get>>,<<Rpl1>>] packed_type:Uint16 loop:<<Loop>> outer_loop:none |
| 168 | /// CHECK-DAG: <<Max:d\d+>> VecMax [<<Min>>,<<Rpl2>>] packed_type:Uint16 loop:<<Loop>> outer_loop:none |
| 169 | /// CHECK-DAG: VecStore [{{l\d+}},{{i\d+}},<<Max>>] loop:<<Loop>> outer_loop:none |
| 170 | private static void doitMinMaxUnsigned(short[] x, short[] y) { |
| 171 | int n = Math.min(x.length, y.length); |
| 172 | for (int i = 0; i < n; i++) { |
| 173 | x[i] = (short) Math.max(1111, Math.min(y[i] & 0xffff, 2323)); |
| 174 | } |
| 175 | } |
| 176 | |
Vladimir Marko | 2aaa44f | 2018-03-27 15:02:47 +0100 | [diff] [blame] | 177 | public static void main() { |
Aart Bik | c8e93c7 | 2017-05-10 10:49:22 -0700 | [diff] [blame] | 178 | short[] interesting = { |
| 179 | (short) 0x0000, (short) 0x0001, (short) 0x007f, |
| 180 | (short) 0x0080, (short) 0x0081, (short) 0x00ff, |
| 181 | (short) 0x0100, (short) 0x0101, (short) 0x017f, |
| 182 | (short) 0x0180, (short) 0x0181, (short) 0x01ff, |
| 183 | (short) 0x7f00, (short) 0x7f01, (short) 0x7f7f, |
| 184 | (short) 0x7f80, (short) 0x7f81, (short) 0x7fff, |
| 185 | (short) 0x8000, (short) 0x8001, (short) 0x807f, |
| 186 | (short) 0x8080, (short) 0x8081, (short) 0x80ff, |
| 187 | (short) 0x8100, (short) 0x8101, (short) 0x817f, |
| 188 | (short) 0x8180, (short) 0x8181, (short) 0x81ff, |
| 189 | (short) 0xff00, (short) 0xff01, (short) 0xff7f, |
| 190 | (short) 0xff80, (short) 0xff81, (short) 0xffff |
| 191 | }; |
| 192 | // Initialize cross-values for the interesting values. |
| 193 | int total = interesting.length * interesting.length; |
| 194 | short[] x = new short[total]; |
| 195 | short[] y = new short[total]; |
| 196 | short[] z = new short[total]; |
| 197 | int k = 0; |
| 198 | for (int i = 0; i < interesting.length; i++) { |
| 199 | for (int j = 0; j < interesting.length; j++) { |
| 200 | x[k] = 0; |
| 201 | y[k] = interesting[i]; |
| 202 | z[k] = interesting[j]; |
| 203 | k++; |
| 204 | } |
| 205 | } |
| 206 | |
| 207 | // And test. |
| 208 | doitMin(x, y, z); |
| 209 | for (int i = 0; i < total; i++) { |
| 210 | short expected = (short) Math.min(y[i], z[i]); |
| 211 | expectEquals(expected, x[i]); |
| 212 | } |
Aart Bik | 304c8a5 | 2017-05-23 11:01:13 -0700 | [diff] [blame] | 213 | doitMinUnsigned(x, y, z); |
| 214 | for (int i = 0; i < total; i++) { |
| 215 | short expected = (short) Math.min(y[i] & 0xffff, z[i] & 0xffff); |
| 216 | expectEquals(expected, x[i]); |
| 217 | } |
Aart Bik | c8e93c7 | 2017-05-10 10:49:22 -0700 | [diff] [blame] | 218 | doitMax(x, y, z); |
| 219 | for (int i = 0; i < total; i++) { |
| 220 | short expected = (short) Math.max(y[i], z[i]); |
| 221 | expectEquals(expected, x[i]); |
| 222 | } |
Aart Bik | 304c8a5 | 2017-05-23 11:01:13 -0700 | [diff] [blame] | 223 | doitMaxUnsigned(x, y, z); |
| 224 | for (int i = 0; i < total; i++) { |
| 225 | short expected = (short) Math.max(y[i] & 0xffff, z[i] & 0xffff); |
| 226 | expectEquals(expected, x[i]); |
| 227 | } |
Aart Bik | dbbac8f | 2017-09-01 13:06:08 -0700 | [diff] [blame] | 228 | doitMin100(x, y); |
| 229 | for (int i = 0; i < total; i++) { |
| 230 | short expected = (short) Math.min(y[i], 100); |
| 231 | expectEquals(expected, x[i]); |
| 232 | } |
Aart Bik | 5aac921 | 2018-04-03 14:06:43 -0700 | [diff] [blame] | 233 | doitMinMax(x, y); |
| 234 | for (int i = 0; i < total; i++) { |
| 235 | int s = y[i]; |
| 236 | short expected = (short) (s < -1111 ? -1111 : (s > 2323 ? 2323 : s)); |
| 237 | expectEquals(expected, x[i]); |
| 238 | } |
| 239 | doitMinMaxUnsigned(x, y); |
| 240 | for (int i = 0; i < total; i++) { |
| 241 | int u = y[i] & 0xffff; |
| 242 | short expected = (short) (u < 1111 ? 1111 : (u > 2323 ? 2323 : u)); |
| 243 | expectEquals(expected, x[i]); |
| 244 | } |
Aart Bik | c8e93c7 | 2017-05-10 10:49:22 -0700 | [diff] [blame] | 245 | |
Vladimir Marko | 2aaa44f | 2018-03-27 15:02:47 +0100 | [diff] [blame] | 246 | System.out.println("ShortSimdMinMax passed"); |
Aart Bik | c8e93c7 | 2017-05-10 10:49:22 -0700 | [diff] [blame] | 247 | } |
| 248 | |
| 249 | private static void expectEquals(short expected, short result) { |
| 250 | if (expected != result) { |
| 251 | throw new Error("Expected: " + expected + ", found: " + result); |
| 252 | } |
| 253 | } |
| 254 | } |