[ignition] desugar async functions/generators/modules in BytecodeGenerator

src/interpreter/bytecode-generator.h

 // Copyright 2015 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.
 
 #ifndef V8_INTERPRETER_BYTECODE_GENERATOR_H_
 #define V8_INTERPRETER_BYTECODE_GENERATOR_H_
 
 #include "src/ast/ast.h"
 #include "src/interpreter/bytecode-array-builder.h"
 #include "src/interpreter/bytecode-label.h"
@@ skipping 35 matching lines @@
   class ExpressionResultScope;
   class EffectResultScope;
   class GlobalDeclarationsBuilder;
   class RegisterAllocationScope;
   class TestResultScope;
   class ValueResultScope;
 
   enum class TestFallthrough { kThen, kElse, kNone };
 
   void GenerateBytecodeBody();
+  void GenerateBytecodeBodyForAsyncFunction();
+  void GenerateBytecodeBodyForGenerator();
+  void GenerateBytecodeBodyForModule();
+
+  enum class BuildJSGeneratorObject { kNoInitialYield, kInitialYield };
+  void BuildAllocateAndStoreJSGeneratorObject(BuildJSGeneratorObject tag);
+  void BuildAllocateAndStoreJSPromise();
+  void BindUnboundGeneratorResumePoints();
+
   void AllocateDeferredConstants(Isolate* isolate);
 
   DEFINE_AST_VISITOR_SUBCLASS_MEMBERS();
 
   // Dispatched from VisitBinaryOperation.
   void VisitArithmeticExpression(BinaryOperation* binop);
   void VisitCommaExpression(BinaryOperation* binop);
   void VisitLogicalOrExpression(BinaryOperation* binop);
   void VisitLogicalAndExpression(BinaryOperation* binop);
 
@@ skipping 91 matching lines @@
   // register, or just getting the effect.
   void VisitForAccumulatorValue(Expression* expr);
   void VisitForAccumulatorValueOrTheHole(Expression* expr);
   MUST_USE_RESULT Register VisitForRegisterValue(Expression* expr);
   void VisitForRegisterValue(Expression* expr, Register destination);
   void VisitAndPushIntoRegisterList(Expression* expr, RegisterList* reg_list);
   void VisitForEffect(Expression* expr);
   void VisitForTest(Expression* expr, BytecodeLabels* then_labels,
                     BytecodeLabels* else_labels, TestFallthrough fallthrough);
 
+  void BuildYield(int yield_id, Register generator, Register value);
+  void BuildYieldResumePoint(int yield_id, Yield::OnException on_exception,
+                             Register generator, int position);
+
+  void BuildTryCatch(HandlerTable::CatchPrediction catch_prediction,
+                     std::function<void()> build_try,
+                     std::function<void(Register context)> build_catch);
+  void BuildTryFinally(std::function<void()> build_try,
+                       std::function<void()> build_finally);
+
   // Returns the runtime function id for a store to super for the function's
   // language mode.
   inline Runtime::FunctionId StoreToSuperRuntimeId();
   inline Runtime::FunctionId StoreKeyedToSuperRuntimeId();
 
   inline BytecodeArrayBuilder* builder() const { return builder_; }
   inline Zone* zone() const { return zone_; }
   inline DeclarationScope* scope() const { return scope_; }
   inline CompilationInfo* info() const { return info_; }
 
@@ skipping 36 matching lines @@
   ZoneVector<std::pair<ObjectLiteral*, size_t>> object_literals_;
   ZoneVector<std::pair<ArrayLiteral*, size_t>> array_literals_;
 
   ControlScope* execution_control_;
   ContextScope* execution_context_;
   ExpressionResultScope* execution_result_;
 
   ZoneVector<BytecodeLabel> generator_resume_points_;
   Register generator_state_;
   int loop_depth_;
+  HandlerTable::CatchPrediction catch_prediction_;
 
   Handle<Name> home_object_symbol_;
   Handle<Name> iterator_symbol_;
   Handle<Name> prototype_string_;
   Handle<FixedArray> empty_fixed_array_;
   const AstRawString* undefined_string_;
 };
 
 }  // namespace interpreter
 }  // namespace internal
 }  // namespace v8
 
 #endif  // V8_INTERPRETER_BYTECODE_GENERATOR_H_