// Copyright 2010 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 --use-osr

function f1() {
  var sum = 0;
  for (var i = 0; i < 1000; i++) {
    var x = i + 2;
    var y = x + 5;
    var z = y + 3;
    sum += z;
    if (i == 18) %OptimizeOsr();
  }
  return sum;
}
%PrepareFunctionForOptimization(f1);

function f2() {
  var sum = 0;
  for (var i = 0; i < 1000; i++) {
    var x = i + 2;
    var y = x + 5;
    var z = y + 3;
    sum += z;
    if (i == 19) %OptimizeOsr();
  }
  return sum;
}
%PrepareFunctionForOptimization(f2);

function f3() {
  var sum = 0;
  for (var i = 0; i < 1000; i++) {
    var x = i + 2;
    var y = x + 5;
    var z = y + 3;
    sum += z;
    if (i == 20) %OptimizeOsr();
  }
  return sum;
}
%PrepareFunctionForOptimization(f3);

function test1() {
  var j = 11;
  for (var i = 0; i < 2; i++) {
    assertEquals(509500, f1());
  }
}

function test2() {
  for (var i = 0; i < 2; i++) {
    var j = 11, k = 12;
    assertEquals(509500, f2());
  }
}

function test3() {
  for (var i = 0; i < 2; i++) {
    var j = 11, k = 13, m = 14;
    assertEquals(509500, f3());
  }
}

test1();
test2();
test3();