blob: 4711214c9dc669897dabe422ddaa0b2dfe0a534b [file] [log] [blame]
Aart Bikc8e93c72017-05-10 10:49:22 -07001/*
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 //
Aart Bik304c8a52017-05-23 11:01:13 -070030 /// CHECK-START-ARM64: 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
34 /// CHECK-DAG: <<Min:d\d+>> VecMin [<<Get1>>,<<Get2>>] unsigned:false loop:<<Loop>> outer_loop:none
35 /// CHECK-DAG: VecStore [{{l\d+}},<<Phi>>,<<Min>>] loop:<<Loop>> outer_loop:none
Goran Jakovljevic8fea1e12017-06-06 13:28:42 +020036 //
37 /// CHECK-START-MIPS64: 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
41 /// CHECK-DAG: <<Min:d\d+>> VecMin [<<Get1>>,<<Get2>>] unsigned:false loop:<<Loop>> outer_loop:none
42 /// CHECK-DAG: VecStore [{{l\d+}},<<Phi>>,<<Min>>] loop:<<Loop>> outer_loop:none
Aart Bikc8e93c72017-05-10 10:49:22 -070043 private static void doitMin(byte[] x, byte[] y, byte[] z) {
44 int min = Math.min(x.length, Math.min(y.length, z.length));
45 for (int i = 0; i < min; i++) {
46 x[i] = (byte) Math.min(y[i], z[i]);
47 }
48 }
49
Aart Bik304c8a52017-05-23 11:01:13 -070050 /// CHECK-START-ARM64: void Main.doitMinUnsigned(byte[], byte[], byte[]) loop_optimization (before)
51 /// CHECK-DAG: <<I255:i\d+>> IntConstant 255 loop:none
52 /// CHECK-DAG: <<Phi:i\d+>> Phi loop:<<Loop:B\d+>> outer_loop:none
53 /// CHECK-DAG: <<Get1:b\d+>> ArrayGet loop:<<Loop>> outer_loop:none
54 /// CHECK-DAG: <<Get2:b\d+>> ArrayGet loop:<<Loop>> outer_loop:none
55 /// CHECK-DAG: <<And1:i\d+>> And [<<Get1>>,<<I255>>] loop:<<Loop>> outer_loop:none
56 /// CHECK-DAG: <<And2:i\d+>> And [<<Get2>>,<<I255>>] loop:<<Loop>> outer_loop:none
57 /// CHECK-DAG: <<Min:i\d+>> InvokeStaticOrDirect [<<And1>>,<<And2>>] intrinsic:MathMinIntInt loop:<<Loop>> outer_loop:none
58 /// CHECK-DAG: <<Cnv:b\d+>> TypeConversion [<<Min>>] loop:<<Loop>> outer_loop:none
59 /// CHECK-DAG: ArraySet [{{l\d+}},<<Phi>>,<<Cnv>>] loop:<<Loop>> outer_loop:none
60 //
61 /// CHECK-START-ARM64: void Main.doitMinUnsigned(byte[], byte[], byte[]) loop_optimization (after)
62 /// CHECK-DAG: <<Phi:i\d+>> Phi loop:<<Loop:B\d+>> outer_loop:none
63 /// CHECK-DAG: <<Get1:d\d+>> VecLoad loop:<<Loop>> outer_loop:none
64 /// CHECK-DAG: <<Get2:d\d+>> VecLoad loop:<<Loop>> outer_loop:none
65 /// CHECK-DAG: <<Min:d\d+>> VecMin [<<Get1>>,<<Get2>>] unsigned:true loop:<<Loop>> outer_loop:none
66 /// CHECK-DAG: VecStore [{{l\d+}},<<Phi>>,<<Min>>] loop:<<Loop>> outer_loop:none
Goran Jakovljevic8fea1e12017-06-06 13:28:42 +020067 //
68 /// CHECK-START-MIPS64: void Main.doitMinUnsigned(byte[], byte[], byte[]) loop_optimization (after)
69 /// CHECK-DAG: <<Phi:i\d+>> Phi loop:<<Loop:B\d+>> outer_loop:none
70 /// CHECK-DAG: <<Get1:d\d+>> VecLoad loop:<<Loop>> outer_loop:none
71 /// CHECK-DAG: <<Get2:d\d+>> VecLoad loop:<<Loop>> outer_loop:none
72 /// CHECK-DAG: <<Min:d\d+>> VecMin [<<Get1>>,<<Get2>>] unsigned:true loop:<<Loop>> outer_loop:none
73 /// CHECK-DAG: VecStore [{{l\d+}},<<Phi>>,<<Min>>] loop:<<Loop>> outer_loop:none
Aart Bik304c8a52017-05-23 11:01:13 -070074 private static void doitMinUnsigned(byte[] x, byte[] y, byte[] z) {
75 int min = Math.min(x.length, Math.min(y.length, z.length));
76 for (int i = 0; i < min; i++) {
77 x[i] = (byte) Math.min(y[i] & 0xff, z[i] & 0xff);
78 }
79 }
80
Aart Bikc8e93c72017-05-10 10:49:22 -070081 /// CHECK-START: void Main.doitMax(byte[], byte[], byte[]) loop_optimization (before)
82 /// CHECK-DAG: <<Phi:i\d+>> Phi loop:<<Loop:B\d+>> outer_loop:none
83 /// CHECK-DAG: <<Get1:b\d+>> ArrayGet loop:<<Loop>> outer_loop:none
84 /// CHECK-DAG: <<Get2:b\d+>> ArrayGet loop:<<Loop>> outer_loop:none
85 /// CHECK-DAG: <<Max:i\d+>> InvokeStaticOrDirect [<<Get1>>,<<Get2>>] intrinsic:MathMaxIntInt loop:<<Loop>> outer_loop:none
86 /// CHECK-DAG: <<Cnv:b\d+>> TypeConversion [<<Max>>] loop:<<Loop>> outer_loop:none
87 /// CHECK-DAG: ArraySet [{{l\d+}},<<Phi>>,<<Cnv>>] loop:<<Loop>> outer_loop:none
88 //
Aart Bik304c8a52017-05-23 11:01:13 -070089 /// CHECK-START-ARM64: void Main.doitMax(byte[], byte[], byte[]) loop_optimization (after)
90 /// CHECK-DAG: <<Phi:i\d+>> Phi loop:<<Loop:B\d+>> outer_loop:none
91 /// CHECK-DAG: <<Get1:d\d+>> VecLoad loop:<<Loop>> outer_loop:none
92 /// CHECK-DAG: <<Get2:d\d+>> VecLoad loop:<<Loop>> outer_loop:none
93 /// CHECK-DAG: <<Max:d\d+>> VecMax [<<Get1>>,<<Get2>>] unsigned:false loop:<<Loop>> outer_loop:none
94 /// CHECK-DAG: VecStore [{{l\d+}},<<Phi>>,<<Max>>] loop:<<Loop>> outer_loop:none
Goran Jakovljevic8fea1e12017-06-06 13:28:42 +020095 //
96 /// CHECK-START-MIPS64: void Main.doitMax(byte[], byte[], byte[]) loop_optimization (after)
97 /// CHECK-DAG: <<Phi:i\d+>> Phi loop:<<Loop:B\d+>> outer_loop:none
98 /// CHECK-DAG: <<Get1:d\d+>> VecLoad loop:<<Loop>> outer_loop:none
99 /// CHECK-DAG: <<Get2:d\d+>> VecLoad loop:<<Loop>> outer_loop:none
100 /// CHECK-DAG: <<Max:d\d+>> VecMax [<<Get1>>,<<Get2>>] unsigned:false loop:<<Loop>> outer_loop:none
101 /// CHECK-DAG: VecStore [{{l\d+}},<<Phi>>,<<Max>>] loop:<<Loop>> outer_loop:none
Aart Bikc8e93c72017-05-10 10:49:22 -0700102 private static void doitMax(byte[] x, byte[] y, byte[] z) {
103 int min = Math.min(x.length, Math.min(y.length, z.length));
104 for (int i = 0; i < min; i++) {
105 x[i] = (byte) Math.max(y[i], z[i]);
106 }
107 }
108
Aart Bik304c8a52017-05-23 11:01:13 -0700109 /// CHECK-START-ARM64: void Main.doitMaxUnsigned(byte[], byte[], byte[]) loop_optimization (before)
110 /// CHECK-DAG: <<I255:i\d+>> IntConstant 255 loop:none
111 /// CHECK-DAG: <<Phi:i\d+>> Phi loop:<<Loop:B\d+>> outer_loop:none
112 /// CHECK-DAG: <<Get1:b\d+>> ArrayGet loop:<<Loop>> outer_loop:none
113 /// CHECK-DAG: <<Get2:b\d+>> ArrayGet loop:<<Loop>> outer_loop:none
114 /// CHECK-DAG: <<And1:i\d+>> And [<<Get1>>,<<I255>>] loop:<<Loop>> outer_loop:none
115 /// CHECK-DAG: <<And2:i\d+>> And [<<Get2>>,<<I255>>] loop:<<Loop>> outer_loop:none
116 /// CHECK-DAG: <<Max:i\d+>> InvokeStaticOrDirect [<<And1>>,<<And2>>] intrinsic:MathMaxIntInt loop:<<Loop>> outer_loop:none
117 /// CHECK-DAG: <<Cnv:b\d+>> TypeConversion [<<Max>>] loop:<<Loop>> outer_loop:none
118 /// CHECK-DAG: ArraySet [{{l\d+}},<<Phi>>,<<Cnv>>] loop:<<Loop>> outer_loop:none
119 //
120 /// CHECK-START-ARM64: void Main.doitMaxUnsigned(byte[], byte[], byte[]) loop_optimization (after)
121 /// CHECK-DAG: <<Phi:i\d+>> Phi loop:<<Loop:B\d+>> outer_loop:none
122 /// CHECK-DAG: <<Get1:d\d+>> VecLoad loop:<<Loop>> outer_loop:none
123 /// CHECK-DAG: <<Get2:d\d+>> VecLoad loop:<<Loop>> outer_loop:none
124 /// CHECK-DAG: <<Max:d\d+>> VecMax [<<Get1>>,<<Get2>>] unsigned:true loop:<<Loop>> outer_loop:none
125 /// CHECK-DAG: VecStore [{{l\d+}},<<Phi>>,<<Max>>] loop:<<Loop>> outer_loop:none
Goran Jakovljevic8fea1e12017-06-06 13:28:42 +0200126 //
127 /// CHECK-START-MIPS64: void Main.doitMaxUnsigned(byte[], byte[], byte[]) loop_optimization (after)
128 /// CHECK-DAG: <<Phi:i\d+>> Phi loop:<<Loop:B\d+>> outer_loop:none
129 /// CHECK-DAG: <<Get1:d\d+>> VecLoad loop:<<Loop>> outer_loop:none
130 /// CHECK-DAG: <<Get2:d\d+>> VecLoad loop:<<Loop>> outer_loop:none
131 /// CHECK-DAG: <<Max:d\d+>> VecMax [<<Get1>>,<<Get2>>] unsigned:true loop:<<Loop>> outer_loop:none
132 /// CHECK-DAG: VecStore [{{l\d+}},<<Phi>>,<<Max>>] loop:<<Loop>> outer_loop:none
Aart Bik304c8a52017-05-23 11:01:13 -0700133 private static void doitMaxUnsigned(byte[] x, byte[] y, byte[] z) {
134 int min = Math.min(x.length, Math.min(y.length, z.length));
135 for (int i = 0; i < min; i++) {
136 x[i] = (byte) Math.max(y[i] & 0xff, z[i] & 0xff);
137 }
138 }
139
Aart Bikc8e93c72017-05-10 10:49:22 -0700140 public static void main(String[] args) {
141 // Initialize cross-values for all possible values.
142 int total = 256 * 256;
143 byte[] x = new byte[total];
144 byte[] y = new byte[total];
145 byte[] z = new byte[total];
146 int k = 0;
147 for (int i = 0; i < 256; i++) {
148 for (int j = 0; j < 256; j++) {
149 x[k] = 0;
150 y[k] = (byte) i;
151 z[k] = (byte) j;
152 k++;
153 }
154 }
155
156 // And test.
157 doitMin(x, y, z);
158 for (int i = 0; i < total; i++) {
159 byte expected = (byte) Math.min(y[i], z[i]);
160 expectEquals(expected, x[i]);
161 }
Aart Bik304c8a52017-05-23 11:01:13 -0700162 doitMinUnsigned(x, y, z);
163 for (int i = 0; i < total; i++) {
164 byte expected = (byte) Math.min(y[i] & 0xff, z[i] & 0xff);
165 expectEquals(expected, x[i]);
166 }
Aart Bikc8e93c72017-05-10 10:49:22 -0700167 doitMax(x, y, z);
168 for (int i = 0; i < total; i++) {
169 byte expected = (byte) Math.max(y[i], z[i]);
170 expectEquals(expected, x[i]);
171 }
Aart Bik304c8a52017-05-23 11:01:13 -0700172 doitMaxUnsigned(x, y, z);
173 for (int i = 0; i < total; i++) {
174 byte expected = (byte) Math.max(y[i] & 0xff, z[i] & 0xff);
175 expectEquals(expected, x[i]);
176 }
Aart Bikc8e93c72017-05-10 10:49:22 -0700177
178 System.out.println("passed");
179 }
180
181 private static void expectEquals(byte expected, byte result) {
182 if (expected != result) {
183 throw new Error("Expected: " + expected + ", found: " + result);
184 }
185 }
186}