FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
WebKit/Source/JavaScriptCore/ftl/FTLLocation.h at main · WebKit/WebKit · GitHub
Uh oh!
There was an error while loading.
Please reload this page
.
WebKit
/
WebKit
Public
Notifications
You must be signed in to change notification settings
Fork
2.1k
Star
10.1k
Code
Pull requests
2.6k
Actions
Wiki
Security and quality
0
Insights
Additional navigation options
Code
Pull requests
Actions
Wiki
Security and quality
Insights
Expand file tree
Breadcrumbs
WebKit
/
Source
/
JavaScriptCore
/
ftl
/
FTLLocation.h
Copy path
More file actions
More file actions
Latest commit
History
History
History
205 lines (165 loc) · 5.88 KB
Breadcrumbs
WebKit
/
Source
/
JavaScriptCore
/
ftl
/
FTLLocation.h
Copy path
File metadata and controls
205 lines (165 loc) · 5.88 KB
Raw
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
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
192
193
194
195
196
197
198
199
200
201
202
203
204
205
/*
* Copyright (C) 2013-2019 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.
*/
#
pragma
once
#
include
<
wtf/Platform.h
>
#
if
ENABLE(FTL_JIT)
#
include
<
JavaScriptCore/DFGCommon.h
>
#
include
<
JavaScriptCore/FPRInfo.h
>
#
include
<
JavaScriptCore/GPRInfo.h
>
#
include
<
JavaScriptCore/Reg.h
>
#
include
<
wtf/HashMap.h
>
namespace
JSC
{
namespace
B3
{
class
ValueRep
;
}
//
namespace B3
namespace
FTL
{
class
Location
{
public:
enum
Kind {
Unprocessed,
Register,
Indirect,
Constant
};
Location
()
: m_kind(Unprocessed)
{
u.
constant
=
0
;
}
Location
(
WTF
::HashTableDeletedValueType)
: m_kind(Unprocessed)
{
u.
constant
=
1
;
}
static
Location
forRegister
(Reg reg,
int32_t
addend)
{
Location result;
result.
m_kind
= Register;
result.
u
.
variable
.
regIndex
= reg.
index
();
result.
u
.
variable
.
offset
= addend;
return
result;
}
static
Location
forIndirect
(Reg reg,
int32_t
offset)
{
Location result;
result.
m_kind
= Indirect;
result.
u
.
variable
.
regIndex
= reg.
index
();
result.
u
.
variable
.
offset
= offset;
return
result;
}
static
Location
forConstant
(
int64_t
constant)
{
Location result;
result.
m_kind
= Constant;
result.
u
.
constant
= constant;
return
result;
}
static
Location
NODELETE
forValueRep
(
const
B3
::ValueRep&);
Kind
kind
()
const
{
return
m_kind; }
bool
hasReg
()
const
{
return
kind
() == Register ||
kind
() == Indirect; }
Reg
reg
()
const
{
ASSERT
(
hasReg
());
return
Reg::fromIndex
(u.
variable
.
regIndex
);
}
bool
hasOffset
()
const
{
return
kind
() == Indirect; }
int32_t
offset
()
const
{
ASSERT
(
hasOffset
());
return
u.
variable
.
offset
;
}
bool
hasAddend
()
const
{
return
kind
() == Register; }
int32_t
addend
()
const
{
ASSERT
(
hasAddend
());
return
u.
variable
.
offset
;
}
bool
hasConstant
()
const
{
return
kind
() == Constant; }
int64_t
constant
()
const
{
ASSERT
(
hasConstant
());
return
u.
constant
;
}
explicit
operator
bool
()
const
{
return
kind
() != Unprocessed || u.
variable
.
offset
; }
bool
operator
!()
const
{
return
!
static_cast
<
bool
>(*
this
); }
bool
isHashTableDeletedValue
()
const
{
return
kind
() == Unprocessed && u.
variable
.
offset
; }
static
constexpr
bool
safeToCompareToHashTableEmptyOrDeletedValue =
true
;
bool
operator
==(
const
Location& other)
const
{
return
m_kind == other.
m_kind
&& u.
constant
== other.
u
.
constant
;
}
unsigned
hash
()
const
{
unsigned
result = m_kind;
switch
(
kind
()) {
case
Unprocessed:
result ^= u.
variable
.
offset
;
break
;
case
Register:
result ^= u.
variable
.
regIndex
;
break
;
case
Indirect:
result ^= u.
variable
.
regIndex
;
result ^= u.
variable
.
offset
;
break
;
case
Constant:
result ^=
WTF
::IntHash<
int64_t
>::
hash
(u.
constant
);
break
;
}
return
WTF
::IntHash<
unsigned
>::
hash
(result);
}
void
dump
(PrintStream&)
const
;
bool
NODELETE
isGPR
()
const
;
bool
NODELETE
involvesGPR
()
const
;
GPRReg
NODELETE
gpr
()
const
;
GPRReg
NODELETE
directGPR
()
const
;
//
Get the GPR and assert that there is no addend.
bool
NODELETE
isFPR
()
const
;
FPRReg
NODELETE
fpr
()
const
;
//
Assuming that all registers are saved to the savedRegisters buffer according
//
to FTLSaveRestore convention, this loads the value into the given register.
//
The code that this generates isn't exactly super fast. This assumes that FP
//
and SP contain the same values that they would have contained in the original
//
frame, or that you've done one or more canonically formed calls (i.e. can
//
restore the FP by following the call frame linked list numFramesToPop times,
//
and SP can be recovered by popping FP numFramesToPop-1 times and adding 16).
void
restoreInto
(MacroAssembler&,
char
* savedRegisters, GPRReg result,
unsigned
numFramesToPop =
0
)
const
;
private:
Kind m_kind;
union
{
int64_t
constant;
struct
{
unsigned
regIndex;
int32_t
offset;
} variable;
} u;
};
} }
//
namespace JSC::FTL
namespace
WTF
{
void
printInternal
(PrintStream&,
JSC
::
FTL
::Location::Kind);
template
<
typename
T>
struct
HashTraits
;
template
<>
struct
HashTraits
<
JSC
::
FTL
::Location> : SimpleClassHashTraits<
JSC
::
FTL
::Location> { };
}
//
namespace WTF
#
endif
//
ENABLE(FTL_JIT)
Back
|
FazBrowse Home
|
New Git URL