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
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
|
/* -*- Mode: C++; tab-width: 8; indent-tabs-mode: nil; c-basic-offset: 2 -*-
* vim: set ts=8 sts=2 et sw=2 tw=80:
* This Source Code Form is subject to the terms of the Mozilla Public
* License, v. 2.0. If a copy of the MPL was not distributed with this
* file, You can obtain one at http://mozilla.org/MPL/2.0/. */
#ifndef jit_InlineScriptTree_h
#define jit_InlineScriptTree_h
#include "mozilla/Assertions.h"
#include "jit/JitAllocPolicy.h"
#include "js/TypeDecls.h"
namespace js {
namespace jit {
// The compiler at various points needs to be able to store references to the
// current inline path (the sequence of scripts and call-pcs that lead to the
// current function being inlined).
//
// To support this, use a tree that records the inlinings done during
// compilation.
class InlineScriptTree {
// InlineScriptTree for the caller
InlineScriptTree* caller_;
// PC in the caller corresponding to this script.
jsbytecode* callerPc_;
// Script for this entry.
JSScript* script_;
// Child entries (linked together by nextCallee pointer)
InlineScriptTree* children_;
InlineScriptTree* nextCallee_;
public:
InlineScriptTree(InlineScriptTree* caller, jsbytecode* callerPc,
JSScript* script)
: caller_(caller),
callerPc_(callerPc),
script_(script),
children_(nullptr),
nextCallee_(nullptr) {}
static inline InlineScriptTree* New(TempAllocator* allocator,
InlineScriptTree* caller,
jsbytecode* callerPc, JSScript* script);
inline InlineScriptTree* addCallee(TempAllocator* allocator,
jsbytecode* callerPc,
JSScript* calleeScript);
inline void removeCallee(InlineScriptTree* callee);
InlineScriptTree* caller() const { return caller_; }
bool isOutermostCaller() const { return caller_ == nullptr; }
bool hasCaller() const { return caller_ != nullptr; }
InlineScriptTree* outermostCaller() {
if (isOutermostCaller()) {
return this;
}
return caller_->outermostCaller();
}
jsbytecode* callerPc() const { return callerPc_; }
JSScript* script() const { return script_; }
bool hasChildren() const { return children_ != nullptr; }
InlineScriptTree* firstChild() const {
MOZ_ASSERT(hasChildren());
return children_;
}
bool hasNextCallee() const { return nextCallee_ != nullptr; }
InlineScriptTree* nextCallee() const {
MOZ_ASSERT(hasNextCallee());
return nextCallee_;
}
unsigned depth() const {
if (isOutermostCaller()) {
return 1;
}
return 1 + caller_->depth();
}
};
class BytecodeSite : public TempObject {
// InlineScriptTree identifying innermost active function at site.
InlineScriptTree* tree_;
// Bytecode address within innermost active function.
jsbytecode* pc_;
public:
BytecodeSite() : tree_(nullptr), pc_(nullptr) {}
BytecodeSite(InlineScriptTree* tree, jsbytecode* pc) : tree_(tree), pc_(pc) {
MOZ_ASSERT(tree_ != nullptr);
MOZ_ASSERT(pc_ != nullptr);
}
InlineScriptTree* tree() const { return tree_; }
jsbytecode* pc() const { return pc_; }
JSScript* script() const { return tree_ ? tree_->script() : nullptr; }
};
} // namespace jit
} // namespace js
#endif /* jit_InlineScriptTree_h */
|
