Interpreter.cpp 4.9 KB

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