55 lines
2.4 KiB
JavaScript
55 lines
2.4 KiB
JavaScript
|
// Copyright 2012 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.
|
||
|
|
|
||
|
|
// This tests that we do not share optimized code across closures that
|
||
|
|
// were optimized using OSR (for a particular OSR entry AST id) even if
|
||
|
|
// caching of optimized code kicks in.
|
||
|
|
|
||
|
|
function makeClosure() {
|
||
|
|
function f(mode, iterations) {
|
||
|
|
var accumulator = 0;
|
||
|
|
if (mode == 1) {
|
||
|
|
while (--iterations > 0) accumulator = Math.ceil(accumulator);
|
||
|
|
return 1;
|
||
|
|
} else {
|
||
|
|
while (--iterations > 0) accumulator = Math.floor(accumulator);
|
||
|
|
return 2;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
return f;
|
||
|
|
}
|
||
|
|
|
||
|
|
// Generate two closures sharing the same underlying function literal.
|
||
|
|
var f1 = makeClosure();
|
||
|
|
var f2 = makeClosure();
|
||
|
|
|
||
|
|
// This function should be optimized via OSR in the first tight loop.
|
||
|
|
assertSame(1, f1(1, 100000));
|
||
|
|
|
||
|
|
// This function should be optimized via OSR in the second tight loop.
|
||
|
|
assertSame(2, f2(2, 100000));
|