Gitiles
Code Review Sign In
review.blissroms.org / platform_art / 61b922847403ac0e74b6477114c81a28ac2e01a0 / . / test / 651-checker-byte-simd-minmax / src / Main.java
blob: fcf62d3c4c75d8f450a676a833fd52c5e6fc5c88 [file] [log] [blame]
Aart Bikc8e93c72017-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 */
20public class Main {
21
22 /// CHECK-START: void Main.doitMin(byte[], byte[], byte[]) loop_optimization (before)
23 /// CHECK-DAG: <<Phi:i\d+>> Phi loop:<<Loop:B\d+>> outer_loop:none
24 /// CHECK-DAG: <<Get1:b\d+>> ArrayGet loop:<<Loop>> outer_loop:none
25 /// CHECK-DAG: <<Get2:b\d+>> ArrayGet loop:<<Loop>> outer_loop:none
26 /// CHECK-DAG: <<Min:i\d+>> InvokeStaticOrDirect [<<Get1>>,<<Get2>>] intrinsic:MathMinIntInt loop:<<Loop>> outer_loop:none
27 /// CHECK-DAG: <<Cnv:b\d+>> TypeConversion [<<Min>>] loop:<<Loop>> outer_loop:none
28 /// CHECK-DAG: ArraySet [{{l\d+}},<<Phi>>,<<Cnv>>] loop:<<Loop>> outer_loop:none
29 //
Artem Serov8f7c4102017-06-21 11:21:37 +0100[diff] [blame]30 /// CHECK-START-ARM: void Main.doitMin(byte[], byte[], byte[]) loop_optimization (after)
31 /// CHECK-DAG: <<Phi:i\d+>> Phi loop:<<Loop:B\d+>> outer_loop:none
32 /// CHECK-DAG: <<Get1:d\d+>> VecLoad loop:<<Loop>> outer_loop:none
33 /// CHECK-DAG: <<Get2:d\d+>> VecLoad loop:<<Loop>> outer_loop:none
Vladimir Markod5d2f2c2017-09-26 12:37:26 +0100[diff] [blame]34 /// CHECK-DAG: <<Min:d\d+>> VecMin [<<Get1>>,<<Get2>>] packed_type:Int8 loop:<<Loop>> outer_loop:none
Artem Serov8f7c4102017-06-21 11:21:37 +0100[diff] [blame]35 /// CHECK-DAG: VecStore [{{l\d+}},<<Phi>>,<<Min>>] loop:<<Loop>> outer_loop:none
36 //
Aart Bik304c8a52017-05-23 11:01:13 -0700[diff] [blame]37 /// CHECK-START-ARM64: void Main.doitMin(byte[], byte[], byte[]) loop_optimization (after)
38 /// CHECK-DAG: <<Phi:i\d+>> Phi loop:<<Loop:B\d+>> outer_loop:none
39 /// CHECK-DAG: <<Get1:d\d+>> VecLoad loop:<<Loop>> outer_loop:none
40 /// CHECK-DAG: <<Get2:d\d+>> VecLoad loop:<<Loop>> outer_loop:none
Vladimir Markod5d2f2c2017-09-26 12:37:26 +0100[diff] [blame]41 /// CHECK-DAG: <<Min:d\d+>> VecMin [<<Get1>>,<<Get2>>] packed_type:Int8 loop:<<Loop>> outer_loop:none
Aart Bik304c8a52017-05-23 11:01:13 -0700[diff] [blame]42 /// CHECK-DAG: VecStore [{{l\d+}},<<Phi>>,<<Min>>] loop:<<Loop>> outer_loop:none
Goran Jakovljevic8fea1e12017-06-06 13:28:42 +0200[diff] [blame]43 //
44 /// CHECK-START-MIPS64: void Main.doitMin(byte[], byte[], byte[]) loop_optimization (after)
45 /// CHECK-DAG: <<Phi:i\d+>> Phi loop:<<Loop:B\d+>> outer_loop:none
46 /// CHECK-DAG: <<Get1:d\d+>> VecLoad loop:<<Loop>> outer_loop:none
47 /// CHECK-DAG: <<Get2:d\d+>> VecLoad loop:<<Loop>> outer_loop:none
Vladimir Markod5d2f2c2017-09-26 12:37:26 +0100[diff] [blame]48 /// CHECK-DAG: <<Min:d\d+>> VecMin [<<Get1>>,<<Get2>>] packed_type:Int8 loop:<<Loop>> outer_loop:none
Goran Jakovljevic8fea1e12017-06-06 13:28:42 +0200[diff] [blame]49 /// CHECK-DAG: VecStore [{{l\d+}},<<Phi>>,<<Min>>] loop:<<Loop>> outer_loop:none
Aart Bikc8e93c72017-05-10 10:49:22 -0700[diff] [blame]50 private static void doitMin(byte[] x, byte[] y, byte[] z) {
51 int min = Math.min(x.length, Math.min(y.length, z.length));
52 for (int i = 0; i < min; i++) {
53 x[i] = (byte) Math.min(y[i], z[i]);
54 }
55 }
56
Vladimir Marko61b92282017-10-11 13:23:17 +0100[diff] [blame^]57 /// CHECK-START-ARM64: void Main.doitMinUnsigned(byte[], byte[], byte[]) instruction_simplifier (before)
Aart Bik304c8a52017-05-23 11:01:13 -0700[diff] [blame]58 /// CHECK-DAG: <<I255:i\d+>> IntConstant 255 loop:none
59 /// CHECK-DAG: <<Phi:i\d+>> Phi loop:<<Loop:B\d+>> outer_loop:none
60 /// CHECK-DAG: <<Get1:b\d+>> ArrayGet loop:<<Loop>> outer_loop:none
61 /// CHECK-DAG: <<Get2:b\d+>> ArrayGet loop:<<Loop>> outer_loop:none
62 /// CHECK-DAG: <<And1:i\d+>> And [<<Get1>>,<<I255>>] loop:<<Loop>> outer_loop:none
63 /// CHECK-DAG: <<And2:i\d+>> And [<<Get2>>,<<I255>>] loop:<<Loop>> outer_loop:none
64 /// CHECK-DAG: <<Min:i\d+>> InvokeStaticOrDirect [<<And1>>,<<And2>>] intrinsic:MathMinIntInt loop:<<Loop>> outer_loop:none
65 /// CHECK-DAG: <<Cnv:b\d+>> TypeConversion [<<Min>>] loop:<<Loop>> outer_loop:none
Vladimir Marko61b92282017-10-11 13:23:17 +0100[diff] [blame^]66 /// CHECK-DAG: ArraySet [{{l\d+}},{{i\d+}},<<Cnv>>] loop:<<Loop>> outer_loop:none
67 //
68 /// CHECK-START-ARM64: void Main.doitMinUnsigned(byte[], byte[], byte[]) loop_optimization (before)
69 /// CHECK-DAG: <<Phi:i\d+>> Phi loop:<<Loop:B\d+>> outer_loop:none
70 /// CHECK-DAG: <<Get1:a\d+>> ArrayGet loop:<<Loop>> outer_loop:none
71 /// CHECK-DAG: <<Get2:a\d+>> ArrayGet loop:<<Loop>> outer_loop:none
72 /// CHECK-DAG: <<Min:i\d+>> InvokeStaticOrDirect [<<Get1>>,<<Get2>>] intrinsic:MathMinIntInt loop:<<Loop>> outer_loop:none
73 /// CHECK-DAG: <<Cnv:b\d+>> TypeConversion [<<Min>>] loop:<<Loop>> outer_loop:none
Aart Bik304c8a52017-05-23 11:01:13 -0700[diff] [blame]74 /// CHECK-DAG: ArraySet [{{l\d+}},<<Phi>>,<<Cnv>>] loop:<<Loop>> outer_loop:none
75 //
Vladimir Marko61b92282017-10-11 13:23:17 +0100[diff] [blame^]76 // FIXME: Pattern currently not detected. b/67935418
77 // CHECK-START-ARM: void Main.doitMinUnsigned(byte[], byte[], byte[]) loop_optimization (after)
78 // CHECK-DAG: <<Phi:i\d+>> Phi loop:<<Loop:B\d+>> outer_loop:none
79 // CHECK-DAG: <<Get1:d\d+>> VecLoad loop:<<Loop>> outer_loop:none
80 // CHECK-DAG: <<Get2:d\d+>> VecLoad loop:<<Loop>> outer_loop:none
81 // CHECK-DAG: <<Min:d\d+>> VecMin [<<Get1>>,<<Get2>>] packed_type:Uint8 loop:<<Loop>> outer_loop:none
82 // CHECK-DAG: VecStore [{{l\d+}},<<Phi>>,<<Min>>] loop:<<Loop>> outer_loop:none
Artem Serov8f7c4102017-06-21 11:21:37 +0100[diff] [blame]83 //
Vladimir Marko61b92282017-10-11 13:23:17 +0100[diff] [blame^]84 // CHECK-START-ARM64: void Main.doitMinUnsigned(byte[], byte[], byte[]) loop_optimization (after)
85 // CHECK-DAG: <<Phi:i\d+>> Phi loop:<<Loop:B\d+>> outer_loop:none
86 // CHECK-DAG: <<Get1:d\d+>> VecLoad loop:<<Loop>> outer_loop:none
87 // CHECK-DAG: <<Get2:d\d+>> VecLoad loop:<<Loop>> outer_loop:none
88 // CHECK-DAG: <<Min:d\d+>> VecMin [<<Get1>>,<<Get2>>] packed_type:Uint8 loop:<<Loop>> outer_loop:none
89 // CHECK-DAG: VecStore [{{l\d+}},<<Phi>>,<<Min>>] loop:<<Loop>> outer_loop:none
Goran Jakovljevic8fea1e12017-06-06 13:28:42 +0200[diff] [blame]90 //
Vladimir Marko61b92282017-10-11 13:23:17 +0100[diff] [blame^]91 // CHECK-START-MIPS64: void Main.doitMinUnsigned(byte[], byte[], byte[]) loop_optimization (after)
92 // CHECK-DAG: <<Phi:i\d+>> Phi loop:<<Loop:B\d+>> outer_loop:none
93 // CHECK-DAG: <<Get1:d\d+>> VecLoad loop:<<Loop>> outer_loop:none
94 // CHECK-DAG: <<Get2:d\d+>> VecLoad loop:<<Loop>> outer_loop:none
95 // CHECK-DAG: <<Min:d\d+>> VecMin [<<Get1>>,<<Get2>>] packed_type:Uint8 loop:<<Loop>> outer_loop:none
96 // CHECK-DAG: VecStore [{{l\d+}},<<Phi>>,<<Min>>] loop:<<Loop>> outer_loop:none
Aart Bik304c8a52017-05-23 11:01:13 -0700[diff] [blame]97 private static void doitMinUnsigned(byte[] x, byte[] y, byte[] z) {
98 int min = Math.min(x.length, Math.min(y.length, z.length));
99 for (int i = 0; i < min; i++) {
100 x[i] = (byte) Math.min(y[i] & 0xff, z[i] & 0xff);
101 }
102 }
103
Aart Bikc8e93c72017-05-10 10:49:22 -0700[diff] [blame]104 /// CHECK-START: void Main.doitMax(byte[], byte[], byte[]) loop_optimization (before)
105 /// CHECK-DAG: <<Phi:i\d+>> Phi loop:<<Loop:B\d+>> outer_loop:none
106 /// CHECK-DAG: <<Get1:b\d+>> ArrayGet loop:<<Loop>> outer_loop:none
107 /// CHECK-DAG: <<Get2:b\d+>> ArrayGet loop:<<Loop>> outer_loop:none
108 /// CHECK-DAG: <<Max:i\d+>> InvokeStaticOrDirect [<<Get1>>,<<Get2>>] intrinsic:MathMaxIntInt loop:<<Loop>> outer_loop:none
109 /// CHECK-DAG: <<Cnv:b\d+>> TypeConversion [<<Max>>] loop:<<Loop>> outer_loop:none
110 /// CHECK-DAG: ArraySet [{{l\d+}},<<Phi>>,<<Cnv>>] loop:<<Loop>> outer_loop:none
111 //
Artem Serov8f7c4102017-06-21 11:21:37 +0100[diff] [blame]112 /// CHECK-START-ARM: void Main.doitMax(byte[], byte[], byte[]) loop_optimization (after)
113 /// CHECK-DAG: <<Phi:i\d+>> Phi loop:<<Loop:B\d+>> outer_loop:none
114 /// CHECK-DAG: <<Get1:d\d+>> VecLoad loop:<<Loop>> outer_loop:none
115 /// CHECK-DAG: <<Get2:d\d+>> VecLoad loop:<<Loop>> outer_loop:none
Vladimir Markod5d2f2c2017-09-26 12:37:26 +0100[diff] [blame]116 /// CHECK-DAG: <<Max:d\d+>> VecMax [<<Get1>>,<<Get2>>] packed_type:Int8 loop:<<Loop>> outer_loop:none
Artem Serov8f7c4102017-06-21 11:21:37 +0100[diff] [blame]117 /// CHECK-DAG: VecStore [{{l\d+}},<<Phi>>,<<Max>>] loop:<<Loop>> outer_loop:none
118 //
Aart Bik304c8a52017-05-23 11:01:13 -0700[diff] [blame]119 /// CHECK-START-ARM64: void Main.doitMax(byte[], byte[], byte[]) loop_optimization (after)
120 /// CHECK-DAG: <<Phi:i\d+>> Phi loop:<<Loop:B\d+>> outer_loop:none
121 /// CHECK-DAG: <<Get1:d\d+>> VecLoad loop:<<Loop>> outer_loop:none
122 /// CHECK-DAG: <<Get2:d\d+>> VecLoad loop:<<Loop>> outer_loop:none
Vladimir Markod5d2f2c2017-09-26 12:37:26 +0100[diff] [blame]123 /// CHECK-DAG: <<Max:d\d+>> VecMax [<<Get1>>,<<Get2>>] packed_type:Int8 loop:<<Loop>> outer_loop:none
Aart Bik304c8a52017-05-23 11:01:13 -0700[diff] [blame]124 /// CHECK-DAG: VecStore [{{l\d+}},<<Phi>>,<<Max>>] loop:<<Loop>> outer_loop:none
Goran Jakovljevic8fea1e12017-06-06 13:28:42 +0200[diff] [blame]125 //
126 /// CHECK-START-MIPS64: void Main.doitMax(byte[], byte[], byte[]) loop_optimization (after)
127 /// CHECK-DAG: <<Phi:i\d+>> Phi loop:<<Loop:B\d+>> outer_loop:none
128 /// CHECK-DAG: <<Get1:d\d+>> VecLoad loop:<<Loop>> outer_loop:none
129 /// CHECK-DAG: <<Get2:d\d+>> VecLoad loop:<<Loop>> outer_loop:none
Vladimir Markod5d2f2c2017-09-26 12:37:26 +0100[diff] [blame]130 /// CHECK-DAG: <<Max:d\d+>> VecMax [<<Get1>>,<<Get2>>] packed_type:Int8 loop:<<Loop>> outer_loop:none
Goran Jakovljevic8fea1e12017-06-06 13:28:42 +0200[diff] [blame]131 /// CHECK-DAG: VecStore [{{l\d+}},<<Phi>>,<<Max>>] loop:<<Loop>> outer_loop:none
Aart Bikc8e93c72017-05-10 10:49:22 -0700[diff] [blame]132 private static void doitMax(byte[] x, byte[] y, byte[] z) {
133 int min = Math.min(x.length, Math.min(y.length, z.length));
134 for (int i = 0; i < min; i++) {
135 x[i] = (byte) Math.max(y[i], z[i]);
136 }
137 }
138
Vladimir Marko61b92282017-10-11 13:23:17 +0100[diff] [blame^]139 /// CHECK-START-ARM64: void Main.doitMaxUnsigned(byte[], byte[], byte[]) instruction_simplifier (before)
Aart Bik304c8a52017-05-23 11:01:13 -0700[diff] [blame]140 /// CHECK-DAG: <<I255:i\d+>> IntConstant 255 loop:none
141 /// CHECK-DAG: <<Phi:i\d+>> Phi loop:<<Loop:B\d+>> outer_loop:none
142 /// CHECK-DAG: <<Get1:b\d+>> ArrayGet loop:<<Loop>> outer_loop:none
143 /// CHECK-DAG: <<Get2:b\d+>> ArrayGet loop:<<Loop>> outer_loop:none
144 /// CHECK-DAG: <<And1:i\d+>> And [<<Get1>>,<<I255>>] loop:<<Loop>> outer_loop:none
145 /// CHECK-DAG: <<And2:i\d+>> And [<<Get2>>,<<I255>>] loop:<<Loop>> outer_loop:none
146 /// CHECK-DAG: <<Max:i\d+>> InvokeStaticOrDirect [<<And1>>,<<And2>>] intrinsic:MathMaxIntInt loop:<<Loop>> outer_loop:none
147 /// CHECK-DAG: <<Cnv:b\d+>> TypeConversion [<<Max>>] loop:<<Loop>> outer_loop:none
Vladimir Marko61b92282017-10-11 13:23:17 +0100[diff] [blame^]148 /// CHECK-DAG: ArraySet [{{l\d+}},{{i\d+}},<<Cnv>>] loop:<<Loop>> outer_loop:none
149 //
150 /// CHECK-START-ARM64: void Main.doitMaxUnsigned(byte[], byte[], byte[]) loop_optimization (before)
151 /// CHECK-DAG: <<Phi:i\d+>> Phi loop:<<Loop:B\d+>> outer_loop:none
152 /// CHECK-DAG: <<Get1:a\d+>> ArrayGet loop:<<Loop>> outer_loop:none
153 /// CHECK-DAG: <<Get2:a\d+>> ArrayGet loop:<<Loop>> outer_loop:none
154 /// CHECK-DAG: <<Max:i\d+>> InvokeStaticOrDirect [<<Get1>>,<<Get2>>] intrinsic:MathMaxIntInt loop:<<Loop>> outer_loop:none
155 /// CHECK-DAG: <<Cnv:b\d+>> TypeConversion [<<Max>>] loop:<<Loop>> outer_loop:none
Aart Bik304c8a52017-05-23 11:01:13 -0700[diff] [blame]156 /// CHECK-DAG: ArraySet [{{l\d+}},<<Phi>>,<<Cnv>>] loop:<<Loop>> outer_loop:none
157 //
Vladimir Marko61b92282017-10-11 13:23:17 +0100[diff] [blame^]158 // FIXME: Pattern currently not detected. b/67935418
159 // CHECK-START-ARM: void Main.doitMaxUnsigned(byte[], byte[], byte[]) loop_optimization (after)
160 // CHECK-DAG: <<Phi:i\d+>> Phi loop:<<Loop:B\d+>> outer_loop:none
161 // CHECK-DAG: <<Get1:d\d+>> VecLoad loop:<<Loop>> outer_loop:none
162 // CHECK-DAG: <<Get2:d\d+>> VecLoad loop:<<Loop>> outer_loop:none
163 // CHECK-DAG: <<Max:d\d+>> VecMax [<<Get1>>,<<Get2>>] packed_type:Uint8 loop:<<Loop>> outer_loop:none
164 // CHECK-DAG: VecStore [{{l\d+}},<<Phi>>,<<Max>>] loop:<<Loop>> outer_loop:none
Artem Serov8f7c4102017-06-21 11:21:37 +0100[diff] [blame]165 //
Vladimir Marko61b92282017-10-11 13:23:17 +0100[diff] [blame^]166 // CHECK-START-ARM64: void Main.doitMaxUnsigned(byte[], byte[], byte[]) loop_optimization (after)
167 // CHECK-DAG: <<Phi:i\d+>> Phi loop:<<Loop:B\d+>> outer_loop:none
168 // CHECK-DAG: <<Get1:d\d+>> VecLoad loop:<<Loop>> outer_loop:none
169 // CHECK-DAG: <<Get2:d\d+>> VecLoad loop:<<Loop>> outer_loop:none
170 // CHECK-DAG: <<Max:d\d+>> VecMax [<<Get1>>,<<Get2>>] packed_type:Uint8 loop:<<Loop>> outer_loop:none
171 // CHECK-DAG: VecStore [{{l\d+}},<<Phi>>,<<Max>>] loop:<<Loop>> outer_loop:none
Goran Jakovljevic8fea1e12017-06-06 13:28:42 +0200[diff] [blame]172 //
Vladimir Marko61b92282017-10-11 13:23:17 +0100[diff] [blame^]173 // CHECK-START-MIPS64: void Main.doitMaxUnsigned(byte[], byte[], byte[]) loop_optimization (after)
174 // CHECK-DAG: <<Phi:i\d+>> Phi loop:<<Loop:B\d+>> outer_loop:none
175 // CHECK-DAG: <<Get1:d\d+>> VecLoad loop:<<Loop>> outer_loop:none
176 // CHECK-DAG: <<Get2:d\d+>> VecLoad loop:<<Loop>> outer_loop:none
177 // CHECK-DAG: <<Max:d\d+>> VecMax [<<Get1>>,<<Get2>>] packed_type:Uint8 loop:<<Loop>> outer_loop:none
178 // CHECK-DAG: VecStore [{{l\d+}},<<Phi>>,<<Max>>] loop:<<Loop>> outer_loop:none
Aart Bik304c8a52017-05-23 11:01:13 -0700[diff] [blame]179 private static void doitMaxUnsigned(byte[] x, byte[] y, byte[] z) {
180 int min = Math.min(x.length, Math.min(y.length, z.length));
181 for (int i = 0; i < min; i++) {
182 x[i] = (byte) Math.max(y[i] & 0xff, z[i] & 0xff);
183 }
184 }
185
Aart Bikdbbac8f2017-09-01 13:06:08 -0700[diff] [blame]186 /// CHECK-START: void Main.doitMin100(byte[], byte[]) loop_optimization (before)
187 /// CHECK-DAG: <<I100:i\d+>> IntConstant 100 loop:none
188 /// CHECK-DAG: <<Phi:i\d+>> Phi loop:<<Loop:B\d+>> outer_loop:none
189 /// CHECK-DAG: <<Get:b\d+>> ArrayGet loop:<<Loop>> outer_loop:none
190 /// CHECK-DAG: <<Min:i\d+>> InvokeStaticOrDirect [<<Get>>,<<I100>>] intrinsic:MathMinIntInt loop:<<Loop>> outer_loop:none
191 /// CHECK-DAG: <<Cnv:b\d+>> TypeConversion [<<Min>>] loop:<<Loop>> outer_loop:none
192 /// CHECK-DAG: ArraySet [{{l\d+}},<<Phi>>,<<Cnv>>] loop:<<Loop>> outer_loop:none
193 //
194 /// CHECK-START-ARM64: void Main.doitMin100(byte[], byte[]) loop_optimization (after)
195 /// CHECK-DAG: <<I100:i\d+>> IntConstant 100 loop:none
196 /// CHECK-DAG: <<Repl:d\d+>> VecReplicateScalar [<<I100>>] loop:none
197 /// CHECK-DAG: <<Phi:i\d+>> Phi loop:<<Loop:B\d+>> outer_loop:none
198 /// CHECK-DAG: <<Get:d\d+>> VecLoad loop:<<Loop>> outer_loop:none
Vladimir Markod5d2f2c2017-09-26 12:37:26 +0100[diff] [blame]199 /// CHECK-DAG: <<Min:d\d+>> VecMin [<<Get>>,<<Repl>>] packed_type:Int8 loop:<<Loop>> outer_loop:none
Aart Bikdbbac8f2017-09-01 13:06:08 -0700[diff] [blame]200 /// CHECK-DAG: VecStore [{{l\d+}},<<Phi>>,<<Min>>] loop:<<Loop>> outer_loop:none
201 private static void doitMin100(byte[] x, byte[] y) {
202 int min = Math.min(x.length, y.length);
203 for (int i = 0; i < min; i++) {
204 x[i] = (byte) Math.min(y[i], 100);
205 }
206 }
207
Aart Bikc8e93c72017-05-10 10:49:22 -0700[diff] [blame]208 public static void main(String[] args) {
209 // Initialize cross-values for all possible values.
210 int total = 256 * 256;
211 byte[] x = new byte[total];
212 byte[] y = new byte[total];
213 byte[] z = new byte[total];
214 int k = 0;
215 for (int i = 0; i < 256; i++) {
216 for (int j = 0; j < 256; j++) {
217 x[k] = 0;
218 y[k] = (byte) i;
219 z[k] = (byte) j;
220 k++;
221 }
222 }
223
224 // And test.
225 doitMin(x, y, z);
226 for (int i = 0; i < total; i++) {
227 byte expected = (byte) Math.min(y[i], z[i]);
228 expectEquals(expected, x[i]);
229 }
Aart Bik304c8a52017-05-23 11:01:13 -0700[diff] [blame]230 doitMinUnsigned(x, y, z);
231 for (int i = 0; i < total; i++) {
232 byte expected = (byte) Math.min(y[i] & 0xff, z[i] & 0xff);
233 expectEquals(expected, x[i]);
234 }
Aart Bikc8e93c72017-05-10 10:49:22 -0700[diff] [blame]235 doitMax(x, y, z);
236 for (int i = 0; i < total; i++) {
237 byte expected = (byte) Math.max(y[i], z[i]);
238 expectEquals(expected, x[i]);
239 }
Aart Bik304c8a52017-05-23 11:01:13 -0700[diff] [blame]240 doitMaxUnsigned(x, y, z);
241 for (int i = 0; i < total; i++) {
242 byte expected = (byte) Math.max(y[i] & 0xff, z[i] & 0xff);
243 expectEquals(expected, x[i]);
244 }
Aart Bikdbbac8f2017-09-01 13:06:08 -0700[diff] [blame]245 doitMin100(x, y);
246 for (int i = 0; i < total; i++) {
247 byte expected = (byte) Math.min(y[i], 100);
248 expectEquals(expected, x[i]);
249 }
Aart Bikc8e93c72017-05-10 10:49:22 -0700[diff] [blame]250
251 System.out.println("passed");
252 }
253
254 private static void expectEquals(byte expected, byte result) {
255 if (expected != result) {
256 throw new Error("Expected: " + expected + ", found: " + result);
257 }
258 }
259}