int32mod.js 839 Bytes
Newer Older
1 2 3 4 5 6 7 8
// 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);

9 10 11 12 13
var mod = (function Module(stdlib, foreign, heap) {
  "use asm";
  function mod(dividend, divisor) {
    dividend = dividend|0;
    divisor = divisor|0;
14
    return ((dividend | 0) % (divisor | 0)) | 0;
15
  }
16 17
  return { mod: mod };
})(stdlib, foreign, heap).mod;
18

19
var divisors = [-2147483648, -32 * 1024, -1000, -16, -7, -2, -1, 0,
20 21 22 23
                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) {
24
    assertEquals((dividend % divisor) | 0, mod(dividend, divisor));
25 26
  }
}