67 lines
2.5 KiB
JavaScript
67 lines
2.5 KiB
JavaScript
|
// Copyright 2013 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: --fold-constants --nodead-code-elimination
|
||
|
|
// Flags: --expose-gc --allow-natives-syntax
|
||
|
|
// Flags: --parallel-recompilation --parallel-recompilation-delay=300
|
||
|
|
|
||
|
|
if (!%IsParallelRecompilationSupported()) {
|
||
|
|
print("Parallel recompilation is disabled. Skipping this test.");
|
||
|
|
quit();
|
||
|
|
}
|
||
|
|
|
||
|
|
function assertUnoptimized(fun) {
|
||
|
|
assertTrue(%GetOptimizationStatus(fun) != 1);
|
||
|
|
}
|
||
|
|
|
||
|
|
function test(fun) {
|
||
|
|
fun();
|
||
|
|
fun();
|
||
|
|
%OptimizeFunctionOnNextCall(fun, "parallel");
|
||
|
|
fun(); // Trigger optimization in the background.
|
||
|
|
gc(); // Tenure cons string.
|
||
|
|
assertUnoptimized(fun); // Compilation not complete yet.
|
||
|
|
%CompleteOptimization(fun); // Compilation embeds tenured cons string.
|
||
|
|
gc(); // Visit embedded cons string during mark compact.
|
||
|
|
}
|
||
|
|
|
||
|
|
function f() {
|
||
|
|
return "abcdefghijklmn" + "123456789";
|
||
|
|
}
|
||
|
|
|
||
|
|
function g() {
|
||
|
|
return "abcdefghijklmn\u2603" + "123456789";
|
||
|
|
}
|
||
|
|
|
||
|
|
function h() {
|
||
|
|
return "abcdefghijklmn\u2603" + "123456789\u2604";
|
||
|
|
}
|
||
|
|
|
||
|
|
test(f);
|
||
|
|
test(g);
|
||
|
|
test(h);
|