diff options
Diffstat (limited to 'deps/v8/test/mjsunit/compiler/regress-5320.js')
-rw-r--r-- | deps/v8/test/mjsunit/compiler/regress-5320.js | 52 |
1 files changed, 52 insertions, 0 deletions
diff --git a/deps/v8/test/mjsunit/compiler/regress-5320.js b/deps/v8/test/mjsunit/compiler/regress-5320.js new file mode 100644 index 0000000000..2e30a7b4f5 --- /dev/null +++ b/deps/v8/test/mjsunit/compiler/regress-5320.js @@ -0,0 +1,52 @@ +// Copyright 2016 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. + +// Flags: --allow-natives-syntax + +function OptimizeTruncatingBinaryOp(func) { + func(42, -2); + func(31, undefined); + %BaselineFunctionOnNextCall(func); + func(42, -2); + func(31, undefined); + %OptimizeFunctionOnNextCall(func); + func(-1, 2.1); + assertOptimized(func); +} + +// SAR +OptimizeTruncatingBinaryOp(function(a, b) { return a >> b; }); +// SHR +OptimizeTruncatingBinaryOp(function(a, b) { return a >>> b; }); +// SHL +OptimizeTruncatingBinaryOp(function(a, b) { return a << b; }); +// BIT_AND +OptimizeTruncatingBinaryOp(function(a, b) { return a & b; }); +// BIT_OR +OptimizeTruncatingBinaryOp(function(a, b) { return a | b; }); +// BIT_XOR +OptimizeTruncatingBinaryOp(function(a, b) { return a ^ b; }); |