summaryrefslogtreecommitdiff
path: root/Libraries/LibJS/Interpreter.h
blob: 79940cac3a7e3b4d383e42112d6ac79a18dc1c62 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
/*
 * Copyright (c) 2020, Andreas Kling <kling@serenityos.org>
 * All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions are met:
 *
 * 1. Redistributions of source code must retain the above copyright notice, this
 *    list of conditions and the following disclaimer.
 *
 * 2. Redistributions in binary form must reproduce the above copyright notice,
 *    this list of conditions and the following disclaimer in the documentation
 *    and/or other materials provided with the distribution.
 *
 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
 * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
 * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
 * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
 * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 */

#pragma once

#include <AK/HashMap.h>
#include <AK/String.h>
#include <AK/Vector.h>
#include <LibJS/Forward.h>
#include <LibJS/Heap.h>
#include <LibJS/Value.h>

namespace JS {

enum class ScopeType {
    Function,
    Block,
};

struct Variable {
    Value value;
    DeclarationType declaration_type;
};

struct ScopeFrame {
    ScopeType type;
    const ScopeNode& scope_node;
    HashMap<String, Variable> variables;
};

struct Argument {
    String name;
    Value value;
};

class Interpreter {
public:
    Interpreter();
    ~Interpreter();

    Value run(const ScopeNode&, Vector<Argument> = {}, ScopeType = ScopeType::Block);

    Object& global_object() { return *m_global_object; }
    const Object& global_object() const { return *m_global_object; }

    Heap& heap() { return m_heap; }

    void do_return();

    Value get_variable(const String& name);
    void set_variable(String name, Value);
    void declare_variable(String name, DeclarationType);

    void collect_roots(Badge<Heap>, HashTable<Cell*>&);

    void enter_scope(const ScopeNode&, Vector<Argument>, ScopeType);
    void exit_scope(const ScopeNode&);

    void push_this_value(Value value) { m_this_stack.append(move(value)); }
    void pop_this_value() { m_this_stack.take_last(); }
    Value this_value() const
    {
        if (m_this_stack.is_empty())
            return m_global_object;
        return m_this_stack.last();
    }

private:
    Heap m_heap;

    Vector<ScopeFrame> m_scope_stack;
    Vector<Value> m_this_stack;

    Object* m_global_object { nullptr };
};

}