Gitiles
Code Review Sign In
review.blissroms.org / platform_art / 304c8a5dfe92d5677e9561270b19313d3e450c59 / . / test / 651-checker-byte-simd-minmax / src / Main.java
blob: fe4580784a4a9be61356a34570d9b09aea341829 [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 //
Aart Bik304c8a52017-05-23 11:01:13 -0700[diff] [blame^]30 /// 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
Aart Bikc8e93c72017-05-10 10:49:22 -0700[diff] [blame]36 private static void doitMin(byte[] x, byte[] y, byte[] z) {
37 int min = Math.min(x.length, Math.min(y.length, z.length));
38 for (int i = 0; i < min; i++) {
39 x[i] = (byte) Math.min(y[i], z[i]);
40 }
41 }
42
Aart Bik304c8a52017-05-23 11:01:13 -0700[diff] [blame^]43 /// CHECK-START-ARM64: void Main.doitMinUnsigned(byte[], byte[], byte[]) loop_optimization (before)
44 /// CHECK-DAG: <<I255:i\d+>> IntConstant 255 loop:none
45 /// CHECK-DAG: <<Phi:i\d+>> Phi loop:<<Loop:B\d+>> outer_loop:none
46 /// CHECK-DAG: <<Get1:b\d+>> ArrayGet loop:<<Loop>> outer_loop:none
47 /// CHECK-DAG: <<Get2:b\d+>> ArrayGet loop:<<Loop>> outer_loop:none
48 /// CHECK-DAG: <<And1:i\d+>> And [<<Get1>>,<<I255>>] loop:<<Loop>> outer_loop:none
49 /// CHECK-DAG: <<And2:i\d+>> And [<<Get2>>,<<I255>>] loop:<<Loop>> outer_loop:none
50 /// CHECK-DAG: <<Min:i\d+>> InvokeStaticOrDirect [<<And1>>,<<And2>>] intrinsic:MathMinIntInt loop:<<Loop>> outer_loop:none
51 /// CHECK-DAG: <<Cnv:b\d+>> TypeConversion [<<Min>>] loop:<<Loop>> outer_loop:none
52 /// CHECK-DAG: ArraySet [{{l\d+}},<<Phi>>,<<Cnv>>] loop:<<Loop>> outer_loop:none
53 //
54 /// CHECK-START-ARM64: void Main.doitMinUnsigned(byte[], byte[], byte[]) loop_optimization (after)
55 /// CHECK-DAG: <<Phi:i\d+>> Phi loop:<<Loop:B\d+>> outer_loop:none
56 /// CHECK-DAG: <<Get1:d\d+>> VecLoad loop:<<Loop>> outer_loop:none
57 /// CHECK-DAG: <<Get2:d\d+>> VecLoad loop:<<Loop>> outer_loop:none
58 /// CHECK-DAG: <<Min:d\d+>> VecMin [<<Get1>>,<<Get2>>] unsigned:true loop:<<Loop>> outer_loop:none
59 /// CHECK-DAG: VecStore [{{l\d+}},<<Phi>>,<<Min>>] loop:<<Loop>> outer_loop:none
60 private static void doitMinUnsigned(byte[] x, byte[] y, byte[] z) {
61 int min = Math.min(x.length, Math.min(y.length, z.length));
62 for (int i = 0; i < min; i++) {
63 x[i] = (byte) Math.min(y[i] & 0xff, z[i] & 0xff);
64 }
65 }
66
Aart Bikc8e93c72017-05-10 10:49:22 -0700[diff] [blame]67 /// CHECK-START: void Main.doitMax(byte[], byte[], byte[]) loop_optimization (before)
68 /// CHECK-DAG: <<Phi:i\d+>> Phi loop:<<Loop:B\d+>> outer_loop:none
69 /// CHECK-DAG: <<Get1:b\d+>> ArrayGet loop:<<Loop>> outer_loop:none
70 /// CHECK-DAG: <<Get2:b\d+>> ArrayGet loop:<<Loop>> outer_loop:none
71 /// CHECK-DAG: <<Max:i\d+>> InvokeStaticOrDirect [<<Get1>>,<<Get2>>] intrinsic:MathMaxIntInt loop:<<Loop>> outer_loop:none
72 /// CHECK-DAG: <<Cnv:b\d+>> TypeConversion [<<Max>>] loop:<<Loop>> outer_loop:none
73 /// CHECK-DAG: ArraySet [{{l\d+}},<<Phi>>,<<Cnv>>] loop:<<Loop>> outer_loop:none
74 //
Aart Bik304c8a52017-05-23 11:01:13 -0700[diff] [blame^]75 /// CHECK-START-ARM64: void Main.doitMax(byte[], byte[], byte[]) loop_optimization (after)
76 /// CHECK-DAG: <<Phi:i\d+>> Phi loop:<<Loop:B\d+>> outer_loop:none
77 /// CHECK-DAG: <<Get1:d\d+>> VecLoad loop:<<Loop>> outer_loop:none
78 /// CHECK-DAG: <<Get2:d\d+>> VecLoad loop:<<Loop>> outer_loop:none
79 /// CHECK-DAG: <<Max:d\d+>> VecMax [<<Get1>>,<<Get2>>] unsigned:false loop:<<Loop>> outer_loop:none
80 /// CHECK-DAG: VecStore [{{l\d+}},<<Phi>>,<<Max>>] loop:<<Loop>> outer_loop:none
Aart Bikc8e93c72017-05-10 10:49:22 -0700[diff] [blame]81 private static void doitMax(byte[] x, byte[] y, byte[] z) {
82 int min = Math.min(x.length, Math.min(y.length, z.length));
83 for (int i = 0; i < min; i++) {
84 x[i] = (byte) Math.max(y[i], z[i]);
85 }
86 }
87
Aart Bik304c8a52017-05-23 11:01:13 -0700[diff] [blame^]88 /// CHECK-START-ARM64: void Main.doitMaxUnsigned(byte[], byte[], byte[]) loop_optimization (before)
89 /// CHECK-DAG: <<I255:i\d+>> IntConstant 255 loop:none
90 /// CHECK-DAG: <<Phi:i\d+>> Phi loop:<<Loop:B\d+>> outer_loop:none
91 /// CHECK-DAG: <<Get1:b\d+>> ArrayGet loop:<<Loop>> outer_loop:none
92 /// CHECK-DAG: <<Get2:b\d+>> ArrayGet loop:<<Loop>> outer_loop:none
93 /// CHECK-DAG: <<And1:i\d+>> And [<<Get1>>,<<I255>>] loop:<<Loop>> outer_loop:none
94 /// CHECK-DAG: <<And2:i\d+>> And [<<Get2>>,<<I255>>] loop:<<Loop>> outer_loop:none
95 /// CHECK-DAG: <<Max:i\d+>> InvokeStaticOrDirect [<<And1>>,<<And2>>] intrinsic:MathMaxIntInt loop:<<Loop>> outer_loop:none
96 /// CHECK-DAG: <<Cnv:b\d+>> TypeConversion [<<Max>>] loop:<<Loop>> outer_loop:none
97 /// CHECK-DAG: ArraySet [{{l\d+}},<<Phi>>,<<Cnv>>] loop:<<Loop>> outer_loop:none
98 //
99 /// CHECK-START-ARM64: void Main.doitMaxUnsigned(byte[], byte[], byte[]) loop_optimization (after)
100 /// CHECK-DAG: <<Phi:i\d+>> Phi loop:<<Loop:B\d+>> outer_loop:none
101 /// CHECK-DAG: <<Get1:d\d+>> VecLoad loop:<<Loop>> outer_loop:none
102 /// CHECK-DAG: <<Get2:d\d+>> VecLoad loop:<<Loop>> outer_loop:none
103 /// CHECK-DAG: <<Max:d\d+>> VecMax [<<Get1>>,<<Get2>>] unsigned:true loop:<<Loop>> outer_loop:none
104 /// CHECK-DAG: VecStore [{{l\d+}},<<Phi>>,<<Max>>] loop:<<Loop>> outer_loop:none
105 private static void doitMaxUnsigned(byte[] x, byte[] y, byte[] z) {
106 int min = Math.min(x.length, Math.min(y.length, z.length));
107 for (int i = 0; i < min; i++) {
108 x[i] = (byte) Math.max(y[i] & 0xff, z[i] & 0xff);
109 }
110 }
111
Aart Bikc8e93c72017-05-10 10:49:22 -0700[diff] [blame]112 public static void main(String[] args) {
113 // Initialize cross-values for all possible values.
114 int total = 256 * 256;
115 byte[] x = new byte[total];
116 byte[] y = new byte[total];
117 byte[] z = new byte[total];
118 int k = 0;
119 for (int i = 0; i < 256; i++) {
120 for (int j = 0; j < 256; j++) {
121 x[k] = 0;
122 y[k] = (byte) i;
123 z[k] = (byte) j;
124 k++;
125 }
126 }
127
128 // And test.
129 doitMin(x, y, z);
130 for (int i = 0; i < total; i++) {
131 byte expected = (byte) Math.min(y[i], z[i]);
132 expectEquals(expected, x[i]);
133 }
Aart Bik304c8a52017-05-23 11:01:13 -0700[diff] [blame^]134 doitMinUnsigned(x, y, z);
135 for (int i = 0; i < total; i++) {
136 byte expected = (byte) Math.min(y[i] & 0xff, z[i] & 0xff);
137 expectEquals(expected, x[i]);
138 }
Aart Bikc8e93c72017-05-10 10:49:22 -0700[diff] [blame]139 doitMax(x, y, z);
140 for (int i = 0; i < total; i++) {
141 byte expected = (byte) Math.max(y[i], z[i]);
142 expectEquals(expected, x[i]);
143 }
Aart Bik304c8a52017-05-23 11:01:13 -0700[diff] [blame^]144 doitMaxUnsigned(x, y, z);
145 for (int i = 0; i < total; i++) {
146 byte expected = (byte) Math.max(y[i] & 0xff, z[i] & 0xff);
147 expectEquals(expected, x[i]);
148 }
Aart Bikc8e93c72017-05-10 10:49:22 -0700[diff] [blame]149
150 System.out.println("passed");
151 }
152
153 private static void expectEquals(byte expected, byte result) {
154 if (expected != result) {
155 throw new Error("Expected: " + expected + ", found: " + result);
156 }
157 }
158}