Interpreter.cpp 7.1 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214
  1. /*
  2. * Copyright (c) 2020, Andreas Kling <kling@serenityos.org>
  3. * All rights reserved.
  4. *
  5. * Redistribution and use in source and binary forms, with or without
  6. * modification, are permitted provided that the following conditions are met:
  7. *
  8. * 1. Redistributions of source code must retain the above copyright notice, this
  9. * list of conditions and the following disclaimer.
  10. *
  11. * 2. Redistributions in binary form must reproduce the above copyright notice,
  12. * this list of conditions and the following disclaimer in the documentation
  13. * and/or other materials provided with the distribution.
  14. *
  15. * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
  16. * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  17. * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
  18. * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
  19. * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  20. * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
  21. * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
  22. * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
  23. * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
  24. * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
  25. */
  26. #include <AK/Badge.h>
  27. #include <LibJS/AST.h>
  28. #include <LibJS/Interpreter.h>
  29. #include <LibJS/Runtime/ArrayPrototype.h>
  30. #include <LibJS/Runtime/DatePrototype.h>
  31. #include <LibJS/Runtime/Error.h>
  32. #include <LibJS/Runtime/ErrorPrototype.h>
  33. #include <LibJS/Runtime/FunctionPrototype.h>
  34. #include <LibJS/Runtime/GlobalObject.h>
  35. #include <LibJS/Runtime/NativeFunction.h>
  36. #include <LibJS/Runtime/Object.h>
  37. #include <LibJS/Runtime/ObjectPrototype.h>
  38. #include <LibJS/Runtime/Shape.h>
  39. #include <LibJS/Runtime/StringPrototype.h>
  40. #include <LibJS/Runtime/Value.h>
  41. namespace JS {
  42. Interpreter::Interpreter()
  43. : m_heap(*this)
  44. {
  45. m_empty_object_shape = heap().allocate<Shape>();
  46. m_object_prototype = heap().allocate<ObjectPrototype>();
  47. m_function_prototype = heap().allocate<FunctionPrototype>();
  48. m_string_prototype = heap().allocate<StringPrototype>();
  49. m_array_prototype = heap().allocate<ArrayPrototype>();
  50. m_error_prototype = heap().allocate<ErrorPrototype>();
  51. m_date_prototype = heap().allocate<DatePrototype>();
  52. }
  53. Interpreter::~Interpreter()
  54. {
  55. }
  56. Value Interpreter::run(const Statement& statement, Vector<Argument> arguments, ScopeType scope_type)
  57. {
  58. if (!statement.is_scope_node())
  59. return statement.execute(*this);
  60. auto& block = static_cast<const ScopeNode&>(statement);
  61. enter_scope(block, move(arguments), scope_type);
  62. Value last_value = js_undefined();
  63. for (auto& node : block.children()) {
  64. last_value = node.execute(*this);
  65. if (m_unwind_until != ScopeType::None)
  66. break;
  67. }
  68. if (m_unwind_until == scope_type)
  69. m_unwind_until = ScopeType::None;
  70. exit_scope(block);
  71. return last_value;
  72. }
  73. void Interpreter::enter_scope(const ScopeNode& scope_node, Vector<Argument> arguments, ScopeType scope_type)
  74. {
  75. HashMap<FlyString, Variable> scope_variables_with_declaration_type;
  76. for (auto& argument : arguments) {
  77. scope_variables_with_declaration_type.set(argument.name, { argument.value, DeclarationType::Var });
  78. }
  79. m_scope_stack.append({ scope_type, scope_node, move(scope_variables_with_declaration_type) });
  80. }
  81. void Interpreter::exit_scope(const ScopeNode& scope_node)
  82. {
  83. while (!m_scope_stack.is_empty()) {
  84. auto popped_scope = m_scope_stack.take_last();
  85. if (popped_scope.scope_node.ptr() == &scope_node)
  86. break;
  87. }
  88. // If we unwind all the way, just reset m_unwind_until so that future "return" doesn't break.
  89. if (m_scope_stack.is_empty())
  90. m_unwind_until = ScopeType::None;
  91. }
  92. void Interpreter::declare_variable(const FlyString& name, DeclarationType declaration_type)
  93. {
  94. switch (declaration_type) {
  95. case DeclarationType::Var:
  96. for (ssize_t i = m_scope_stack.size() - 1; i >= 0; --i) {
  97. auto& scope = m_scope_stack.at(i);
  98. if (scope.type == ScopeType::Function) {
  99. if (scope.variables.get(name).has_value() && scope.variables.get(name).value().declaration_type != DeclarationType::Var)
  100. ASSERT_NOT_REACHED();
  101. scope.variables.set(move(name), { js_undefined(), declaration_type });
  102. return;
  103. }
  104. }
  105. global_object().put(move(name), js_undefined());
  106. break;
  107. case DeclarationType::Let:
  108. case DeclarationType::Const:
  109. if (m_scope_stack.last().variables.get(name).has_value())
  110. ASSERT_NOT_REACHED();
  111. m_scope_stack.last().variables.set(move(name), { js_undefined(), declaration_type });
  112. break;
  113. }
  114. }
  115. void Interpreter::set_variable(const FlyString& name, Value value, bool first_assignment)
  116. {
  117. for (ssize_t i = m_scope_stack.size() - 1; i >= 0; --i) {
  118. auto& scope = m_scope_stack.at(i);
  119. auto possible_match = scope.variables.get(name);
  120. if (possible_match.has_value()) {
  121. if (!first_assignment && possible_match.value().declaration_type == DeclarationType::Const)
  122. ASSERT_NOT_REACHED();
  123. scope.variables.set(move(name), { move(value), possible_match.value().declaration_type });
  124. return;
  125. }
  126. }
  127. global_object().put(move(name), move(value));
  128. }
  129. Optional<Value> Interpreter::get_variable(const FlyString& name)
  130. {
  131. if (name == "this")
  132. return this_value();
  133. for (ssize_t i = m_scope_stack.size() - 1; i >= 0; --i) {
  134. auto& scope = m_scope_stack.at(i);
  135. auto value = scope.variables.get(name);
  136. if (value.has_value())
  137. return value.value().value;
  138. }
  139. return global_object().get(name);
  140. }
  141. void Interpreter::gather_roots(Badge<Heap>, HashTable<Cell*>& roots)
  142. {
  143. roots.set(m_empty_object_shape);
  144. roots.set(m_global_object);
  145. roots.set(m_string_prototype);
  146. roots.set(m_object_prototype);
  147. roots.set(m_array_prototype);
  148. roots.set(m_error_prototype);
  149. roots.set(m_date_prototype);
  150. roots.set(m_function_prototype);
  151. roots.set(m_exception);
  152. for (auto& scope : m_scope_stack) {
  153. for (auto& it : scope.variables) {
  154. if (it.value.value.is_cell())
  155. roots.set(it.value.value.as_cell());
  156. }
  157. }
  158. for (auto& call_frame : m_call_stack) {
  159. if (call_frame.this_value.is_cell())
  160. roots.set(call_frame.this_value.as_cell());
  161. for (auto& argument : call_frame.arguments) {
  162. if (argument.is_cell())
  163. roots.set(argument.as_cell());
  164. }
  165. }
  166. }
  167. Value Interpreter::call(Function* function, Value this_value, const Vector<Value>& arguments)
  168. {
  169. auto& call_frame = push_call_frame();
  170. call_frame.this_value = this_value;
  171. call_frame.arguments = arguments;
  172. auto result = function->call(*this);
  173. pop_call_frame();
  174. return result;
  175. }
  176. Value Interpreter::throw_exception(Exception* exception)
  177. {
  178. m_exception = exception;
  179. unwind(ScopeType::Try);
  180. return {};
  181. }
  182. }