57 lines
2.1 KiB
JavaScript
57 lines
2.1 KiB
JavaScript
|
// Copyright 2014 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 f(o) {
|
||
|
|
var a = 1;
|
||
|
|
if (true) return o.v && a;
|
||
|
|
}
|
||
|
|
|
||
|
|
f({});
|
||
|
|
f({});
|
||
|
|
%OptimizeFunctionOnNextCall(f);
|
||
|
|
assertEquals(1, f({ v: 1 }));
|
||
|
|
|
||
|
|
|
||
|
|
function f1() { return 1 && 2; };
|
||
|
|
function f2() { return 1 || 2; };
|
||
|
|
function f3() { return 0 && 2; };
|
||
|
|
function f4() { return 0 || 2; };
|
||
|
|
|
||
|
|
function test() {
|
||
|
|
assertEquals(2, f1());
|
||
|
|
assertEquals(1, f2());
|
||
|
|
assertEquals(0, f3());
|
||
|
|
assertEquals(2, f4());
|
||
|
|
}
|
||
|
|
|
||
|
|
test();
|
||
|
|
test();
|
||
|
|
[f1, f2, f3, f4].forEach(function(f) { %OptimizeFunctionOnNextCall(f); });
|
||
|
|
test();
|