mirror of
https://github.com/hrydgard/ppsspp.git
synced 2024-11-24 05:49:58 +00:00
b37ba9e599
This way the backend can set flags for the type of IR it wants. It's seems too complex to combine certain things like lwl/lwr in a pass.
259 lines
6.7 KiB
C++
259 lines
6.7 KiB
C++
// Copyright (c) 2012- 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 "base/logging.h"
|
|
#include "profiler/profiler.h"
|
|
#include "Common/ChunkFile.h"
|
|
#include "Common/StringUtils.h"
|
|
|
|
#include "Core/Core.h"
|
|
#include "Core/CoreTiming.h"
|
|
#include "Core/HLE/sceKernelMemory.h"
|
|
#include "Core/MemMap.h"
|
|
#include "Core/MIPS/MIPS.h"
|
|
#include "Core/MIPS/MIPSCodeUtils.h"
|
|
#include "Core/MIPS/MIPSInt.h"
|
|
#include "Core/MIPS/MIPSTables.h"
|
|
#include "Core/MIPS/IR/IRRegCache.h"
|
|
#include "Core/MIPS/IR/IRJit.h"
|
|
#include "Core/MIPS/IR/IRPassSimplify.h"
|
|
#include "Core/MIPS/IR/IRInterpreter.h"
|
|
#include "Core/MIPS/JitCommon/JitCommon.h"
|
|
#include "Core/Reporting.h"
|
|
|
|
namespace MIPSComp {
|
|
|
|
IRJit::IRJit(MIPSState *mips) : frontend_(mips->HasDefaultPrefix()), mips_(mips) {
|
|
u32 size = 128 * 1024;
|
|
// blTrampolines_ = kernelMemory.Alloc(size, true, "trampoline");
|
|
InitIR();
|
|
|
|
IROptions opts{};
|
|
opts.unalignedLoadStore = true;
|
|
frontend_.SetOptions(opts);
|
|
}
|
|
|
|
IRJit::~IRJit() {
|
|
}
|
|
|
|
void IRJit::DoState(PointerWrap &p) {
|
|
frontend_.DoState(p);
|
|
}
|
|
|
|
void IRJit::ClearCache() {
|
|
ILOG("IRJit: Clearing the cache!");
|
|
blocks_.Clear();
|
|
}
|
|
|
|
void IRJit::InvalidateCacheAt(u32 em_address, int length) {
|
|
blocks_.InvalidateICache(em_address, length);
|
|
}
|
|
|
|
void IRJit::Compile(u32 em_address) {
|
|
PROFILE_THIS_SCOPE("jitc");
|
|
|
|
int block_num = blocks_.AllocateBlock(em_address);
|
|
IRBlock *b = blocks_.GetBlock(block_num);
|
|
|
|
std::vector<IRInst> instructions;
|
|
std::vector<u32> constants;
|
|
u32 mipsBytes;
|
|
frontend_.DoJit(em_address, instructions, constants, mipsBytes);
|
|
b->SetInstructions(instructions, constants);
|
|
b->SetOriginalSize(mipsBytes);
|
|
// Overwrites the first instruction, and also updates stats.
|
|
blocks_.FinalizeBlock(block_num);
|
|
|
|
if (frontend_.CheckRounding(em_address)) {
|
|
// Our assumptions are all wrong so it's clean-slate time.
|
|
ClearCache();
|
|
Compile(em_address);
|
|
}
|
|
}
|
|
|
|
void IRJit::RunLoopUntil(u64 globalticks) {
|
|
PROFILE_THIS_SCOPE("jit");
|
|
|
|
// ApplyRoundingMode(true);
|
|
// IR Dispatcher
|
|
|
|
while (true) {
|
|
// RestoreRoundingMode(true);
|
|
CoreTiming::Advance();
|
|
// ApplyRoundingMode(true);
|
|
if (coreState != 0) {
|
|
break;
|
|
}
|
|
while (mips_->downcount >= 0) {
|
|
u32 inst = Memory::ReadUnchecked_U32(mips_->pc);
|
|
u32 opcode = inst & 0xFF000000;
|
|
if (opcode == MIPS_EMUHACK_OPCODE) {
|
|
u32 data = inst & 0xFFFFFF;
|
|
IRBlock *block = blocks_.GetBlock(data);
|
|
mips_->pc = IRInterpret(mips_, block->GetInstructions(), block->GetConstants(), block->GetNumInstructions());
|
|
} else {
|
|
// RestoreRoundingMode(true);
|
|
Compile(mips_->pc);
|
|
// ApplyRoundingMode(true);
|
|
}
|
|
}
|
|
}
|
|
|
|
// RestoreRoundingMode(true);
|
|
}
|
|
|
|
bool IRJit::DescribeCodePtr(const u8 *ptr, std::string &name) {
|
|
// Used in disassembly viewer.
|
|
return false;
|
|
}
|
|
|
|
void IRJit::LinkBlock(u8 *exitPoint, const u8 *checkedEntry) {
|
|
Crash();
|
|
}
|
|
|
|
void IRJit::UnlinkBlock(u8 *checkedEntry, u32 originalAddress) {
|
|
Crash();
|
|
}
|
|
|
|
bool IRJit::ReplaceJalTo(u32 dest) {
|
|
Crash();
|
|
return false;
|
|
}
|
|
|
|
void IRBlockCache::Clear() {
|
|
for (int i = 0; i < (int)blocks_.size(); ++i) {
|
|
blocks_[i].Destroy(i);
|
|
}
|
|
blocks_.clear();
|
|
byPage_.clear();
|
|
}
|
|
|
|
void IRBlockCache::InvalidateICache(u32 address, u32 length) {
|
|
u32 startPage = AddressToPage(address);
|
|
u32 endPage = AddressToPage(address + length);
|
|
|
|
for (u32 page = startPage; page <= endPage; ++page) {
|
|
const auto iter = byPage_.find(page);
|
|
if (iter == byPage_.end())
|
|
continue;
|
|
|
|
const std::vector<int> &blocksInPage = iter->second;
|
|
for (int i : blocksInPage) {
|
|
if (blocks_[i].OverlapsRange(address, length)) {
|
|
// Not removing from the page, hopefully doesn't build up with small recompiles.
|
|
blocks_[i].Destroy(i);
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
void IRBlockCache::FinalizeBlock(int i) {
|
|
blocks_[i].Finalize(i);
|
|
|
|
u32 startAddr, size;
|
|
blocks_[i].GetRange(startAddr, size);
|
|
|
|
u32 startPage = AddressToPage(startAddr);
|
|
u32 endPage = AddressToPage(startAddr + size);
|
|
|
|
for (u32 page = startPage; page <= endPage; ++page) {
|
|
byPage_[page].push_back(i);
|
|
}
|
|
}
|
|
|
|
u32 IRBlockCache::AddressToPage(u32 addr) {
|
|
// Use relatively small pages since basic blocks are typically small.
|
|
return (addr & 0x3FFFFFFF) >> 10;
|
|
}
|
|
|
|
std::vector<u32> IRBlockCache::SaveAndClearEmuHackOps() {
|
|
std::vector<u32> result;
|
|
result.resize(blocks_.size());
|
|
|
|
for (int number = 0; number < (int)blocks_.size(); ++number) {
|
|
IRBlock &b = blocks_[number];
|
|
if (b.IsValid() && b.RestoreOriginalFirstOp(number)) {
|
|
result[number] = number;
|
|
} else {
|
|
result[number] = 0;
|
|
}
|
|
}
|
|
|
|
return result;
|
|
}
|
|
|
|
void IRBlockCache::RestoreSavedEmuHackOps(std::vector<u32> saved) {
|
|
if ((int)blocks_.size() != (int)saved.size()) {
|
|
ERROR_LOG(JIT, "RestoreSavedEmuHackOps: Wrong saved block size.");
|
|
return;
|
|
}
|
|
|
|
for (int number = 0; number < (int)blocks_.size(); ++number) {
|
|
IRBlock &b = blocks_[number];
|
|
// Only if we restored it, write it back.
|
|
if (b.IsValid() && saved[number] != 0 && b.HasOriginalFirstOp()) {
|
|
b.Finalize(number);
|
|
}
|
|
}
|
|
}
|
|
|
|
bool IRBlock::HasOriginalFirstOp() {
|
|
return Memory::ReadUnchecked_U32(origAddr_) == origFirstOpcode_.encoding;
|
|
}
|
|
|
|
bool IRBlock::RestoreOriginalFirstOp(int number) {
|
|
const u32 emuhack = MIPS_EMUHACK_OPCODE | number;
|
|
if (Memory::ReadUnchecked_U32(origAddr_) == emuhack) {
|
|
Memory::Write_Opcode_JIT(origAddr_, origFirstOpcode_);
|
|
return true;
|
|
}
|
|
return false;
|
|
}
|
|
|
|
void IRBlock::Finalize(int number) {
|
|
origFirstOpcode_ = Memory::Read_Opcode_JIT(origAddr_);
|
|
MIPSOpcode opcode = MIPSOpcode(MIPS_EMUHACK_OPCODE | number);
|
|
Memory::Write_Opcode_JIT(origAddr_, opcode);
|
|
}
|
|
|
|
void IRBlock::Destroy(int number) {
|
|
if (origAddr_) {
|
|
MIPSOpcode opcode = MIPSOpcode(MIPS_EMUHACK_OPCODE | number);
|
|
if (Memory::ReadUnchecked_U32(origAddr_) == opcode.encoding)
|
|
Memory::Write_Opcode_JIT(origAddr_, origFirstOpcode_);
|
|
|
|
// Let's mark this invalid so we don't try to clear it again.
|
|
origAddr_ = 0;
|
|
}
|
|
}
|
|
|
|
bool IRBlock::OverlapsRange(u32 addr, u32 size) {
|
|
addr &= 0x3FFFFFFF;
|
|
u32 origAddr = origAddr_ & 0x3FFFFFFF;
|
|
return addr + size > origAddr && addr < origAddr + origSize_;
|
|
}
|
|
|
|
MIPSOpcode IRJit::GetOriginalOp(MIPSOpcode op) {
|
|
IRBlock *b = blocks_.GetBlock(op.encoding & 0xFFFFFF);
|
|
if (b) {
|
|
return b->GetOriginalFirstOp();
|
|
}
|
|
return op;
|
|
}
|
|
|
|
} // namespace MIPSComp
|