ppsspp/Core/MIPS/JitCommon/JitBlockCache.h

163 lines
4.8 KiB
C
Raw Normal View History

2012-11-01 16:19:01 +01:00
// Copyright (c) 2012- PPSSPP Project / Dolphin 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.
2012-11-01 16:19:01 +01:00
// 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/.
#pragma once
#include <map>
#include <vector>
#include <string>
#include "Common/CommonTypes.h"
#include "Core/MIPS/MIPSAnalyst.h"
#include "Core/MIPS/MIPS.h"
2012-11-01 16:19:01 +01:00
#if defined(ARM)
#include "Common/ArmEmitter.h"
namespace ArmGen { class ARMXEmitter; }
using namespace ArmGen;
typedef ArmGen::ARMXCodeBlock CodeBlock;
#elif defined(_M_IX86) || defined(_M_X64)
#include "Common/x64Emitter.h"
namespace Gen { class XEmitter; }
using namespace Gen;
typedef Gen::XCodeBlock CodeBlock;
2013-08-10 16:39:28 +02:00
#elif defined(PPC)
#include "Common/ppcEmitter.h"
namespace PpcGen { class PPCXEmitter; }
using namespace PpcGen;
typedef PpcGen::PPCXCodeBlock CodeBlock;
#else
#error "Unsupported arch!"
#endif
#if defined(ARM)
const int MAX_JIT_BLOCK_EXITS = 2;
#else
const int MAX_JIT_BLOCK_EXITS = 8;
#endif
2012-11-01 16:19:01 +01:00
// Define this in order to get VTune profile support for the Jit generated code.
// Add the VTune include/lib directories to the project directories to get this to build.
// #define USE_VTUNE
// We should be careful not to access these block structures during runtime as they are large.
// Fine to mess with them at block compile time though.
struct JitBlock {
bool ContainsAddress(u32 em_address);
2012-11-01 16:19:01 +01:00
const u8 *checkedEntry;
const u8 *normalEntry;
u8 *exitPtrs[MAX_JIT_BLOCK_EXITS]; // to be able to rewrite the exit jump
u32 exitAddress[MAX_JIT_BLOCK_EXITS]; // 0xFFFFFFFF == unknown
2012-11-01 16:19:01 +01:00
u32 originalAddress;
MIPSOpcode originalFirstOpcode; //to be able to restore
2013-12-19 13:31:13 +01:00
u16 codeSize;
u16 originalSize;
u16 blockNum;
2012-11-01 16:19:01 +01:00
bool invalid;
bool linkStatus[MAX_JIT_BLOCK_EXITS];
2012-11-01 16:19:01 +01:00
#ifdef USE_VTUNE
char blockName[32];
#endif
// By having a pointer, we avoid a constructor/destructor being generated and dog slow
// performance in debug.
std::vector<u32> *proxyFor;
2013-12-19 13:31:13 +01:00
bool IsPureProxy() const {
return originalFirstOpcode.encoding == 0x68FF0000;
2013-12-19 13:31:13 +01:00
}
void SetPureProxy() {
// Magic number that won't be a real opcode.
originalFirstOpcode.encoding = 0x68FF0000;
2013-12-19 13:31:13 +01:00
}
2012-11-01 16:19:01 +01:00
};
typedef void (*CompiledCode)();
class JitBlockCache {
2012-11-01 16:19:01 +01:00
public:
JitBlockCache(MIPSState *mips_, CodeBlock *codeBlock);
2012-11-01 16:19:01 +01:00
~JitBlockCache();
int AllocateBlock(u32 em_address);
// When a proxy block is invalidated, the block located at the rootAddress
// is invalidated too.
2013-12-19 13:34:06 +01:00
void ProxyBlock(u32 rootAddress, u32 startAddress, u32 size, const u8 *codePtr);
2013-04-26 23:39:23 +02:00
void FinalizeBlock(int block_num, bool block_link);
2012-11-01 16:19:01 +01:00
void Clear();
void Init();
void Shutdown();
void Reset();
bool IsFull() const;
// Code Cache
JitBlock *GetBlock(int block_num);
// Fast way to get a block. Only works on the first source-cpu instruction of a block.
int GetBlockNumberFromStartAddress(u32 em_address, bool realBlocksOnly = true);
2012-11-01 16:19:01 +01:00
// slower, but can get numbers from within blocks, not just the first instruction.
// WARNING! WILL NOT WORK WITH JIT INLINING ENABLED (not yet a feature but will be soon)
2012-11-01 16:19:01 +01:00
// Returns a list of block numbers - only one block can start at a particular address, but they CAN overlap.
// This one is slow so should only be used for one-shots from the debugger UI, not for anything during runtime.
void GetBlockNumbersFromAddress(u32 em_address, std::vector<int> *block_numbers);
2013-12-10 13:06:57 +01:00
int GetBlockNumberFromEmuHackOp(MIPSOpcode inst, bool ignoreBad = false) const;
2012-11-01 16:19:01 +01:00
u32 GetAddressFromBlockPtr(const u8 *ptr) const;
MIPSOpcode GetOriginalFirstOp(int block_num);
2012-11-01 16:19:01 +01:00
// DOES NOT WORK CORRECTLY WITH JIT INLINING
2012-11-01 16:19:01 +01:00
void InvalidateICache(u32 address, const u32 length);
void DestroyBlock(int block_num, bool invalidate);
// No jit operations may be run between these calls.
// Meant to be used to make memory safe for savestates, memcpy, etc.
std::vector<u32> SaveAndClearEmuHackOps();
void RestoreSavedEmuHackOps(std::vector<u32> saved);
2013-12-19 13:34:06 +01:00
int GetNumBlocks() const { return num_blocks_; }
2013-04-26 23:39:23 +02:00
private:
void LinkBlockExits(int i);
void LinkBlock(int i);
void UnlinkBlock(int i);
MIPSOpcode GetEmuHackOpForBlock(int block_num) const;
2013-04-26 23:39:23 +02:00
2013-12-19 13:34:06 +01:00
MIPSState *mips_;
CodeBlock *codeBlock_;
2013-12-19 13:34:06 +01:00
JitBlock *blocks_;
std::vector<int> proxyBlockIndices_;
2013-12-19 13:34:06 +01:00
int num_blocks_;
std::multimap<u32, int> links_to_;
std::map<std::pair<u32,u32>, u32> block_map_; // (end_addr, start_addr) -> number
2013-04-26 23:39:23 +02:00
enum {
MAX_NUM_BLOCKS = 65536*2
};
2012-11-01 16:19:01 +01:00
};
2013-04-26 23:39:23 +02:00