Chromium Code Reviews
chromiumcodereview-hr@appspot.gserviceaccount.com (chromiumcodereview-hr) | Please choose your nickname with Settings | Help | Chromium Project | Gerrit Changes | Sign out
(318)

Side by Side Diff: test/mjsunit/div-mod.js

Issue 7276034: ARM: Improve register allocation and constraints (try 2).... (Closed) Base URL: http://v8.googlecode.com/svn/branches/bleeding_edge/
Patch Set: Created 9 years, 5 months ago
Use n/p to move between diff chunks; N/P to move between comments. Draft comments are only viewable by you.
Jump to:
View unified diff | Download patch | Annotate | Revision Log
« no previous file with comments | « src/arm/macro-assembler-arm.cc ('k') | no next file » | no next file with comments »
Toggle Intra-line Diffs ('i') | Expand Comments ('e') | Collapse Comments ('c') | Show Comments Hide Comments ('s')
OLDNEW
1 // Copyright 2009 the V8 project authors. All rights reserved. 1 // Copyright 2009 the V8 project authors. All rights reserved.
2 // Redistribution and use in source and binary forms, with or without 2 // Redistribution and use in source and binary forms, with or without
3 // modification, are permitted provided that the following conditions are 3 // modification, are permitted provided that the following conditions are
4 // met: 4 // met:
5 // 5 //
6 // * Redistributions of source code must retain the above copyright 6 // * Redistributions of source code must retain the above copyright
7 // notice, this list of conditions and the following disclaimer. 7 // notice, this list of conditions and the following disclaimer.
8 // * Redistributions in binary form must reproduce the above 8 // * Redistributions in binary form must reproduce the above
9 // copyright notice, this list of conditions and the following 9 // copyright notice, this list of conditions and the following
10 // disclaimer in the documentation and/or other materials provided 10 // disclaimer in the documentation and/or other materials provided
11 // with the distribution. 11 // with the distribution.
12 // * Neither the name of Google Inc. nor the names of its 12 // * Neither the name of Google Inc. nor the names of its
13 // contributors may be used to endorse or promote products derived 13 // contributors may be used to endorse or promote products derived
14 // from this software without specific prior written permission. 14 // from this software without specific prior written permission.
15 // 15 //
16 // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS 16 // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
17 // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT 17 // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
18 // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR 18 // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
19 // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT 19 // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
20 // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, 20 // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
21 // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT 21 // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
22 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 22 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
23 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 23 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
24 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 24 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
25 // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE 25 // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
26 // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 26 // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
27 27
28 // Flags: --allow-natives-syntax
29
28 // Test fast div and mod. 30 // Test fast div and mod.
29 31
30 function divmod(div_func, mod_func, x, y) { 32 function divmod(div_func, mod_func, x, y) {
31 var div_answer = (div_func)(x); 33 var div_answer = (div_func)(x);
32 assertEquals(x / y, div_answer, x + "/" + y); 34 assertEquals(x / y, div_answer, x + "/" + y);
33 var mod_answer = (mod_func)(x); 35 var mod_answer = (mod_func)(x);
34 assertEquals(x % y, mod_answer, x + "%" + y); 36 assertEquals(x % y, mod_answer, x + "%" + y);
35 var minus_div_answer = (div_func)(-x); 37 var minus_div_answer = (div_func)(-x);
36 assertEquals(-x / y, minus_div_answer, "-" + x + "/" + y); 38 assertEquals(-x / y, minus_div_answer, "-" + x + "/" + y);
37 var minus_mod_answer = (mod_func)(-x); 39 var minus_mod_answer = (mod_func)(-x);
(...skipping 145 matching lines...) Expand 10 before | Expand all | Expand 10 after
183 assertEquals(-1 / 0, 1 / z); 185 assertEquals(-1 / 0, 1 / z);
184 z = (x | x | x | x) % x; 186 z = (x | x | x | x) % x;
185 assertEquals(1 / 0, 1 / z); 187 assertEquals(1 / 0, 1 / z);
186 z = (y | y | y | y) % y; 188 z = (y | y | y | y) % y;
187 assertEquals(-1 / 0, 1 / z); 189 assertEquals(-1 / 0, 1 / z);
188 z = (x | x | x | x) % y; 190 z = (x | x | x | x) % y;
189 assertEquals(1 / 0, 1 / z); 191 assertEquals(1 / 0, 1 / z);
190 } 192 }
191 193
192 negative_zero_modulus_test(); 194 negative_zero_modulus_test();
195
196
197 function lithium_integer_mod() {
198 var left_operands = [
199 0,
200 305419896, // 0x12345678
201 ];
202
203 // Test the standard lithium code for modulo opeartions.
204 var mod_func;
205 for (var i = 0; i < left_operands.length; i++) {
206 for (var j = 0; j < divisors.length; j++) {
207 mod_func = this.eval("(function(left) { return left % " + divisors[j]+ "; })");
208 assertEquals((mod_func)(left_operands[i]), left_operands[i] % divisors[j]) ;
209 assertEquals((mod_func)(-left_operands[i]), -left_operands[i] % divisors[j ]);
210 }
211 }
212
213 var results_powers_of_two = [
214 // 0
215 [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0],
216 // 305419896 == 0x12345678
217 [0, 0, 0, 8, 24, 56, 120, 120, 120, 632, 1656, 1656, 5752, 5752, 22136, 2213 6, 22136, 22136, 284280, 284280, 1332856, 3430008, 3430008, 3430008, 3430008, 36 984440, 36984440, 36984440, 305419896, 305419896, 305419896],
218 ];
219
220 // Test the lithium code for modulo operations with a variable power of two
221 // right hand side operand.
222 for (var i = 0; i < left_operands.length; i++) {
223 for (var j = 0; j < 31; j++) {
224 assertEquals(results_powers_of_two[i][j], left_operands[i] % (2 << j));
225 assertEquals(results_powers_of_two[i][j], left_operands[i] % -(2 << j));
226 assertEquals(-results_powers_of_two[i][j], -left_operands[i] % (2 << j));
227 assertEquals(-results_powers_of_two[i][j], -left_operands[i] % -(2 << j));
228 }
229 }
230
231 // Test the lithium code for modulo operations with a constant power of two
232 // right hand side operand.
233 for (var i = 0; i < left_operands.length; i++) {
234 // With positive left hand side operand.
235 assertEquals(results_powers_of_two[i][0], left_operands[i] % -(2 << 0));
236 assertEquals(results_powers_of_two[i][1], left_operands[i] % (2 << 1));
237 assertEquals(results_powers_of_two[i][2], left_operands[i] % -(2 << 2));
238 assertEquals(results_powers_of_two[i][3], left_operands[i] % (2 << 3));
239 assertEquals(results_powers_of_two[i][4], left_operands[i] % -(2 << 4));
240 assertEquals(results_powers_of_two[i][5], left_operands[i] % (2 << 5));
241 assertEquals(results_powers_of_two[i][6], left_operands[i] % -(2 << 6));
242 assertEquals(results_powers_of_two[i][7], left_operands[i] % (2 << 7));
243 assertEquals(results_powers_of_two[i][8], left_operands[i] % -(2 << 8));
244 assertEquals(results_powers_of_two[i][9], left_operands[i] % (2 << 9));
245 assertEquals(results_powers_of_two[i][10], left_operands[i] % -(2 << 10));
246 assertEquals(results_powers_of_two[i][11], left_operands[i] % (2 << 11));
247 assertEquals(results_powers_of_two[i][12], left_operands[i] % -(2 << 12));
248 assertEquals(results_powers_of_two[i][13], left_operands[i] % (2 << 13));
249 assertEquals(results_powers_of_two[i][14], left_operands[i] % -(2 << 14));
250 assertEquals(results_powers_of_two[i][15], left_operands[i] % (2 << 15));
251 assertEquals(results_powers_of_two[i][16], left_operands[i] % -(2 << 16));
252 assertEquals(results_powers_of_two[i][17], left_operands[i] % (2 << 17));
253 assertEquals(results_powers_of_two[i][18], left_operands[i] % -(2 << 18));
254 assertEquals(results_powers_of_two[i][19], left_operands[i] % (2 << 19));
255 assertEquals(results_powers_of_two[i][20], left_operands[i] % -(2 << 20));
256 assertEquals(results_powers_of_two[i][21], left_operands[i] % (2 << 21));
257 assertEquals(results_powers_of_two[i][22], left_operands[i] % -(2 << 22));
258 assertEquals(results_powers_of_two[i][23], left_operands[i] % (2 << 23));
259 assertEquals(results_powers_of_two[i][24], left_operands[i] % -(2 << 24));
260 assertEquals(results_powers_of_two[i][25], left_operands[i] % (2 << 25));
261 assertEquals(results_powers_of_two[i][26], left_operands[i] % -(2 << 26));
262 assertEquals(results_powers_of_two[i][27], left_operands[i] % (2 << 27));
263 assertEquals(results_powers_of_two[i][28], left_operands[i] % -(2 << 28));
264 assertEquals(results_powers_of_two[i][29], left_operands[i] % (2 << 29));
265 assertEquals(results_powers_of_two[i][30], left_operands[i] % -(2 << 30));
266 // With negative left hand side operand.
267 assertEquals(-results_powers_of_two[i][0], -left_operands[i] % -(2 << 0));
268 assertEquals(-results_powers_of_two[i][1], -left_operands[i] % (2 << 1));
269 assertEquals(-results_powers_of_two[i][2], -left_operands[i] % -(2 << 2));
270 assertEquals(-results_powers_of_two[i][3], -left_operands[i] % (2 << 3));
271 assertEquals(-results_powers_of_two[i][4], -left_operands[i] % -(2 << 4));
272 assertEquals(-results_powers_of_two[i][5], -left_operands[i] % (2 << 5));
273 assertEquals(-results_powers_of_two[i][6], -left_operands[i] % -(2 << 6));
274 assertEquals(-results_powers_of_two[i][7], -left_operands[i] % (2 << 7));
275 assertEquals(-results_powers_of_two[i][8], -left_operands[i] % -(2 << 8));
276 assertEquals(-results_powers_of_two[i][9], -left_operands[i] % (2 << 9));
277 assertEquals(-results_powers_of_two[i][10], -left_operands[i] % -(2 << 10));
278 assertEquals(-results_powers_of_two[i][11], -left_operands[i] % (2 << 11));
279 assertEquals(-results_powers_of_two[i][12], -left_operands[i] % -(2 << 12));
280 assertEquals(-results_powers_of_two[i][13], -left_operands[i] % (2 << 13));
281 assertEquals(-results_powers_of_two[i][14], -left_operands[i] % -(2 << 14));
282 assertEquals(-results_powers_of_two[i][15], -left_operands[i] % (2 << 15));
283 assertEquals(-results_powers_of_two[i][16], -left_operands[i] % -(2 << 16));
284 assertEquals(-results_powers_of_two[i][17], -left_operands[i] % (2 << 17));
285 assertEquals(-results_powers_of_two[i][18], -left_operands[i] % -(2 << 18));
286 assertEquals(-results_powers_of_two[i][19], -left_operands[i] % (2 << 19));
287 assertEquals(-results_powers_of_two[i][20], -left_operands[i] % -(2 << 20));
288 assertEquals(-results_powers_of_two[i][21], -left_operands[i] % (2 << 21));
289 assertEquals(-results_powers_of_two[i][22], -left_operands[i] % -(2 << 22));
290 assertEquals(-results_powers_of_two[i][23], -left_operands[i] % (2 << 23));
291 assertEquals(-results_powers_of_two[i][24], -left_operands[i] % -(2 << 24));
292 assertEquals(-results_powers_of_two[i][25], -left_operands[i] % (2 << 25));
293 assertEquals(-results_powers_of_two[i][26], -left_operands[i] % -(2 << 26));
294 assertEquals(-results_powers_of_two[i][27], -left_operands[i] % (2 << 27));
295 assertEquals(-results_powers_of_two[i][28], -left_operands[i] % -(2 << 28));
296 assertEquals(-results_powers_of_two[i][29], -left_operands[i] % (2 << 29));
297 assertEquals(-results_powers_of_two[i][30], -left_operands[i] % -(2 << 30));
298 }
299
300 }
301
302 lithium_integer_mod();
303 %OptimizeFunctionOnNextCall(lithium_integer_mod)
304 lithium_integer_mod();
OLDNEW
« no previous file with comments | « src/arm/macro-assembler-arm.cc ('k') | no next file » | no next file with comments »

Powered by Google App Engine
This is Rietveld 408576698