2001-10-03 17:10:38 +04:00
|
|
|
/////////////////////////////////////////////////////////////////////////
|
2008-01-05 13:45:05 +03:00
|
|
|
// $Id: cpu.cc,v 1.198 2008-01-05 10:45:05 sshwarts Exp $
|
2001-10-03 17:10:38 +04:00
|
|
|
/////////////////////////////////////////////////////////////////////////
|
|
|
|
//
|
2001-04-10 06:20:02 +04:00
|
|
|
// Copyright (C) 2001 MandrakeSoft S.A.
|
2001-04-10 05:04:59 +04:00
|
|
|
//
|
|
|
|
// MandrakeSoft S.A.
|
|
|
|
// 43, rue d'Aboukir
|
|
|
|
// 75002 Paris - France
|
|
|
|
// http://www.linux-mandrake.com/
|
|
|
|
// http://www.mandrakesoft.com/
|
|
|
|
//
|
|
|
|
// This library is free software; you can redistribute it and/or
|
|
|
|
// modify it under the terms of the GNU Lesser General Public
|
|
|
|
// License as published by the Free Software Foundation; either
|
|
|
|
// version 2 of the License, or (at your option) any later version.
|
|
|
|
//
|
|
|
|
// This library 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
|
|
|
|
// Lesser General Public License for more details.
|
|
|
|
//
|
|
|
|
// You should have received a copy of the GNU Lesser General Public
|
|
|
|
// License along with this library; if not, write to the Free Software
|
|
|
|
// Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
|
2007-11-18 02:28:33 +03:00
|
|
|
/////////////////////////////////////////////////////////////////////////
|
2001-04-10 05:04:59 +04:00
|
|
|
|
|
|
|
|
2001-05-24 22:46:34 +04:00
|
|
|
#define NEED_CPU_REG_SHORTCUTS 1
|
2001-04-10 05:04:59 +04:00
|
|
|
#include "bochs.h"
|
2006-03-07 01:03:16 +03:00
|
|
|
#include "cpu.h"
|
merge in BRANCH-io-cleanup.
To see the commit logs for this use either cvsweb or
cvs update -r BRANCH-io-cleanup and then 'cvs log' the various files.
In general this provides a generic interface for logging.
logfunctions:: is a class that is inherited by some classes, and also
. allocated as a standalone global called 'genlog'. All logging uses
. one of the ::info(), ::error(), ::ldebug(), ::panic() methods of this
. class through 'BX_INFO(), BX_ERROR(), BX_DEBUG(), BX_PANIC()' macros
. respectively.
.
. An example usage:
. BX_INFO(("Hello, World!\n"));
iofunctions:: is a class that is allocated once by default, and assigned
as the iofunction of each logfunctions instance. It is this class that
maintains the file descriptor and other output related code, at this
point using vfprintf(). At some future point, someone may choose to
write a gui 'console' for bochs to which messages would be redirected
simply by assigning a different iofunction class to the various logfunctions
objects.
More cleanup is coming, but this works for now. If you want to see alot
of debugging output, in main.cc, change onoff[LOGLEV_DEBUG]=0 to =1.
Comments, bugs, flames, to me: todd@fries.net
2001-05-15 18:49:57 +04:00
|
|
|
#define LOG_THIS BX_CPU_THIS_PTR
|
2001-04-10 05:04:59 +04:00
|
|
|
|
2006-03-07 01:03:16 +03:00
|
|
|
#include "iodev/iodev.h"
|
|
|
|
|
|
|
|
#if BX_EXTERNAL_DEBUGGER
|
|
|
|
#include "extdb.h"
|
|
|
|
#endif
|
|
|
|
|
2005-03-11 00:22:15 +03:00
|
|
|
#if BX_SUPPORT_ICACHE
|
|
|
|
|
2005-04-10 23:42:48 +04:00
|
|
|
bxPageWriteStampTable pageWriteStampTable;
|
|
|
|
|
2005-10-18 22:07:52 +04:00
|
|
|
void purgeICaches(void)
|
2005-04-10 23:42:48 +04:00
|
|
|
{
|
|
|
|
for (unsigned i=0; i<BX_SMP_PROCESSORS; i++)
|
2005-06-17 00:28:27 +04:00
|
|
|
BX_CPU(i)->iCache.purgeICacheEntries();
|
|
|
|
|
2006-05-17 00:55:55 +04:00
|
|
|
pageWriteStampTable.purgeWriteStamps();
|
2005-04-10 23:42:48 +04:00
|
|
|
}
|
|
|
|
|
2005-10-18 22:07:52 +04:00
|
|
|
void flushICaches(void)
|
|
|
|
{
|
|
|
|
for (unsigned i=0; i<BX_SMP_PROCESSORS; i++)
|
|
|
|
BX_CPU(i)->iCache.flushICacheEntries();
|
|
|
|
|
|
|
|
pageWriteStampTable.resetWriteStamps();
|
|
|
|
}
|
|
|
|
|
2007-12-14 14:27:44 +03:00
|
|
|
#define InstrumentTRACECACHE 0
|
2005-03-11 00:22:15 +03:00
|
|
|
|
2007-12-14 14:27:44 +03:00
|
|
|
#if InstrumentTRACECACHE
|
2007-12-04 22:27:23 +03:00
|
|
|
static Bit32u iCacheLookups=0;
|
|
|
|
static Bit32u iCacheMisses=0;
|
2007-12-09 21:36:05 +03:00
|
|
|
static Bit32u iCacheMergeTraces=0;
|
2007-12-14 14:27:44 +03:00
|
|
|
static Bit32u iCacheTraceLengh[BX_MAX_TRACE_LENGTH];
|
2005-03-11 00:22:15 +03:00
|
|
|
|
2007-12-14 23:41:09 +03:00
|
|
|
#define InstrICache_StatsMask 0x3ffffff
|
2005-03-11 00:22:15 +03:00
|
|
|
|
|
|
|
#define InstrICache_Stats() {\
|
|
|
|
if ((iCacheLookups & InstrICache_StatsMask) == 0) { \
|
2007-12-14 14:27:44 +03:00
|
|
|
BX_INFO(("ICACHE lookups: %u, misses: %u, merges: %u, hit rate = %3.2f%%", \
|
2007-12-04 22:27:23 +03:00
|
|
|
(unsigned) iCacheLookups, \
|
|
|
|
(unsigned) iCacheMisses, \
|
2007-12-09 21:36:05 +03:00
|
|
|
(unsigned) iCacheMergeTraces, \
|
2005-03-11 00:22:15 +03:00
|
|
|
(iCacheLookups-iCacheMisses) * 100.0 / iCacheLookups)); \
|
2007-12-14 14:27:44 +03:00
|
|
|
for (unsigned trace_len_idx=0; trace_len_idx<BX_MAX_TRACE_LENGTH;trace_len_idx++) { \
|
|
|
|
BX_INFO(("trace[%02d]: %u\t(%3.2f%%)", trace_len_idx+1, \
|
|
|
|
iCacheTraceLengh[trace_len_idx], \
|
|
|
|
iCacheTraceLengh[trace_len_idx] * 100.0/(iCacheLookups-iCacheMisses))); \
|
|
|
|
iCacheTraceLengh[trace_len_idx] = 0; \
|
|
|
|
} \
|
2007-12-09 21:36:05 +03:00
|
|
|
iCacheLookups = iCacheMisses = iCacheMergeTraces = 0; \
|
2005-03-11 00:22:15 +03:00
|
|
|
} \
|
|
|
|
}
|
|
|
|
#define InstrICache_Increment(v) (v)++
|
|
|
|
|
|
|
|
#else
|
|
|
|
#define InstrICache_Stats()
|
|
|
|
#define InstrICache_Increment(v)
|
|
|
|
#endif
|
|
|
|
|
2007-12-14 14:27:44 +03:00
|
|
|
#endif // InstrumentTRACECACHE
|
2001-04-10 05:04:59 +04:00
|
|
|
|
2002-09-14 07:01:05 +04:00
|
|
|
// Make code more tidy with a few macros.
|
|
|
|
#if BX_SUPPORT_X86_64==0
|
|
|
|
#define RIP EIP
|
2007-09-25 20:11:32 +04:00
|
|
|
#define RCX ECX
|
2002-09-14 07:01:05 +04:00
|
|
|
#endif
|
|
|
|
|
2007-12-09 21:36:05 +03:00
|
|
|
#if BX_SUPPORT_TRACE_CACHE
|
|
|
|
|
2008-01-05 13:21:25 +03:00
|
|
|
bxInstruction_c* BX_CPU_C::fetchInstructionTrace(bxInstruction_c *iStorage, unsigned *len, bx_address eipBiased)
|
2007-12-09 21:36:05 +03:00
|
|
|
{
|
2007-12-23 20:21:28 +03:00
|
|
|
bx_phy_address pAddr = (bx_phy_address)(BX_CPU_THIS_PTR pAddrA20Page + eipBiased);
|
2007-12-09 21:36:05 +03:00
|
|
|
unsigned iCacheHash = BX_CPU_THIS_PTR iCache.hash(pAddr);
|
|
|
|
bxICacheEntry_c *trace = &(BX_CPU_THIS_PTR iCache.entry[iCacheHash]);
|
|
|
|
Bit32u pageWriteStamp = *(BX_CPU_THIS_PTR currPageWriteStampPtr);
|
|
|
|
|
|
|
|
InstrICache_Increment(iCacheLookups);
|
|
|
|
InstrICache_Stats();
|
|
|
|
|
|
|
|
if ((trace->pAddr == pAddr) &&
|
|
|
|
(trace->writeStamp == pageWriteStamp))
|
|
|
|
{
|
2008-01-05 13:21:25 +03:00
|
|
|
// We are lucky - trace cache hit !
|
2007-12-14 14:27:44 +03:00
|
|
|
InstrICache_Increment(iCacheTraceLengh[trace->ilen-1]);
|
2008-01-05 13:21:25 +03:00
|
|
|
*len = trace->ilen;
|
|
|
|
return trace->i;
|
2007-12-09 21:36:05 +03:00
|
|
|
}
|
|
|
|
|
|
|
|
// We are not so lucky, but let's be optimistic - try to build trace from
|
|
|
|
// incoming instruction bytes stream !
|
|
|
|
trace->pAddr = pAddr;
|
2007-12-14 23:41:09 +03:00
|
|
|
trace->writeStamp = pageWriteStamp;
|
2007-12-09 21:36:05 +03:00
|
|
|
trace->ilen = 0;
|
|
|
|
|
|
|
|
InstrICache_Increment(iCacheMisses);
|
|
|
|
|
2007-12-22 15:43:17 +03:00
|
|
|
unsigned remainingInPage = (unsigned)(BX_CPU_THIS_PTR eipPageWindowSize - eipBiased);
|
2007-12-09 21:36:05 +03:00
|
|
|
Bit8u *fetchPtr = BX_CPU_THIS_PTR eipFetchPtr + eipBiased;
|
|
|
|
unsigned ret;
|
|
|
|
|
|
|
|
// We could include in trace maximum BX_MAX_TRACE_LEN instructions
|
|
|
|
unsigned max_length = BX_MAX_TRACE_LENGTH;
|
|
|
|
if ((pageWriteStamp & ICacheWriteStampMask) != ICacheWriteStampStart)
|
|
|
|
max_length = 1; // seems like the entry has SMC ping-pong problem
|
|
|
|
|
|
|
|
bxInstruction_c *i = trace->i;
|
|
|
|
|
2008-01-05 13:21:25 +03:00
|
|
|
for (unsigned n=0;n<max_length;n++,i++)
|
2007-12-09 21:36:05 +03:00
|
|
|
{
|
|
|
|
#if BX_SUPPORT_X86_64
|
|
|
|
if (BX_CPU_THIS_PTR cpu_mode == BX_MODE_LONG_64)
|
2007-12-22 20:17:40 +03:00
|
|
|
ret = fetchDecode64(fetchPtr, i, remainingInPage);
|
2007-12-09 21:36:05 +03:00
|
|
|
else
|
|
|
|
#endif
|
2007-12-22 20:17:40 +03:00
|
|
|
ret = fetchDecode32(fetchPtr, i, remainingInPage);
|
2007-12-09 21:36:05 +03:00
|
|
|
|
|
|
|
if (ret==0) {
|
|
|
|
// Fetching instruction on segment/page boundary
|
2008-01-05 13:21:25 +03:00
|
|
|
if (n > 0) {
|
2007-12-09 21:36:05 +03:00
|
|
|
// The trace is already valid, it has several instructions inside,
|
|
|
|
// in this case just drop the boundary instruction and stop
|
|
|
|
// tracing.
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
// First instruction is boundary fetch, return iStorage and leave
|
|
|
|
// the trace cache entry invalid (do not cache the instruction)
|
2007-12-14 23:41:09 +03:00
|
|
|
trace->writeStamp = ICacheWriteStampInvalid;
|
2007-12-09 21:36:05 +03:00
|
|
|
boundaryFetch(fetchPtr, remainingInPage, iStorage);
|
2008-01-05 13:21:25 +03:00
|
|
|
|
|
|
|
*len = 1;
|
|
|
|
return iStorage;
|
2007-12-09 21:36:05 +03:00
|
|
|
}
|
|
|
|
|
|
|
|
// add instruction to the trace ...
|
|
|
|
unsigned iLen = i->ilen();
|
|
|
|
trace->ilen++;
|
|
|
|
|
|
|
|
// ... and continue to the next instruction
|
|
|
|
remainingInPage -= iLen;
|
2007-12-22 20:17:40 +03:00
|
|
|
if (remainingInPage == 0) break;
|
2007-12-09 21:36:05 +03:00
|
|
|
pAddr += iLen;
|
2007-12-14 23:41:09 +03:00
|
|
|
fetchPtr += iLen;
|
|
|
|
|
|
|
|
if (i->getStopTraceAttr()) {
|
|
|
|
unsigned b1 = i->b1() & 0x1f0;
|
|
|
|
if (b1 == 0x70 || b1 == 0x180) { // JCC instruction
|
|
|
|
// try cross JCC branch merge of traces
|
|
|
|
mergeTraces(trace, i+1, pAddr);
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
}
|
2007-12-09 21:36:05 +03:00
|
|
|
|
2007-12-14 23:41:09 +03:00
|
|
|
// try to find a trace starting from current pAddr and merge
|
|
|
|
if (mergeTraces(trace, i+1, pAddr)) break;
|
2007-12-09 21:36:05 +03:00
|
|
|
}
|
|
|
|
|
2008-01-05 13:21:25 +03:00
|
|
|
*len = trace->ilen;
|
|
|
|
return trace->i;
|
2007-12-09 21:36:05 +03:00
|
|
|
}
|
|
|
|
|
|
|
|
bx_bool BX_CPU_C::mergeTraces(bxICacheEntry_c *trace, bxInstruction_c *i, bx_phy_address pAddr)
|
|
|
|
{
|
|
|
|
bxICacheEntry_c *e = &(BX_CPU_THIS_PTR iCache.entry[BX_CPU_THIS_PTR iCache.hash(pAddr)]);
|
|
|
|
|
|
|
|
if ((e->pAddr == pAddr) && (e->writeStamp == trace->writeStamp))
|
|
|
|
{
|
|
|
|
// We are lucky - another trace hit !
|
|
|
|
InstrICache_Increment(iCacheMergeTraces);
|
|
|
|
|
|
|
|
// determine max amount of instruction to take from another trace
|
|
|
|
unsigned max_length = e->ilen;
|
|
|
|
if (max_length + trace->ilen > BX_MAX_TRACE_LENGTH)
|
|
|
|
max_length = BX_MAX_TRACE_LENGTH - trace->ilen;
|
|
|
|
if(max_length == 0) return 0;
|
|
|
|
|
|
|
|
memcpy(i, e->i, sizeof(bxInstruction_c)*max_length);
|
|
|
|
trace->ilen += max_length;
|
|
|
|
BX_ASSERT(trace->ilen <= BX_MAX_TRACE_LENGTH);
|
|
|
|
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
return 0;
|
2007-12-22 15:43:17 +03:00
|
|
|
}
|
2007-12-09 21:36:05 +03:00
|
|
|
|
2007-12-14 14:27:44 +03:00
|
|
|
void BX_CPU_C::instrumentTraces(void)
|
|
|
|
{
|
|
|
|
Bit32u currPageWriteStamp = *(BX_CPU_THIS_PTR currPageWriteStampPtr);
|
|
|
|
bxICacheEntry_c *e = BX_CPU_THIS_PTR iCache.entry;
|
|
|
|
Bit32u trace_length[BX_MAX_TRACE_LENGTH], invalid_entries = 0;
|
|
|
|
unsigned i;
|
|
|
|
|
|
|
|
for (i=0; i < BX_MAX_TRACE_LENGTH; i++) trace_length[i] = 0;
|
|
|
|
|
|
|
|
for (i=0; i<BxICacheEntries; i++, e++) {
|
|
|
|
if (e->writeStamp == currPageWriteStamp)
|
|
|
|
trace_length[e->ilen-1]++;
|
|
|
|
else
|
|
|
|
invalid_entries++;
|
|
|
|
}
|
|
|
|
|
|
|
|
for (i=0; i < BX_MAX_TRACE_LENGTH; i++) {
|
|
|
|
BX_INFO(("traces[%02d]: %u\t%f%%", i+1,
|
|
|
|
trace_length[i], trace_length[i]*100.0/BxICacheEntries));
|
|
|
|
}
|
|
|
|
BX_INFO(("invalid entries: %u\t%f%%",
|
|
|
|
invalid_entries, invalid_entries*100.0/BxICacheEntries));
|
|
|
|
}
|
|
|
|
|
2007-12-09 21:36:05 +03:00
|
|
|
#else
|
|
|
|
|
|
|
|
bxInstruction_c* BX_CPU_C::fetchInstruction(bxInstruction_c *iStorage, bx_address eipBiased)
|
2006-04-28 20:45:29 +04:00
|
|
|
{
|
|
|
|
unsigned ret;
|
|
|
|
bxInstruction_c *i = iStorage;
|
|
|
|
|
|
|
|
#if BX_SUPPORT_ICACHE
|
|
|
|
bx_phy_address pAddr = BX_CPU_THIS_PTR pAddrA20Page + eipBiased;
|
|
|
|
unsigned iCacheHash = BX_CPU_THIS_PTR iCache.hash(pAddr);
|
|
|
|
bxICacheEntry_c *cache_entry = &(BX_CPU_THIS_PTR iCache.entry[iCacheHash]);
|
|
|
|
i = &(cache_entry->i);
|
|
|
|
|
|
|
|
Bit32u pageWriteStamp = *(BX_CPU_THIS_PTR currPageWriteStampPtr);
|
|
|
|
|
|
|
|
InstrICache_Increment(iCacheLookups);
|
|
|
|
InstrICache_Stats();
|
|
|
|
|
|
|
|
if ((cache_entry->pAddr == pAddr) &&
|
|
|
|
(cache_entry->writeStamp == pageWriteStamp))
|
|
|
|
{
|
|
|
|
// iCache hit. Instruction is already decoded and stored in the
|
|
|
|
// instruction cache.
|
|
|
|
#if BX_INSTRUMENTATION
|
|
|
|
// An instruction was found in the iCache.
|
|
|
|
BX_INSTR_OPCODE(BX_CPU_ID, BX_CPU_THIS_PTR eipFetchPtr + eipBiased,
|
|
|
|
i->ilen(), BX_CPU_THIS_PTR sregs[BX_SEG_REG_CS].cache.u.segment.d_b, Is64BitMode());
|
|
|
|
#endif
|
2006-05-16 20:47:00 +04:00
|
|
|
return i;
|
2006-04-28 20:45:29 +04:00
|
|
|
}
|
|
|
|
#endif
|
2006-05-16 20:47:00 +04:00
|
|
|
|
|
|
|
// iCache miss. No validated instruction with matching fetch parameters
|
|
|
|
// is in the iCache. Or we're not compiling iCache support in, in which
|
|
|
|
// case we always have an iCache miss. :^)
|
2007-12-22 15:43:17 +03:00
|
|
|
unsigned remainingInPage = (unsigned)(BX_CPU_THIS_PTR eipPageWindowSize - eipBiased);
|
2006-05-16 20:47:00 +04:00
|
|
|
Bit8u *fetchPtr = BX_CPU_THIS_PTR eipFetchPtr + eipBiased;
|
2006-04-28 20:45:29 +04:00
|
|
|
|
|
|
|
#if BX_SUPPORT_ICACHE
|
2006-05-16 20:47:00 +04:00
|
|
|
// The entry will be marked valid if fetchdecode will succeed
|
|
|
|
cache_entry->writeStamp = ICacheWriteStampInvalid;
|
|
|
|
InstrICache_Increment(iCacheMisses);
|
2006-04-28 20:45:29 +04:00
|
|
|
#endif
|
|
|
|
|
|
|
|
#if BX_SUPPORT_X86_64
|
2006-05-16 20:47:00 +04:00
|
|
|
if (BX_CPU_THIS_PTR cpu_mode == BX_MODE_LONG_64)
|
2007-12-22 20:17:40 +03:00
|
|
|
ret = fetchDecode64(fetchPtr, i, remainingInPage);
|
2006-05-16 20:47:00 +04:00
|
|
|
else
|
2006-04-28 20:45:29 +04:00
|
|
|
#endif
|
2007-12-22 20:17:40 +03:00
|
|
|
ret = fetchDecode32(fetchPtr, i, remainingInPage);
|
2006-04-28 20:45:29 +04:00
|
|
|
|
2006-05-16 20:47:00 +04:00
|
|
|
if (ret==0) {
|
|
|
|
// return iStorage and leave icache entry invalid (do not cache instr)
|
|
|
|
boundaryFetch(fetchPtr, remainingInPage, iStorage);
|
|
|
|
return iStorage;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
2006-04-28 20:45:29 +04:00
|
|
|
#if BX_SUPPORT_ICACHE
|
2006-05-16 20:47:00 +04:00
|
|
|
cache_entry->pAddr = pAddr;
|
|
|
|
cache_entry->writeStamp = pageWriteStamp;
|
2006-04-28 20:45:29 +04:00
|
|
|
#endif
|
|
|
|
#if BX_INSTRUMENTATION
|
2006-05-16 20:47:00 +04:00
|
|
|
// An instruction was either fetched, or found in the iCache.
|
|
|
|
BX_INSTR_OPCODE(BX_CPU_ID, fetchPtr, i->ilen(),
|
|
|
|
BX_CPU_THIS_PTR sregs[BX_SEG_REG_CS].cache.u.segment.d_b, Is64BitMode());
|
2006-04-28 20:45:29 +04:00
|
|
|
#endif
|
|
|
|
}
|
|
|
|
|
|
|
|
return i;
|
|
|
|
}
|
|
|
|
|
2007-12-09 21:36:05 +03:00
|
|
|
#endif
|
|
|
|
|
2007-09-26 22:07:39 +04:00
|
|
|
// The CHECK_MAX_INSTRUCTIONS macro allows cpu_loop to execute a few
|
|
|
|
// instructions and then return so that the other processors have a chance to
|
|
|
|
// run. This is used by bochs internal debugger or when simulating
|
|
|
|
// multiple processors.
|
|
|
|
//
|
|
|
|
// If maximum instructions have been executed, return. The zero-count
|
|
|
|
// means run forever.
|
|
|
|
#if BX_SUPPORT_SMP || BX_DEBUGGER
|
|
|
|
#define CHECK_MAX_INSTRUCTIONS(count) \
|
|
|
|
if ((count) > 0) { \
|
|
|
|
(count)--; \
|
|
|
|
if ((count) == 0) return; \
|
|
|
|
}
|
|
|
|
#else
|
|
|
|
#define CHECK_MAX_INSTRUCTIONS(count)
|
|
|
|
#endif
|
|
|
|
|
2006-04-29 11:12:13 +04:00
|
|
|
void BX_CPU_C::cpu_loop(Bit32u max_instr_count)
|
2001-04-10 05:04:59 +04:00
|
|
|
{
|
2002-09-19 23:17:20 +04:00
|
|
|
bxInstruction_c iStorage BX_CPP_AlignN(32);
|
2002-09-22 05:52:21 +04:00
|
|
|
|
2001-04-10 05:04:59 +04:00
|
|
|
#if BX_DEBUGGER
|
|
|
|
BX_CPU_THIS_PTR break_point = 0;
|
2004-01-29 20:49:03 +03:00
|
|
|
#if BX_MAGIC_BREAKPOINT
|
2001-04-10 05:04:59 +04:00
|
|
|
BX_CPU_THIS_PTR magic_break = 0;
|
|
|
|
#endif
|
|
|
|
BX_CPU_THIS_PTR stop_reason = STOP_NO_REASON;
|
|
|
|
#endif
|
|
|
|
|
2006-03-14 21:11:22 +03:00
|
|
|
if (setjmp(BX_CPU_THIS_PTR jmp_buf_env))
|
2002-09-29 18:16:30 +04:00
|
|
|
{
|
2007-09-26 22:07:39 +04:00
|
|
|
// only from exception function we can get here ...
|
2003-02-13 18:04:11 +03:00
|
|
|
BX_INSTR_NEW_INSTRUCTION(BX_CPU_ID);
|
2007-09-26 22:07:39 +04:00
|
|
|
#if BX_DEBUGGER || BX_EXTERNAL_DEBUGGER || BX_GDBSTUB
|
|
|
|
if (dbg_instruction_epilog()) return;
|
|
|
|
#endif
|
|
|
|
CHECK_MAX_INSTRUCTIONS(max_instr_count);
|
2005-04-12 22:08:10 +04:00
|
|
|
#if BX_GDBSTUB
|
2007-11-28 01:12:45 +03:00
|
|
|
if (bx_dbg.gdbstub_enabled) return;
|
2002-09-29 18:16:30 +04:00
|
|
|
#endif
|
2005-04-12 22:08:10 +04:00
|
|
|
}
|
2001-04-10 05:04:59 +04:00
|
|
|
|
2002-10-07 02:08:18 +04:00
|
|
|
#if BX_DEBUGGER
|
|
|
|
// If the exception() routine has encountered a nasty fault scenario,
|
|
|
|
// the debugger may request that control is returned to it so that
|
|
|
|
// the situation may be examined.
|
2006-06-12 23:51:31 +04:00
|
|
|
if (bx_guard.interrupt_requested) {
|
|
|
|
BX_ERROR(("CPU_LOOP bx_guard.interrupt_requested=%d", bx_guard.interrupt_requested));
|
2002-10-07 02:08:18 +04:00
|
|
|
return;
|
2005-03-11 00:22:15 +03:00
|
|
|
}
|
2002-10-07 02:08:18 +04:00
|
|
|
#endif
|
|
|
|
|
2002-09-02 22:44:35 +04:00
|
|
|
// We get here either by a normal function call, or by a longjmp
|
|
|
|
// back from an exception() call. In either case, commit the
|
|
|
|
// new EIP/ESP, and set up other environmental fields. This code
|
|
|
|
// mirrors similar code below, after the interrupt() call.
|
2007-11-24 17:22:34 +03:00
|
|
|
BX_CPU_THIS_PTR prev_rip = RIP; // commit new EIP
|
|
|
|
BX_CPU_THIS_PTR speculative_rsp = 0;
|
2001-04-10 05:04:59 +04:00
|
|
|
BX_CPU_THIS_PTR EXT = 0;
|
|
|
|
BX_CPU_THIS_PTR errorno = 0;
|
|
|
|
|
2002-10-04 20:26:10 +04:00
|
|
|
while (1) {
|
2002-09-02 22:44:35 +04:00
|
|
|
|
2007-12-14 23:41:09 +03:00
|
|
|
#if BX_SUPPORT_TRACE_CACHE
|
|
|
|
// clear stop trace magic indication that probably was set by branch32/64
|
|
|
|
BX_CPU_THIS_PTR async_event &= ~BX_ASYNC_EVENT_STOP_TRACE;
|
|
|
|
#endif
|
|
|
|
|
2006-05-24 20:46:57 +04:00
|
|
|
// First check on events which occurred for previous instructions
|
|
|
|
// (traps) and ones which are asynchronous to the CPU
|
|
|
|
// (hardware interrupts).
|
|
|
|
if (BX_CPU_THIS_PTR async_event) {
|
|
|
|
if (handleAsyncEvent()) {
|
|
|
|
// If request to return to caller ASAP.
|
|
|
|
return;
|
|
|
|
}
|
2002-10-04 20:26:10 +04:00
|
|
|
}
|
2001-04-10 05:04:59 +04:00
|
|
|
|
2006-05-24 20:46:57 +04:00
|
|
|
bx_address eipBiased = RIP + BX_CPU_THIS_PTR eipPageBias;
|
2002-09-02 22:44:35 +04:00
|
|
|
|
2006-05-24 20:46:57 +04:00
|
|
|
if (eipBiased >= BX_CPU_THIS_PTR eipPageWindowSize) {
|
|
|
|
prefetch();
|
|
|
|
eipBiased = RIP + BX_CPU_THIS_PTR eipPageBias;
|
|
|
|
}
|
2001-04-10 05:04:59 +04:00
|
|
|
|
2008-01-05 13:21:25 +03:00
|
|
|
|
2007-12-09 21:36:05 +03:00
|
|
|
#if BX_SUPPORT_TRACE_CACHE == 0
|
|
|
|
// fetch and decode single instruction
|
2006-05-24 20:46:57 +04:00
|
|
|
bxInstruction_c *i = fetchInstruction(&iStorage, eipBiased);
|
2007-12-09 21:36:05 +03:00
|
|
|
#else
|
|
|
|
unsigned n, length = 1;
|
2008-01-05 13:21:25 +03:00
|
|
|
bxInstruction_c *i = fetchInstructionTrace(&iStorage, &length, eipBiased);
|
2007-12-09 21:36:05 +03:00
|
|
|
Bit32u currPageWriteStamp = *(BX_CPU_THIS_PTR currPageWriteStampPtr);
|
|
|
|
|
2008-01-05 13:45:05 +03:00
|
|
|
for(;;i++) {
|
2007-12-09 21:36:05 +03:00
|
|
|
#endif
|
2007-11-12 21:20:15 +03:00
|
|
|
|
2007-12-09 21:36:05 +03:00
|
|
|
BX_CPU_CALL_METHODR(i->ResolveModrm, (i));
|
2005-02-05 23:56:44 +03:00
|
|
|
|
2007-12-09 21:36:05 +03:00
|
|
|
// An instruction will have been fetched using either the normal case,
|
|
|
|
// or the boundary fetch (across pages), by this point.
|
|
|
|
BX_INSTR_FETCH_DECODE_COMPLETED(BX_CPU_ID, i);
|
2002-12-20 16:36:50 +03:00
|
|
|
|
2007-03-06 20:47:18 +03:00
|
|
|
#if BX_DEBUGGER || BX_EXTERNAL_DEBUGGER || BX_GDBSTUB
|
2007-12-09 21:36:05 +03:00
|
|
|
if (dbg_instruction_prolog()) return;
|
2006-05-16 20:47:00 +04:00
|
|
|
#endif
|
|
|
|
|
2006-04-05 21:31:35 +04:00
|
|
|
#if BX_DISASM
|
2007-12-09 21:36:05 +03:00
|
|
|
if (BX_CPU_THIS_PTR trace) {
|
|
|
|
// print the instruction that is about to be executed
|
|
|
|
debug_disasm_instruction(BX_CPU_THIS_PTR prev_rip);
|
|
|
|
}
|
2005-12-12 22:54:48 +03:00
|
|
|
#endif
|
2002-02-16 01:58:06 +03:00
|
|
|
|
2007-12-09 21:36:05 +03:00
|
|
|
// decoding instruction compeleted -> continue with execution
|
|
|
|
BX_INSTR_BEFORE_EXECUTION(BX_CPU_ID, i);
|
|
|
|
RIP += i->ilen();
|
|
|
|
BX_CPU_CALL_METHOD(i->execute, (i)); // might iterate repeat instruction
|
|
|
|
BX_CPU_THIS_PTR prev_rip = RIP; // commit new RIP
|
|
|
|
BX_INSTR_AFTER_EXECUTION(BX_CPU_ID, i);
|
|
|
|
BX_TICK1_IF_SINGLE_PROCESSOR();
|
2006-06-24 22:27:11 +04:00
|
|
|
|
2007-12-09 21:36:05 +03:00
|
|
|
// inform instrumentation about new instruction
|
|
|
|
BX_INSTR_NEW_INSTRUCTION(BX_CPU_ID);
|
2002-09-28 04:54:05 +04:00
|
|
|
|
2007-12-09 21:36:05 +03:00
|
|
|
// note instructions generating exceptions never reach this point
|
2007-03-06 20:47:18 +03:00
|
|
|
#if BX_DEBUGGER || BX_EXTERNAL_DEBUGGER || BX_GDBSTUB
|
2007-12-09 21:36:05 +03:00
|
|
|
if (dbg_instruction_epilog()) return;
|
2006-04-29 11:12:13 +04:00
|
|
|
#endif
|
|
|
|
|
2007-12-09 21:36:05 +03:00
|
|
|
CHECK_MAX_INSTRUCTIONS(max_instr_count);
|
|
|
|
|
|
|
|
#if BX_SUPPORT_TRACE_CACHE
|
2008-01-05 13:45:05 +03:00
|
|
|
if (--length == 0) break;
|
|
|
|
|
2007-12-09 21:36:05 +03:00
|
|
|
if (currPageWriteStamp != *(BX_CPU_THIS_PTR currPageWriteStampPtr))
|
|
|
|
break; // probably it is self modifying code ...
|
|
|
|
|
|
|
|
if (BX_CPU_THIS_PTR async_event) break;
|
|
|
|
}
|
|
|
|
#endif
|
2002-10-04 20:26:10 +04:00
|
|
|
} // while (1)
|
|
|
|
}
|
2002-09-19 23:17:20 +04:00
|
|
|
|
2007-01-05 16:40:47 +03:00
|
|
|
void BX_CPU_C::repeat(bxInstruction_c *i, BxExecutePtr_t execute)
|
|
|
|
{
|
|
|
|
// non repeated instruction
|
|
|
|
if (! i->repUsedL()) {
|
|
|
|
BX_CPU_CALL_METHOD(execute, (i));
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
#if BX_SUPPORT_X86_64
|
2007-10-31 01:15:42 +03:00
|
|
|
if (i->as64L()) {
|
|
|
|
while(1) {
|
2007-01-05 16:40:47 +03:00
|
|
|
if (RCX != 0) {
|
|
|
|
BX_CPU_CALL_METHOD(execute, (i));
|
|
|
|
BX_INSTR_REPEAT_ITERATION(BX_CPU_ID, i);
|
|
|
|
RCX --;
|
|
|
|
}
|
|
|
|
if (RCX == 0) return;
|
2007-10-31 01:15:42 +03:00
|
|
|
|
|
|
|
BX_TICK1_IF_SINGLE_PROCESSOR();
|
|
|
|
|
|
|
|
#if BX_DEBUGGER == 0
|
|
|
|
if (BX_CPU_THIS_PTR async_event)
|
|
|
|
#endif
|
|
|
|
break; // exit always if debugger enabled
|
2007-01-05 16:40:47 +03:00
|
|
|
}
|
2007-10-31 01:15:42 +03:00
|
|
|
}
|
|
|
|
else
|
2007-01-05 16:40:47 +03:00
|
|
|
#endif
|
2007-10-31 01:15:42 +03:00
|
|
|
if (i->as32L()) {
|
|
|
|
while(1) {
|
2007-01-05 16:40:47 +03:00
|
|
|
if (ECX != 0) {
|
|
|
|
BX_CPU_CALL_METHOD(execute, (i));
|
|
|
|
BX_INSTR_REPEAT_ITERATION(BX_CPU_ID, i);
|
2007-09-25 20:11:32 +04:00
|
|
|
RCX = ECX - 1;
|
2007-01-05 16:40:47 +03:00
|
|
|
}
|
|
|
|
if (ECX == 0) return;
|
2007-10-31 01:15:42 +03:00
|
|
|
|
|
|
|
BX_TICK1_IF_SINGLE_PROCESSOR();
|
|
|
|
|
|
|
|
#if BX_DEBUGGER == 0
|
|
|
|
if (BX_CPU_THIS_PTR async_event)
|
|
|
|
#endif
|
|
|
|
break; // exit always if debugger enabled
|
2007-01-05 16:40:47 +03:00
|
|
|
}
|
2007-10-31 01:15:42 +03:00
|
|
|
}
|
|
|
|
else // 16bit addrsize
|
|
|
|
{
|
|
|
|
while(1) {
|
2007-01-05 16:40:47 +03:00
|
|
|
if (CX != 0) {
|
|
|
|
BX_CPU_CALL_METHOD(execute, (i));
|
|
|
|
BX_INSTR_REPEAT_ITERATION(BX_CPU_ID, i);
|
|
|
|
CX --;
|
|
|
|
}
|
|
|
|
if (CX == 0) return;
|
|
|
|
|
2007-10-31 01:15:42 +03:00
|
|
|
BX_TICK1_IF_SINGLE_PROCESSOR();
|
2007-01-05 16:40:47 +03:00
|
|
|
|
|
|
|
#if BX_DEBUGGER == 0
|
2007-10-31 01:15:42 +03:00
|
|
|
if (BX_CPU_THIS_PTR async_event)
|
2007-01-05 16:40:47 +03:00
|
|
|
#endif
|
2007-10-31 01:15:42 +03:00
|
|
|
break; // exit always if debugger enabled
|
|
|
|
}
|
2007-01-05 16:40:47 +03:00
|
|
|
}
|
|
|
|
|
2007-11-24 17:22:34 +03:00
|
|
|
RIP = BX_CPU_THIS_PTR prev_rip; // repeat loop not done, restore RIP
|
2007-01-05 16:40:47 +03:00
|
|
|
}
|
|
|
|
|
|
|
|
void BX_CPU_C::repeat_ZFL(bxInstruction_c *i, BxExecutePtr_t execute)
|
|
|
|
{
|
|
|
|
// non repeated instruction
|
|
|
|
if (! i->repUsedL()) {
|
|
|
|
BX_CPU_CALL_METHOD(execute, (i));
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
2007-11-13 20:30:54 +03:00
|
|
|
unsigned rep = i->repUsedValue();
|
|
|
|
|
2007-01-05 16:40:47 +03:00
|
|
|
#if BX_SUPPORT_X86_64
|
2007-10-31 01:15:42 +03:00
|
|
|
if (i->as64L()) {
|
|
|
|
while(1) {
|
2007-01-05 16:40:47 +03:00
|
|
|
if (RCX != 0) {
|
|
|
|
BX_CPU_CALL_METHOD(execute, (i));
|
|
|
|
BX_INSTR_REPEAT_ITERATION(BX_CPU_ID, i);
|
|
|
|
RCX --;
|
|
|
|
}
|
2007-11-13 20:30:54 +03:00
|
|
|
if (rep==3 && get_ZF()==0) return;
|
|
|
|
if (rep==2 && get_ZF()!=0) return;
|
2007-01-05 16:40:47 +03:00
|
|
|
if (RCX == 0) return;
|
2007-10-31 01:15:42 +03:00
|
|
|
|
|
|
|
BX_TICK1_IF_SINGLE_PROCESSOR();
|
|
|
|
|
|
|
|
#if BX_DEBUGGER == 0
|
|
|
|
if (BX_CPU_THIS_PTR async_event)
|
|
|
|
#endif
|
|
|
|
break; // exit always if debugger enabled
|
2007-01-05 16:40:47 +03:00
|
|
|
}
|
2007-10-31 01:15:42 +03:00
|
|
|
}
|
|
|
|
else
|
2007-01-05 16:40:47 +03:00
|
|
|
#endif
|
2007-10-31 01:15:42 +03:00
|
|
|
if (i->as32L()) {
|
|
|
|
while(1) {
|
2007-01-05 16:40:47 +03:00
|
|
|
if (ECX != 0) {
|
|
|
|
BX_CPU_CALL_METHOD(execute, (i));
|
|
|
|
BX_INSTR_REPEAT_ITERATION(BX_CPU_ID, i);
|
2007-09-25 20:11:32 +04:00
|
|
|
RCX = ECX - 1;
|
2007-01-05 16:40:47 +03:00
|
|
|
}
|
2007-11-13 20:30:54 +03:00
|
|
|
if (rep==3 && get_ZF()==0) return;
|
|
|
|
if (rep==2 && get_ZF()!=0) return;
|
2007-01-05 16:40:47 +03:00
|
|
|
if (ECX == 0) return;
|
2007-10-31 01:15:42 +03:00
|
|
|
|
|
|
|
BX_TICK1_IF_SINGLE_PROCESSOR();
|
|
|
|
|
|
|
|
#if BX_DEBUGGER == 0
|
|
|
|
if (BX_CPU_THIS_PTR async_event)
|
|
|
|
#endif
|
|
|
|
break; // exit always if debugger enabled
|
2007-01-05 16:40:47 +03:00
|
|
|
}
|
2007-10-31 01:15:42 +03:00
|
|
|
}
|
|
|
|
else // 16bit addrsize
|
|
|
|
{
|
|
|
|
while(1) {
|
2007-01-05 16:40:47 +03:00
|
|
|
if (CX != 0) {
|
|
|
|
BX_CPU_CALL_METHOD(execute, (i));
|
|
|
|
BX_INSTR_REPEAT_ITERATION(BX_CPU_ID, i);
|
|
|
|
CX --;
|
|
|
|
}
|
2007-11-13 20:30:54 +03:00
|
|
|
if (rep==3 && get_ZF()==0) return;
|
|
|
|
if (rep==2 && get_ZF()!=0) return;
|
2007-01-05 16:40:47 +03:00
|
|
|
if (CX == 0) return;
|
|
|
|
|
2007-10-31 01:15:42 +03:00
|
|
|
BX_TICK1_IF_SINGLE_PROCESSOR();
|
2007-01-05 16:40:47 +03:00
|
|
|
|
|
|
|
#if BX_DEBUGGER == 0
|
2007-10-31 01:15:42 +03:00
|
|
|
if (BX_CPU_THIS_PTR async_event)
|
2007-01-05 16:40:47 +03:00
|
|
|
#endif
|
2007-10-31 01:15:42 +03:00
|
|
|
break; // exit always if debugger enabled
|
|
|
|
}
|
2007-01-05 16:40:47 +03:00
|
|
|
}
|
|
|
|
|
2007-11-24 17:22:34 +03:00
|
|
|
RIP = BX_CPU_THIS_PTR prev_rip; // repeat loop not done, restore RIP
|
2007-01-05 16:40:47 +03:00
|
|
|
}
|
|
|
|
|
2005-02-12 17:00:13 +03:00
|
|
|
unsigned BX_CPU_C::handleAsyncEvent(void)
|
2002-10-04 20:26:10 +04:00
|
|
|
{
|
2001-04-10 05:04:59 +04:00
|
|
|
//
|
|
|
|
// This area is where we process special conditions and events.
|
|
|
|
//
|
2007-11-01 21:03:48 +03:00
|
|
|
if (BX_CPU_THIS_PTR debug_trap & BX_DEBUG_TRAP_SPECIAL) {
|
2001-04-10 05:04:59 +04:00
|
|
|
// I made up the bitmask above to mean HALT state.
|
2001-06-05 19:56:19 +04:00
|
|
|
// for one processor, pass the time as quickly as possible until
|
|
|
|
// an interrupt wakes up the CPU.
|
2002-04-01 17:14:37 +04:00
|
|
|
#if BX_DEBUGGER
|
2002-09-14 07:01:05 +04:00
|
|
|
while (bx_guard.interrupt_requested != 1)
|
2002-04-01 17:14:37 +04:00
|
|
|
#else
|
2002-09-14 07:01:05 +04:00
|
|
|
while (1)
|
2002-04-01 17:14:37 +04:00
|
|
|
#endif
|
2005-02-12 17:00:13 +03:00
|
|
|
{
|
2007-11-01 21:03:48 +03:00
|
|
|
if ((BX_CPU_INTR && (BX_CPU_THIS_PTR get_IF() || (BX_CPU_THIS_PTR debug_trap & BX_DEBUG_TRAP_MWAIT_IF))) ||
|
2006-03-16 23:24:09 +03:00
|
|
|
BX_CPU_THIS_PTR nmi_pending || BX_CPU_THIS_PTR smi_pending)
|
|
|
|
{
|
|
|
|
// interrupt ends the HALT condition
|
2007-11-01 21:03:48 +03:00
|
|
|
#if BX_SUPPORT_MONITOR_MWAIT
|
|
|
|
if (BX_CPU_THIS_PTR debug_trap & BX_DEBUG_TRAP_MWAIT)
|
2007-11-01 23:43:53 +03:00
|
|
|
BX_CPU_THIS_PTR mem->clear_monitor(BX_CPU_THIS_PTR bx_cpuid);
|
2007-11-01 21:03:48 +03:00
|
|
|
#endif
|
2006-04-10 23:05:21 +04:00
|
|
|
BX_CPU_THIS_PTR debug_trap = 0; // clear traps for after resume
|
|
|
|
BX_CPU_THIS_PTR inhibit_mask = 0; // clear inhibits for after resume
|
2001-06-05 19:56:19 +04:00
|
|
|
break;
|
2005-02-12 17:00:13 +03:00
|
|
|
}
|
2007-11-01 21:03:48 +03:00
|
|
|
if ((BX_CPU_THIS_PTR debug_trap & BX_DEBUG_TRAP_SPECIAL) == 0) {
|
2006-04-10 23:05:21 +04:00
|
|
|
BX_INFO(("handleAsyncEvent: reset detected in HLT state"));
|
2002-09-12 11:16:37 +04:00
|
|
|
break;
|
2002-09-14 07:01:05 +04:00
|
|
|
}
|
2007-12-08 12:26:13 +03:00
|
|
|
// for multiprocessor simulation, even if this CPU is halted we still
|
|
|
|
// must give the others a chance to simulate. If an interrupt has
|
|
|
|
// arrived, then clear the HALT condition; otherwise just return from
|
|
|
|
// the CPU loop with stop_reason STOP_CPU_HALTED.
|
|
|
|
#if BX_SUPPORT_SMP
|
|
|
|
if (BX_SMP_PROCESSORS > 1) {
|
|
|
|
// HALT condition remains, return so other CPUs have a chance
|
2001-05-23 12:16:07 +04:00
|
|
|
#if BX_DEBUGGER
|
2007-12-08 12:26:13 +03:00
|
|
|
BX_CPU_THIS_PTR stop_reason = STOP_CPU_HALTED;
|
2001-05-23 12:16:07 +04:00
|
|
|
#endif
|
2007-12-08 12:26:13 +03:00
|
|
|
return 1; // Return to caller of cpu_loop.
|
|
|
|
}
|
2001-06-05 19:56:19 +04:00
|
|
|
#endif
|
2007-12-08 12:26:13 +03:00
|
|
|
BX_TICK1();
|
|
|
|
}
|
2006-03-14 21:11:22 +03:00
|
|
|
} else if (bx_pc_system.kill_bochs_request) {
|
2002-04-18 04:22:20 +04:00
|
|
|
// setting kill_bochs_request causes the cpu loop to return ASAP.
|
2002-10-05 18:51:25 +04:00
|
|
|
return 1; // Return to caller of cpu_loop.
|
2001-05-23 12:16:07 +04:00
|
|
|
}
|
|
|
|
|
2001-04-10 05:04:59 +04:00
|
|
|
// Priority 1: Hardware Reset and Machine Checks
|
|
|
|
// RESET
|
|
|
|
// Machine Check
|
|
|
|
// (bochs doesn't support these)
|
|
|
|
|
|
|
|
// Priority 2: Trap on Task Switch
|
|
|
|
// T flag in TSS is set
|
|
|
|
if (BX_CPU_THIS_PTR debug_trap & 0x00008000) {
|
|
|
|
BX_CPU_THIS_PTR dr6 |= BX_CPU_THIS_PTR debug_trap;
|
|
|
|
exception(BX_DB_EXCEPTION, 0, 0); // no error, not interrupt
|
2005-02-12 17:00:13 +03:00
|
|
|
}
|
2001-04-10 05:04:59 +04:00
|
|
|
|
|
|
|
// Priority 3: External Hardware Interventions
|
|
|
|
// FLUSH
|
|
|
|
// STOPCLK
|
|
|
|
// SMI
|
|
|
|
// INIT
|
|
|
|
// (bochs doesn't support these)
|
2006-02-14 23:03:14 +03:00
|
|
|
if (BX_CPU_THIS_PTR smi_pending && ! BX_CPU_THIS_PTR smm_mode())
|
2006-02-14 22:00:08 +03:00
|
|
|
{
|
2006-04-05 21:31:35 +04:00
|
|
|
// clear SMI pending flag and disable NMI when SMM was accepted
|
2006-03-16 23:24:09 +03:00
|
|
|
BX_CPU_THIS_PTR smi_pending = 0;
|
|
|
|
BX_CPU_THIS_PTR nmi_disable = 1;
|
2006-04-05 21:31:35 +04:00
|
|
|
enter_system_management_mode();
|
2006-02-14 22:00:08 +03:00
|
|
|
}
|
2001-04-10 05:04:59 +04:00
|
|
|
|
|
|
|
// Priority 4: Traps on Previous Instruction
|
|
|
|
// Breakpoints
|
|
|
|
// Debug Trap Exceptions (TF flag set or data/IO breakpoint)
|
2006-02-14 22:00:08 +03:00
|
|
|
if (BX_CPU_THIS_PTR debug_trap &&
|
|
|
|
!(BX_CPU_THIS_PTR inhibit_mask & BX_INHIBIT_DEBUG))
|
2005-02-12 17:00:13 +03:00
|
|
|
{
|
2001-04-10 05:04:59 +04:00
|
|
|
// A trap may be inhibited on this boundary due to an instruction
|
|
|
|
// which loaded SS. If so we clear the inhibit_mask below
|
|
|
|
// and don't execute this code until the next boundary.
|
|
|
|
// Commit debug events to DR6
|
|
|
|
BX_CPU_THIS_PTR dr6 |= BX_CPU_THIS_PTR debug_trap;
|
|
|
|
exception(BX_DB_EXCEPTION, 0, 0); // no error, not interrupt
|
2005-02-12 17:00:13 +03:00
|
|
|
}
|
2001-04-10 05:04:59 +04:00
|
|
|
|
|
|
|
// Priority 5: External Interrupts
|
|
|
|
// NMI Interrupts
|
|
|
|
// Maskable Hardware Interrupts
|
|
|
|
if (BX_CPU_THIS_PTR inhibit_mask & BX_INHIBIT_INTERRUPTS) {
|
|
|
|
// Processing external interrupts is inhibited on this
|
|
|
|
// boundary because of certain instructions like STI.
|
|
|
|
// inhibit_mask is cleared below, in which case we will have
|
|
|
|
// an opportunity to check interrupts on the next instruction
|
|
|
|
// boundary.
|
2005-02-12 17:00:13 +03:00
|
|
|
}
|
2006-03-16 23:24:09 +03:00
|
|
|
else if (BX_CPU_THIS_PTR nmi_pending) {
|
|
|
|
BX_CPU_THIS_PTR nmi_pending = 0;
|
|
|
|
BX_CPU_THIS_PTR nmi_disable = 1;
|
|
|
|
BX_CPU_THIS_PTR errorno = 0;
|
|
|
|
BX_CPU_THIS_PTR EXT = 1; /* external event */
|
|
|
|
BX_INSTR_HWINTERRUPT(BX_CPU_ID, 2, BX_CPU_THIS_PTR sregs[BX_SEG_REG_CS].selector.value, RIP);
|
2006-05-26 21:24:36 +04:00
|
|
|
interrupt(2, 0, 0, 0);
|
2006-03-16 23:24:09 +03:00
|
|
|
}
|
2006-02-14 22:00:08 +03:00
|
|
|
else if (BX_CPU_INTR && BX_CPU_THIS_PTR get_IF() && BX_DBG_ASYNC_INTR)
|
2005-02-12 17:00:13 +03:00
|
|
|
{
|
2001-04-10 05:04:59 +04:00
|
|
|
Bit8u vector;
|
|
|
|
|
|
|
|
// NOTE: similar code in ::take_irq()
|
2001-06-12 17:07:43 +04:00
|
|
|
#if BX_SUPPORT_APIC
|
2002-10-05 14:25:31 +04:00
|
|
|
if (BX_CPU_THIS_PTR local_apic.INTR)
|
2006-06-03 16:59:14 +04:00
|
|
|
vector = BX_CPU_THIS_PTR local_apic.acknowledge_int();
|
2001-05-23 12:16:07 +04:00
|
|
|
else
|
|
|
|
#endif
|
2007-12-04 00:43:14 +03:00
|
|
|
// if no local APIC, always acknowledge the PIC.
|
|
|
|
vector = DEV_pic_iac(); // may set INTR with next interrupt
|
2001-04-10 05:04:59 +04:00
|
|
|
BX_CPU_THIS_PTR errorno = 0;
|
2006-02-01 21:12:08 +03:00
|
|
|
BX_CPU_THIS_PTR EXT = 1; /* external event */
|
2003-02-13 18:04:11 +03:00
|
|
|
BX_INSTR_HWINTERRUPT(BX_CPU_ID, vector,
|
2006-03-16 23:24:09 +03:00
|
|
|
BX_CPU_THIS_PTR sregs[BX_SEG_REG_CS].selector.value, RIP);
|
2006-05-26 21:24:36 +04:00
|
|
|
interrupt(vector, 0, 0, 0);
|
2002-09-02 22:44:35 +04:00
|
|
|
// Set up environment, as would be when this main cpu loop gets
|
|
|
|
// invoked. At the end of normal instructions, we always commmit
|
|
|
|
// the new EIP/ESP values. But here, we call interrupt() much like
|
|
|
|
// it was a sofware interrupt instruction, and need to effect the
|
|
|
|
// commit here. This code mirrors similar code above.
|
2007-11-24 17:22:34 +03:00
|
|
|
BX_CPU_THIS_PTR prev_rip = RIP; // commit new RIP
|
|
|
|
BX_CPU_THIS_PTR speculative_rsp = 0;
|
2002-09-02 22:44:35 +04:00
|
|
|
BX_CPU_THIS_PTR EXT = 0;
|
|
|
|
BX_CPU_THIS_PTR errorno = 0;
|
2005-02-12 17:00:13 +03:00
|
|
|
}
|
2001-04-10 05:04:59 +04:00
|
|
|
else if (BX_HRQ && BX_DBG_ASYNC_DMA) {
|
|
|
|
// NOTE: similar code in ::take_dma()
|
|
|
|
// assert Hold Acknowledge (HLDA) and go into a bus hold state
|
2002-10-25 01:07:56 +04:00
|
|
|
DEV_dma_raise_hlda();
|
2005-02-12 17:00:13 +03:00
|
|
|
}
|
2001-04-10 05:04:59 +04:00
|
|
|
|
|
|
|
// Priority 6: Faults from fetching next instruction
|
|
|
|
// Code breakpoint fault
|
|
|
|
// Code segment limit violation (priority 7 on 486/Pentium)
|
|
|
|
// Code page fault (priority 7 on 486/Pentium)
|
|
|
|
// (handled in main decode loop)
|
|
|
|
|
|
|
|
// Priority 7: Faults from decoding next instruction
|
|
|
|
// Instruction length > 15 bytes
|
|
|
|
// Illegal opcode
|
|
|
|
// Coprocessor not available
|
|
|
|
// (handled in main decode loop etc)
|
|
|
|
|
|
|
|
// Priority 8: Faults on executing an instruction
|
|
|
|
// Floating point execution
|
|
|
|
// Overflow
|
|
|
|
// Bound error
|
|
|
|
// Invalid TSS
|
|
|
|
// Segment not present
|
|
|
|
// Stack fault
|
|
|
|
// General protection
|
|
|
|
// Data page fault
|
|
|
|
// Alignment check
|
|
|
|
// (handled by rest of the code)
|
|
|
|
|
2006-03-16 23:24:09 +03:00
|
|
|
if (BX_CPU_THIS_PTR get_TF())
|
2005-02-12 17:00:13 +03:00
|
|
|
{
|
2001-04-10 05:04:59 +04:00
|
|
|
// TF is set before execution of next instruction. Schedule
|
|
|
|
// a debug trap (#DB) after execution. After completion of
|
|
|
|
// next instruction, the code above will invoke the trap.
|
|
|
|
BX_CPU_THIS_PTR debug_trap |= 0x00004000; // BS flag in DR6
|
2005-02-12 17:00:13 +03:00
|
|
|
}
|
2001-04-10 05:04:59 +04:00
|
|
|
|
2002-09-20 07:52:59 +04:00
|
|
|
// Now we can handle things which are synchronous to instruction
|
|
|
|
// execution.
|
2006-03-16 23:24:09 +03:00
|
|
|
if (BX_CPU_THIS_PTR get_RF()) {
|
|
|
|
BX_CPU_THIS_PTR clear_RF();
|
2005-02-12 17:00:13 +03:00
|
|
|
}
|
2002-09-20 07:52:59 +04:00
|
|
|
#if BX_X86_DEBUGGER
|
|
|
|
else {
|
|
|
|
// only bother comparing if any breakpoints enabled
|
2006-03-16 23:24:09 +03:00
|
|
|
if (BX_CPU_THIS_PTR dr7 & 0x000000ff) {
|
2007-11-24 17:22:34 +03:00
|
|
|
bx_address iaddr = BX_CPU_THIS_PTR get_segment_base(BX_SEG_REG_CS) + BX_CPU_THIS_PTR prev_rip;
|
2006-05-13 16:49:45 +04:00
|
|
|
Bit32u dr6_bits = hwdebug_compare(iaddr, 1, BX_HWDebugInstruction, BX_HWDebugInstruction);
|
|
|
|
if (dr6_bits)
|
2005-02-12 17:00:13 +03:00
|
|
|
{
|
2002-09-20 07:52:59 +04:00
|
|
|
// Add to the list of debug events thus far.
|
|
|
|
BX_CPU_THIS_PTR async_event = 1;
|
2003-08-04 20:03:09 +04:00
|
|
|
BX_CPU_THIS_PTR debug_trap |= dr6_bits;
|
2002-09-20 07:52:59 +04:00
|
|
|
// If debug events are not inhibited on this boundary,
|
|
|
|
// fire off a debug fault. Otherwise handle it on the next
|
|
|
|
// boundary. (becomes a trap)
|
2006-05-13 16:49:45 +04:00
|
|
|
if (! (BX_CPU_THIS_PTR inhibit_mask & BX_INHIBIT_DEBUG)) {
|
2002-09-20 07:52:59 +04:00
|
|
|
// Commit debug events to DR6
|
|
|
|
BX_CPU_THIS_PTR dr6 = BX_CPU_THIS_PTR debug_trap;
|
|
|
|
exception(BX_DB_EXCEPTION, 0, 0); // no error, not interrupt
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2005-02-12 17:00:13 +03:00
|
|
|
}
|
2002-09-20 07:52:59 +04:00
|
|
|
#endif
|
|
|
|
|
|
|
|
// We have ignored processing of external interrupts and
|
|
|
|
// debug events on this boundary. Reset the mask so they
|
|
|
|
// will be processed on the next boundary.
|
|
|
|
BX_CPU_THIS_PTR inhibit_mask = 0;
|
|
|
|
|
2002-10-05 14:25:31 +04:00
|
|
|
if ( !(BX_CPU_INTR ||
|
2001-04-10 05:04:59 +04:00
|
|
|
BX_CPU_THIS_PTR debug_trap ||
|
|
|
|
BX_HRQ ||
|
2006-03-16 23:24:09 +03:00
|
|
|
BX_CPU_THIS_PTR get_TF()
|
2003-08-04 20:03:09 +04:00
|
|
|
#if BX_X86_DEBUGGER
|
|
|
|
|| (BX_CPU_THIS_PTR dr7 & 0xff)
|
|
|
|
#endif
|
|
|
|
))
|
2001-04-10 05:04:59 +04:00
|
|
|
BX_CPU_THIS_PTR async_event = 0;
|
2002-10-05 18:51:25 +04:00
|
|
|
|
|
|
|
return 0; // Continue executing cpu_loop.
|
2001-04-10 05:04:59 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
// boundaries of consideration:
|
|
|
|
//
|
|
|
|
// * physical memory boundary: 1024k (1Megabyte) (increments of...)
|
|
|
|
// * A20 boundary: 1024k (1Megabyte)
|
|
|
|
// * page boundary: 4k
|
|
|
|
// * ROM boundary: 2k (dont care since we are only reading)
|
|
|
|
// * segment boundary: any
|
|
|
|
|
2005-02-12 17:00:13 +03:00
|
|
|
void BX_CPU_C::prefetch(void)
|
2001-04-10 05:04:59 +04:00
|
|
|
{
|
2005-08-05 22:23:36 +04:00
|
|
|
bx_address temp_rip = RIP;
|
|
|
|
bx_address laddr = BX_CPU_THIS_PTR get_segment_base(BX_SEG_REG_CS) + temp_rip;
|
2006-05-04 23:54:25 +04:00
|
|
|
bx_phy_address pAddr;
|
|
|
|
|
|
|
|
// Calculate RIP at the beginning of the page.
|
2007-12-30 20:53:12 +03:00
|
|
|
BX_CPU_THIS_PTR eipPageBias = PAGE_OFFSET(laddr) - RIP;
|
2006-05-04 23:54:25 +04:00
|
|
|
BX_CPU_THIS_PTR eipPageWindowSize = 4096;
|
2005-08-05 22:23:36 +04:00
|
|
|
|
2005-12-10 00:21:29 +03:00
|
|
|
if (! Is64BitMode()) {
|
2005-08-05 22:23:36 +04:00
|
|
|
Bit32u temp_limit = BX_CPU_THIS_PTR sregs[BX_SEG_REG_CS].cache.u.segment.limit_scaled;
|
2006-03-04 12:22:55 +03:00
|
|
|
if (((Bit32u) temp_rip) > temp_limit) {
|
|
|
|
BX_ERROR(("prefetch: EIP [%08x] > CS.limit [%08x]", (Bit32u) temp_rip, temp_limit));
|
2005-08-05 22:23:36 +04:00
|
|
|
exception(BX_GP_EXCEPTION, 0, 0);
|
|
|
|
}
|
2006-05-04 23:54:25 +04:00
|
|
|
if (temp_limit + BX_CPU_THIS_PTR eipPageBias < 4096) {
|
|
|
|
BX_CPU_THIS_PTR eipPageWindowSize = temp_limit + BX_CPU_THIS_PTR eipPageBias + 1;
|
|
|
|
}
|
2005-02-05 23:56:44 +03:00
|
|
|
}
|
2001-04-10 05:04:59 +04:00
|
|
|
|
2007-07-09 19:16:14 +04:00
|
|
|
if (BX_CPU_THIS_PTR cr0.get_PG()) {
|
2001-04-10 05:04:59 +04:00
|
|
|
// aligned block guaranteed to be all in one page, same A20 address
|
2007-12-17 00:03:46 +03:00
|
|
|
pAddr = itranslate_linear(laddr, CPL);
|
2002-09-19 23:17:20 +04:00
|
|
|
pAddr = A20ADDR(pAddr);
|
2005-02-05 23:56:44 +03:00
|
|
|
}
|
2001-08-10 22:42:24 +04:00
|
|
|
else
|
2005-02-05 23:56:44 +03:00
|
|
|
{
|
2002-09-19 23:17:20 +04:00
|
|
|
pAddr = A20ADDR(laddr);
|
2005-02-05 23:56:44 +03:00
|
|
|
}
|
2001-04-10 05:04:59 +04:00
|
|
|
|
2002-09-19 23:17:20 +04:00
|
|
|
BX_CPU_THIS_PTR pAddrA20Page = pAddr & 0xfffff000;
|
2004-11-05 13:13:15 +03:00
|
|
|
BX_CPU_THIS_PTR eipFetchPtr =
|
2006-03-26 23:39:37 +04:00
|
|
|
BX_CPU_THIS_PTR mem->getHostMemAddr(BX_CPU_THIS,
|
|
|
|
BX_CPU_THIS_PTR pAddrA20Page, BX_READ, CODE_ACCESS);
|
2002-09-02 22:44:35 +04:00
|
|
|
|
|
|
|
// Sanity checks
|
2006-03-02 20:39:10 +03:00
|
|
|
if (! BX_CPU_THIS_PTR eipFetchPtr) {
|
|
|
|
if (pAddr >= BX_CPU_THIS_PTR mem->len) {
|
|
|
|
BX_PANIC(("prefetch: running in bogus memory, pAddr=0x%08x", pAddr));
|
2005-01-13 22:03:40 +03:00
|
|
|
}
|
2002-09-02 22:44:35 +04:00
|
|
|
else {
|
2005-01-13 22:03:40 +03:00
|
|
|
BX_PANIC(("prefetch: getHostMemAddr vetoed direct read, pAddr=0x%08x", pAddr));
|
2002-09-02 22:44:35 +04:00
|
|
|
}
|
2005-01-13 22:03:40 +03:00
|
|
|
}
|
2003-05-11 02:25:55 +04:00
|
|
|
|
2004-07-30 00:15:19 +04:00
|
|
|
#if BX_SUPPORT_ICACHE
|
2005-08-13 18:10:22 +04:00
|
|
|
BX_CPU_THIS_PTR currPageWriteStampPtr = pageWriteStampTable.getPageWriteStampPtr(pAddr);
|
|
|
|
Bit32u pageWriteStamp = *(BX_CPU_THIS_PTR currPageWriteStampPtr);
|
2006-02-28 20:47:33 +03:00
|
|
|
Bit32u fetchModeMask = BX_CPU_THIS_PTR fetchModeMask;
|
2004-11-19 02:16:36 +03:00
|
|
|
if ((pageWriteStamp & ICacheFetchModeMask) != fetchModeMask)
|
|
|
|
{
|
2003-05-11 02:25:55 +04:00
|
|
|
// The current CPU mode does not match iCache entries for this
|
|
|
|
// physical page.
|
|
|
|
pageWriteStamp &= ICacheWriteStampMask; // Clear out old fetch mode bits.
|
2004-11-19 02:16:36 +03:00
|
|
|
pageWriteStamp |= fetchModeMask; // Add in new ones.
|
2005-04-10 23:42:48 +04:00
|
|
|
pageWriteStampTable.setPageWriteStamp(pAddr, pageWriteStamp);
|
2004-11-19 02:16:36 +03:00
|
|
|
}
|
2003-05-21 19:48:55 +04:00
|
|
|
#endif
|
2001-04-10 05:04:59 +04:00
|
|
|
}
|
|
|
|
|
2005-02-12 17:00:13 +03:00
|
|
|
void BX_CPU_C::boundaryFetch(Bit8u *fetchPtr, unsigned remainingInPage, bxInstruction_c *i)
|
2002-09-22 05:52:21 +04:00
|
|
|
{
|
2005-11-27 00:36:51 +03:00
|
|
|
unsigned j;
|
|
|
|
Bit8u fetchBuffer[16]; // Really only need 15
|
|
|
|
unsigned ret;
|
2002-09-22 05:52:21 +04:00
|
|
|
|
2005-11-27 00:36:51 +03:00
|
|
|
if (remainingInPage >= 15) {
|
|
|
|
BX_INFO(("fetchDecode #GP(0): too many instruction prefixes"));
|
|
|
|
exception(BX_GP_EXCEPTION, 0, 0);
|
|
|
|
}
|
2002-09-22 05:52:21 +04:00
|
|
|
|
2005-11-27 00:36:51 +03:00
|
|
|
// Read all leftover bytes in current page up to boundary.
|
|
|
|
for (j=0; j<remainingInPage; j++) {
|
|
|
|
fetchBuffer[j] = *fetchPtr++;
|
|
|
|
}
|
2002-09-22 05:52:21 +04:00
|
|
|
|
2005-11-27 00:36:51 +03:00
|
|
|
// The 2nd chunk of the instruction is on the next page.
|
|
|
|
// Set RIP to the 0th byte of the 2nd page, and force a
|
|
|
|
// prefetch so direct access of that physical page is possible, and
|
|
|
|
// all the associated info is updated.
|
|
|
|
RIP += remainingInPage;
|
|
|
|
prefetch();
|
|
|
|
if (BX_CPU_THIS_PTR eipPageWindowSize < 15) {
|
|
|
|
BX_PANIC(("fetch_decode: small window size after prefetch"));
|
|
|
|
}
|
2002-09-22 05:52:21 +04:00
|
|
|
|
2005-11-27 00:36:51 +03:00
|
|
|
// We can fetch straight from the 0th byte, which is eipFetchPtr;
|
|
|
|
fetchPtr = BX_CPU_THIS_PTR eipFetchPtr;
|
2002-09-22 05:52:21 +04:00
|
|
|
|
2005-11-27 00:36:51 +03:00
|
|
|
// read leftover bytes in next page
|
|
|
|
for (; j<15; j++) {
|
|
|
|
fetchBuffer[j] = *fetchPtr++;
|
|
|
|
}
|
2002-09-22 05:52:21 +04:00
|
|
|
#if BX_SUPPORT_X86_64
|
2007-12-22 20:17:40 +03:00
|
|
|
if (BX_CPU_THIS_PTR cpu_mode == BX_MODE_LONG_64)
|
2005-11-27 00:36:51 +03:00
|
|
|
ret = fetchDecode64(fetchBuffer, i, 15);
|
|
|
|
else
|
2002-09-22 05:52:21 +04:00
|
|
|
#endif
|
2007-01-29 00:27:31 +03:00
|
|
|
ret = fetchDecode32(fetchBuffer, i, 15);
|
2005-02-05 23:56:44 +03:00
|
|
|
|
2005-11-27 00:36:51 +03:00
|
|
|
if (ret==0) {
|
2006-03-02 20:39:10 +03:00
|
|
|
BX_INFO(("fetchDecode #GP(0): too many instruction prefixes"));
|
2005-11-27 00:36:51 +03:00
|
|
|
exception(BX_GP_EXCEPTION, 0, 0);
|
|
|
|
}
|
2005-02-05 23:56:44 +03:00
|
|
|
|
2005-11-27 00:36:51 +03:00
|
|
|
// Restore EIP since we fudged it to start at the 2nd page boundary.
|
2007-11-24 17:22:34 +03:00
|
|
|
RIP = BX_CPU_THIS_PTR prev_rip;
|
2002-09-22 05:52:21 +04:00
|
|
|
|
2006-02-28 20:47:33 +03:00
|
|
|
// Since we cross an instruction boundary, note that we need a prefetch()
|
|
|
|
// again on the next instruction. Perhaps we can optimize this to
|
|
|
|
// eliminate the extra prefetch() since we do it above, but have to
|
|
|
|
// think about repeated instructions, etc.
|
|
|
|
invalidate_prefetch_q();
|
2002-09-28 04:54:05 +04:00
|
|
|
|
2003-02-13 18:04:11 +03:00
|
|
|
BX_INSTR_OPCODE(BX_CPU_ID, fetchBuffer, i->ilen(),
|
2005-11-14 21:25:41 +03:00
|
|
|
BX_CPU_THIS_PTR sregs[BX_SEG_REG_CS].cache.u.segment.d_b, Is64BitMode());
|
2002-09-22 05:52:21 +04:00
|
|
|
}
|
|
|
|
|
2006-04-08 00:47:32 +04:00
|
|
|
void BX_CPU_C::deliver_NMI(void)
|
|
|
|
{
|
|
|
|
BX_CPU_THIS_PTR nmi_pending = 1;
|
|
|
|
BX_CPU_THIS_PTR async_event = 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
void BX_CPU_C::deliver_SMI(void)
|
|
|
|
{
|
|
|
|
BX_CPU_THIS_PTR smi_pending = 1;
|
|
|
|
BX_CPU_THIS_PTR async_event = 1;
|
|
|
|
}
|
2002-09-22 05:52:21 +04:00
|
|
|
|
2002-11-04 08:27:26 +03:00
|
|
|
#if BX_EXTERNAL_DEBUGGER
|
2006-03-16 23:24:09 +03:00
|
|
|
void BX_CPU_C::ask(int level, const char *prefix, const char *fmt, va_list ap)
|
2002-09-14 07:01:05 +04:00
|
|
|
{
|
|
|
|
char buf1[1024];
|
|
|
|
vsprintf (buf1, fmt, ap);
|
|
|
|
printf ("%s %s\n", prefix, buf1);
|
|
|
|
trap_debugger(1);
|
|
|
|
}
|
2006-06-26 01:44:46 +04:00
|
|
|
#endif
|
2001-04-10 05:04:59 +04:00
|
|
|
|
2007-03-06 20:47:18 +03:00
|
|
|
#if BX_DEBUGGER || BX_EXTERNAL_DEBUGGER || BX_GDBSTUB
|
|
|
|
bx_bool BX_CPU_C::dbg_instruction_prolog(void)
|
|
|
|
{
|
|
|
|
#if BX_DEBUGGER
|
|
|
|
if(dbg_check_begin_instr_bpoint()) return 1;
|
|
|
|
#endif
|
|
|
|
|
|
|
|
#if BX_EXTERNAL_DEBUGGER
|
|
|
|
bx_external_debugger(BX_CPU_THIS);
|
|
|
|
#endif
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
bx_bool BX_CPU_C::dbg_instruction_epilog(void)
|
|
|
|
{
|
|
|
|
#if BX_DEBUGGER
|
|
|
|
if (dbg_check_end_instr_bpoint()) return 1;
|
|
|
|
#endif
|
|
|
|
|
|
|
|
#if BX_GDBSTUB
|
|
|
|
if (bx_dbg.gdbstub_enabled) {
|
|
|
|
unsigned reason = bx_gdbstub_check(EIP);
|
|
|
|
if (reason != GDBSTUB_STOP_NO_REASON) return 1;
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
#endif // BX_DEBUGGER || BX_EXTERNAL_DEBUGGER || BX_GDBSTUB
|
|
|
|
|
2001-04-10 05:04:59 +04:00
|
|
|
#if BX_DEBUGGER
|
2006-02-12 23:21:36 +03:00
|
|
|
extern unsigned dbg_show_mask;
|
2001-04-10 05:04:59 +04:00
|
|
|
|
2006-05-24 20:46:57 +04:00
|
|
|
bx_bool BX_CPU_C::dbg_check_begin_instr_bpoint(void)
|
2005-08-28 21:37:37 +04:00
|
|
|
{
|
|
|
|
Bit64u tt = bx_pc_system.time_ticks();
|
2007-09-26 22:07:39 +04:00
|
|
|
bx_address debug_eip = RIP;
|
2006-05-24 20:46:57 +04:00
|
|
|
Bit16u cs = BX_CPU_THIS_PTR sregs[BX_SEG_REG_CS].selector.value;
|
2005-08-15 09:32:36 +04:00
|
|
|
|
2001-05-24 22:46:34 +04:00
|
|
|
BX_CPU_THIS_PTR guard_found.cs = cs;
|
2006-05-24 20:46:57 +04:00
|
|
|
BX_CPU_THIS_PTR guard_found.eip = debug_eip;
|
|
|
|
BX_CPU_THIS_PTR guard_found.laddr =
|
|
|
|
BX_CPU_THIS_PTR get_segment_base(BX_SEG_REG_CS) + debug_eip;
|
|
|
|
BX_CPU_THIS_PTR guard_found.is_32bit_code =
|
|
|
|
BX_CPU_THIS_PTR sregs[BX_SEG_REG_CS].cache.u.segment.d_b;
|
|
|
|
BX_CPU_THIS_PTR guard_found.is_64bit_code = Is64BitMode();
|
2001-04-10 05:04:59 +04:00
|
|
|
|
2006-01-24 22:03:55 +03:00
|
|
|
// mode switch breakpoint
|
2001-04-10 05:04:59 +04:00
|
|
|
// instruction which generate exceptions never reach the end of the
|
2001-05-23 12:16:07 +04:00
|
|
|
// loop due to a long jump. Thats why we check at start of instr.
|
2001-04-10 05:04:59 +04:00
|
|
|
// Downside is that we show the instruction about to be executed
|
|
|
|
// (not the one generating the mode switch).
|
|
|
|
if (BX_CPU_THIS_PTR mode_break &&
|
2006-01-24 22:03:55 +03:00
|
|
|
(BX_CPU_THIS_PTR dbg_cpu_mode != BX_CPU_THIS_PTR get_cpu_mode()))
|
|
|
|
{
|
|
|
|
BX_INFO(("[" FMT_LL "d] Caught mode switch breakpoint, switching from '%s' to '%s'",
|
|
|
|
bx_pc_system.time_ticks(), cpu_mode_string(BX_CPU_THIS_PTR dbg_cpu_mode),
|
|
|
|
cpu_mode_string(BX_CPU_THIS_PTR get_cpu_mode())));
|
|
|
|
BX_CPU_THIS_PTR dbg_cpu_mode = BX_CPU_THIS_PTR get_cpu_mode();
|
2001-04-10 05:04:59 +04:00
|
|
|
BX_CPU_THIS_PTR stop_reason = STOP_MODE_BREAK_POINT;
|
2006-01-24 22:03:55 +03:00
|
|
|
return(1);
|
2001-04-10 05:04:59 +04:00
|
|
|
}
|
|
|
|
|
2006-02-12 23:21:36 +03:00
|
|
|
// support for 'show' command in debugger
|
|
|
|
if(dbg_show_mask) {
|
|
|
|
int rv = bx_dbg_show_symbolic();
|
|
|
|
if (rv) return(rv);
|
2001-04-10 05:04:59 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
// see if debugger is looking for iaddr breakpoint of any type
|
|
|
|
if (bx_guard.guard_for & BX_DBG_GUARD_IADDR_ALL) {
|
2007-10-13 02:11:25 +04:00
|
|
|
#if (BX_DBG_MAX_VIR_BPOINTS > 0)
|
2001-04-10 05:04:59 +04:00
|
|
|
if (bx_guard.guard_for & BX_DBG_GUARD_IADDR_VIR) {
|
2005-08-15 09:32:36 +04:00
|
|
|
if ((BX_CPU_THIS_PTR guard_found.icount!=0) ||
|
2005-08-28 21:37:37 +04:00
|
|
|
(tt != BX_CPU_THIS_PTR guard_found.time_tick))
|
|
|
|
{
|
2001-04-10 05:04:59 +04:00
|
|
|
for (unsigned i=0; i<bx_guard.iaddr.num_virtual; i++) {
|
2006-04-29 13:27:49 +04:00
|
|
|
if (bx_guard.iaddr.vir[i].enabled &&
|
|
|
|
(bx_guard.iaddr.vir[i].cs == cs) &&
|
2006-05-24 20:46:57 +04:00
|
|
|
(bx_guard.iaddr.vir[i].eip == debug_eip))
|
2006-01-19 21:32:39 +03:00
|
|
|
{
|
2001-05-24 22:46:34 +04:00
|
|
|
BX_CPU_THIS_PTR guard_found.guard_found = BX_DBG_GUARD_IADDR_VIR;
|
|
|
|
BX_CPU_THIS_PTR guard_found.iaddr_index = i;
|
2005-08-15 19:43:04 +04:00
|
|
|
BX_CPU_THIS_PTR guard_found.time_tick = tt;
|
2001-04-10 05:04:59 +04:00
|
|
|
return(1); // on a breakpoint
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2005-04-12 22:08:10 +04:00
|
|
|
}
|
2001-04-10 05:04:59 +04:00
|
|
|
#endif
|
2007-10-13 02:11:25 +04:00
|
|
|
#if (BX_DBG_MAX_LIN_BPOINTS > 0)
|
2001-04-10 05:04:59 +04:00
|
|
|
if (bx_guard.guard_for & BX_DBG_GUARD_IADDR_LIN) {
|
2005-08-15 09:32:36 +04:00
|
|
|
if ((BX_CPU_THIS_PTR guard_found.icount!=0) ||
|
2005-08-28 21:37:37 +04:00
|
|
|
(tt != BX_CPU_THIS_PTR guard_found.time_tick))
|
|
|
|
{
|
2001-04-10 05:04:59 +04:00
|
|
|
for (unsigned i=0; i<bx_guard.iaddr.num_linear; i++) {
|
2003-08-04 20:03:09 +04:00
|
|
|
if (bx_guard.iaddr.lin[i].enabled &&
|
2006-04-29 13:27:49 +04:00
|
|
|
(bx_guard.iaddr.lin[i].addr == BX_CPU_THIS_PTR guard_found.laddr))
|
2006-01-19 21:32:39 +03:00
|
|
|
{
|
2001-05-24 22:46:34 +04:00
|
|
|
BX_CPU_THIS_PTR guard_found.guard_found = BX_DBG_GUARD_IADDR_LIN;
|
|
|
|
BX_CPU_THIS_PTR guard_found.iaddr_index = i;
|
2005-08-15 19:43:04 +04:00
|
|
|
BX_CPU_THIS_PTR guard_found.time_tick = tt;
|
2001-04-10 05:04:59 +04:00
|
|
|
return(1); // on a breakpoint
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2005-04-12 22:08:10 +04:00
|
|
|
}
|
2001-04-10 05:04:59 +04:00
|
|
|
#endif
|
2007-10-13 02:11:25 +04:00
|
|
|
#if (BX_DBG_MAX_PHY_BPOINTS > 0)
|
2001-04-10 05:04:59 +04:00
|
|
|
if (bx_guard.guard_for & BX_DBG_GUARD_IADDR_PHY) {
|
2006-06-17 16:09:55 +04:00
|
|
|
bx_phy_address phy;
|
|
|
|
bx_bool valid = dbg_xlate_linear2phy(BX_CPU_THIS_PTR guard_found.laddr, &phy);
|
2001-09-28 03:41:18 +04:00
|
|
|
// The "guard_found.icount!=0" condition allows you to step or
|
|
|
|
// continue beyond a breakpoint. Bryce tried removing it once,
|
|
|
|
// and once you get to a breakpoint you are stuck there forever.
|
|
|
|
// Not pretty.
|
2005-08-15 09:32:36 +04:00
|
|
|
if (valid && ((BX_CPU_THIS_PTR guard_found.icount!=0) ||
|
2005-08-28 21:37:37 +04:00
|
|
|
(tt != BX_CPU_THIS_PTR guard_found.time_tick)))
|
|
|
|
{
|
2001-04-10 05:04:59 +04:00
|
|
|
for (unsigned i=0; i<bx_guard.iaddr.num_physical; i++) {
|
2005-08-28 21:37:37 +04:00
|
|
|
if (bx_guard.iaddr.phy[i].enabled && (bx_guard.iaddr.phy[i].addr == phy))
|
|
|
|
{
|
2001-05-24 22:46:34 +04:00
|
|
|
BX_CPU_THIS_PTR guard_found.guard_found = BX_DBG_GUARD_IADDR_PHY;
|
|
|
|
BX_CPU_THIS_PTR guard_found.iaddr_index = i;
|
2005-08-15 09:32:36 +04:00
|
|
|
BX_CPU_THIS_PTR guard_found.time_tick = tt;
|
2001-04-10 05:04:59 +04:00
|
|
|
return(1); // on a breakpoint
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2005-04-12 22:08:10 +04:00
|
|
|
#endif
|
|
|
|
}
|
2005-08-28 21:37:37 +04:00
|
|
|
|
2001-04-10 05:04:59 +04:00
|
|
|
return(0); // not on a breakpoint
|
|
|
|
}
|
|
|
|
|
2006-05-24 20:46:57 +04:00
|
|
|
bx_bool BX_CPU_C::dbg_check_end_instr_bpoint(void)
|
2006-04-29 20:14:47 +04:00
|
|
|
{
|
|
|
|
BX_CPU_THIS_PTR guard_found.icount++;
|
2006-05-24 20:46:57 +04:00
|
|
|
BX_CPU_THIS_PTR guard_found.cs =
|
|
|
|
BX_CPU_THIS_PTR sregs[BX_SEG_REG_CS].selector.value;
|
2007-09-26 22:07:39 +04:00
|
|
|
BX_CPU_THIS_PTR guard_found.eip = RIP;
|
2006-05-24 20:46:57 +04:00
|
|
|
BX_CPU_THIS_PTR guard_found.laddr =
|
2007-09-26 22:07:39 +04:00
|
|
|
BX_CPU_THIS_PTR get_segment_base(BX_SEG_REG_CS) + RIP;
|
2006-05-24 20:46:57 +04:00
|
|
|
BX_CPU_THIS_PTR guard_found.is_32bit_code =
|
|
|
|
BX_CPU_THIS_PTR sregs[BX_SEG_REG_CS].cache.u.segment.d_b;
|
|
|
|
BX_CPU_THIS_PTR guard_found.is_64bit_code = Is64BitMode();
|
|
|
|
|
|
|
|
// Check if we hit read/write or time breakpoint
|
|
|
|
if (BX_CPU_THIS_PTR break_point) {
|
|
|
|
switch (BX_CPU_THIS_PTR break_point) {
|
|
|
|
case BREAK_POINT_TIME:
|
|
|
|
BX_INFO(("[" FMT_LL "d] Caught time breakpoint", bx_pc_system.time_ticks()));
|
|
|
|
BX_CPU_THIS_PTR stop_reason = STOP_TIME_BREAK_POINT;
|
|
|
|
return(1); // on a breakpoint
|
|
|
|
case BREAK_POINT_READ:
|
|
|
|
BX_INFO(("[" FMT_LL "d] Caught read watch point", bx_pc_system.time_ticks()));
|
|
|
|
BX_CPU_THIS_PTR stop_reason = STOP_READ_WATCH_POINT;
|
|
|
|
return(1); // on a breakpoint
|
|
|
|
case BREAK_POINT_WRITE:
|
|
|
|
BX_INFO(("[" FMT_LL "d] Caught write watch point", bx_pc_system.time_ticks()));
|
|
|
|
BX_CPU_THIS_PTR stop_reason = STOP_WRITE_WATCH_POINT;
|
|
|
|
return(1); // on a breakpoint
|
|
|
|
default:
|
|
|
|
BX_PANIC(("Weird break point condition"));
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
#if BX_MAGIC_BREAKPOINT
|
|
|
|
if (BX_CPU_THIS_PTR magic_break) {
|
|
|
|
BX_INFO(("[" FMT_LL "d] Stopped on MAGIC BREAKPOINT", bx_pc_system.time_ticks()));
|
|
|
|
BX_CPU_THIS_PTR stop_reason = STOP_MAGIC_BREAK_POINT;
|
|
|
|
return(1); // on a breakpoint
|
|
|
|
}
|
|
|
|
#endif
|
2006-04-29 20:14:47 +04:00
|
|
|
|
|
|
|
// convenient point to see if user typed Ctrl-C
|
|
|
|
if (bx_guard.interrupt_requested &&
|
|
|
|
(bx_guard.guard_for & BX_DBG_GUARD_CTRL_C))
|
|
|
|
{
|
|
|
|
BX_CPU_THIS_PTR guard_found.guard_found = BX_DBG_GUARD_CTRL_C;
|
2006-05-24 20:46:57 +04:00
|
|
|
return(1); // Ctrl-C pressed
|
2006-04-29 20:14:47 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
return(0); // no breakpoint
|
|
|
|
}
|
|
|
|
|
2005-08-28 21:37:37 +04:00
|
|
|
void BX_CPU_C::dbg_take_irq(void)
|
2001-04-10 05:04:59 +04:00
|
|
|
{
|
|
|
|
// NOTE: similar code in ::cpu_loop()
|
|
|
|
|
2006-05-24 20:46:57 +04:00
|
|
|
if (BX_CPU_INTR && BX_CPU_THIS_PTR get_IF()) {
|
|
|
|
if (setjmp(BX_CPU_THIS_PTR jmp_buf_env) == 0) {
|
2001-04-10 05:04:59 +04:00
|
|
|
// normal return from setjmp setup
|
2006-03-16 23:24:09 +03:00
|
|
|
unsigned vector = DEV_pic_iac(); // may set INTR with next interrupt
|
2001-04-10 05:04:59 +04:00
|
|
|
BX_CPU_THIS_PTR errorno = 0;
|
2006-03-16 23:24:09 +03:00
|
|
|
BX_CPU_THIS_PTR EXT = 1; // external event
|
2001-04-10 05:04:59 +04:00
|
|
|
BX_CPU_THIS_PTR async_event = 1; // set in case INTR is triggered
|
|
|
|
interrupt(vector, 0, 0, 0);
|
|
|
|
}
|
2005-04-12 22:08:10 +04:00
|
|
|
}
|
2001-04-10 05:04:59 +04:00
|
|
|
}
|
|
|
|
|
2005-08-28 21:37:37 +04:00
|
|
|
void BX_CPU_C::dbg_force_interrupt(unsigned vector)
|
2001-04-10 05:04:59 +04:00
|
|
|
{
|
2006-06-26 01:44:46 +04:00
|
|
|
// Used to force simulator to take an interrupt, without
|
2001-04-10 05:04:59 +04:00
|
|
|
// regard to IF
|
|
|
|
|
2006-05-24 20:46:57 +04:00
|
|
|
if (setjmp(BX_CPU_THIS_PTR jmp_buf_env) == 0) {
|
2001-04-10 05:04:59 +04:00
|
|
|
// normal return from setjmp setup
|
|
|
|
BX_CPU_THIS_PTR errorno = 0;
|
2006-03-16 23:24:09 +03:00
|
|
|
BX_CPU_THIS_PTR EXT = 1; // external event
|
2001-04-10 05:04:59 +04:00
|
|
|
BX_CPU_THIS_PTR async_event = 1; // probably don't need this
|
|
|
|
interrupt(vector, 0, 0, 0);
|
2005-04-12 22:08:10 +04:00
|
|
|
}
|
2001-04-10 05:04:59 +04:00
|
|
|
}
|
|
|
|
|
2005-08-28 21:37:37 +04:00
|
|
|
void BX_CPU_C::dbg_take_dma(void)
|
2001-04-10 05:04:59 +04:00
|
|
|
{
|
|
|
|
// NOTE: similar code in ::cpu_loop()
|
2006-03-16 23:24:09 +03:00
|
|
|
if (BX_HRQ) {
|
2001-04-10 05:04:59 +04:00
|
|
|
BX_CPU_THIS_PTR async_event = 1; // set in case INTR is triggered
|
2002-10-25 01:07:56 +04:00
|
|
|
DEV_dma_raise_hlda();
|
2005-04-12 22:08:10 +04:00
|
|
|
}
|
2001-04-10 05:04:59 +04:00
|
|
|
}
|
2006-03-16 23:24:09 +03:00
|
|
|
|
2005-04-12 22:08:10 +04:00
|
|
|
#endif // #if BX_DEBUGGER
|