Interpreter.cpp 5.5 KB

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