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
|
/*
* Copyright (C) 2017 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 "AirLowerStackArgs.h"
#if ENABLE(B3_JIT)
#include "AirCode.h"
#include "AirInsertionSet.h"
#include "AirInstInlines.h"
#include "AirPhaseScope.h"
namespace JSC { namespace B3 { namespace Air {
void lowerStackArgs(Code& code)
{
PhaseScope phaseScope(code, "lowerStackArgs"_s);
// Now we need to deduce how much argument area we need.
for (BasicBlock* block : code) {
for (Inst& inst : *block) {
for (Arg& arg : inst.args) {
if (arg.isCallArg()) {
ASSERT(arg.offset() >= 0);
// We always check the conservative register bytes for Bank::FP because
// CallArgs do not store which bank they are.
code.requestCallArgAreaSizeInBytes(arg.offset() + (code.usesSIMD() ? conservativeRegisterBytes(Bank::FP) : conservativeRegisterBytesWithoutVectors(Bank::FP)));
}
}
}
}
code.setFrameSize(code.frameSize() + code.callArgAreaSizeInBytes());
// Finally, transform the code to use Addr's instead of StackSlot's. This is a lossless
// transformation since we can search the StackSlots array to figure out which StackSlot any
// offset-from-FP refers to.
InsertionSet insertionSet(code);
for (BasicBlock* block : code) {
// FIXME We can keep track of the last large offset which was materialized in this block, and reuse the register
// if it hasn't been clobbered instead of renetating imm+add+addr every time. https://bugs.webkit.org/show_bug.cgi?id=171387
for (unsigned instIndex = 0; instIndex < block->size(); ++instIndex) {
Inst& inst = block->at(instIndex);
bool extendedOffsetAddrRegInUse = false;
auto stackAddr = [&] (unsigned insertionIndex, Arg arg, Width width, Value::OffsetType offsetFromFP) -> Arg {
int32_t offsetFromSP = offsetFromFP + code.frameSize();
if (inst.admitsExtendedOffsetAddr(arg)) {
// Stackmaps and patchpoints expect addr inputs relative to SP or FP only. We might as well
// not even bother generating an addr with valid form for these opcodes since extended offset
// addr is always valid.
return Arg::extendedOffsetAddr(offsetFromFP);
}
Arg result = Arg::addr(Air::Tmp(GPRInfo::callFrameRegister), offsetFromFP);
if (result.isValidForm(Move, width))
return result;
result = Arg::addr(Air::Tmp(MacroAssembler::stackPointerRegister), offsetFromSP);
if (result.isValidForm(Move, width))
return result;
if (inst.kind.opcode == Patch)
return Arg::extendedOffsetAddr(offsetFromFP);
#if CPU(ARM64) || CPU(RISCV64)
RELEASE_ASSERT(!extendedOffsetAddrRegInUse);
Air::Tmp tmp = Air::Tmp(extendedOffsetAddrRegister());
extendedOffsetAddrRegInUse = true;
Arg largeOffset = Arg::isValidImmForm(offsetFromSP) ? Arg::imm(offsetFromSP) : Arg::bigImm(offsetFromSP);
insertionSet.insert(insertionIndex, Move, inst.origin, largeOffset, tmp);
insertionSet.insert(insertionIndex, Add64, inst.origin, Air::Tmp(MacroAssembler::stackPointerRegister), tmp);
result = Arg::addr(tmp, 0);
return result;
#elif CPU(ARM)
// We solve this in AirAllocateRegistersAndStackAndGenerateCode.cpp.
UNUSED_PARAM(insertionIndex);
return result;
#elif CPU(X86_64)
UNUSED_PARAM(insertionIndex);
// Can't happen on x86: immediates are always big enough for frame size.
RELEASE_ASSERT_NOT_REACHED();
#else
#error Unhandled architecture.
#endif
};
auto isMove = [] (Inst& inst) -> std::optional<Width> {
switch (inst.kind.opcode) {
case Move:
return pointerWidth();
case Move32:
case MoveFloat:
return Width32;
case MoveDouble:
return Width64;
case MoveVector:
return Width128;
default:
return std::nullopt;
}
};
if (isARM64() && (inst.kind.opcode == Lea32 || inst.kind.opcode == Lea64)) {
// On ARM64, Lea is just an add. We can't handle this below because
// taking into account the Width to see if we can compute the immediate
// is wrong.
auto lowerArmLea = [&] (Value::OffsetType offset, Tmp base) {
ASSERT(inst.args[1].isTmp());
if (Arg::isValidImmForm(offset))
inst = Inst(inst.kind.opcode == Lea32 ? Add32 : Add64, inst.origin, Arg::imm(offset), base, inst.args[1]);
else {
Air::Tmp tmp = Air::Tmp(extendedOffsetAddrRegister());
Arg offsetArg = Arg::bigImm(offset);
insertionSet.insert(instIndex, Move, inst.origin, offsetArg, tmp);
inst = Inst(inst.kind.opcode == Lea32 ? Add32 : Add64, inst.origin, tmp, base, inst.args[1]);
}
};
switch (inst.args[0].kind()) {
case Arg::Stack: {
StackSlot* slot = inst.args[0].stackSlot();
lowerArmLea(inst.args[0].offset() + slot->offsetFromFP(), Tmp(GPRInfo::callFrameRegister));
break;
}
case Arg::CallArg:
lowerArmLea(inst.args[0].offset() - code.frameSize(), Tmp(GPRInfo::callFrameRegister));
break;
case Arg::Addr:
lowerArmLea(inst.args[0].offset(), inst.args[0].base());
break;
case Arg::ExtendedOffsetAddr:
ASSERT_NOT_REACHED();
break;
default:
break;
}
continue;
}
// Moves between stack spills may require using the extendedOffsetReg for both the src and dst addresses.
// In that case, split the move into separate load and store instructions so that the extendedOffsetReg can
// be used for each address, one at a time.
std::optional<Width> moveWidth = isMove(inst);
if (isARM64() && moveWidth && inst.args.size() == 3 && inst.args[0].isStack()) {
Arg& src = inst.args[0];
src = stackAddr(instIndex, src, *moveWidth, src.offset() + src.stackSlot()->offsetFromFP());
if (extendedOffsetAddrRegInUse) {
Arg scratch = inst.args[2];
ASSERT(scratch.isReg());
// Insert Mov src, scratchReg
insertionSet.insert(instIndex, inst.kind.opcode, inst.origin, src, scratch);
extendedOffsetAddrRegInUse = false; // Used by the inserted instruction; no longer needed.
// Modify inst to be 'Move scratch, dest'.
src = scratch;
inst.args.resize(2);
}
// Fall through to handle remainder of the original or modified inst, including potential ZDef handling.
}
inst.forEachArg(
[&] (Arg& arg, Arg::Role role, Bank, Width width) {
switch (arg.kind()) {
case Arg::Stack: {
StackSlot* slot = arg.stackSlot();
if (inst.kind.opcode == Move && slot->kind() == StackSlotKind::Spill)
inst.kind.spill = true;
if (Arg::isZDef(role)
&& slot->kind() == StackSlotKind::Spill
&& slot->byteSize() > bytesForWidth(width)) {
// Currently we only handle this simple case because it's the only one
// that arises: ZDef's are only 32-bit right now. So, when we hit these
// assertions it means that we need to implement those other kinds of
// zero fills.
RELEASE_ASSERT(slot->byteSize() == 8);
RELEASE_ASSERT(width == Width32);
#if CPU(ARM64) || CPU(RISCV64)
Air::Opcode storeOpcode = Move32;
Air::Arg::Kind operandKind = Arg::ZeroReg;
Air::Arg operand = Arg::zeroReg();
#elif CPU(X86_64) || CPU(ARM)
Air::Opcode storeOpcode = Move32;
Air::Arg::Kind operandKind = Arg::Imm;
Air::Arg operand = Arg::imm(0);
#else
#error Unhandled architecture.
#endif
RELEASE_ASSERT(isValidForm(storeOpcode, operandKind, Arg::Stack));
insertionSet.insert(
instIndex + 1, storeOpcode, inst.origin, operand,
stackAddr(instIndex + 1, arg, width, arg.offset() + 4 + slot->offsetFromFP()));
extendedOffsetAddrRegInUse = false;
}
arg = stackAddr(instIndex, arg, width, arg.offset() + slot->offsetFromFP());
break;
}
case Arg::CallArg:
arg = stackAddr(instIndex, arg, width, arg.offset() - code.frameSize());
break;
default:
break;
}
}
);
}
insertionSet.execute(block);
}
}
} } } // namespace JSC::B3::Air
#endif // ENABLE(B3_JIT)
|