9dd35ee2f9
* Fast runtime calls for div and mod. * Fix assembly and disassembly of multiply instructions. * Strength reduce and inline multiplications to shift-add. * Strength reduce and inline mod by power of 2. * Strength reduce mod by other small integers to mul. * Strength reduce div by 2 and 3. Review URL: http://codereview.chromium.org/155047 git-svn-id: http://v8.googlecode.com/svn/branches/bleeding_edge@2355 ce2b1a6d-e550-0410-aec6-3dcde31c8c00
96 lines
3.4 KiB
JavaScript
96 lines
3.4 KiB
JavaScript
// Copyright 2009 the V8 project authors. All rights reserved.
|
|
// Redistribution and use in source and binary forms, with or without
|
|
// modification, are permitted provided that the following conditions are
|
|
// met:
|
|
//
|
|
// * Redistributions of source code must retain the above copyright
|
|
// notice, this list of conditions and the following disclaimer.
|
|
// * Redistributions in binary form must reproduce the above
|
|
// copyright notice, this list of conditions and the following
|
|
// disclaimer in the documentation and/or other materials provided
|
|
// with the distribution.
|
|
// * Neither the name of Google Inc. nor the names of its
|
|
// contributors may be used to endorse or promote products derived
|
|
// from this software without specific prior written permission.
|
|
//
|
|
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
|
// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
|
|
// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
|
|
// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
|
|
// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
|
// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
|
// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
|
// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
|
// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
|
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
|
// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
|
|
// Test fast div and mod.
|
|
|
|
function divmod(div_func, mod_func, x, y) {
|
|
var div_answer = (div_func)(x);
|
|
assertEquals(x / y, div_answer, x + "/" + y);
|
|
var mod_answer = (mod_func)(x);
|
|
assertEquals(x % y, mod_answer, x + "%" + y);
|
|
var minus_div_answer = (div_func)(-x);
|
|
assertEquals(-x / y, minus_div_answer, "-" + x + "/" + y);
|
|
var minus_mod_answer = (mod_func)(-x);
|
|
assertEquals(-x % y, minus_mod_answer, "-" + x + "%" + y);
|
|
}
|
|
|
|
|
|
function run_tests_for(divisor) {
|
|
print("(function(left) { return left / " + divisor + "; })");
|
|
var div_func = this.eval("(function(left) { return left / " + divisor + "; })");
|
|
var mod_func = this.eval("(function(left) { return left % " + divisor + "; })");
|
|
var exp;
|
|
// Strange number test.
|
|
divmod(div_func, mod_func, 0, divisor);
|
|
divmod(div_func, mod_func, 1 / 0, divisor);
|
|
// Floating point number test.
|
|
for (exp = -1024; exp <= 1024; exp += 4) {
|
|
divmod(div_func, mod_func, Math.pow(2, exp), divisor);
|
|
divmod(div_func, mod_func, 0.9999999 * Math.pow(2, exp), divisor);
|
|
divmod(div_func, mod_func, 1.0000001 * Math.pow(2, exp), divisor);
|
|
}
|
|
// Integer number test.
|
|
for (exp = 0; exp <= 32; exp++) {
|
|
divmod(div_func, mod_func, 1 << exp, divisor);
|
|
divmod(div_func, mod_func, (1 << exp) + 1, divisor);
|
|
divmod(div_func, mod_func, (1 << exp) - 1, divisor);
|
|
}
|
|
divmod(div_func, mod_func, Math.floor(0x1fffffff / 3), divisor);
|
|
divmod(div_func, mod_func, Math.floor(-0x20000000 / 3), divisor);
|
|
}
|
|
|
|
|
|
var divisors = [
|
|
0,
|
|
1,
|
|
2,
|
|
3,
|
|
4,
|
|
5,
|
|
6,
|
|
7,
|
|
8,
|
|
9,
|
|
10,
|
|
// These ones in the middle don't add much apart from slowness to the test.
|
|
0x1000000,
|
|
0x2000000,
|
|
0x4000000,
|
|
0x8000000,
|
|
0x10000000,
|
|
0x20000000,
|
|
0x40000000,
|
|
12,
|
|
60,
|
|
100,
|
|
1000 * 60 * 60 * 24];
|
|
|
|
for (var i = 0; i < divisors.length; i++) {
|
|
run_tests_for(divisors[i]);
|
|
}
|
|
|