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

Side by Side Diff: test/mjsunit/asm/uint32mod-constant.js

Issue 2663243002: [asm] Fix lots of invalid asm.js tests (Closed)
Patch Set: Rebase Created 3 years, 10 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
« no previous file with comments | « test/mjsunit/asm/uint32mod.js ('k') | test/mjsunit/asm/uint8array-outofbounds.js » ('j') | no next file with comments »
Toggle Intra-line Diffs ('i') | Expand Comments ('e') | Collapse Comments ('c') | Show Comments Hide Comments ('s')
OLDNEW
1 // Copyright 2014 the V8 project authors. All rights reserved. 1 // Copyright 2014 the V8 project authors. All rights reserved.
2 // Use of this source code is governed by a BSD-style license that can be 2 // Use of this source code is governed by a BSD-style license that can be
3 // found in the LICENSE file. 3 // found in the LICENSE file.
4 4
5 var stdlib = {}; 5 var stdlib = {};
6 var foreign = {}; 6 var foreign = {};
7 var heap = new ArrayBuffer(64 * 1024); 7 var heap = new ArrayBuffer(64 * 1024);
8 8
9 function Uint32Mod(divisor) { 9 function Uint32Mod(divisor) {
10 var name = "mod_"; 10 var name = "mod_";
11 name += divisor; 11 name += divisor;
12 var m = eval("function Module(stdlib, foreign, heap) {\n" 12 var m = eval(
13 + " \"use asm\";\n" 13 'function Module(stdlib, foreign, heap) {\n' +
14 + " function " + name + "(dividend) {\n" 14 ' "use asm";\n' +
15 + " return ((dividend >>> 0) % " + divisor + ") >>> 0;\n" 15 ' function ' + name + '(dividend) {\n' +
16 + " }\n" 16 ' dividend = dividend | 0;\n' +
17 + " return { f: " + name + "}\n" 17 ' return ((dividend >>> 0) % ' + divisor + ') | 0;\n' +
18 + "}; Module"); 18 ' }\n' +
19 ' return { f: ' + name + '}\n' +
20 '}; Module');
19 return m(stdlib, foreign, heap).f; 21 return m(stdlib, foreign, heap).f;
20 } 22 }
21 23
22 var divisors = [0, 1, 3, 4, 10, 42, 64, 100, 1024, 2147483647, 4294967295]; 24 var divisors = [0, 1, 3, 4, 10, 42, 64, 100, 1024, 2147483647, 4294967295];
23 for (var i in divisors) { 25 for (var i in divisors) {
24 var divisor = divisors[i]; 26 var divisor = divisors[i];
25 var mod = Uint32Mod(divisor); 27 var mod = Uint32Mod(divisor);
26 for (var dividend = 0; dividend < 4294967296; dividend += 3999773) { 28 for (var dividend = 0; dividend < 4294967296; dividend += 3999773) {
27 assertEquals((dividend % divisor) >>> 0, mod(dividend)); 29 assertEquals((dividend % divisor) | 0, mod(dividend));
28 } 30 }
29 } 31 }
OLDNEW
« no previous file with comments | « test/mjsunit/asm/uint32mod.js ('k') | test/mjsunit/asm/uint8array-outofbounds.js » ('j') | no next file with comments »

Powered by Google App Engine
This is Rietveld 408576698