Repository navigation
Expand file tree
/
Copy pathFTLJITCode.cpp
More file actions
191 lines (159 loc) · 5.41 KB
/
Copy pathFTLJITCode.cpp
File metadata and controls
191 lines (159 loc) · 5.41 KB
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
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
/*
* Copyright (C) 2013-2022 Apple Inc. 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 APPLE INC. ``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 APPLE INC. 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.
*/
#include "config.h"
#include "FTLJITCode.h"
#if ENABLE(FTL_JIT)
#include "FTLState.h"
#include "JSCJSValueInlines.h"
#include "JSCPtrTag.h"
#include "TrackedReferences.h"
WTF_ALLOW_UNSAFE_BUFFER_USAGE_BEGIN
namespace JSC { namespace FTL {
using namespace B3;
JITCode::JITCode()
: JSC::JITCode(JITType::FTLJIT)
, common(/* isUnlinked */ false)
{
}
JITCode::~JITCode()
{
if (FTL::shouldDumpDisassembly()) {
if (m_b3Code)
dataLogLn("Destroying FTL JIT code at ", m_b3Code);
}
}
void JITCode::initializeB3Code(CodeRef<JSEntryPtrTag> b3Code)
{
m_b3Code = b3Code;
}
void JITCode::initializeB3Byproducts(std::unique_ptr<OpaqueByproducts> byproducts)
{
m_b3Byproducts = WTF::move(byproducts);
}
void JITCode::initializeAddressForCall(CodePtr<JSEntryPtrTag> address)
{
m_addressForCall = address;
}
void JITCode::initializeAddressForArityCheck(CodePtr<JSEntryPtrTag> entrypoint)
{
m_addressForArityCheck = entrypoint;
}
CodePtr<JSEntryPtrTag> JITCode::addressForCall(ArityCheckMode arityCheck)
{
switch (arityCheck) {
case ArityCheckMode::ArityCheckNotRequired:
return m_addressForCall;
case ArityCheckMode::MustCheckArity:
return m_addressForArityCheck;
}
RELEASE_ASSERT_NOT_REACHED();
return CodePtr<JSEntryPtrTag>();
}
void* JITCode::executableAddressAtOffset(size_t offset)
{
if (!offset)
return m_addressForCall.taggedPtr();
char* executableAddress = m_addressForCall.untaggedPtr<char*>();
return tagCodePtr<JSEntryPtrTag>(executableAddress + offset);
}
void* JITCode::dataAddressAtOffset(size_t)
{
// We can't patch FTL code, yet. Even if we did, it's not clear that we would do so
// through this API.
RELEASE_ASSERT_NOT_REACHED();
return nullptr;
}
unsigned JITCode::offsetOf(void*)
{
// We currently don't have visibility into the FTL code.
RELEASE_ASSERT_NOT_REACHED();
return 0;
}
size_t JITCode::size()
{
// We don't know the size of FTL code, yet. Make a wild guess. This is mostly used for
// GC load estimates.
return m_size;
}
bool JITCode::contains(void*)
{
// We have no idea what addresses the FTL code contains, yet.
RELEASE_ASSERT_NOT_REACHED();
return false;
}
JITCode* JITCode::ftl()
{
return this;
}
DFG::CommonData* JITCode::dfgCommon()
{
return &common;
}
const DFG::CommonData* JITCode::dfgCommon() const
{
return &common;
}
void JITCode::shrinkToFit()
{
common.shrinkToFit();
osrExitDescriptors.shrinkToFit();
osrExitConstants.shrinkToFit();
lazySlowPaths.shrinkToFit();
}
void JITCode::validateReferences(const TrackedReferences& trackedReferences)
{
common.validateReferences(trackedReferences);
for (EncodedJSValue constant : osrExitConstants)
trackedReferences.check(JSValue::decode(constant));
for (OSRExitDescriptor& descriptor : osrExitDescriptors)
descriptor.validateReferences(trackedReferences);
}
RegisterSet JITCode::liveRegistersToPreserveAtExceptionHandlingCallSite(CodeBlock*, CallSiteIndex callSiteIndex)
{
for (const OSRExitStream::ExceptionHandlerExit& handler : m_osrExits.exceptionHandlerExits()) {
if (handler.callSiteIndex.bits() == callSiteIndex.bits())
return ValueRep::usedRegisters(/* isSIMDContext = */ false, m_osrExits.valueReps(handler.valueRepsOffset));
}
return { };
}
std::optional<CodeOrigin> JITCode::findPC(CodeBlock* codeBlock, void* pc)
{
for (const DFG::OSRExitStub& stub : m_osrExitStubs) {
if (ExecutableMemoryHandle* handle = stub.code.executableMemory()) {
if (handle->contains(pc))
return std::optional<CodeOrigin>(osrExit(stub.exitIndex).m_codeOriginForExitProfile);
}
}
for (std::unique_ptr<LazySlowPath>& lazySlowPath : lazySlowPaths) {
if (ExecutableMemoryHandle* handle = lazySlowPath->stub().executableMemory()) {
if (handle->contains(pc))
return std::optional<CodeOrigin>(codeBlock->codeOrigin(lazySlowPath->callSiteIndex()));
}
}
return std::nullopt;
}
} } // namespace JSC::FTL
WTF_ALLOW_UNSAFE_BUFFER_USAGE_END
#endif // ENABLE(FTL_JIT)