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
206
207
208
209
210
211
212
213
214
215
216
217
|
/*
* Copyright (C) 2012 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.
*/
#ifndef DFGRegisterSet_h
#define DFGRegisterSet_h
#include <wtf/Platform.h>
#if ENABLE(DFG_JIT)
#include "DFGFPRInfo.h"
#include "DFGGPRInfo.h"
#include <wtf/Bitmap.h>
namespace JSC { namespace DFG {
static const unsigned totalNumberOfRegisters =
GPRInfo::numberOfRegisters + FPRInfo::numberOfRegisters;
static const unsigned numberOfBytesInRegisterSet =
(totalNumberOfRegisters + 7) >> 3;
typedef uint8_t RegisterSetPOD[numberOfBytesInRegisterSet];
class RegisterSet {
public:
RegisterSet()
{
for (unsigned i = numberOfBytesInRegisterSet; i--;)
m_set[i] = 0;
}
RegisterSet(const RegisterSetPOD& other)
{
for (unsigned i = numberOfBytesInRegisterSet; i--;)
m_set[i] = other[i];
}
const RegisterSetPOD& asPOD() const { return m_set; }
void copyInfo(RegisterSetPOD& other) const
{
for (unsigned i = numberOfBytesInRegisterSet; i--;)
other[i] = m_set[i];
}
void set(GPRReg reg)
{
setBit(GPRInfo::toIndex(reg));
}
void setGPRByIndex(unsigned index)
{
ASSERT(index < GPRInfo::numberOfRegisters);
setBit(index);
}
void clear(GPRReg reg)
{
clearBit(GPRInfo::toIndex(reg));
}
bool get(GPRReg reg) const
{
return getBit(GPRInfo::toIndex(reg));
}
bool getGPRByIndex(unsigned index) const
{
ASSERT(index < GPRInfo::numberOfRegisters);
return getBit(index);
}
// Return the index'th free GPR.
GPRReg getFreeGPR(unsigned index = 0) const
{
for (unsigned i = GPRInfo::numberOfRegisters; i--;) {
if (!getGPRByIndex(i) && !index--)
return GPRInfo::toRegister(i);
}
return InvalidGPRReg;
}
void set(FPRReg reg)
{
setBit(GPRInfo::numberOfRegisters + FPRInfo::toIndex(reg));
}
void setFPRByIndex(unsigned index)
{
ASSERT(index < FPRInfo::numberOfRegisters);
setBit(GPRInfo::numberOfRegisters + index);
}
void clear(FPRReg reg)
{
clearBit(GPRInfo::numberOfRegisters + FPRInfo::toIndex(reg));
}
bool get(FPRReg reg) const
{
return getBit(GPRInfo::numberOfRegisters + FPRInfo::toIndex(reg));
}
bool getFPRByIndex(unsigned index) const
{
ASSERT(index < FPRInfo::numberOfRegisters);
return getBit(GPRInfo::numberOfRegisters + index);
}
template<typename BankInfo>
void setByIndex(unsigned index)
{
set(BankInfo::toRegister(index));
}
template<typename BankInfo>
bool getByIndex(unsigned index)
{
return get(BankInfo::toRegister(index));
}
unsigned numberOfSetGPRs() const
{
unsigned result = 0;
for (unsigned i = GPRInfo::numberOfRegisters; i--;) {
if (!getBit(i))
continue;
result++;
}
return result;
}
unsigned numberOfSetFPRs() const
{
unsigned result = 0;
for (unsigned i = FPRInfo::numberOfRegisters; i--;) {
if (!getBit(GPRInfo::numberOfRegisters + i))
continue;
result++;
}
return result;
}
unsigned numberOfSetRegisters() const
{
unsigned result = 0;
for (unsigned i = totalNumberOfRegisters; i--;) {
if (!getBit(i))
continue;
result++;
}
return result;
}
private:
void setBit(unsigned i)
{
ASSERT(i < totalNumberOfRegisters);
m_set[i >> 3] |= (1 << (i & 7));
}
void clearBit(unsigned i)
{
ASSERT(i < totalNumberOfRegisters);
m_set[i >> 3] &= ~(1 << (i & 7));
}
bool getBit(unsigned i) const
{
ASSERT(i < totalNumberOfRegisters);
return !!(m_set[i >> 3] & (1 << (i & 7)));
}
RegisterSetPOD m_set;
};
} } // namespace JSC::DFG
#else // ENABLE(DFG_JIT) -> so if DFG is disabled
namespace JSC { namespace DFG {
// Define RegisterSetPOD to something that is a POD, but is otherwise useless,
// to make it easier to refer to this type in code that may be compiled when
// the DFG is disabled.
struct RegisterSetPOD { };
} } // namespace JSC::DFG
#endif // ENABLE(DFG_JIT)
#endif // DFGRegisterSet_h
|
