v8/test/mjsunit/asm/int32mod.js
Benedikt Meurer 45ff9d53c5 [turbofan] Optimize remainder of integer division by unknown power of two.
Drive-by-Fix: minint % 0 was broken on ARM, but we didn't notice because
there was no test covering that case...

TEST=msjunit
R=svenpanne@chromium.org

Review URL: https://codereview.chromium.org/727673002

Cr-Commit-Position: refs/heads/master@{#25347}
2014-11-14 08:21:18 +00:00

27 lines
827 B
JavaScript

// 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);
var mod = (function Module(stdlib, foreign, heap) {
"use asm";
function mod(dividend, divisor) {
dividend = dividend|0;
divisor = divisor|0;
return (dividend % divisor) | 0;
}
return { mod: mod };
})(stdlib, foreign, heap).mod;
var divisors = [-2147483648, -32 * 1024, -1000, -16, -7, -2, -1, 0,
1, 3, 4, 10, 64, 100, 1024, 2147483647];
for (var i in divisors) {
var divisor = divisors[i];
for (var dividend = -2147483648; dividend < 2147483648; dividend += 3999773) {
assertEquals((dividend % divisor) | 0, mod(dividend, divisor));
}
}