Interpreter.h 5.5 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182
  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. #pragma once
  27. #include <AK/FlyString.h>
  28. #include <AK/HashMap.h>
  29. #include <AK/String.h>
  30. #include <AK/Vector.h>
  31. #include <LibJS/Forward.h>
  32. #include <LibJS/Heap/Heap.h>
  33. #include <LibJS/Runtime/Exception.h>
  34. #include <LibJS/Runtime/LexicalEnvironment.h>
  35. #include <LibJS/Runtime/MarkedValueList.h>
  36. #include <LibJS/Runtime/Value.h>
  37. namespace JS {
  38. enum class ScopeType {
  39. None,
  40. Function,
  41. Block,
  42. Try,
  43. Breakable,
  44. Continuable,
  45. };
  46. struct ScopeFrame {
  47. ScopeType type;
  48. NonnullRefPtr<ScopeNode> scope_node;
  49. bool pushed_environment { false };
  50. };
  51. struct CallFrame {
  52. FlyString function_name;
  53. Value this_value;
  54. Vector<Value> arguments;
  55. LexicalEnvironment* environment { nullptr };
  56. };
  57. struct Argument {
  58. FlyString name;
  59. Value value;
  60. };
  61. typedef Vector<Argument, 8> ArgumentVector;
  62. class Interpreter {
  63. public:
  64. template<typename GlobalObjectType, typename... Args>
  65. static NonnullOwnPtr<Interpreter> create(Args&&... args)
  66. {
  67. auto interpreter = adopt_own(*new Interpreter);
  68. interpreter->m_global_object = interpreter->heap().allocate<GlobalObjectType>(forward<Args>(args)...);
  69. static_cast<GlobalObjectType*>(interpreter->m_global_object)->initialize();
  70. return interpreter;
  71. }
  72. ~Interpreter();
  73. Value run(const Statement&, ArgumentVector = {}, ScopeType = ScopeType::Block);
  74. GlobalObject& global_object();
  75. const GlobalObject& global_object() const;
  76. Heap& heap() { return m_heap; }
  77. void unwind(ScopeType type) { m_unwind_until = type; }
  78. void stop_unwind() { m_unwind_until = ScopeType::None; }
  79. bool should_unwind_until(ScopeType type) const { return m_unwind_until == type; }
  80. bool should_unwind() const { return m_unwind_until != ScopeType::None; }
  81. Value get_variable(const FlyString& name);
  82. void set_variable(const FlyString& name, Value, bool first_assignment = false);
  83. Reference get_reference(const FlyString& name);
  84. void gather_roots(Badge<Heap>, HashTable<Cell*>&);
  85. void enter_scope(const ScopeNode&, ArgumentVector, ScopeType);
  86. void exit_scope(const ScopeNode&);
  87. Value call(Function&, Value this_value = {}, Optional<MarkedValueList> arguments = {});
  88. CallFrame& push_call_frame()
  89. {
  90. m_call_stack.append({ {}, js_undefined(), {}, nullptr });
  91. return m_call_stack.last();
  92. }
  93. void pop_call_frame() { m_call_stack.take_last(); }
  94. const CallFrame& call_frame() { return m_call_stack.last(); }
  95. const Vector<CallFrame>& call_stack() { return m_call_stack; }
  96. void push_environment(LexicalEnvironment*);
  97. void pop_environment();
  98. const LexicalEnvironment* current_environment() const { return m_call_stack.last().environment; }
  99. LexicalEnvironment* current_environment() { return m_call_stack.last().environment; }
  100. size_t argument_count() const
  101. {
  102. if (m_call_stack.is_empty())
  103. return 0;
  104. return m_call_stack.last().arguments.size();
  105. }
  106. Value argument(size_t index) const
  107. {
  108. if (m_call_stack.is_empty())
  109. return {};
  110. auto& arguments = m_call_stack.last().arguments;
  111. return index < arguments.size() ? arguments[index] : js_undefined();
  112. }
  113. Value this_value() const
  114. {
  115. if (m_call_stack.is_empty())
  116. return m_global_object;
  117. return m_call_stack.last().this_value;
  118. }
  119. Exception* exception()
  120. {
  121. return m_exception;
  122. }
  123. void clear_exception() { m_exception = nullptr; }
  124. template<typename T, typename... Args>
  125. Value throw_exception(Args&&... args)
  126. {
  127. return throw_exception(T::create(global_object(), forward<Args>(args)...));
  128. }
  129. Value throw_exception(Exception*);
  130. Value throw_exception(Value value)
  131. {
  132. return throw_exception(heap().allocate<Exception>(value));
  133. }
  134. Value last_value() const { return m_last_value; }
  135. private:
  136. Interpreter();
  137. Heap m_heap;
  138. Value m_last_value;
  139. Vector<ScopeFrame> m_scope_stack;
  140. Vector<CallFrame> m_call_stack;
  141. Object* m_global_object { nullptr };
  142. Exception* m_exception { nullptr };
  143. ScopeType m_unwind_until { ScopeType::None };
  144. };
  145. }