Interpreter.cpp 5.2 KB

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