Generator.cpp 4.7 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157
  1. /*
  2. * Copyright (c) 2021, Andreas Kling <kling@serenityos.org>
  3. *
  4. * SPDX-License-Identifier: BSD-2-Clause
  5. */
  6. #include <LibJS/AST.h>
  7. #include <LibJS/Bytecode/BasicBlock.h>
  8. #include <LibJS/Bytecode/Generator.h>
  9. #include <LibJS/Bytecode/Instruction.h>
  10. #include <LibJS/Bytecode/Op.h>
  11. #include <LibJS/Bytecode/Register.h>
  12. namespace JS::Bytecode {
  13. Generator::Generator()
  14. : m_string_table(make<StringTable>())
  15. , m_identifier_table(make<IdentifierTable>())
  16. {
  17. }
  18. Generator::~Generator()
  19. {
  20. }
  21. Executable Generator::generate(ASTNode const& node, bool is_in_generator_function)
  22. {
  23. Generator generator;
  24. generator.switch_to_basic_block(generator.make_block());
  25. if (is_in_generator_function) {
  26. generator.enter_generator_context();
  27. // Immediately yield with no value.
  28. auto& start_block = generator.make_block();
  29. generator.emit<Bytecode::Op::Yield>(Label { start_block });
  30. generator.switch_to_basic_block(start_block);
  31. }
  32. node.generate_bytecode(generator);
  33. if (is_in_generator_function) {
  34. // Terminate all unterminated blocks with yield return
  35. for (auto& block : generator.m_root_basic_blocks) {
  36. if (block.is_terminated())
  37. continue;
  38. generator.switch_to_basic_block(block);
  39. generator.emit<Bytecode::Op::LoadImmediate>(js_undefined());
  40. generator.emit<Bytecode::Op::Yield>(nullptr);
  41. }
  42. }
  43. return { {}, move(generator.m_root_basic_blocks), move(generator.m_string_table), move(generator.m_identifier_table), generator.m_next_register };
  44. }
  45. void Generator::grow(size_t additional_size)
  46. {
  47. VERIFY(m_current_basic_block);
  48. m_current_basic_block->grow(additional_size);
  49. }
  50. void* Generator::next_slot()
  51. {
  52. VERIFY(m_current_basic_block);
  53. return m_current_basic_block->next_slot();
  54. }
  55. Register Generator::allocate_register()
  56. {
  57. VERIFY(m_next_register != NumericLimits<u32>::max());
  58. return Register { m_next_register++ };
  59. }
  60. Label Generator::nearest_continuable_scope() const
  61. {
  62. return m_continuable_scopes.last();
  63. }
  64. void Generator::begin_continuable_scope(Label continue_target)
  65. {
  66. m_continuable_scopes.append(continue_target);
  67. }
  68. void Generator::end_continuable_scope()
  69. {
  70. m_continuable_scopes.take_last();
  71. }
  72. Label Generator::nearest_breakable_scope() const
  73. {
  74. return m_breakable_scopes.last();
  75. }
  76. void Generator::begin_breakable_scope(Label breakable_target)
  77. {
  78. m_breakable_scopes.append(breakable_target);
  79. }
  80. void Generator::end_breakable_scope()
  81. {
  82. m_breakable_scopes.take_last();
  83. }
  84. void Generator::emit_load_from_reference(JS::ASTNode const& node)
  85. {
  86. if (is<Identifier>(node)) {
  87. auto& identifier = static_cast<Identifier const&>(node);
  88. emit<Bytecode::Op::GetVariable>(intern_identifier(identifier.string()));
  89. return;
  90. }
  91. if (is<MemberExpression>(node)) {
  92. auto& expression = static_cast<MemberExpression const&>(node);
  93. expression.object().generate_bytecode(*this);
  94. auto object_reg = allocate_register();
  95. emit<Bytecode::Op::Store>(object_reg);
  96. if (expression.is_computed()) {
  97. expression.property().generate_bytecode(*this);
  98. emit<Bytecode::Op::GetByValue>(object_reg);
  99. } else {
  100. auto identifier_table_ref = intern_identifier(verify_cast<Identifier>(expression.property()).string());
  101. emit<Bytecode::Op::GetById>(identifier_table_ref);
  102. }
  103. return;
  104. }
  105. VERIFY_NOT_REACHED();
  106. }
  107. void Generator::emit_store_to_reference(JS::ASTNode const& node)
  108. {
  109. if (is<Identifier>(node)) {
  110. auto& identifier = static_cast<Identifier const&>(node);
  111. emit<Bytecode::Op::SetVariable>(intern_identifier(identifier.string()));
  112. return;
  113. }
  114. if (is<MemberExpression>(node)) {
  115. // NOTE: The value is in the accumulator, so we have to store that away first.
  116. auto value_reg = allocate_register();
  117. emit<Bytecode::Op::Store>(value_reg);
  118. auto& expression = static_cast<MemberExpression const&>(node);
  119. expression.object().generate_bytecode(*this);
  120. auto object_reg = allocate_register();
  121. emit<Bytecode::Op::Store>(object_reg);
  122. if (expression.is_computed()) {
  123. expression.property().generate_bytecode(*this);
  124. auto property_reg = allocate_register();
  125. emit<Bytecode::Op::Store>(property_reg);
  126. emit<Bytecode::Op::Load>(value_reg);
  127. emit<Bytecode::Op::PutByValue>(object_reg, property_reg);
  128. } else {
  129. emit<Bytecode::Op::Load>(value_reg);
  130. auto identifier_table_ref = intern_identifier(verify_cast<Identifier>(expression.property()).string());
  131. emit<Bytecode::Op::PutById>(object_reg, identifier_table_ref);
  132. }
  133. return;
  134. }
  135. VERIFY_NOT_REACHED();
  136. }
  137. }