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

Side by Side Diff: test/mjsunit/asm/uint32div.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/uint32-less-than-shift.js ('k') | test/mjsunit/asm/uint32mod.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 Uint32Div(divisor) { 9 function Uint32Div(divisor) {
10 var name = "div_"; 10 var name = "div_";
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 div = Uint32Div(divisor); 27 var div = Uint32Div(divisor);
26 for (var dividend = 0; dividend < 4294967296; dividend += 3999773) { 28 for (var dividend = 0; dividend < 4294967296; dividend += 3999773) {
27 assertEquals((dividend / divisor) >>> 0, div(dividend)); 29 assertEquals((dividend / divisor) | 0, div(dividend));
28 } 30 }
29 } 31 }
30 32
31 var div = (function(stdlib, foreign, heap) { 33 var div = (function(stdlib, foreign, heap) {
32 "use asm"; 34 "use asm";
33 function div(dividend, divisor) { 35 function div(dividend, divisor) {
36 dividend = dividend | 0;
37 divisor = divisor | 0;
34 return (dividend >>> 0) / (divisor >>> 0) | 0; 38 return (dividend >>> 0) / (divisor >>> 0) | 0;
35 } 39 }
36 return {div: div}; 40 return {div: div};
37 })(stdlib, foreign, heap).div; 41 })(stdlib, foreign, heap).div;
38 42
39 for (var i in divisors) { 43 for (var i in divisors) {
40 var divisor = divisors[i]; 44 var divisor = divisors[i];
41 for (var dividend = 0; dividend < 4294967296; dividend += 3999773) { 45 for (var dividend = 0; dividend < 4294967296; dividend += 3999773) {
42 assertEquals((dividend >>> 0) / (divisor >>> 0) | 0, 46 assertEquals((dividend >>> 0) / (divisor >>> 0) | 0,
43 div(dividend, divisor)); 47 div(dividend, divisor));
44 } 48 }
45 } 49 }
OLDNEW
« no previous file with comments | « test/mjsunit/asm/uint32-less-than-shift.js ('k') | test/mjsunit/asm/uint32mod.js » ('j') | no next file with comments »

Powered by Google App Engine
This is Rietveld 408576698