Commit ae249928 authored by mstarzinger's avatar mstarzinger Committed by Commit bot

[turbofan] Remove deprecated --turbo-from-bytecode flag.

This flag is on by default for now. Whenever heuristics in the compiler
pipeline decide to use Ignition+TurboFan, then {BytecodeGraphBuilder} is
active. Removing the flag reduces maintenance overhead.

R=mvstanton@chromium.org

Review-Url: https://codereview.chromium.org/2437103002
Cr-Commit-Position: refs/heads/master@{#40639}
parent feb96ace
...@@ -592,12 +592,7 @@ bool AstNumberingVisitor::Renumber(FunctionLiteral* node) { ...@@ -592,12 +592,7 @@ bool AstNumberingVisitor::Renumber(FunctionLiteral* node) {
} }
if (IsGeneratorFunction(node->kind()) || IsAsyncFunction(node->kind())) { if (IsGeneratorFunction(node->kind()) || IsAsyncFunction(node->kind())) {
// Generators can be optimized if --turbo-from-bytecode is set.
if (FLAG_turbo_from_bytecode) {
DisableCrankshaft(kGenerator); DisableCrankshaft(kGenerator);
} else {
DisableOptimization(kGenerator);
}
} }
if (IsClassConstructor(node->kind())) { if (IsClassConstructor(node->kind())) {
......
...@@ -619,9 +619,6 @@ MaybeHandle<Code> GetOptimizedCode(Handle<JSFunction> function, ...@@ -619,9 +619,6 @@ MaybeHandle<Code> GetOptimizedCode(Handle<JSFunction> function,
// Shared function no longer needs to be tiered up // Shared function no longer needs to be tiered up
shared->set_marked_for_tier_up(false); shared->set_marked_for_tier_up(false);
// Flag combination --ignition-osr --no-turbo-from-bytecode is unsupported.
if (ignition_osr && !FLAG_turbo_from_bytecode) return MaybeHandle<Code>();
Handle<Code> cached_code; Handle<Code> cached_code;
// TODO(4764): When compiling for OSR from bytecode, BailoutId might derive // TODO(4764): When compiling for OSR from bytecode, BailoutId might derive
// from bytecode offset and overlap with actual BailoutId. No lookup! // from bytecode offset and overlap with actual BailoutId. No lookup!
...@@ -675,7 +672,7 @@ MaybeHandle<Code> GetOptimizedCode(Handle<JSFunction> function, ...@@ -675,7 +672,7 @@ MaybeHandle<Code> GetOptimizedCode(Handle<JSFunction> function,
TRACE_EVENT0(TRACE_DISABLED_BY_DEFAULT("v8.compile"), "V8.OptimizeCode"); TRACE_EVENT0(TRACE_DISABLED_BY_DEFAULT("v8.compile"), "V8.OptimizeCode");
// TurboFan can optimize directly from existing bytecode. // TurboFan can optimize directly from existing bytecode.
if (FLAG_turbo_from_bytecode && use_turbofan && ShouldUseIgnition(info)) { if (use_turbofan && ShouldUseIgnition(info)) {
if (info->is_osr() && !ignition_osr) return MaybeHandle<Code>(); if (info->is_osr() && !ignition_osr) return MaybeHandle<Code>();
if (!Compiler::EnsureBytecode(info)) { if (!Compiler::EnsureBytecode(info)) {
if (isolate->has_pending_exception()) isolate->clear_pending_exception(); if (isolate->has_pending_exception()) isolate->clear_pending_exception();
...@@ -788,10 +785,9 @@ class InterpreterActivationsFinder : public ThreadVisitor, ...@@ -788,10 +785,9 @@ class InterpreterActivationsFinder : public ThreadVisitor,
JavaScriptFrameIterator it(isolate, top); JavaScriptFrameIterator it(isolate, top);
for (; !it.done(); it.Advance()) { for (; !it.done(); it.Advance()) {
JavaScriptFrame* frame = it.frame(); JavaScriptFrame* frame = it.frame();
if (FLAG_turbo_from_bytecode && FLAG_ignition_osr && if (FLAG_ignition_osr && frame->is_optimized() &&
frame->is_optimized() && frame->function()->shared() == shared_) { frame->function()->shared() == shared_) {
// If we are able to optimize functions directly from bytecode, then // There might be optimized OSR code active on the stack that is not
// there might be optimized OSR code active on the stack that is not
// reachable through a function. We count this as an activation. // reachable through a function. We count this as an activation.
has_activations_ = true; has_activations_ = true;
} }
...@@ -838,12 +834,9 @@ bool HasInterpreterActivations( ...@@ -838,12 +834,9 @@ bool HasInterpreterActivations(
Isolate* isolate, InterpreterActivationsFinder* activations_finder) { Isolate* isolate, InterpreterActivationsFinder* activations_finder) {
activations_finder->VisitThread(isolate, isolate->thread_local_top()); activations_finder->VisitThread(isolate, isolate->thread_local_top());
isolate->thread_manager()->IterateArchivedThreads(activations_finder); isolate->thread_manager()->IterateArchivedThreads(activations_finder);
if (FLAG_turbo_from_bytecode) { // There might be optimized functions that rely on bytecode being around. We
// If we are able to optimize functions directly from bytecode, then there // need to prevent switching the given function to baseline code.
// might be optimized functions that rely on bytecode being around. We need
// to prevent switching the given function to baseline code in those cases.
Deoptimizer::VisitAllOptimizedFunctions(isolate, activations_finder); Deoptimizer::VisitAllOptimizedFunctions(isolate, activations_finder);
}
return activations_finder->has_activations(); return activations_finder->has_activations();
} }
...@@ -1372,7 +1365,7 @@ bool Compiler::EnsureDeoptimizationSupport(CompilationInfo* info) { ...@@ -1372,7 +1365,7 @@ bool Compiler::EnsureDeoptimizationSupport(CompilationInfo* info) {
Compiler::CompilationTier Compiler::NextCompilationTier(JSFunction* function) { Compiler::CompilationTier Compiler::NextCompilationTier(JSFunction* function) {
Handle<SharedFunctionInfo> shared(function->shared(), function->GetIsolate()); Handle<SharedFunctionInfo> shared(function->shared(), function->GetIsolate());
if (shared->code()->is_interpreter_trampoline_builtin()) { if (shared->code()->is_interpreter_trampoline_builtin()) {
if (FLAG_turbo_from_bytecode && UseTurboFan(shared)) { if (UseTurboFan(shared)) {
return OPTIMIZED; return OPTIMIZED;
} else { } else {
return BASELINE; return BASELINE;
......
...@@ -427,7 +427,6 @@ DEFINE_BOOL(omit_map_checks_for_leaf_maps, true, ...@@ -427,7 +427,6 @@ DEFINE_BOOL(omit_map_checks_for_leaf_maps, true,
DEFINE_BOOL(turbo, false, "enable TurboFan compiler") DEFINE_BOOL(turbo, false, "enable TurboFan compiler")
DEFINE_IMPLICATION(turbo, turbo_asm_deoptimization) DEFINE_IMPLICATION(turbo, turbo_asm_deoptimization)
DEFINE_IMPLICATION(turbo, turbo_loop_peeling) DEFINE_IMPLICATION(turbo, turbo_loop_peeling)
DEFINE_BOOL(turbo_from_bytecode, true, "enable building graphs from bytecode")
DEFINE_BOOL(turbo_sp_frame_access, false, DEFINE_BOOL(turbo_sp_frame_access, false,
"use stack pointer-relative access to frame wherever possible") "use stack pointer-relative access to frame wherever possible")
DEFINE_BOOL(turbo_preprocess_ranges, true, DEFINE_BOOL(turbo_preprocess_ranges, true,
......
...@@ -25,8 +25,7 @@ ...@@ -25,8 +25,7 @@
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
// Flags: --allow-natives-syntax --expose-gc // Flags: --allow-natives-syntax --expose-gc --ignition-osr
// Flags: --ignition-osr --turbo-from-bytecode
// IC and Crankshaft support for smi-only elements in dynamic array literals. // IC and Crankshaft support for smi-only elements in dynamic array literals.
function get(foo) { return foo; } // Used to generate dynamic values. function get(foo) { return foo; } // Used to generate dynamic values.
......
// Copyright 2016 the V8 project authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
// Flags: --ignition --harmony-do-expressions
// Flags: --allow-natives-syntax --turbo --turbo-from-bytecode
// This file is identical to mjsunit/harmony/generators.js, except for its Flags
// lines. The purpose is to explicitly mention --turbo-from-bytecode such that
// Clusterfuzz can thoroughly test the new generators implementation.
function MaybeOptimizeOrDeoptimize(f) {
let x = Math.random(); // --random-seed makes this deterministic
if (x <= 0.33) {
%OptimizeFunctionOnNextCall(f);
} else if (x <= 0.66) {
%DeoptimizeFunction(f);
}
}
function Next(generator, ...args) {
MaybeOptimizeOrDeoptimize(%GeneratorGetFunction(generator));
return generator.next(...args);
}
function Return(generator, ...args) {
MaybeOptimizeOrDeoptimize(%GeneratorGetFunction(generator));
return generator.return(...args);
}
function Throw(generator, ...args) {
MaybeOptimizeOrDeoptimize(%GeneratorGetFunction(generator));
return generator.throw(...args);
}
{ // yield in try-catch
let g = function*() {
try {yield 1} catch (error) {assertEquals("caught", error)}
};
assertThrowsEquals(() => Throw(g(), "not caught"), "not caught");
{
let x = g();
assertEquals({value: 1, done: false}, Next(x));
assertEquals({value: undefined, done: true}, Throw(x, "caught"));
}
{
let x = g();
assertEquals({value: 1, done: false}, Next(x));
assertEquals({value: undefined, done: true}, Next(x));
assertThrowsEquals(() => Throw(x, "not caught"), "not caught");
}
}
{ // return that doesn't close
let g = function*() { try {return 42} finally {yield 43} };
{
let x = g();
assertEquals({value: 43, done: false}, Next(x));
assertEquals({value: 42, done: true}, Next(x));
}
}
{ // return that doesn't close
let x;
let g = function*() { try {return 42} finally {Throw(x, 666)} };
{
x = g();
assertThrows(() => Next(x), TypeError); // still executing
}
}
{ // yield in try-finally, finally clause performs return
let g = function*() { try {yield 42} finally {return 13} };
{ // "return" closes at suspendedStart
let x = g();
assertEquals({value: 666, done: true}, Return(x, 666));
assertEquals({value: undefined, done: true}, Next(x, 42));
assertThrowsEquals(() => Throw(x, 43), 43);
assertEquals({value: 42, done: true}, Return(x, 42));
}
{ // "throw" closes at suspendedStart
let x = g();
assertThrowsEquals(() => Throw(x, 666), 666);
assertEquals({value: undefined, done: true}, Next(x, 42));
assertEquals({value: 43, done: true}, Return(x, 43));
assertThrowsEquals(() => Throw(x, 44), 44);
}
{ // "next" closes at suspendedYield
let x = g();
assertEquals({value: 42, done: false}, Next(x));
assertEquals({value: 13, done: true}, Next(x, 666));
assertEquals({value: undefined, done: true}, Next(x, 666));
assertThrowsEquals(() => Throw(x, 666), 666);
}
{ // "return" closes at suspendedYield
let x = g();
assertEquals({value: 42, done: false}, Next(x));
assertEquals({value: 13, done: true}, Return(x, 666));
assertEquals({value: undefined, done: true}, Next(x, 666));
assertEquals({value: 666, done: true}, Return(x, 666));
}
{ // "throw" closes at suspendedYield
let x = g();
assertEquals({value: 42, done: false}, Next(x));
assertEquals({value: 13, done: true}, Throw(x, 666));
assertThrowsEquals(() => Throw(x, 666), 666);
assertEquals({value: undefined, done: true}, Next(x, 666));
}
}
{ // yield in try-finally, finally clause doesn't perform return
let g = function*() { try {yield 42} finally {13} };
{ // "return" closes at suspendedStart
let x = g();
assertEquals({value: 666, done: true}, Return(x, 666));
assertEquals({value: undefined, done: true}, Next(x, 42));
assertThrowsEquals(() => Throw(x, 43), 43);
assertEquals({value: 42, done: true}, Return(x, 42));
}
{ // "throw" closes at suspendedStart
let x = g();
assertThrowsEquals(() => Throw(x, 666), 666);
assertEquals({value: undefined, done: true}, Next(x, 42));
assertEquals({value: 43, done: true}, Return(x, 43));
assertThrowsEquals(() => Throw(x, 44), 44);
}
{ // "next" closes at suspendedYield
let x = g();
assertEquals({value: 42, done: false}, Next(x));
assertEquals({value: undefined, done: true}, Next(x, 666));
assertEquals({value: undefined, done: true}, Next(x, 666));
assertThrowsEquals(() => Throw(x, 666), 666);
assertEquals({value: 42, done: true}, Return(x, 42));
}
{ // "return" closes at suspendedYield
let x = g();
assertEquals({value: 42, done: false}, Next(x));
assertEquals({value: 666, done: true}, Return(x, 666));
assertEquals({value: undefined, done: true}, Next(x, 666));
assertThrowsEquals(() => Throw(x, 44), 44);
assertEquals({value: 42, done: true}, Return(x, 42));
}
{ // "throw" closes at suspendedYield
let x = g();
assertEquals({value: 42, done: false}, Next(x));
assertThrowsEquals(() => Throw(x, 666), 666);
assertEquals({value: undefined, done: true}, Next(x, 666));
assertThrowsEquals(() => Throw(x, 666), 666);
assertEquals({value: 42, done: true}, Return(x, 42));
}
}
{ // yield in try-finally, finally clause yields and performs return
let g = function*() { try {yield 42} finally {yield 43; return 13} };
{
let x = g();
assertEquals({value: 42, done: false}, Next(x));
assertEquals({value: 43, done: false}, Return(x, 666));
assertEquals({value: 13, done: true}, Next(x));
assertEquals({value: 666, done: true}, Return(x, 666));
}
{
let x = g();
assertEquals({value: 666, done: true}, Return(x, 666));
assertEquals({value: undefined, done: true}, Next(x));
assertEquals({value: 666, done: true}, Return(x, 666));
}
}
{ // yield in try-finally, finally clause yields and doesn't perform return
let g = function*() { try {yield 42} finally {yield 43; 13} };
{
let x = g();
assertEquals({value: 42, done: false}, Next(x));
assertEquals({value: 43, done: false}, Return(x, 666));
assertEquals({value: 666, done: true}, Next(x));
assertEquals({value: 5, done: true}, Return(x, 5));
}
{
let x = g();
assertEquals({value: 666, done: true}, Return(x, 666));
assertEquals({value: undefined, done: true}, Next(x));
assertEquals({value: 666, done: true}, Return(x, 666));
}
}
{ // yield*, finally clause performs return
let h = function*() { try {yield 42} finally {yield 43; return 13} };
let g = function*() { yield 1; yield yield* h(); };
{
let x = g();
assertEquals({value: 1, done: false}, Next(x));
assertEquals({value: 42, done: false}, Next(x));
assertEquals({value: 43, done: false}, Next(x, 666));
assertEquals({value: 13, done: false}, Next(x));
assertEquals({value: undefined, done: true}, Next(x));
}
{
let x = g();
assertEquals({value: 1, done: false}, Next(x));
assertEquals({value: 42, done: false}, Next(x));
assertEquals({value: 43, done: false}, Return(x, 666));
assertEquals({value: 13, done: false}, Next(x));
assertEquals({value: undefined, done: true}, Next(x));
}
{
let x = g();
assertEquals({value: 1, done: false}, Next(x));
assertEquals({value: 42, done: false}, Next(x));
assertEquals({value: 43, done: false}, Throw(x, 666));
assertEquals({value: 13, done: false}, Next(x));
assertEquals({value: undefined, done: true}, Next(x));
}
}
{ // yield*, finally clause does not perform return
let h = function*() { try {yield 42} finally {yield 43; 13} };
let g = function*() { yield 1; yield yield* h(); };
{
let x = g();
assertEquals({value: 1, done: false}, Next(x));
assertEquals({value: 42, done: false}, Next(x));
assertEquals({value: 43, done: false}, Next(x, 666));
assertEquals({value: undefined, done: false}, Next(x));
assertEquals({value: undefined, done: true}, Next(x));
}
{
let x = g();
assertEquals({value: 1, done: false}, Next(x));
assertEquals({value: 42, done: false}, Next(x));
assertEquals({value: 43, done: false}, Return(x, 44));
assertEquals({value: 44, done: false}, Next(x));
assertEquals({value: undefined, done: true}, Next(x));
}
{
let x = g();
assertEquals({value: 1, done: false}, Next(x));
assertEquals({value: 42, done: false}, Next(x));
assertEquals({value: 43, done: false}, Throw(x, 666));
assertThrowsEquals(() => Next(x), 666);
}
}
{ // yield*, .return argument is final result
function* inner() {
yield 2;
}
function* g() {
yield 1;
return yield* inner();
}
{
let x = g();
assertEquals({value: 1, done: false}, Next(x));
assertEquals({value: 2, done: false}, Next(x));
assertEquals({value: 42, done: true}, Return(x, 42));
}
}
// More or less random tests from here on.
{
function* foo() { }
let g = foo();
assertEquals({value: undefined, done: true}, Next(g));
assertEquals({value: undefined, done: true}, Next(g));
}
{
function* foo() { return new.target }
let g = foo();
assertEquals({value: undefined, done: true}, Next(g));
assertEquals({value: undefined, done: true}, Next(g));
}
{
function* foo() { throw 666; return 42}
let g = foo();
assertThrowsEquals(() => Next(g), 666);
assertEquals({value: undefined, done: true}, Next(g));
}
{
function* foo(a) { return a; }
let g = foo(42);
assertEquals({value: 42, done: true}, Next(g));
assertEquals({value: undefined, done: true}, Next(g));
}
{
function* foo(a) { a.iwashere = true; return a; }
let x = {};
let g = foo(x);
assertEquals({value: {iwashere: true}, done: true}, Next(g));
assertEquals({value: undefined, done: true}, Next(g));
}
{
let a = 42;
function* foo() { return a; }
let g = foo();
assertEquals({value: 42, done: true}, Next(g));
assertEquals({value: undefined, done: true}, Next(g));
}
{
let a = 40;
function* foo(b) { return a + b; }
let g = foo(2);
assertEquals({value: 42, done: true}, Next(g));
assertEquals({value: undefined, done: true}, Next(g));
}
{
let a = 40;
function* foo(b) { a--; b++; return a + b; }
let g = foo(2);
assertEquals({value: 42, done: true}, Next(g));
assertEquals({value: undefined, done: true}, Next(g));
}
{
let g;
function* foo() { Next(g) }
g = foo();
assertThrows(() => Next(g), TypeError);
assertEquals({value: undefined, done: true}, Next(g));
}
{
function* foo() { yield 2; yield 3; yield 4 }
g = foo();
assertEquals({value: 2, done: false}, Next(g));
assertEquals({value: 3, done: false}, Next(g));
assertEquals({value: 4, done: false}, Next(g));
assertEquals({value: undefined, done: true}, Next(g));
assertEquals({value: undefined, done: true}, Next(g));
}
{
function* foo() { yield 2; if (true) { yield 3 }; yield 4 }
g = foo();
assertEquals({value: 2, done: false}, Next(g));
assertEquals({value: 3, done: false}, Next(g));
assertEquals({value: 4, done: false}, Next(g));
assertEquals({value: undefined, done: true}, Next(g));
assertEquals({value: undefined, done: true}, Next(g));
}
{
function* foo() { yield 2; if (true) { yield 3; yield 4 } }
g = foo();
assertEquals({value: 2, done: false}, Next(g));
assertEquals({value: 3, done: false}, Next(g));
assertEquals({value: 4, done: false}, Next(g));
assertEquals({value: undefined, done: true}, Next(g));
assertEquals({value: undefined, done: true}, Next(g));
}
{
function* foo() { yield 2; if (false) { yield 3 }; yield 4 }
g = foo();
assertEquals({value: 2, done: false}, Next(g));
assertEquals({value: 4, done: false}, Next(g));
assertEquals({value: undefined, done: true}, Next(g));
assertEquals({value: undefined, done: true}, Next(g));
}
{
function* foo() { yield 2; while (true) { yield 3 }; yield 4 }
g = foo();
assertEquals({value: 2, done: false}, Next(g));
assertEquals({value: 3, done: false}, Next(g));
assertEquals({value: 3, done: false}, Next(g));
assertEquals({value: 3, done: false}, Next(g));
assertEquals({value: 3, done: false}, Next(g));
}
{
function* foo() { yield 2; (yield 3) + 42; yield 4 }
g = foo();
assertEquals({value: 2, done: false}, Next(g));
assertEquals({value: 3, done: false}, Next(g));
assertEquals({value: 4, done: false}, Next(g));
}
{
function* foo() { yield 2; (do {yield 3}) + 42; yield 4 }
g = foo();
assertEquals({value: 2, done: false}, Next(g));
assertEquals({value: 3, done: false}, Next(g));
assertEquals({value: 4, done: false}, Next(g));
}
{
function* foo() { yield 2; return (yield 3) + 42; yield 4 }
g = foo();
assertEquals({value: 2, done: false}, Next(g));
assertEquals({value: 3, done: false}, Next(g));
assertEquals({value: 42, done: true}, Next(g, 0));
assertEquals({value: undefined, done: true}, Next(g));
}
{
let x = 42;
function* foo() {
yield x;
for (let x in {a: 1, b: 2}) {
let i = 2;
yield x;
yield i;
do {
yield i;
} while (i-- > 0);
}
yield x;
return 5;
}
g = foo();
assertEquals({value: 42, done: false}, Next(g));
assertEquals({value: 'a', done: false}, Next(g));
assertEquals({value: 2, done: false}, Next(g));
assertEquals({value: 2, done: false}, Next(g));
assertEquals({value: 1, done: false}, Next(g));
assertEquals({value: 0, done: false}, Next(g));
assertEquals({value: 'b', done: false}, Next(g));
assertEquals({value: 2, done: false}, Next(g));
assertEquals({value: 2, done: false}, Next(g));
assertEquals({value: 1, done: false}, Next(g));
assertEquals({value: 0, done: false}, Next(g));
assertEquals({value: 42, done: false}, Next(g));
assertEquals({value: 5, done: true}, Next(g));
}
{
let a = 3;
function* foo() {
let b = 4;
yield 1;
{ let c = 5; yield 2; yield a; yield b; yield c; }
}
g = foo();
assertEquals({value: 1, done: false}, Next(g));
assertEquals({value: 2, done: false}, Next(g));
assertEquals({value: 3, done: false}, Next(g));
assertEquals({value: 4, done: false}, Next(g));
assertEquals({value: 5, done: false}, Next(g));
assertEquals({value: undefined, done: true}, Next(g));
}
{
function* foo() {
yield 42;
yield 42;
yield 42;
yield 42;
yield 42;
yield 42;
yield 42;
yield 42;
yield 42;
yield 42;
yield 42;
yield 42;
yield 42;
yield 42;
yield 42;
yield 42;
yield 42;
yield 42;
yield 42;
yield 42;
yield 42;
yield 42;
yield 42;
yield 42;
yield 42;
yield 42;
yield 42;
yield 42;
yield 42;
yield 42;
yield 42;
yield 42;
yield 42;
yield 42;
yield 42;
yield 42;
yield 42;
yield 42;
yield 42;
yield 42;
yield 42;
yield 42;
yield 42;
yield 42;
yield 42;
yield 42;
yield 42;
yield 42;
yield 42;
yield 42;
yield 42;
yield 42;
yield 42;
yield 42;
yield 42;
yield 42;
yield 42;
yield 42;
yield 42;
yield 42;
yield 42;
yield 42;
yield 42;
yield 42;
yield 42;
yield 42;
yield 42;
yield 42;
yield 42;
yield 42;
yield 42;
yield 42;
yield 42;
yield 42;
yield 42;
yield 42;
yield 42;
yield 42;
yield 42;
yield 42;
yield 42;
yield 42;
yield 42;
yield 42;
yield 42;
yield 42;
yield 42;
yield 42;
yield 42;
yield 42;
yield 42;
yield 42;
yield 42;
yield 42;
yield 42;
yield 42;
yield 42;
yield 42;
yield 42;
yield 42;
}
g = foo();
for (let i = 0; i < 100; ++i) {
assertEquals({value: 42, done: false}, i%25 === 0 ? Next(g) : g.next());
}
assertEquals({value: undefined, done: true}, Next(g));
}
{
function* foo() {
for (let i = 0; i < 3; ++i) {
let j = 0
yield i;
do {
yield (i + 10);
} while (++j < 2);
}
}
g = foo();
assertEquals({value: 0, done: false}, Next(g));
assertEquals({value: 10, done: false}, Next(g));
assertEquals({value: 10, done: false}, Next(g));
assertEquals({value: 1, done: false}, Next(g));
assertEquals({value: 11, done: false}, Next(g));
assertEquals({value: 11, done: false}, Next(g));
assertEquals({value: 2, done: false}, Next(g));
assertEquals({value: 12, done: false}, Next(g));
assertEquals({value: 12, done: false}, Next(g));
assertEquals({value: undefined, done: true}, Next(g));
}
{
let foo = function*() {
while (true) {
if (true || false) yield 42;
continue;
}
}
g = foo();
assertEquals({value: 42, done: false}, Next(g));
assertEquals({value: 42, done: false}, Next(g));
assertEquals({value: 42, done: false}, Next(g));
}
{
let foo = function*() {
yield* (function*() { yield 42; }());
assertUnreachable();
}
g = foo();
assertEquals({value: 42, done: false}, Next(g));
assertEquals({value: 23, done: true}, Return(g, 23));
}
{
let iterable = {
[Symbol.iterator]() {
return { next() { return {} } };
}
};
let foo = function*() { yield* iterable };
g = foo();
g.next();
assertThrows(() => Throw(g), TypeError);
}
...@@ -2,7 +2,7 @@ ...@@ -2,7 +2,7 @@
// Use of this source code is governed by a BSD-style license that can be // Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file. // found in the LICENSE file.
// Flags: --allow-natives-syntax --ignition --ignition-osr --turbo-from-bytecode // Flags: --allow-natives-syntax --ignition --ignition-osr
function f() { function f() {
for (var i = 0; i < 10; i++) { for (var i = 0; i < 10; i++) {
......
...@@ -25,7 +25,7 @@ ...@@ -25,7 +25,7 @@
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
// Flags: --use-osr --allow-natives-syntax --ignition-osr --turbo-from-bytecode // Flags: --use-osr --allow-natives-syntax --ignition-osr
function f() { function f() {
do { do {
......
...@@ -2,7 +2,7 @@ ...@@ -2,7 +2,7 @@
// Use of this source code is governed by a BSD-style license that can be // Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file. // found in the LICENSE file.
// Flags: --allow-natives-syntax --ignition --ignition-osr --turbo-from-bytecode // Flags: --allow-natives-syntax --ignition --ignition-osr
(function TestNonLoopyLoop() { (function TestNonLoopyLoop() {
function f() { function f() {
......
...@@ -2,7 +2,7 @@ ...@@ -2,7 +2,7 @@
// Use of this source code is governed by a BSD-style license that can be // Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file. // found in the LICENSE file.
// Flags: --ignition --ignition-osr --turbo-from-bytecode --allow-natives-syntax // Flags: --ignition --ignition-osr --allow-natives-syntax
function g() { return 23 } function g() { return 23 }
function h() { return 42 } function h() { return 42 }
......
...@@ -2,7 +2,7 @@ ...@@ -2,7 +2,7 @@
// Use of this source code is governed by a BSD-style license that can be // Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file. // found in the LICENSE file.
// Flags: --ignition --turbo-from-bytecode --always-opt --allow-natives-syntax // Flags: --ignition --always-opt --allow-natives-syntax
try { try {
} catch(e) {; } } catch(e) {; }
......
...@@ -2,7 +2,7 @@ ...@@ -2,7 +2,7 @@
// Use of this source code is governed by a BSD-style license that can be // Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file. // found in the LICENSE file.
// Flags: --ignition --ignition-osr --turbo-from-bytecode // Flags: --ignition --ignition-osr
function osr() { function osr() {
for (var i = 0; i < 50000; ++i) Math.random(); for (var i = 0; i < 50000; ++i) Math.random();
......
...@@ -2,7 +2,7 @@ ...@@ -2,7 +2,7 @@
// Use of this source code is governed by a BSD-style license that can be // Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file. // found in the LICENSE file.
// Flags: --allow-natives-syntax --ignition --turbo-from-bytecode --turbo-filter=f // Flags: --allow-natives-syntax --ignition --turbo-filter=f
function f(x) { return x + 23 } function f(x) { return x + 23 }
function g(x) { return f(x) + 42 } function g(x) { return f(x) + 42 }
......
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment