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 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266
|
/*
* Copyright (C) 2014-2021 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 "ScratchRegisterAllocator.h"
#if ENABLE(JIT)
#include "AssemblyHelpersSpoolers.h"
#include "MaxFrameExtentForSlowPathCall.h"
#include "VM.h"
namespace JSC {
ScratchRegisterAllocator::ScratchRegisterAllocator(const RegisterSet& usedRegisters)
: m_usedRegisters(usedRegisters)
, m_numberOfReusedRegisters(0)
{
}
ScratchRegisterAllocator::~ScratchRegisterAllocator() = default;
void ScratchRegisterAllocator::lock(GPRReg reg)
{
if (reg == InvalidGPRReg)
return;
ASSERT(Reg::fromIndex(reg).isGPR());
m_lockedRegisters.add(reg, IgnoreVectors);
}
void ScratchRegisterAllocator::lock(FPRReg reg)
{
if (reg == InvalidFPRReg)
return;
ASSERT(Reg::fromIndex(reg).isFPR());
m_lockedRegisters.add(reg, IgnoreVectors);
}
void ScratchRegisterAllocator::lock(JSValueRegs regs)
{
lock(regs.tagGPR());
lock(regs.payloadGPR());
}
template<typename BankInfo>
typename BankInfo::RegisterType ScratchRegisterAllocator::allocateScratch()
{
// First try to allocate a register that is totally free.
for (unsigned i = 0; i < BankInfo::numberOfRegisters; ++i) {
auto reg = BankInfo::toRegister(i);
if (!m_lockedRegisters.contains(reg, IgnoreVectors)
&& !m_usedRegisters.contains(reg, IgnoreVectors)
&& !m_scratchRegisters.contains(reg, IgnoreVectors)) {
m_scratchRegisters.add(reg, IgnoreVectors);
return reg;
}
}
// Since that failed, try to allocate a register that is not yet
// locked or used for scratch.
for (unsigned i = 0; i < BankInfo::numberOfRegisters; ++i) {
auto reg = BankInfo::toRegister(i);
if (!m_lockedRegisters.contains(reg, IgnoreVectors) && !m_scratchRegisters.contains(reg, IgnoreVectors)) {
m_scratchRegisters.add(reg, IgnoreVectors);
m_numberOfReusedRegisters++;
return reg;
}
}
// We failed.
CRASH();
// Make some silly compilers happy.
return static_cast<typename BankInfo::RegisterType>(-1);
}
GPRReg ScratchRegisterAllocator::allocateScratchGPR() { return allocateScratch<GPRInfo>(); }
FPRReg ScratchRegisterAllocator::allocateScratchFPR() { return allocateScratch<FPRInfo>(); }
ScratchRegisterAllocator::PreservedState ScratchRegisterAllocator::preserveReusedRegistersByPushing(AssemblyHelpers& jit, ExtraStackSpace extraStackSpace)
{
if (!didReuseRegisters())
return PreservedState(0, extraStackSpace);
JIT_COMMENT(jit, "preserveReusedRegistersByPushing");
RegisterSet registersToSpill;
for (unsigned i = 0; i < FPRInfo::numberOfRegisters; ++i) {
FPRReg reg = FPRInfo::toRegister(i);
ASSERT(reg != InvalidFPRReg);
if (m_scratchRegisters.contains(reg, IgnoreVectors) && m_usedRegisters.contains(reg, conservativeWidth(reg)))
registersToSpill.add(reg, conservativeWidth(reg));
else if (m_scratchRegisters.contains(reg, IgnoreVectors) && m_usedRegisters.contains(reg, IgnoreVectors))
registersToSpill.add(reg, IgnoreVectors);
}
for (unsigned i = 0; i < GPRInfo::numberOfRegisters; ++i) {
GPRReg reg = GPRInfo::toRegister(i);
ASSERT(reg != InvalidGPRReg);
if (m_scratchRegisters.contains(reg, IgnoreVectors) && m_usedRegisters.contains(reg, IgnoreVectors))
registersToSpill.add(reg, IgnoreVectors);
}
unsigned extraStackBytesAtTopOfStack = extraStackSpace == ExtraStackSpace::SpaceForCCall ? maxFrameExtentForSlowPathCall : 0;
unsigned stackAdjustmentSize = ScratchRegisterAllocator::preserveRegistersToStackForCall(jit, registersToSpill, extraStackBytesAtTopOfStack);
return PreservedState(stackAdjustmentSize, extraStackSpace);
}
void ScratchRegisterAllocator::restoreReusedRegistersByPopping(AssemblyHelpers& jit, const ScratchRegisterAllocator::PreservedState& preservedState)
{
RELEASE_ASSERT(preservedState);
if (!didReuseRegisters())
return;
JIT_COMMENT(jit, "restoreReusedRegistersByPopping");
RegisterSet registersToFill;
for (unsigned i = GPRInfo::numberOfRegisters; i--;) {
GPRReg reg = GPRInfo::toRegister(i);
ASSERT(reg != InvalidGPRReg);
if (m_scratchRegisters.contains(reg, IgnoreVectors) && m_usedRegisters.contains(reg, conservativeWidth(reg)))
registersToFill.add(reg, conservativeWidth(reg));
else if (m_scratchRegisters.contains(reg, IgnoreVectors) && m_usedRegisters.contains(reg, IgnoreVectors))
registersToFill.add(reg, IgnoreVectors);
}
for (unsigned i = FPRInfo::numberOfRegisters; i--;) {
FPRReg reg = FPRInfo::toRegister(i);
ASSERT(reg != InvalidFPRReg);
if (m_scratchRegisters.contains(reg, IgnoreVectors) && m_usedRegisters.contains(reg, IgnoreVectors))
registersToFill.add(reg, IgnoreVectors);
}
unsigned extraStackBytesAtTopOfStack =
preservedState.extraStackSpaceRequirement == ExtraStackSpace::SpaceForCCall ? maxFrameExtentForSlowPathCall : 0;
ScratchRegisterAllocator::restoreRegistersFromStackForCall(jit, registersToFill, { },
preservedState.numberOfBytesPreserved, extraStackBytesAtTopOfStack);
}
unsigned ScratchRegisterAllocator::preserveRegistersToStackForCall(AssemblyHelpers& jit, const RegisterSet& usedRegisters, unsigned extraBytesAtTopOfStack)
{
RELEASE_ASSERT(extraBytesAtTopOfStack % sizeof(void*) == 0);
if (!usedRegisters.numberOfSetRegisters())
return 0;
ASSERT(!usedRegisters.hasAnyWideRegisters() || Options::useWasmSIMD());
JIT_COMMENT(jit, "Preserve registers to stack for call: ", usedRegisters, "; Extra bytes at top of stack: ", extraBytesAtTopOfStack);
unsigned byteSizeOfSetRegisters = usedRegisters.byteSizeOfSetRegisters();
unsigned stackOffset = byteSizeOfSetRegisters;
stackOffset += extraBytesAtTopOfStack;
stackOffset = WTF::roundUpToMultipleOf<stackAlignmentBytes()>(stackOffset);
jit.subPtr(
MacroAssembler::TrustedImm32(stackOffset),
MacroAssembler::stackPointerRegister);
AssemblyHelpers::StoreRegSpooler spooler(jit, MacroAssembler::stackPointerRegister);
unsigned offset = 0;
for (GPRReg reg = MacroAssembler::firstRegister(); reg <= MacroAssembler::lastRegister(); reg = MacroAssembler::nextRegister(reg)) {
if (usedRegisters.contains(reg, IgnoreVectors)) {
spooler.storeGPR({ reg, static_cast<ptrdiff_t>(extraBytesAtTopOfStack + offset), conservativeWidthWithoutVectors(reg) });
offset += conservativeRegisterBytesWithoutVectors(reg);
}
}
#if !CPU(REGISTER64)
if (byteSizeOfSetRegisters > offset)
offset = WTF::roundUpToMultipleOf<2*bytesForWidth(pointerWidth())>(offset);
#endif
spooler.finalizeGPR();
for (FPRReg reg = MacroAssembler::firstFPRegister(); reg <= MacroAssembler::lastFPRegister(); reg = MacroAssembler::nextFPRegister(reg)) {
if (conservativeWidth(reg) == Width128 && usedRegisters.contains(reg, conservativeWidth(reg))) {
spooler.storeVector({ reg, static_cast<ptrdiff_t>(extraBytesAtTopOfStack + offset), conservativeWidth(reg) });
offset += conservativeRegisterBytes(reg);
} else if (usedRegisters.contains(reg, IgnoreVectors)) {
spooler.storeFPR({ reg, static_cast<ptrdiff_t>(extraBytesAtTopOfStack + offset), conservativeWidthWithoutVectors(reg) });
offset += conservativeRegisterBytesWithoutVectors(reg);
}
}
spooler.finalizeFPR();
ASSERT(offset == byteSizeOfSetRegisters);
return stackOffset;
}
void ScratchRegisterAllocator::restoreRegistersFromStackForCall(AssemblyHelpers& jit, const RegisterSet& usedRegisters, const RegisterSet& ignore, unsigned numberOfStackBytesUsedForRegisterPreservation, unsigned extraBytesAtTopOfStack)
{
RELEASE_ASSERT(extraBytesAtTopOfStack % sizeof(void*) == 0);
if (!usedRegisters.numberOfSetRegisters()) {
RELEASE_ASSERT(numberOfStackBytesUsedForRegisterPreservation == 0);
return;
}
ASSERT(!usedRegisters.hasAnyWideRegisters() || Options::useWasmSIMD());
JIT_COMMENT(jit, "Restore registers from stack for call: ", usedRegisters, "; Extra bytes at top of stack: ", extraBytesAtTopOfStack);
AssemblyHelpers::LoadRegSpooler spooler(jit, MacroAssembler::stackPointerRegister);
unsigned byteSizeOfSetRegisters = usedRegisters.byteSizeOfSetRegisters();
unsigned offset = 0;
for (GPRReg reg = MacroAssembler::firstRegister(); reg <= MacroAssembler::lastRegister(); reg = MacroAssembler::nextRegister(reg)) {
if (usedRegisters.contains(reg, IgnoreVectors)) {
if (!ignore.contains(reg, IgnoreVectors))
spooler.loadGPR({ reg, static_cast<ptrdiff_t>(extraBytesAtTopOfStack + offset), conservativeWidthWithoutVectors(reg) });
offset += conservativeRegisterBytesWithoutVectors(reg);
}
}
#if !CPU(REGISTER64)
if (byteSizeOfSetRegisters > offset)
offset = WTF::roundUpToMultipleOf<2*bytesForWidth(pointerWidth())>(offset);
#endif
spooler.finalizeGPR();
for (FPRReg reg = MacroAssembler::firstFPRegister(); reg <= MacroAssembler::lastFPRegister(); reg = MacroAssembler::nextFPRegister(reg)) {
if (usedRegisters.contains(reg, IgnoreVectors)) {
// You should never have to ignore only part of a register.
ASSERT(ignore.contains(reg, IgnoreVectors) == ignore.contains(reg, Width128));
if (conservativeWidth(reg) == Width128 && usedRegisters.contains(reg, conservativeWidth(reg))) {
if (!ignore.contains(reg, IgnoreVectors))
spooler.loadVector({ reg, static_cast<ptrdiff_t>(extraBytesAtTopOfStack + offset), conservativeWidth(reg) });
offset += conservativeRegisterBytes(reg);
} else if (usedRegisters.contains(reg, IgnoreVectors)) {
if (!ignore.contains(reg, IgnoreVectors))
spooler.loadFPR({ reg, static_cast<ptrdiff_t>(extraBytesAtTopOfStack + offset), conservativeWidthWithoutVectors(reg) });
offset += conservativeRegisterBytesWithoutVectors(reg);
}
}
}
spooler.finalizeFPR();
unsigned stackOffset = byteSizeOfSetRegisters;
stackOffset += extraBytesAtTopOfStack;
stackOffset = WTF::roundUpToMultipleOf<stackAlignmentBytes()>(stackOffset);
ASSERT(offset == byteSizeOfSetRegisters);
RELEASE_ASSERT(stackOffset == numberOfStackBytesUsedForRegisterPreservation);
jit.addPtr(
MacroAssembler::TrustedImm32(stackOffset),
MacroAssembler::stackPointerRegister);
}
} // namespace JSC
#endif // ENABLE(JIT)
|