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