Generator.h 11 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309
  1. /*
  2. * Copyright (c) 2021-2024, Andreas Kling <kling@serenityos.org>
  3. *
  4. * SPDX-License-Identifier: BSD-2-Clause
  5. */
  6. #pragma once
  7. #include <AK/OwnPtr.h>
  8. #include <AK/SinglyLinkedList.h>
  9. #include <LibJS/AST.h>
  10. #include <LibJS/Bytecode/BasicBlock.h>
  11. #include <LibJS/Bytecode/CodeGenerationError.h>
  12. #include <LibJS/Bytecode/Executable.h>
  13. #include <LibJS/Bytecode/IdentifierTable.h>
  14. #include <LibJS/Bytecode/Label.h>
  15. #include <LibJS/Bytecode/Op.h>
  16. #include <LibJS/Bytecode/Register.h>
  17. #include <LibJS/Bytecode/StringTable.h>
  18. #include <LibJS/Forward.h>
  19. #include <LibJS/Runtime/FunctionKind.h>
  20. #include <LibRegex/Regex.h>
  21. namespace JS::Bytecode {
  22. class Generator {
  23. public:
  24. VM& vm() { return m_vm; }
  25. enum class SurroundingScopeKind {
  26. Global,
  27. Function,
  28. Block,
  29. };
  30. static CodeGenerationErrorOr<NonnullGCPtr<Executable>> generate(VM&, ASTNode const&, ReadonlySpan<FunctionParameter> parameters, FunctionKind = FunctionKind::Normal);
  31. Register allocate_register();
  32. void set_local_initialized(u32 local_index);
  33. [[nodiscard]] bool is_local_initialized(u32 local_index) const;
  34. class SourceLocationScope {
  35. public:
  36. SourceLocationScope(Generator&, ASTNode const& node);
  37. ~SourceLocationScope();
  38. private:
  39. Generator& m_generator;
  40. ASTNode const* m_previous_node { nullptr };
  41. };
  42. class UnwindContext {
  43. public:
  44. UnwindContext(Generator&, Optional<Label> finalizer);
  45. UnwindContext const* previous() const { return m_previous_context; }
  46. void set_handler(Label handler) { m_handler = handler; }
  47. Optional<Label> handler() const { return m_handler; }
  48. Optional<Label> finalizer() const { return m_finalizer; }
  49. ~UnwindContext();
  50. private:
  51. Generator& m_generator;
  52. Optional<Label> m_finalizer;
  53. Optional<Label> m_handler {};
  54. UnwindContext const* m_previous_context { nullptr };
  55. };
  56. template<typename OpType, typename... Args>
  57. void emit(Args&&... args)
  58. {
  59. VERIFY(!is_current_block_terminated());
  60. size_t slot_offset = m_current_basic_block->size();
  61. grow(sizeof(OpType));
  62. void* slot = m_current_basic_block->data() + slot_offset;
  63. new (slot) OpType(forward<Args>(args)...);
  64. if constexpr (OpType::IsTerminator)
  65. m_current_basic_block->terminate({});
  66. auto* op = static_cast<OpType*>(slot);
  67. op->set_source_record({ m_current_ast_node->start_offset(), m_current_ast_node->end_offset() });
  68. }
  69. template<typename OpType, typename... Args>
  70. void emit_with_extra_operand_slots(size_t extra_operand_slots, Args&&... args)
  71. {
  72. VERIFY(!is_current_block_terminated());
  73. size_t size_to_allocate = round_up_to_power_of_two(sizeof(OpType) + extra_operand_slots * sizeof(Operand), alignof(void*));
  74. size_t slot_offset = m_current_basic_block->size();
  75. grow(size_to_allocate);
  76. void* slot = m_current_basic_block->data() + slot_offset;
  77. new (slot) OpType(forward<Args>(args)...);
  78. if constexpr (OpType::IsTerminator)
  79. m_current_basic_block->terminate({});
  80. auto* op = static_cast<OpType*>(slot);
  81. op->set_source_record({ m_current_ast_node->start_offset(), m_current_ast_node->end_offset() });
  82. }
  83. struct ReferenceOperands {
  84. Optional<Operand> base {}; // [[Base]]
  85. Optional<Operand> referenced_name {}; // [[ReferencedName]] as an operand
  86. Optional<IdentifierTableIndex> referenced_identifier {}; // [[ReferencedName]] as an identifier
  87. Optional<IdentifierTableIndex> referenced_private_identifier {}; // [[ReferencedName]] as a private identifier
  88. Optional<Operand> this_value {}; // [[ThisValue]]
  89. Optional<Operand> loaded_value {}; // Loaded value, if we've performed a load.
  90. };
  91. CodeGenerationErrorOr<ReferenceOperands> emit_load_from_reference(JS::ASTNode const&, Optional<Operand> preferred_dst = {});
  92. CodeGenerationErrorOr<void> emit_store_to_reference(JS::ASTNode const&, Operand value);
  93. CodeGenerationErrorOr<void> emit_store_to_reference(ReferenceOperands const&, Operand value);
  94. CodeGenerationErrorOr<Optional<Operand>> emit_delete_reference(JS::ASTNode const&);
  95. CodeGenerationErrorOr<ReferenceOperands> emit_super_reference(MemberExpression const&);
  96. void emit_set_variable(JS::Identifier const& identifier, Operand value, Bytecode::Op::SetVariable::InitializationMode initialization_mode = Bytecode::Op::SetVariable::InitializationMode::Set, Bytecode::Op::EnvironmentMode mode = Bytecode::Op::EnvironmentMode::Lexical);
  97. void push_home_object(Operand);
  98. void pop_home_object();
  99. void emit_new_function(Operand dst, JS::FunctionExpression const&, Optional<IdentifierTableIndex> lhs_name);
  100. CodeGenerationErrorOr<Optional<Operand>> emit_named_evaluation_if_anonymous_function(Expression const&, Optional<IdentifierTableIndex> lhs_name, Optional<Operand> preferred_dst = {});
  101. void begin_continuable_scope(Label continue_target, Vector<DeprecatedFlyString> const& language_label_set);
  102. void end_continuable_scope();
  103. void begin_breakable_scope(Label breakable_target, Vector<DeprecatedFlyString> const& language_label_set);
  104. void end_breakable_scope();
  105. [[nodiscard]] Label nearest_continuable_scope() const;
  106. [[nodiscard]] Label nearest_breakable_scope() const;
  107. void switch_to_basic_block(BasicBlock& block)
  108. {
  109. m_current_basic_block = &block;
  110. }
  111. [[nodiscard]] BasicBlock& current_block() { return *m_current_basic_block; }
  112. BasicBlock& make_block(String name = {})
  113. {
  114. if (name.is_empty())
  115. name = MUST(String::number(m_next_block++));
  116. auto block = BasicBlock::create(name);
  117. if (auto const* context = m_current_unwind_context) {
  118. if (context->handler().has_value())
  119. block->set_handler(context->handler().value().block());
  120. if (m_current_unwind_context->finalizer().has_value())
  121. block->set_finalizer(context->finalizer().value().block());
  122. }
  123. m_root_basic_blocks.append(move(block));
  124. return *m_root_basic_blocks.last();
  125. }
  126. bool is_current_block_terminated() const
  127. {
  128. return m_current_basic_block->is_terminated();
  129. }
  130. StringTableIndex intern_string(ByteString string)
  131. {
  132. return m_string_table->insert(move(string));
  133. }
  134. RegexTableIndex intern_regex(ParsedRegex regex)
  135. {
  136. return m_regex_table->insert(move(regex));
  137. }
  138. IdentifierTableIndex intern_identifier(DeprecatedFlyString string)
  139. {
  140. return m_identifier_table->insert(move(string));
  141. }
  142. bool is_in_generator_or_async_function() const { return m_enclosing_function_kind == FunctionKind::Async || m_enclosing_function_kind == FunctionKind::Generator || m_enclosing_function_kind == FunctionKind::AsyncGenerator; }
  143. bool is_in_generator_function() const { return m_enclosing_function_kind == FunctionKind::Generator || m_enclosing_function_kind == FunctionKind::AsyncGenerator; }
  144. bool is_in_async_function() const { return m_enclosing_function_kind == FunctionKind::Async || m_enclosing_function_kind == FunctionKind::AsyncGenerator; }
  145. bool is_in_async_generator_function() const { return m_enclosing_function_kind == FunctionKind::AsyncGenerator; }
  146. enum class BindingMode {
  147. Lexical,
  148. Var,
  149. Global,
  150. };
  151. struct LexicalScope {
  152. SurroundingScopeKind kind;
  153. };
  154. void block_declaration_instantiation(ScopeNode const&);
  155. void begin_variable_scope();
  156. void end_variable_scope();
  157. enum class BlockBoundaryType {
  158. Break,
  159. Continue,
  160. Unwind,
  161. ReturnToFinally,
  162. LeaveLexicalEnvironment,
  163. };
  164. template<typename OpType>
  165. void perform_needed_unwinds()
  166. requires(OpType::IsTerminator && !IsSame<OpType, Op::Jump>)
  167. {
  168. for (size_t i = m_boundaries.size(); i > 0; --i) {
  169. auto boundary = m_boundaries[i - 1];
  170. using enum BlockBoundaryType;
  171. switch (boundary) {
  172. case Unwind:
  173. if constexpr (IsSame<OpType, Bytecode::Op::Throw>)
  174. return;
  175. emit<Bytecode::Op::LeaveUnwindContext>();
  176. break;
  177. case LeaveLexicalEnvironment:
  178. emit<Bytecode::Op::LeaveLexicalEnvironment>();
  179. break;
  180. case Break:
  181. case Continue:
  182. break;
  183. case ReturnToFinally:
  184. return;
  185. };
  186. }
  187. }
  188. void generate_break();
  189. void generate_break(DeprecatedFlyString const& break_label);
  190. void generate_continue();
  191. void generate_continue(DeprecatedFlyString const& continue_label);
  192. void start_boundary(BlockBoundaryType type) { m_boundaries.append(type); }
  193. void end_boundary(BlockBoundaryType type)
  194. {
  195. VERIFY(m_boundaries.last() == type);
  196. m_boundaries.take_last();
  197. }
  198. void emit_get_by_id(Operand dst, Operand base, IdentifierTableIndex);
  199. void emit_get_by_id_with_this(Operand dst, Operand base, IdentifierTableIndex, Operand this_value);
  200. void emit_iterator_value(Operand dst, Operand result);
  201. void emit_iterator_complete(Operand dst, Operand result);
  202. [[nodiscard]] size_t next_global_variable_cache() { return m_next_global_variable_cache++; }
  203. [[nodiscard]] size_t next_environment_variable_cache() { return m_next_environment_variable_cache++; }
  204. [[nodiscard]] size_t next_property_lookup_cache() { return m_next_property_lookup_cache++; }
  205. enum class DeduplicateConstant {
  206. Yes,
  207. No,
  208. };
  209. [[nodiscard]] Operand add_constant(Value value, DeduplicateConstant deduplicate_constant = DeduplicateConstant::Yes)
  210. {
  211. if (deduplicate_constant == DeduplicateConstant::Yes) {
  212. for (size_t i = 0; i < m_constants.size(); ++i) {
  213. if (m_constants[i] == value)
  214. return Operand(Operand::Type::Constant, i);
  215. }
  216. }
  217. m_constants.append(value);
  218. return Operand(Operand::Type::Constant, m_constants.size() - 1);
  219. }
  220. private:
  221. VM& m_vm;
  222. enum class JumpType {
  223. Continue,
  224. Break,
  225. };
  226. void generate_scoped_jump(JumpType);
  227. void generate_labelled_jump(JumpType, DeprecatedFlyString const& label);
  228. explicit Generator(VM&);
  229. ~Generator() = default;
  230. void grow(size_t);
  231. struct LabelableScope {
  232. Label bytecode_target;
  233. Vector<DeprecatedFlyString> language_label_set;
  234. };
  235. BasicBlock* m_current_basic_block { nullptr };
  236. ASTNode const* m_current_ast_node { nullptr };
  237. UnwindContext const* m_current_unwind_context { nullptr };
  238. Vector<NonnullOwnPtr<BasicBlock>> m_root_basic_blocks;
  239. NonnullOwnPtr<StringTable> m_string_table;
  240. NonnullOwnPtr<IdentifierTable> m_identifier_table;
  241. NonnullOwnPtr<RegexTable> m_regex_table;
  242. MarkedVector<Value> m_constants;
  243. u32 m_next_register { Register::reserved_register_count };
  244. u32 m_next_block { 1 };
  245. u32 m_next_property_lookup_cache { 0 };
  246. u32 m_next_global_variable_cache { 0 };
  247. u32 m_next_environment_variable_cache { 0 };
  248. FunctionKind m_enclosing_function_kind { FunctionKind::Normal };
  249. Vector<LabelableScope> m_continuable_scopes;
  250. Vector<LabelableScope> m_breakable_scopes;
  251. Vector<BlockBoundaryType> m_boundaries;
  252. Vector<Operand> m_home_objects;
  253. HashTable<u32> m_initialized_locals;
  254. };
  255. }