Interpreter.cpp 3.3 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116
  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)
  41. {
  42. enter_scope(scope_node);
  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)
  51. {
  52. m_scope_stack.append({ scope_node, {} });
  53. }
  54. void Interpreter::exit_scope(const ScopeNode& scope_node)
  55. {
  56. ASSERT(&m_scope_stack.last().scope_node == &scope_node);
  57. m_scope_stack.take_last();
  58. }
  59. void Interpreter::do_return()
  60. {
  61. dbg() << "FIXME: Implement Interpreter::do_return()";
  62. }
  63. void Interpreter::declare_variable(String name)
  64. {
  65. m_scope_stack.last().variables.set(move(name), js_undefined());
  66. }
  67. void Interpreter::set_variable(String name, Value value)
  68. {
  69. for (ssize_t i = m_scope_stack.size() - 1; i >= 0; --i) {
  70. auto& scope = m_scope_stack.at(i);
  71. if (scope.variables.contains(name)) {
  72. scope.variables.set(move(name), move(value));
  73. return;
  74. }
  75. }
  76. global_object().put(move(name), move(value));
  77. }
  78. Value Interpreter::get_variable(const String& name)
  79. {
  80. for (ssize_t i = m_scope_stack.size() - 1; i >= 0; --i) {
  81. auto& scope = m_scope_stack.at(i);
  82. auto value = scope.variables.get(name);
  83. if (value.has_value())
  84. return value.value();
  85. }
  86. return global_object().get(name);
  87. }
  88. void Interpreter::collect_roots(Badge<Heap>, HashTable<Cell*>& roots)
  89. {
  90. roots.set(m_global_object);
  91. for (auto& scope : m_scope_stack) {
  92. for (auto& it : scope.variables) {
  93. if (it.value.is_object())
  94. roots.set(it.value.as_object());
  95. }
  96. }
  97. }
  98. }