Interpreter.cpp 6.5 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204
  1. /*
  2. * Copyright (c) 2021, Andreas Kling <kling@serenityos.org>
  3. *
  4. * SPDX-License-Identifier: BSD-2-Clause
  5. */
  6. #include <AK/Debug.h>
  7. #include <AK/TemporaryChange.h>
  8. #include <LibJS/Bytecode/BasicBlock.h>
  9. #include <LibJS/Bytecode/Instruction.h>
  10. #include <LibJS/Bytecode/Interpreter.h>
  11. #include <LibJS/Bytecode/Op.h>
  12. #include <LibJS/Runtime/GlobalEnvironment.h>
  13. #include <LibJS/Runtime/GlobalObject.h>
  14. namespace JS::Bytecode {
  15. static Interpreter* s_current;
  16. Interpreter* Interpreter::current()
  17. {
  18. return s_current;
  19. }
  20. Interpreter::Interpreter(GlobalObject& global_object)
  21. : m_vm(global_object.vm())
  22. , m_global_object(global_object)
  23. {
  24. VERIFY(!s_current);
  25. s_current = this;
  26. }
  27. Interpreter::~Interpreter()
  28. {
  29. VERIFY(s_current == this);
  30. s_current = nullptr;
  31. }
  32. Value Interpreter::run(Executable const& executable, BasicBlock const* entry_point)
  33. {
  34. dbgln_if(JS_BYTECODE_DEBUG, "Bytecode::Interpreter will run unit {:p}", &executable);
  35. TemporaryChange restore_executable { m_current_executable, &executable };
  36. vm().set_last_value(Badge<Interpreter> {}, {});
  37. ExecutionContext execution_context;
  38. if (vm().execution_context_stack().is_empty()) {
  39. execution_context.this_value = &global_object();
  40. static FlyString global_execution_context_name = "(*BC* global execution context)";
  41. execution_context.function_name = global_execution_context_name;
  42. execution_context.lexical_environment = &global_object().environment();
  43. execution_context.variable_environment = &global_object().environment();
  44. VERIFY(!vm().exception());
  45. // FIXME: How do we know if we're in strict mode? Maybe the Bytecode::Block should know this?
  46. // execution_context.is_strict_mode = ???;
  47. vm().push_execution_context(execution_context, global_object());
  48. VERIFY(!vm().exception());
  49. }
  50. auto block = entry_point ?: &executable.basic_blocks.first();
  51. if (m_manually_entered_frames) {
  52. VERIFY(registers().size() >= executable.number_of_registers);
  53. } else {
  54. m_register_windows.append(make<RegisterWindow>());
  55. registers().resize(executable.number_of_registers);
  56. registers()[Register::global_object_index] = Value(&global_object());
  57. }
  58. for (;;) {
  59. Bytecode::InstructionStreamIterator pc(block->instruction_stream());
  60. bool will_jump = false;
  61. bool will_return = false;
  62. while (!pc.at_end()) {
  63. auto& instruction = *pc;
  64. instruction.execute(*this);
  65. if (vm().exception()) {
  66. m_saved_exception = {};
  67. if (m_unwind_contexts.is_empty())
  68. break;
  69. auto& unwind_context = m_unwind_contexts.last();
  70. if (unwind_context.handler) {
  71. block = unwind_context.handler;
  72. unwind_context.handler = nullptr;
  73. accumulator() = vm().exception()->value();
  74. vm().clear_exception();
  75. will_jump = true;
  76. } else if (unwind_context.finalizer) {
  77. block = unwind_context.finalizer;
  78. m_unwind_contexts.take_last();
  79. will_jump = true;
  80. m_saved_exception = Handle<Exception>::create(vm().exception());
  81. vm().clear_exception();
  82. }
  83. }
  84. if (m_pending_jump.has_value()) {
  85. block = m_pending_jump.release_value();
  86. will_jump = true;
  87. break;
  88. }
  89. if (!m_return_value.is_empty()) {
  90. will_return = true;
  91. break;
  92. }
  93. ++pc;
  94. }
  95. if (will_return)
  96. break;
  97. if (pc.at_end() && !will_jump)
  98. break;
  99. if (vm().exception())
  100. break;
  101. }
  102. dbgln_if(JS_BYTECODE_DEBUG, "Bytecode::Interpreter did run unit {:p}", &executable);
  103. if constexpr (JS_BYTECODE_DEBUG) {
  104. for (size_t i = 0; i < registers().size(); ++i) {
  105. String value_string;
  106. if (registers()[i].is_empty())
  107. value_string = "(empty)";
  108. else
  109. value_string = registers()[i].to_string_without_side_effects();
  110. dbgln("[{:3}] {}", i, value_string);
  111. }
  112. }
  113. vm().set_last_value(Badge<Interpreter> {}, accumulator());
  114. if (!m_manually_entered_frames)
  115. m_register_windows.take_last();
  116. auto return_value = m_return_value.value_or(js_undefined());
  117. m_return_value = {};
  118. // NOTE: The return value from a called function is put into $0 in the caller context.
  119. if (!m_register_windows.is_empty())
  120. m_register_windows.last()[0] = return_value;
  121. if (vm().execution_context_stack().size() == 1)
  122. vm().pop_execution_context();
  123. vm().finish_execution_generation();
  124. return return_value;
  125. }
  126. void Interpreter::enter_unwind_context(Optional<Label> handler_target, Optional<Label> finalizer_target)
  127. {
  128. m_unwind_contexts.empend(handler_target.has_value() ? &handler_target->block() : nullptr, finalizer_target.has_value() ? &finalizer_target->block() : nullptr);
  129. }
  130. void Interpreter::leave_unwind_context()
  131. {
  132. m_unwind_contexts.take_last();
  133. }
  134. void Interpreter::continue_pending_unwind(Label const& resume_label)
  135. {
  136. if (!m_saved_exception.is_null()) {
  137. vm().set_exception(*m_saved_exception.cell());
  138. m_saved_exception = {};
  139. } else {
  140. jump(resume_label);
  141. }
  142. }
  143. AK::Array<OwnPtr<PassManager>, static_cast<UnderlyingType<Interpreter::OptimizationLevel>>(Interpreter::OptimizationLevel::__Count)> Interpreter::s_optimization_pipelines {};
  144. Bytecode::PassManager& Interpreter::optimization_pipeline(Interpreter::OptimizationLevel level)
  145. {
  146. auto underlying_level = to_underlying(level);
  147. VERIFY(underlying_level <= to_underlying(Interpreter::OptimizationLevel::__Count));
  148. auto& entry = s_optimization_pipelines[underlying_level];
  149. if (entry)
  150. return *entry;
  151. auto pm = make<PassManager>();
  152. if (level == OptimizationLevel::Default) {
  153. pm->add<Passes::GenerateCFG>();
  154. pm->add<Passes::UnifySameBlocks>();
  155. pm->add<Passes::GenerateCFG>();
  156. pm->add<Passes::MergeBlocks>();
  157. pm->add<Passes::GenerateCFG>();
  158. pm->add<Passes::UnifySameBlocks>();
  159. pm->add<Passes::GenerateCFG>();
  160. pm->add<Passes::MergeBlocks>();
  161. pm->add<Passes::GenerateCFG>();
  162. pm->add<Passes::PlaceBlocks>();
  163. } else {
  164. VERIFY_NOT_REACHED();
  165. }
  166. auto& passes = *pm;
  167. entry = move(pm);
  168. return passes;
  169. }
  170. }