mirror of
https://github.com/hrydgard/ppsspp.git
synced 2024-11-28 07:50:49 +00:00
128 lines
2.9 KiB
C++
128 lines
2.9 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 "../Core.h"
|
|
#include "Breakpoints.h"
|
|
#include "SymbolMap.h"
|
|
#include "FixedSizeUnorderedSet.h"
|
|
#include <cstdio>
|
|
|
|
#define MAX_BREAKPOINTS 16
|
|
|
|
static FixedSizeUnorderedSet<BreakPoint, MAX_BREAKPOINTS> m_iBreakPoints;
|
|
|
|
std::vector<MemCheck> CBreakPoints::MemChecks;
|
|
u32 CBreakPoints::m_iBreakOnCount = 0;
|
|
|
|
MemCheck::MemCheck(void)
|
|
{
|
|
numHits=0;
|
|
}
|
|
|
|
void MemCheck::Action(u32 iValue, u32 addr, bool write, int size, u32 pc)
|
|
{
|
|
if ((write && bOnWrite) || (!write && bOnRead))
|
|
{
|
|
if (bLog)
|
|
{
|
|
char temp[256];
|
|
printf(temp,"CHK %08x %s%i at %08x (%s), PC=%08x (%s)",iValue,write?"Write":"Read",size*8,addr,symbolMap.GetDescription(addr),pc,symbolMap.GetDescription(pc));
|
|
ERROR_LOG(MEMMAP,"%s",temp);
|
|
}
|
|
if (bBreak)
|
|
Core_Pause();
|
|
}
|
|
}
|
|
|
|
bool CBreakPoints::IsAddressBreakPoint(u32 _iAddress)
|
|
{
|
|
for (size_t i = 0; i < m_iBreakPoints.size(); i++)
|
|
if (m_iBreakPoints[i].iAddress == _iAddress)
|
|
return true;
|
|
|
|
return false;
|
|
}
|
|
|
|
bool CBreakPoints::IsTempBreakPoint(u32 _iAddress)
|
|
{
|
|
for (size_t i = 0; i < m_iBreakPoints.size(); i++)
|
|
if (m_iBreakPoints[i].iAddress == _iAddress && m_iBreakPoints[i].bTemporary)
|
|
return true;
|
|
|
|
return false;
|
|
}
|
|
|
|
void CBreakPoints::RemoveBreakPoint(u32 _iAddress)
|
|
{
|
|
for (size_t i = 0; i < m_iBreakPoints.size(); i++)
|
|
{
|
|
if (m_iBreakPoints[i].iAddress == _iAddress)
|
|
{
|
|
m_iBreakPoints.remove(m_iBreakPoints[i]);
|
|
break;
|
|
}
|
|
}
|
|
}
|
|
|
|
void CBreakPoints::ClearAllBreakPoints()
|
|
{
|
|
m_iBreakPoints.clear();
|
|
}
|
|
|
|
MemCheck *CBreakPoints::GetMemCheck(u32 address)
|
|
{
|
|
std::vector<MemCheck>::iterator iter;
|
|
for (iter = MemChecks.begin(); iter != MemChecks.end(); ++iter)
|
|
{
|
|
if ((*iter).bRange)
|
|
{
|
|
if (address >= (*iter).iStartAddress && address <= (*iter).iEndAddress)
|
|
return &(*iter);
|
|
}
|
|
else
|
|
{
|
|
if ((*iter).iStartAddress==address)
|
|
return &(*iter);
|
|
}
|
|
}
|
|
|
|
//none found
|
|
return 0;
|
|
}
|
|
|
|
bool CBreakPoints::IsBreakOnCount(u32 _iCount)
|
|
{
|
|
if ((_iCount == m_iBreakOnCount) &&
|
|
(m_iBreakOnCount != 0))
|
|
return true;
|
|
|
|
return false;
|
|
}
|
|
|
|
void CBreakPoints::AddBreakPoint(u32 _iAddress, bool temp)
|
|
{
|
|
if (!IsAddressBreakPoint(_iAddress))
|
|
{
|
|
BreakPoint pt;
|
|
pt.bOn=true;
|
|
pt.bTemporary=temp;
|
|
pt.iAddress = _iAddress;
|
|
|
|
m_iBreakPoints.insert(pt);
|
|
}
|
|
}
|