JitCache::Rename iCache to fast_block_map.

iCache sounds too much like emulation.
This commit is contained in:
degasus 2017-01-22 16:57:46 +01:00
parent 830ae6a2c1
commit 8e00c411a3
4 changed files with 33 additions and 33 deletions

View File

@ -99,8 +99,8 @@ void Jit64AsmRoutineManager::Generate()
// Fast block number lookup. // Fast block number lookup.
// ((PC >> 2) & mask) * sizeof(JitBlock*) = (PC & (mask << 2)) * 2 // ((PC >> 2) & mask) * sizeof(JitBlock*) = (PC & (mask << 2)) * 2
MOV(32, R(RSCRATCH), PPCSTATE(pc)); MOV(32, R(RSCRATCH), PPCSTATE(pc));
u64 icache = reinterpret_cast<u64>(g_jit->GetBlockCache()->GetICache()); u64 icache = reinterpret_cast<u64>(g_jit->GetBlockCache()->GetFastBlockMap());
AND(32, R(RSCRATCH), Imm32(JitBaseBlockCache::iCache_Mask << 2)); AND(32, R(RSCRATCH), Imm32(JitBaseBlockCache::FAST_BLOCK_MAP_MASK << 2));
if (icache <= INT_MAX) if (icache <= INT_MAX)
{ {
MOV(64, R(RSCRATCH), MScaled(RSCRATCH, SCALE_2, static_cast<s32>(icache))); MOV(64, R(RSCRATCH), MScaled(RSCRATCH, SCALE_2, static_cast<s32>(icache)));

View File

@ -74,9 +74,9 @@ void JitArm64::GenerateAsm()
ARM64Reg pc_masked = W25; ARM64Reg pc_masked = W25;
ARM64Reg cache_base = X27; ARM64Reg cache_base = X27;
ARM64Reg block = X30; ARM64Reg block = X30;
ORRI2R(pc_masked, WZR, JitBaseBlockCache::iCache_Mask << 3); ORRI2R(pc_masked, WZR, JitBaseBlockCache::FAST_BLOCK_MAP_MASK << 3);
AND(pc_masked, pc_masked, DISPATCHER_PC, ArithOption(DISPATCHER_PC, ST_LSL, 1)); AND(pc_masked, pc_masked, DISPATCHER_PC, ArithOption(DISPATCHER_PC, ST_LSL, 1));
MOVP2R(cache_base, g_jit->GetBlockCache()->GetICache()); MOVP2R(cache_base, g_jit->GetBlockCache()->GetFastBlockMap());
LDR(block, cache_base, EncodeRegTo64(pc_masked)); LDR(block, cache_base, EncodeRegTo64(pc_masked));
FixupBranch not_found = CBZ(block); FixupBranch not_found = CBZ(block);

View File

@ -74,7 +74,7 @@ void JitBaseBlockCache::Clear()
valid_block.ClearAll(); valid_block.ClearAll();
iCache.fill(nullptr); fast_block_map.fill(nullptr);
} }
void JitBaseBlockCache::Reset() void JitBaseBlockCache::Reset()
@ -88,9 +88,9 @@ void JitBaseBlockCache::SchedulateClearCacheThreadSafe()
CoreTiming::ScheduleEvent(0, s_clear_jit_cache_thread_safe, 0, CoreTiming::FromThread::NON_CPU); CoreTiming::ScheduleEvent(0, s_clear_jit_cache_thread_safe, 0, CoreTiming::FromThread::NON_CPU);
} }
JitBlock** JitBaseBlockCache::GetICache() JitBlock** JitBaseBlockCache::GetFastBlockMap()
{ {
return iCache.data(); return fast_block_map.data();
} }
void JitBaseBlockCache::RunOnBlocks(std::function<void(const JitBlock&)> f) void JitBaseBlockCache::RunOnBlocks(std::function<void(const JitBlock&)> f)
@ -107,7 +107,7 @@ JitBlock* JitBaseBlockCache::AllocateBlock(u32 em_address)
b.physicalAddress = physicalAddress; b.physicalAddress = physicalAddress;
b.msrBits = MSR & JIT_CACHE_MSR_MASK; b.msrBits = MSR & JIT_CACHE_MSR_MASK;
b.linkData.clear(); b.linkData.clear();
b.in_icache = 0; b.fast_block_map_index = 0;
return &b; return &b;
} }
@ -125,9 +125,9 @@ void JitBaseBlockCache::FreeBlock(JitBlock* block)
void JitBaseBlockCache::FinalizeBlock(JitBlock& block, bool block_link, const u8* code_ptr) void JitBaseBlockCache::FinalizeBlock(JitBlock& block, bool block_link, const u8* code_ptr)
{ {
size_t icache = FastLookupEntryForAddress(block.effectiveAddress); size_t index = FastLookupIndexForAddress(block.effectiveAddress);
iCache[icache] = &block; fast_block_map[index] = &block;
block.in_icache = icache; block.fast_block_map_index = index;
u32 pAddr = block.physicalAddress; u32 pAddr = block.physicalAddress;
@ -175,12 +175,12 @@ JitBlock* JitBaseBlockCache::GetBlockFromStartAddress(u32 addr, u32 msr)
const u8* JitBaseBlockCache::Dispatch() const u8* JitBaseBlockCache::Dispatch()
{ {
JitBlock* block = iCache[FastLookupEntryForAddress(PC)]; JitBlock* block = fast_block_map[FastLookupIndexForAddress(PC)];
while (!block || block->effectiveAddress != PC || block->msrBits != (MSR & JIT_CACHE_MSR_MASK)) while (!block || block->effectiveAddress != PC || block->msrBits != (MSR & JIT_CACHE_MSR_MASK))
{ {
MoveBlockIntoFastCache(PC, MSR & JIT_CACHE_MSR_MASK); MoveBlockIntoFastCache(PC, MSR & JIT_CACHE_MSR_MASK);
block = iCache[FastLookupEntryForAddress(PC)]; block = fast_block_map[FastLookupIndexForAddress(PC)];
} }
return block->normalEntry; return block->normalEntry;
@ -299,8 +299,8 @@ void JitBaseBlockCache::UnlinkBlock(const JitBlock& block)
void JitBaseBlockCache::DestroyBlock(JitBlock& block) void JitBaseBlockCache::DestroyBlock(JitBlock& block)
{ {
if (iCache[block.in_icache] == &block) if (fast_block_map[block.fast_block_map_index] == &block)
iCache[block.in_icache] = nullptr; fast_block_map[block.fast_block_map_index] = nullptr;
UnlinkBlock(block); UnlinkBlock(block);
@ -330,19 +330,19 @@ void JitBaseBlockCache::MoveBlockIntoFastCache(u32 addr, u32 msr)
} }
else else
{ {
// Drop old icache entry // Drop old fast block map entry
if (iCache[block->in_icache] == block) if (fast_block_map[block->fast_block_map_index] == block)
iCache[block->in_icache] = nullptr; fast_block_map[block->fast_block_map_index] = nullptr;
// And create a new one // And create a new one
size_t icache = FastLookupEntryForAddress(addr); size_t index = FastLookupIndexForAddress(addr);
iCache[icache] = block; fast_block_map[index] = block;
block->in_icache = icache; block->fast_block_map_index = index;
LinkBlock(*block); LinkBlock(*block);
} }
} }
size_t JitBaseBlockCache::FastLookupEntryForAddress(u32 address) size_t JitBaseBlockCache::FastLookupIndexForAddress(u32 address)
{ {
return (address >> 2) & iCache_Mask; return (address >> 2) & FAST_BLOCK_MAP_MASK;
} }

View File

@ -63,9 +63,9 @@ struct JitBlock
u64 ticStop; // for profiling - time. u64 ticStop; // for profiling - time.
u64 ticCounter; // for profiling - time. u64 ticCounter; // for profiling - time.
// This tracks the position if this block within the icache. // This tracks the position if this block within the fast block cache.
// We allow each block to have one icache entry. // We allow each block to have only one map entry.
size_t in_icache; size_t fast_block_map_index;
}; };
typedef void (*CompiledCode)(); typedef void (*CompiledCode)();
@ -107,8 +107,8 @@ public:
// is valid (MSR.IR and MSR.DR, the address translation bits). // is valid (MSR.IR and MSR.DR, the address translation bits).
static constexpr u32 JIT_CACHE_MSR_MASK = 0x30; static constexpr u32 JIT_CACHE_MSR_MASK = 0x30;
static constexpr u32 iCache_Num_Elements = 0x10000; static constexpr u32 FAST_BLOCK_MAP_ELEMENTS = 0x10000;
static constexpr u32 iCache_Mask = iCache_Num_Elements - 1; static constexpr u32 FAST_BLOCK_MAP_MASK = FAST_BLOCK_MAP_ELEMENTS - 1;
explicit JitBaseBlockCache(JitBase& jit); explicit JitBaseBlockCache(JitBase& jit);
virtual ~JitBaseBlockCache(); virtual ~JitBaseBlockCache();
@ -120,7 +120,7 @@ public:
void SchedulateClearCacheThreadSafe(); void SchedulateClearCacheThreadSafe();
// Code Cache // Code Cache
JitBlock** GetICache(); JitBlock** GetFastBlockMap();
void RunOnBlocks(std::function<void(const JitBlock&)> f); void RunOnBlocks(std::function<void(const JitBlock&)> f);
JitBlock* AllocateBlock(u32 em_address); JitBlock* AllocateBlock(u32 em_address);
@ -128,7 +128,7 @@ public:
void FinalizeBlock(JitBlock& block, bool block_link, const u8* code_ptr); void FinalizeBlock(JitBlock& block, bool block_link, const u8* code_ptr);
// Look for the block in the slow but accurate way. // Look for the block in the slow but accurate way.
// This function shall be used if FastLookupEntryForAddress() failed. // This function shall be used if FastLookupIndexForAddress() failed.
// This might return nullptr if there is no such block. // This might return nullptr if there is no such block.
JitBlock* GetBlockFromStartAddress(u32 em_address, u32 msr); JitBlock* GetBlockFromStartAddress(u32 em_address, u32 msr);
@ -156,8 +156,8 @@ private:
void MoveBlockIntoFastCache(u32 em_address, u32 msr); void MoveBlockIntoFastCache(u32 em_address, u32 msr);
// Fast but risky block lookup based on iCache. // Fast but risky block lookup based on fast_block_map.
size_t FastLookupEntryForAddress(u32 address); size_t FastLookupIndexForAddress(u32 address);
// links_to hold all exit points of all valid blocks in a reverse way. // links_to hold all exit points of all valid blocks in a reverse way.
// It is used to query all blocks which links to an address. // It is used to query all blocks which links to an address.
@ -178,5 +178,5 @@ private:
// This array is indexed with the masked PC and likely holds the correct block id. // This array is indexed with the masked PC and likely holds the correct block id.
// This is used as a fast cache of start_block_map used in the assembly dispatcher. // This is used as a fast cache of start_block_map used in the assembly dispatcher.
std::array<JitBlock*, iCache_Num_Elements> iCache; // start_addr & mask -> number std::array<JitBlock*, FAST_BLOCK_MAP_ELEMENTS> fast_block_map; // start_addr & mask -> number
}; };