| // 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 heap = new ArrayBuffer(64 * 1024); |
| var mod = (function Module(stdlib, foreign, heap) { |
| function mod(dividend, divisor) { |
| return ((dividend | 0) % (divisor | 0)) | 0; |
| })(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)); |