v8/test/mjsunit/compiler/regress-const.js

// Copyright 2011 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

// Test const initialization and assignments.
function f() {
  var x = 42;
  while (true) {
    const y = x;
    if (--x == 0) return y;
  }
}

function g() {
  const x = 42;
  return x;
}

%PrepareFunctionForOptimization(f);
for (var i = 0; i < 5; i++) {
  f();
}
%OptimizeFunctionOnNextCall(f);

assertEquals(1, f());

%PrepareFunctionForOptimization(g);
for (var i = 0; i < 5; i++) {
  g();
}
%OptimizeFunctionOnNextCall(g);

assertEquals(42, g());


function h(a, b) {
  var r = a + b;
  const X = 42;
  return r + X;
}

%PrepareFunctionForOptimization(h);

for (var i = 0; i < 5; i++) h(1,2);

%OptimizeFunctionOnNextCall(h);

assertEquals(45, h(1,2));
assertEquals("foo742", h("foo", 7));