Interpreter.cpp 5.5 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164
  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/GlobalObject.h>
  30. #include <LibJS/Runtime/NativeFunction.h>
  31. #include <LibJS/Runtime/Object.h>
  32. #include <LibJS/Runtime/ObjectPrototype.h>
  33. #include <LibJS/Runtime/StringPrototype.h>
  34. #include <LibJS/Runtime/Value.h>
  35. namespace JS {
  36. Interpreter::Interpreter()
  37. : m_heap(*this)
  38. {
  39. m_global_object = heap().allocate<GlobalObject>();
  40. m_object_prototype = heap().allocate<ObjectPrototype>();
  41. m_string_prototype = heap().allocate<StringPrototype>();
  42. }
  43. Interpreter::~Interpreter()
  44. {
  45. }
  46. Value Interpreter::run(const ScopeNode& scope_node, Vector<Argument> arguments, ScopeType scope_type)
  47. {
  48. enter_scope(scope_node, move(arguments), scope_type);
  49. Value last_value = js_undefined();
  50. for (auto& node : scope_node.children()) {
  51. last_value = node.execute(*this);
  52. }
  53. exit_scope(scope_node);
  54. return last_value;
  55. }
  56. void Interpreter::enter_scope(const ScopeNode& scope_node, Vector<Argument> arguments, ScopeType scope_type)
  57. {
  58. HashMap<String, Variable> scope_variables_with_declaration_type;
  59. for (auto& argument : arguments) {
  60. scope_variables_with_declaration_type.set(argument.name, { argument.value, DeclarationType::Var });
  61. }
  62. m_scope_stack.append({ scope_type, scope_node, move(scope_variables_with_declaration_type) });
  63. }
  64. void Interpreter::exit_scope(const ScopeNode& scope_node)
  65. {
  66. while (m_scope_stack.last().scope_node.ptr() != &scope_node)
  67. m_scope_stack.take_last();
  68. }
  69. void Interpreter::do_return()
  70. {
  71. dbg() << "FIXME: Implement Interpreter::do_return()";
  72. }
  73. void Interpreter::declare_variable(String name, DeclarationType declaration_type)
  74. {
  75. switch (declaration_type) {
  76. case DeclarationType::Var:
  77. for (ssize_t i = m_scope_stack.size() - 1; i >= 0; --i) {
  78. auto& scope = m_scope_stack.at(i);
  79. if (scope.type == ScopeType::Function) {
  80. if (scope.variables.get(name).has_value() && scope.variables.get(name).value().declaration_type != DeclarationType::Var)
  81. ASSERT_NOT_REACHED();
  82. scope.variables.set(move(name), { js_undefined(), declaration_type });
  83. return;
  84. }
  85. }
  86. global_object().put(move(name), js_undefined());
  87. break;
  88. case DeclarationType::Let:
  89. case DeclarationType::Const:
  90. if (m_scope_stack.last().variables.get(name).has_value())
  91. ASSERT_NOT_REACHED();
  92. m_scope_stack.last().variables.set(move(name), { js_undefined(), declaration_type });
  93. break;
  94. }
  95. }
  96. void Interpreter::set_variable(String name, Value value, bool first_assignment)
  97. {
  98. for (ssize_t i = m_scope_stack.size() - 1; i >= 0; --i) {
  99. auto& scope = m_scope_stack.at(i);
  100. auto possible_match = scope.variables.get(name);
  101. if (possible_match.has_value()) {
  102. if (!first_assignment && possible_match.value().declaration_type == DeclarationType::Const)
  103. ASSERT_NOT_REACHED();
  104. scope.variables.set(move(name), { move(value), possible_match.value().declaration_type });
  105. return;
  106. }
  107. }
  108. global_object().put(move(name), move(value));
  109. }
  110. Value Interpreter::get_variable(const String& name)
  111. {
  112. for (ssize_t i = m_scope_stack.size() - 1; i >= 0; --i) {
  113. auto& scope = m_scope_stack.at(i);
  114. auto value = scope.variables.get(name);
  115. if (value.has_value())
  116. return value.value().value;
  117. }
  118. return global_object().get(name);
  119. }
  120. void Interpreter::gather_roots(Badge<Heap>, HashTable<Cell*>& roots)
  121. {
  122. roots.set(m_global_object);
  123. roots.set(m_string_prototype);
  124. roots.set(m_object_prototype);
  125. for (auto& scope : m_scope_stack) {
  126. for (auto& it : scope.variables) {
  127. if (it.value.value.is_cell())
  128. roots.set(it.value.value.as_cell());
  129. }
  130. }
  131. for (auto& call_frame : m_call_stack) {
  132. if (call_frame.this_value.is_cell())
  133. roots.set(call_frame.this_value.as_cell());
  134. for (auto& argument : call_frame.arguments) {
  135. if (argument.is_cell())
  136. roots.set(argument.as_cell());
  137. }
  138. }
  139. }
  140. }