2014-11-14 08:21:04 +00:00
|
|
|
// Copyright 2014 the V8 project authors. All rights reserved.
|
|
|
|
// Use of this source code is governed by a BSD-style license that can be
|
|
|
|
// found in the LICENSE file.
|
|
|
|
|
|
|
|
var stdlib = {};
|
|
|
|
var foreign = {};
|
|
|
|
var heap = new ArrayBuffer(64 * 1024);
|
|
|
|
|
|
|
|
function Uint32Mod(divisor) {
|
|
|
|
var name = "mod_";
|
|
|
|
name += divisor;
|
2017-02-14 09:26:52 +00:00
|
|
|
var m = eval(
|
|
|
|
'function Module(stdlib, foreign, heap) {\n' +
|
|
|
|
' "use asm";\n' +
|
|
|
|
' function ' + name + '(dividend) {\n' +
|
|
|
|
' dividend = dividend | 0;\n' +
|
|
|
|
' return ((dividend >>> 0) % ' + divisor + ') | 0;\n' +
|
|
|
|
' }\n' +
|
|
|
|
' return { f: ' + name + '}\n' +
|
|
|
|
'}; Module');
|
2014-11-14 08:21:04 +00:00
|
|
|
return m(stdlib, foreign, heap).f;
|
|
|
|
}
|
|
|
|
|
|
|
|
var divisors = [0, 1, 3, 4, 10, 42, 64, 100, 1024, 2147483647, 4294967295];
|
|
|
|
for (var i in divisors) {
|
|
|
|
var divisor = divisors[i];
|
|
|
|
var mod = Uint32Mod(divisor);
|
|
|
|
for (var dividend = 0; dividend < 4294967296; dividend += 3999773) {
|
2017-02-14 09:26:52 +00:00
|
|
|
assertEquals((dividend % divisor) | 0, mod(dividend));
|
2014-11-14 08:21:04 +00:00
|
|
|
}
|
|
|
|
}
|