c83f0a715e
Otherwise dead phi elimination can actually remove some of the implicitly used phis. BUG=1257 TEST=test/mjsunit/regress/regress-1257.js Review URL: http://codereview.chromium.org/6672066 git-svn-id: http://v8.googlecode.com/svn/branches/bleeding_edge@7221 ce2b1a6d-e550-0410-aec6-3dcde31c8c00
59 lines
2.1 KiB
JavaScript
59 lines
2.1 KiB
JavaScript
// 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.
|
|
|
|
function g(y) { assertEquals(y, 12); }
|
|
|
|
var X = 0;
|
|
|
|
function foo () {
|
|
var cnt = 0;
|
|
var l = -1;
|
|
var x = 0;
|
|
while (1) switch (l) {
|
|
case -1:
|
|
var y = x + 12;
|
|
l = 0;
|
|
break;
|
|
case 0:
|
|
// Loop for to hit OSR.
|
|
if (cnt++ < 10000000) {
|
|
l = 0;
|
|
break;
|
|
} else {
|
|
l = 1;
|
|
break;
|
|
}
|
|
case 1:
|
|
// This case will contain deoptimization
|
|
// because it has no type feedback.
|
|
g(y);
|
|
return;
|
|
};
|
|
}
|
|
|
|
foo();
|