fe6656fbfe
BFC requires same register for input and output and causes introduction of some unneccesary gap moves. TEST=unittests,mjsunit R=svenpanne@chromium.org Review URL: https://codereview.chromium.org/658283003 git-svn-id: https://v8.googlecode.com/svn/branches/bleeding_edge@24678 ce2b1a6d-e550-0410-aec6-3dcde31c8c00
30 lines
935 B
JavaScript
30 lines
935 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);
|
|
|
|
function Word32And(rhs) {
|
|
var name = "and_0x" + Number(rhs).toString(16);
|
|
var m = eval("function Module(stdlib, foreign, heap) {\n"
|
|
+ " \"use asm\";\n"
|
|
+ " function " + name + "(lhs) {\n"
|
|
+ " return (lhs | 0) & 0x" + Number(rhs).toString(16) + ";\n"
|
|
+ " }\n"
|
|
+ " return { f: " + name + "}\n"
|
|
+ "}; Module");
|
|
return m(stdlib, foreign, heap).f;
|
|
}
|
|
|
|
var masks = [0xffffffff, 0xf0f0f0f0, 0x80ffffff, 0x07f77f0f, 0xdeadbeef,
|
|
0x0fffff00, 0x0ff0, 0xff, 0x00];
|
|
for (var i in masks) {
|
|
var rhs = masks[i];
|
|
var and = Word32And(rhs);
|
|
for (var lhs = -2147483648; lhs < 2147483648; lhs += 3999773) {
|
|
assertEquals(lhs & rhs, and(lhs));
|
|
}
|
|
}
|