OLD | NEW |
1 // Copyright 2016 the V8 project authors. All rights reserved. | 1 // Copyright 2016 the V8 project authors. All rights reserved. |
2 // Use of this source code is governed by a BSD-style license that can be | 2 // Use of this source code is governed by a BSD-style license that can be |
3 // found in the LICENSE file. | 3 // found in the LICENSE file. |
4 | 4 |
5 // Flags: --ignition --ignition-generators --harmony-do-expressions | 5 // Flags: --ignition --harmony-do-expressions |
6 // Flags: --allow-natives-syntax --turbo --turbo-from-bytecode | 6 // Flags: --allow-natives-syntax --turbo --turbo-from-bytecode |
7 | 7 |
8 | 8 |
9 // This file is identical to mjsunit/harmony/generators.js, except for its Flags | 9 // This file is identical to mjsunit/harmony/generators.js, except for its Flags |
10 // lines. The purpose is to explicitly mention --turbo-from-bytecode such that | 10 // lines. The purpose is to explicitly mention --turbo-from-bytecode such that |
11 // Clusterfuzz can thoroughly test the new generators implementation. | 11 // Clusterfuzz can thoroughly test the new generators implementation. |
12 | 12 |
13 | 13 |
14 function MaybeOptimizeOrDeoptimize(f) { | 14 function MaybeOptimizeOrDeoptimize(f) { |
15 let x = Math.random(); // --random-seed makes this deterministic | 15 let x = Math.random(); // --random-seed makes this deterministic |
(...skipping 642 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
658 let iterable = { | 658 let iterable = { |
659 [Symbol.iterator]() { | 659 [Symbol.iterator]() { |
660 return { next() { return {} } }; | 660 return { next() { return {} } }; |
661 } | 661 } |
662 }; | 662 }; |
663 let foo = function*() { yield* iterable }; | 663 let foo = function*() { yield* iterable }; |
664 g = foo(); | 664 g = foo(); |
665 g.next(); | 665 g.next(); |
666 assertThrows(() => Throw(g), TypeError); | 666 assertThrows(() => Throw(g), TypeError); |
667 } | 667 } |
OLD | NEW |