mirror of
https://github.com/hrydgard/ppsspp.git
synced 2025-04-02 11:01:50 -04:00
412 lines
13 KiB
C++
412 lines
13 KiB
C++
// Copyright (c) 2023- PPSSPP Project.
|
|
|
|
// This program is free software: you can redistribute it and/or modify
|
|
// it under the terms of the GNU General Public License as published by
|
|
// the Free Software Foundation, version 2.0 or later versions.
|
|
|
|
// This program is distributed in the hope that it will be useful,
|
|
// but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
// GNU General Public License 2.0 for more details.
|
|
|
|
// A copy of the GPL 2.0 should have been included with the program.
|
|
// If not, see http://www.gnu.org/licenses/
|
|
|
|
// Official git repository and contact information can be found at
|
|
// https://github.com/hrydgard/ppsspp and http://www.ppsspp.org/.
|
|
|
|
#include <cstddef>
|
|
#include "Core/MemMap.h"
|
|
#include "Core/MIPS/MIPSTables.h"
|
|
#include "Core/MIPS/RiscV/RiscVJit.h"
|
|
#include "Core/MIPS/RiscV/RiscVRegCache.h"
|
|
|
|
#include <algorithm>
|
|
// for std::min
|
|
|
|
namespace MIPSComp {
|
|
|
|
using namespace RiscVGen;
|
|
using namespace RiscVJitConstants;
|
|
|
|
// Needs space for a LI and J which might both be 32-bit offsets.
|
|
static constexpr int MIN_BLOCK_NORMAL_LEN = 16;
|
|
static constexpr int MIN_BLOCK_EXIT_LEN = 8;
|
|
|
|
RiscVJitBackend::RiscVJitBackend(JitOptions &jitopt, IRBlockCache &blocks)
|
|
: IRNativeBackend(blocks), jo(jitopt), regs_(&jo) {
|
|
// Automatically disable incompatible options.
|
|
if (((intptr_t)Memory::base & 0x00000000FFFFFFFFUL) != 0) {
|
|
jo.enablePointerify = false;
|
|
}
|
|
jo.optimizeForInterpreter = false;
|
|
|
|
// Since we store the offset, this is as big as it can be.
|
|
// We could shift off one bit to double it, would need to change RiscVAsm.
|
|
AllocCodeSpace(1024 * 1024 * 16);
|
|
SetAutoCompress(true);
|
|
|
|
regs_.Init(this);
|
|
}
|
|
|
|
RiscVJitBackend::~RiscVJitBackend() {
|
|
}
|
|
|
|
static void NoBlockExits() {
|
|
_assert_msg_(false, "Never exited block, invalid IR?");
|
|
}
|
|
|
|
bool RiscVJitBackend::CompileBlock(IRBlockCache *irBlockCache, int block_num, bool preload) {
|
|
if (GetSpaceLeft() < 0x800)
|
|
return false;
|
|
|
|
IRBlock *block = irBlockCache->GetBlock(block_num);
|
|
BeginWrite(std::min(GetSpaceLeft(), (size_t)block->GetNumIRInstructions() * 32));
|
|
|
|
u32 startPC = block->GetOriginalStart();
|
|
bool wroteCheckedOffset = false;
|
|
if (jo.enableBlocklink && !jo.useBackJump) {
|
|
SetBlockCheckedOffset(block_num, (int)GetOffset(GetCodePointer()));
|
|
wroteCheckedOffset = true;
|
|
|
|
WriteDebugPC(startPC);
|
|
|
|
FixupBranch normalEntry = BGE(DOWNCOUNTREG, R_ZERO);
|
|
LI(SCRATCH1, startPC);
|
|
QuickJ(R_RA, outerLoopPCInSCRATCH1_);
|
|
SetJumpTarget(normalEntry);
|
|
}
|
|
|
|
// Don't worry, the codespace isn't large enough to overflow offsets.
|
|
const u8 *blockStart = GetCodePointer();
|
|
block->SetNativeOffset((int)GetOffset(blockStart));
|
|
compilingBlockNum_ = block_num;
|
|
|
|
regs_.Start(irBlockCache, block_num);
|
|
|
|
std::vector<const u8 *> addresses;
|
|
const IRInst *instructions = irBlockCache->GetBlockInstructionPtr(*block);
|
|
for (int i = 0; i < block->GetNumIRInstructions(); ++i) {
|
|
const IRInst &inst = instructions[i];
|
|
regs_.SetIRIndex(i);
|
|
addresses.push_back(GetCodePtr());
|
|
|
|
CompileIRInst(inst);
|
|
|
|
if (jo.Disabled(JitDisable::REGALLOC_GPR) || jo.Disabled(JitDisable::REGALLOC_FPR))
|
|
regs_.FlushAll(jo.Disabled(JitDisable::REGALLOC_GPR), jo.Disabled(JitDisable::REGALLOC_FPR));
|
|
|
|
// Safety check, in case we get a bunch of really large jit ops without a lot of branching.
|
|
if (GetSpaceLeft() < 0x800) {
|
|
compilingBlockNum_ = -1;
|
|
return false;
|
|
}
|
|
}
|
|
|
|
// We should've written an exit above. If we didn't, bad things will happen.
|
|
// Only check if debug stats are enabled - needlessly wastes jit space.
|
|
if (DebugStatsEnabled()) {
|
|
QuickCallFunction(&NoBlockExits, SCRATCH2);
|
|
QuickJ(R_RA, hooks_.crashHandler);
|
|
}
|
|
|
|
int len = (int)GetOffset(GetCodePointer()) - block->GetNativeOffset();
|
|
if (len < MIN_BLOCK_NORMAL_LEN) {
|
|
// We need at least 16 bytes to invalidate blocks with, but larger doesn't need to align.
|
|
ReserveCodeSpace(MIN_BLOCK_NORMAL_LEN - len);
|
|
}
|
|
|
|
if (!wroteCheckedOffset) {
|
|
// Always record this, even if block link disabled - it's used for size calc.
|
|
SetBlockCheckedOffset(block_num, (int)GetOffset(GetCodePointer()));
|
|
}
|
|
|
|
if (jo.enableBlocklink && jo.useBackJump) {
|
|
WriteDebugPC(startPC);
|
|
|
|
// Most blocks shouldn't be >= 4KB, so usually we can just BGE.
|
|
if (BInRange(blockStart)) {
|
|
BGE(DOWNCOUNTREG, R_ZERO, blockStart);
|
|
} else {
|
|
FixupBranch skip = BLT(DOWNCOUNTREG, R_ZERO);
|
|
J(blockStart);
|
|
SetJumpTarget(skip);
|
|
}
|
|
LI(SCRATCH1, startPC);
|
|
QuickJ(R_RA, outerLoopPCInSCRATCH1_);
|
|
}
|
|
|
|
if (logBlocks_ > 0) {
|
|
--logBlocks_;
|
|
|
|
std::map<const u8 *, int> addressesLookup;
|
|
for (int i = 0; i < (int)addresses.size(); ++i)
|
|
addressesLookup[addresses[i]] = i;
|
|
|
|
INFO_LOG(Log::JIT, "=============== RISCV (%08x, %d bytes) ===============", startPC, len);
|
|
const IRInst *instructions = irBlockCache->GetBlockInstructionPtr(*block);
|
|
for (const u8 *p = blockStart; p < GetCodePointer(); ) {
|
|
auto it = addressesLookup.find(p);
|
|
if (it != addressesLookup.end()) {
|
|
const IRInst &inst = instructions[it->second];
|
|
|
|
char temp[512];
|
|
DisassembleIR(temp, sizeof(temp), inst);
|
|
INFO_LOG(Log::JIT, "IR: #%d %s", it->second, temp);
|
|
}
|
|
|
|
auto next = std::next(it);
|
|
const u8 *nextp = next == addressesLookup.end() ? GetCodePointer() : next->first;
|
|
|
|
#if PPSSPP_ARCH(RISCV64) || (PPSSPP_PLATFORM(WINDOWS) && !defined(__LIBRETRO__))
|
|
auto lines = DisassembleRV64(p, (int)(nextp - p));
|
|
for (const auto &line : lines)
|
|
INFO_LOG(Log::JIT, "RV: %s", line.c_str());
|
|
#endif
|
|
p = nextp;
|
|
}
|
|
}
|
|
|
|
EndWrite();
|
|
FlushIcache();
|
|
compilingBlockNum_ = -1;
|
|
|
|
return true;
|
|
}
|
|
|
|
void RiscVJitBackend::WriteConstExit(uint32_t pc) {
|
|
int block_num = blocks_.GetBlockNumberFromStartAddress(pc);
|
|
const IRNativeBlock *nativeBlock = GetNativeBlock(block_num);
|
|
|
|
int exitStart = (int)GetOffset(GetCodePointer());
|
|
if (block_num >= 0 && jo.enableBlocklink && nativeBlock && nativeBlock->checkedOffset != 0) {
|
|
QuickJ(SCRATCH1, GetBasePtr() + nativeBlock->checkedOffset);
|
|
} else {
|
|
LI(SCRATCH1, pc);
|
|
QuickJ(R_RA, dispatcherPCInSCRATCH1_);
|
|
}
|
|
|
|
if (jo.enableBlocklink) {
|
|
// In case of compression or early link, make sure it's large enough.
|
|
int len = (int)GetOffset(GetCodePointer()) - exitStart;
|
|
if (len < MIN_BLOCK_EXIT_LEN) {
|
|
ReserveCodeSpace(MIN_BLOCK_EXIT_LEN - len);
|
|
len = MIN_BLOCK_EXIT_LEN;
|
|
}
|
|
|
|
AddLinkableExit(compilingBlockNum_, pc, exitStart, len);
|
|
}
|
|
}
|
|
|
|
void RiscVJitBackend::OverwriteExit(int srcOffset, int len, int block_num) {
|
|
_dbg_assert_(len >= MIN_BLOCK_EXIT_LEN);
|
|
|
|
const IRNativeBlock *nativeBlock = GetNativeBlock(block_num);
|
|
if (nativeBlock) {
|
|
u8 *writable = GetWritablePtrFromCodePtr(GetBasePtr()) + srcOffset;
|
|
if (PlatformIsWXExclusive()) {
|
|
ProtectMemoryPages(writable, len, MEM_PROT_READ | MEM_PROT_WRITE);
|
|
}
|
|
|
|
RiscVEmitter emitter(GetBasePtr() + srcOffset, writable);
|
|
emitter.QuickJ(SCRATCH1, GetBasePtr() + nativeBlock->checkedOffset);
|
|
int bytesWritten = (int)(emitter.GetWritableCodePtr() - writable);
|
|
if (bytesWritten < len)
|
|
emitter.ReserveCodeSpace(len - bytesWritten);
|
|
emitter.FlushIcache();
|
|
|
|
if (PlatformIsWXExclusive()) {
|
|
ProtectMemoryPages(writable, 16, MEM_PROT_READ | MEM_PROT_EXEC);
|
|
}
|
|
}
|
|
}
|
|
|
|
void RiscVJitBackend::CompIR_Generic(IRInst inst) {
|
|
// If we got here, we're going the slow way.
|
|
uint64_t value;
|
|
memcpy(&value, &inst, sizeof(inst));
|
|
|
|
FlushAll();
|
|
LI(X10, value, SCRATCH2);
|
|
SaveStaticRegisters();
|
|
WriteDebugProfilerStatus(IRProfilerStatus::IR_INTERPRET);
|
|
QuickCallFunction(&DoIRInst, SCRATCH2);
|
|
WriteDebugProfilerStatus(IRProfilerStatus::IN_JIT);
|
|
LoadStaticRegisters();
|
|
|
|
// We only need to check the return value if it's a potential exit.
|
|
if ((GetIRMeta(inst.op)->flags & IRFLAG_EXIT) != 0) {
|
|
// Result in X10 aka SCRATCH1.
|
|
_assert_(X10 == SCRATCH1);
|
|
if (BInRange(dispatcherPCInSCRATCH1_)) {
|
|
BNE(X10, R_ZERO, dispatcherPCInSCRATCH1_);
|
|
} else {
|
|
FixupBranch skip = BEQ(X10, R_ZERO);
|
|
QuickJ(R_RA, dispatcherPCInSCRATCH1_);
|
|
SetJumpTarget(skip);
|
|
}
|
|
}
|
|
}
|
|
|
|
void RiscVJitBackend::CompIR_Interpret(IRInst inst) {
|
|
MIPSOpcode op(inst.constant);
|
|
|
|
// IR protects us against this being a branching instruction (well, hopefully.)
|
|
FlushAll();
|
|
SaveStaticRegisters();
|
|
WriteDebugProfilerStatus(IRProfilerStatus::INTERPRET);
|
|
if (DebugStatsEnabled()) {
|
|
LI(X10, MIPSGetName(op));
|
|
QuickCallFunction(&NotifyMIPSInterpret, SCRATCH2);
|
|
}
|
|
LI(X10, (int32_t)inst.constant);
|
|
QuickCallFunction((const u8 *)MIPSGetInterpretFunc(op), SCRATCH2);
|
|
WriteDebugProfilerStatus(IRProfilerStatus::IN_JIT);
|
|
LoadStaticRegisters();
|
|
}
|
|
|
|
void RiscVJitBackend::FlushAll() {
|
|
regs_.FlushAll();
|
|
}
|
|
|
|
bool RiscVJitBackend::DescribeCodePtr(const u8 *ptr, std::string &name) const {
|
|
// Used in disassembly viewer.
|
|
// Don't use spaces; profilers get confused or truncate them.
|
|
if (ptr == dispatcherPCInSCRATCH1_) {
|
|
name = "dispatcherPCInSCRATCH1";
|
|
} else if (ptr == outerLoopPCInSCRATCH1_) {
|
|
name = "outerLoopPCInSCRATCH1";
|
|
} else if (ptr == dispatcherNoCheck_) {
|
|
name = "dispatcherNoCheck";
|
|
} else if (ptr == saveStaticRegisters_) {
|
|
name = "saveStaticRegisters";
|
|
} else if (ptr == loadStaticRegisters_) {
|
|
name = "loadStaticRegisters";
|
|
} else if (ptr == applyRoundingMode_) {
|
|
name = "applyRoundingMode";
|
|
} else if (ptr >= GetBasePtr() && ptr < GetBasePtr() + jitStartOffset_) {
|
|
name = "fixedCode";
|
|
} else {
|
|
return IRNativeBackend::DescribeCodePtr(ptr, name);
|
|
}
|
|
return true;
|
|
}
|
|
|
|
void RiscVJitBackend::ClearAllBlocks() {
|
|
ClearCodeSpace(jitStartOffset_);
|
|
FlushIcacheSection(region + jitStartOffset_, region + region_size - jitStartOffset_);
|
|
EraseAllLinks(-1);
|
|
}
|
|
|
|
void RiscVJitBackend::InvalidateBlock(IRBlockCache *irBlockCache, int block_num) {
|
|
IRBlock *block = irBlockCache->GetBlock(block_num);
|
|
int offset = block->GetNativeOffset();
|
|
u8 *writable = GetWritablePtrFromCodePtr(GetBasePtr()) + offset;
|
|
|
|
// Overwrite the block with a jump to compile it again.
|
|
u32 pc = block->GetOriginalStart();
|
|
if (pc != 0) {
|
|
// Hopefully we always have at least 16 bytes, which should be all we need.
|
|
if (PlatformIsWXExclusive()) {
|
|
ProtectMemoryPages(writable, MIN_BLOCK_NORMAL_LEN, MEM_PROT_READ | MEM_PROT_WRITE);
|
|
}
|
|
|
|
RiscVEmitter emitter(GetBasePtr() + offset, writable);
|
|
// We sign extend to ensure it will fit in 32-bit and 8 bytes LI.
|
|
// TODO: May need to change if dispatcher doesn't reload PC.
|
|
emitter.LI(SCRATCH1, (int32_t)pc);
|
|
emitter.QuickJ(R_RA, dispatcherPCInSCRATCH1_);
|
|
int bytesWritten = (int)(emitter.GetWritableCodePtr() - writable);
|
|
if (bytesWritten < MIN_BLOCK_NORMAL_LEN)
|
|
emitter.ReserveCodeSpace(MIN_BLOCK_NORMAL_LEN - bytesWritten);
|
|
emitter.FlushIcache();
|
|
|
|
if (PlatformIsWXExclusive()) {
|
|
ProtectMemoryPages(writable, MIN_BLOCK_NORMAL_LEN, MEM_PROT_READ | MEM_PROT_EXEC);
|
|
}
|
|
}
|
|
|
|
EraseAllLinks(block_num);
|
|
}
|
|
|
|
void RiscVJitBackend::RestoreRoundingMode(bool force) {
|
|
FSRMI(Round::NEAREST_EVEN);
|
|
}
|
|
|
|
void RiscVJitBackend::ApplyRoundingMode(bool force) {
|
|
QuickCallFunction(applyRoundingMode_);
|
|
}
|
|
|
|
void RiscVJitBackend::MovFromPC(RiscVReg r) {
|
|
LWU(r, CTXREG, offsetof(MIPSState, pc));
|
|
}
|
|
|
|
void RiscVJitBackend::MovToPC(RiscVReg r) {
|
|
SW(r, CTXREG, offsetof(MIPSState, pc));
|
|
}
|
|
|
|
void RiscVJitBackend::WriteDebugPC(uint32_t pc) {
|
|
if (hooks_.profilerPC) {
|
|
int offset = (const u8 *)hooks_.profilerPC - GetBasePtr();
|
|
LI(SCRATCH2, hooks_.profilerPC);
|
|
LI(R_RA, (int32_t)pc);
|
|
SW(R_RA, SCRATCH2, 0);
|
|
}
|
|
}
|
|
|
|
void RiscVJitBackend::WriteDebugPC(RiscVReg r) {
|
|
if (hooks_.profilerPC) {
|
|
int offset = (const u8 *)hooks_.profilerPC - GetBasePtr();
|
|
LI(SCRATCH2, hooks_.profilerPC);
|
|
SW(r, SCRATCH2, 0);
|
|
}
|
|
}
|
|
|
|
void RiscVJitBackend::WriteDebugProfilerStatus(IRProfilerStatus status) {
|
|
if (hooks_.profilerPC) {
|
|
int offset = (const u8 *)hooks_.profilerStatus - GetBasePtr();
|
|
LI(SCRATCH2, hooks_.profilerStatus);
|
|
LI(R_RA, (int)status);
|
|
SW(R_RA, SCRATCH2, 0);
|
|
}
|
|
}
|
|
|
|
void RiscVJitBackend::SaveStaticRegisters() {
|
|
if (jo.useStaticAlloc) {
|
|
QuickCallFunction(saveStaticRegisters_);
|
|
} else {
|
|
// Inline the single operation
|
|
SW(DOWNCOUNTREG, CTXREG, offsetof(MIPSState, downcount));
|
|
}
|
|
}
|
|
|
|
void RiscVJitBackend::LoadStaticRegisters() {
|
|
if (jo.useStaticAlloc) {
|
|
QuickCallFunction(loadStaticRegisters_);
|
|
} else {
|
|
LW(DOWNCOUNTREG, CTXREG, offsetof(MIPSState, downcount));
|
|
}
|
|
}
|
|
|
|
void RiscVJitBackend::NormalizeSrc1(IRInst inst, RiscVReg *reg, RiscVReg tempReg, bool allowOverlap) {
|
|
*reg = NormalizeR(inst.src1, allowOverlap ? 0 : inst.dest, tempReg);
|
|
}
|
|
|
|
void RiscVJitBackend::NormalizeSrc12(IRInst inst, RiscVReg *lhs, RiscVReg *rhs, RiscVReg lhsTempReg, RiscVReg rhsTempReg, bool allowOverlap) {
|
|
*lhs = NormalizeR(inst.src1, allowOverlap ? 0 : inst.dest, lhsTempReg);
|
|
*rhs = NormalizeR(inst.src2, allowOverlap ? 0 : inst.dest, rhsTempReg);
|
|
}
|
|
|
|
RiscVReg RiscVJitBackend::NormalizeR(IRReg rs, IRReg rd, RiscVReg tempReg) {
|
|
// For proper compare, we must sign extend so they both match or don't match.
|
|
// But don't change pointers, in case one is SP (happens in LittleBigPlanet.)
|
|
if (regs_.IsGPRImm(rs) && regs_.GetGPRImm(rs) == 0) {
|
|
return R_ZERO;
|
|
} else if (regs_.IsGPRMappedAsPointer(rs) || rs == rd) {
|
|
return regs_.Normalize32(rs, tempReg);
|
|
} else {
|
|
return regs_.Normalize32(rs);
|
|
}
|
|
}
|
|
|
|
} // namespace MIPSComp
|