Interpreter.cpp 5.1 KB

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