Archive/Play-
0
0
Fork 0
mirror of https://github.com/jpd002/Play-.git synced 2025-05-10 04:27:09 +03:00
Code Issues Projects Releases Packages Wiki Activity Actions 10

Added EE executor that handles block cache invalidation using virtual memory mechanisms.

Browse source
This commit is contained in:
Jean-Philip Desjardins 2015-06-07 23:44:46 -04:00
parent f6672d5b95
commit 295da9f66c
8 changed files with 144 additions and 10 deletions
Download patch file Download diff file Expand all files Collapse all files

23
Source/MipsExecutor.cpp
View file

@ -1,5 +1,10 @@
#include "MipsExecutor.h"
static bool IsInsideRange(uint32 address, uint32 start, uint32 end)
{
return (address >= start) && (address <= end);
}
CMipsExecutor::CMipsExecutor(CMIPS& context, uint32 maxAddress)
: m_context(context)
, m_subTableCount(0)
@ -58,10 +63,20 @@ void CMipsExecutor::ClearActiveBlocks()
}
void CMipsExecutor::ClearActiveBlocksInRange(uint32 start, uint32 end)
{
ClearActiveBlocksInRangeInternal(start, end, nullptr);
}
void CMipsExecutor::ClearActiveBlocksInRangeInternal(uint32 start, uint32 end, CBasicBlock* protectedBlock)
{
uint32 hiStart = start >> 16;
uint32 hiEnd = end >> 16;
//We need to increase the range to make sure we catch any
//block that are straddling table boundaries
if(hiStart != 0) hiStart--;
if(hiEnd != (m_subTableCount - 1)) hiEnd++;
std::set<CBasicBlock*> blocksToDelete;
for(uint32 hi = hiStart; hi <= hiEnd; hi++)
@ -72,10 +87,11 @@ void CMipsExecutor::ClearActiveBlocksInRange(uint32 start, uint32 end)
for(uint32 lo = 0; lo < 0x10000; lo += 4)
{
uint32 tableAddress = (hi << 16) | lo;
if(tableAddress < start) continue;
if(tableAddress >= end) continue;
CBasicBlock* block = table[lo / 4];
auto block = table[lo / 4];
if(block == nullptr) continue;
if(block == protectedBlock) continue;
if(!IsInsideRange(block->GetBeginAddress(), start, end)
&& !IsInsideRange(block->GetEndAddress(), start, end)) continue;
table[lo / 4] = nullptr;
blocksToDelete.insert(block);
}
@ -83,7 +99,6 @@ void CMipsExecutor::ClearActiveBlocksInRange(uint32 start, uint32 end)
if(!blocksToDelete.empty())
{
//TODO: Actually delete the blocks, because remove_if only rearranges items leaving us a new end iterator
m_blocks.remove_if([&] (const BasicBlockPtr& block) { return blocksToDelete.find(block.get()) != std::end(blocksToDelete); });
}
}