Interpreter.cpp 9.8 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285
  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 <AK/StringBuilder.h>
  28. #include <LibJS/AST.h>
  29. #include <LibJS/Interpreter.h>
  30. #include <LibJS/Runtime/Error.h>
  31. #include <LibJS/Runtime/GlobalObject.h>
  32. #include <LibJS/Runtime/LexicalEnvironment.h>
  33. #include <LibJS/Runtime/MarkedValueList.h>
  34. #include <LibJS/Runtime/NativeFunction.h>
  35. #include <LibJS/Runtime/Object.h>
  36. #include <LibJS/Runtime/Reference.h>
  37. #include <LibJS/Runtime/Shape.h>
  38. #include <LibJS/Runtime/SymbolObject.h>
  39. #include <LibJS/Runtime/Value.h>
  40. namespace JS {
  41. Interpreter::Interpreter()
  42. : m_heap(*this)
  43. , m_console(*this)
  44. {
  45. }
  46. Interpreter::~Interpreter()
  47. {
  48. }
  49. Value Interpreter::run(const Statement& statement, ArgumentVector arguments, ScopeType scope_type)
  50. {
  51. if (statement.is_program()) {
  52. if (m_call_stack.is_empty()) {
  53. CallFrame global_call_frame;
  54. global_call_frame.this_value = m_global_object;
  55. global_call_frame.function_name = "(global execution context)";
  56. global_call_frame.environment = heap().allocate<LexicalEnvironment>();
  57. m_call_stack.append(move(global_call_frame));
  58. }
  59. }
  60. if (!statement.is_scope_node())
  61. return statement.execute(*this);
  62. auto& block = static_cast<const ScopeNode&>(statement);
  63. enter_scope(block, move(arguments), scope_type);
  64. m_last_value = js_undefined();
  65. for (auto& node : block.children()) {
  66. m_last_value = node.execute(*this);
  67. if (should_unwind()) {
  68. if (should_unwind_until(ScopeType::Breakable, block.label()))
  69. stop_unwind();
  70. break;
  71. }
  72. }
  73. bool did_return = m_unwind_until == ScopeType::Function;
  74. if (m_unwind_until == scope_type)
  75. m_unwind_until = ScopeType::None;
  76. exit_scope(block);
  77. return did_return ? m_last_value : js_undefined();
  78. }
  79. void Interpreter::enter_scope(const ScopeNode& scope_node, ArgumentVector arguments, ScopeType scope_type)
  80. {
  81. if (scope_type == ScopeType::Function) {
  82. m_scope_stack.append({ scope_type, scope_node, false });
  83. return;
  84. }
  85. HashMap<FlyString, Variable> scope_variables_with_declaration_kind;
  86. scope_variables_with_declaration_kind.ensure_capacity(16);
  87. for (auto& declaration : scope_node.variables()) {
  88. for (auto& declarator : declaration.declarations()) {
  89. if (scope_node.is_program())
  90. global_object().put(declarator.id().string(), js_undefined());
  91. else
  92. scope_variables_with_declaration_kind.set(declarator.id().string(), { js_undefined(), declaration.declaration_kind() });
  93. }
  94. }
  95. for (auto& argument : arguments) {
  96. scope_variables_with_declaration_kind.set(argument.name, { argument.value, DeclarationKind::Var });
  97. }
  98. bool pushed_lexical_environment = false;
  99. if (!scope_variables_with_declaration_kind.is_empty()) {
  100. auto* block_lexical_environment = heap().allocate<LexicalEnvironment>(move(scope_variables_with_declaration_kind), current_environment());
  101. m_call_stack.last().environment = block_lexical_environment;
  102. pushed_lexical_environment = true;
  103. }
  104. m_scope_stack.append({ scope_type, scope_node, pushed_lexical_environment });
  105. }
  106. void Interpreter::exit_scope(const ScopeNode& scope_node)
  107. {
  108. while (!m_scope_stack.is_empty()) {
  109. auto popped_scope = m_scope_stack.take_last();
  110. if (popped_scope.pushed_environment)
  111. m_call_stack.last().environment = m_call_stack.last().environment->parent();
  112. if (popped_scope.scope_node.ptr() == &scope_node)
  113. break;
  114. }
  115. // If we unwind all the way, just reset m_unwind_until so that future "return" doesn't break.
  116. if (m_scope_stack.is_empty())
  117. m_unwind_until = ScopeType::None;
  118. }
  119. void Interpreter::set_variable(const FlyString& name, Value value, bool first_assignment)
  120. {
  121. if (m_call_stack.size()) {
  122. for (auto* environment = current_environment(); environment; environment = environment->parent()) {
  123. auto possible_match = environment->get(name);
  124. if (possible_match.has_value()) {
  125. if (!first_assignment && possible_match.value().declaration_kind == DeclarationKind::Const) {
  126. throw_exception<TypeError>("Assignment to constant variable");
  127. return;
  128. }
  129. environment->set(name, { value, possible_match.value().declaration_kind });
  130. return;
  131. }
  132. }
  133. }
  134. global_object().put(move(name), move(value));
  135. }
  136. Value Interpreter::get_variable(const FlyString& name)
  137. {
  138. if (m_call_stack.size()) {
  139. for (auto* environment = current_environment(); environment; environment = environment->parent()) {
  140. auto possible_match = environment->get(name);
  141. if (possible_match.has_value())
  142. return possible_match.value().value;
  143. }
  144. }
  145. return global_object().get(name);
  146. }
  147. Reference Interpreter::get_reference(const FlyString& name)
  148. {
  149. if (m_call_stack.size()) {
  150. for (auto* environment = current_environment(); environment; environment = environment->parent()) {
  151. auto possible_match = environment->get(name);
  152. if (possible_match.has_value())
  153. return { Reference::LocalVariable, name };
  154. }
  155. }
  156. return { Reference::GlobalVariable, name };
  157. }
  158. void Interpreter::gather_roots(Badge<Heap>, HashTable<Cell*>& roots)
  159. {
  160. roots.set(m_global_object);
  161. roots.set(m_exception);
  162. if (m_last_value.is_cell())
  163. roots.set(m_last_value.as_cell());
  164. for (auto& call_frame : m_call_stack) {
  165. if (call_frame.this_value.is_cell())
  166. roots.set(call_frame.this_value.as_cell());
  167. for (auto& argument : call_frame.arguments) {
  168. if (argument.is_cell())
  169. roots.set(argument.as_cell());
  170. }
  171. roots.set(call_frame.environment);
  172. }
  173. SymbolObject::gather_symbol_roots(roots);
  174. }
  175. Value Interpreter::call(Function& function, Value this_value, Optional<MarkedValueList> arguments)
  176. {
  177. auto& call_frame = push_call_frame();
  178. call_frame.function_name = function.name();
  179. call_frame.this_value = function.bound_this().value_or(this_value);
  180. call_frame.arguments = function.bound_arguments();
  181. if (arguments.has_value())
  182. call_frame.arguments.append(arguments.value().values());
  183. call_frame.environment = function.create_environment();
  184. auto result = function.call(*this);
  185. pop_call_frame();
  186. return result;
  187. }
  188. Value Interpreter::construct(Function& function, Function& new_target, Optional<MarkedValueList> arguments)
  189. {
  190. auto& call_frame = push_call_frame();
  191. call_frame.function_name = function.name();
  192. if (arguments.has_value())
  193. call_frame.arguments = arguments.value().values();
  194. call_frame.environment = function.create_environment();
  195. auto* new_object = Object::create_empty(*this, global_object());
  196. auto prototype = new_target.get("prototype");
  197. if (prototype.is_object())
  198. new_object->set_prototype(&prototype.as_object());
  199. call_frame.this_value = new_object;
  200. auto result = function.construct(*this);
  201. pop_call_frame();
  202. if (exception())
  203. return {};
  204. if (result.is_object())
  205. return result;
  206. return new_object;
  207. }
  208. Value Interpreter::throw_exception(Exception* exception)
  209. {
  210. #ifdef __serenity__
  211. if (exception->value().is_object() && exception->value().as_object().is_error()) {
  212. auto& error = static_cast<Error&>(exception->value().as_object());
  213. dbg() << "Throwing JavaScript Error: " << error.name() << ", " << error.message();
  214. for (ssize_t i = m_call_stack.size() - 1; i >= 0; --i) {
  215. auto function_name = m_call_stack[i].function_name;
  216. if (function_name.is_empty())
  217. function_name = "<anonymous>";
  218. dbg() << " " << function_name;
  219. }
  220. }
  221. #endif
  222. m_exception = exception;
  223. unwind(ScopeType::Try);
  224. return {};
  225. }
  226. GlobalObject& Interpreter::global_object()
  227. {
  228. return static_cast<GlobalObject&>(*m_global_object);
  229. }
  230. const GlobalObject& Interpreter::global_object() const
  231. {
  232. return static_cast<const GlobalObject&>(*m_global_object);
  233. }
  234. String Interpreter::join_arguments() const
  235. {
  236. StringBuilder joined_arguments;
  237. for (size_t i = 0; i < argument_count(); ++i) {
  238. joined_arguments.append(argument(i).to_string_without_side_effects().characters());
  239. if (i != argument_count() - 1)
  240. joined_arguments.append(' ');
  241. }
  242. return joined_arguments.build();
  243. }
  244. }