2001-10-03 17:10:38 +04:00
|
|
|
/////////////////////////////////////////////////////////////////////////
|
2011-02-25 01:05:47 +03:00
|
|
|
// $Id$
|
2001-10-03 17:10:38 +04:00
|
|
|
/////////////////////////////////////////////////////////////////////////
|
|
|
|
//
|
2009-12-04 23:02:12 +03:00
|
|
|
// Copyright (C) 2002-2009 The Bochs Project
|
2001-04-10 05:04:59 +04:00
|
|
|
//
|
|
|
|
// 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
|
2009-08-22 23:30:23 +04:00
|
|
|
// Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
|
2009-01-16 21:18:59 +03:00
|
|
|
//
|
|
|
|
/////////////////////////////////////////////////////////////////////////
|
2001-04-10 05:04:59 +04:00
|
|
|
|
|
|
|
#include "bochs.h"
|
2006-03-07 01:03:16 +03:00
|
|
|
#include "cpu/cpu.h"
|
2004-06-19 19:20:15 +04:00
|
|
|
#include "iodev/iodev.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_pc_system.
|
2001-04-10 05:04:59 +04:00
|
|
|
|
|
|
|
#ifdef WIN32
|
|
|
|
#ifndef __MINGW32__
|
|
|
|
// #include <winsock2.h> // +++
|
|
|
|
#include <winsock.h>
|
|
|
|
#endif
|
|
|
|
#endif
|
|
|
|
|
|
|
|
#if defined(PROVIDE_M_IPS)
|
|
|
|
double m_ips; // Millions of Instructions Per Second
|
|
|
|
#endif
|
|
|
|
|
2002-10-03 19:47:13 +04:00
|
|
|
// Option for turning off BX_TIMER_DEBUG?
|
|
|
|
// Check out m_ips and ips
|
|
|
|
|
|
|
|
#define SpewPeriodicTimerInfo 0
|
|
|
|
#define MinAllowableTimerPeriod 1
|
|
|
|
|
2011-01-12 21:49:11 +03:00
|
|
|
const Bit64u bx_pc_system_c::NullTimerInterval = 0xffffffff;
|
2001-04-10 05:04:59 +04:00
|
|
|
|
|
|
|
// constructor
|
2006-03-04 19:58:10 +03:00
|
|
|
bx_pc_system_c::bx_pc_system_c()
|
2001-04-10 05:04:59 +04:00
|
|
|
{
|
2001-06-27 23:16:01 +04:00
|
|
|
this->put("SYS");
|
2002-10-03 19:47:13 +04:00
|
|
|
|
2006-01-31 23:43:24 +03:00
|
|
|
BX_ASSERT(numTimers == 0);
|
|
|
|
|
2002-10-03 19:47:13 +04:00
|
|
|
// Timer[0] is the null timer. It is initialized as a special
|
|
|
|
// case here. It should never be turned off or modified, and its
|
|
|
|
// duration should always remain the same.
|
|
|
|
ticksTotal = 0; // Reset ticks since emulator started.
|
2006-05-17 00:55:55 +04:00
|
|
|
timer[0].inUse = 1;
|
2002-10-03 19:47:13 +04:00
|
|
|
timer[0].period = NullTimerInterval;
|
|
|
|
timer[0].active = 1;
|
|
|
|
timer[0].continuous = 1;
|
|
|
|
timer[0].funct = nullTimer;
|
|
|
|
timer[0].this_ptr = this;
|
|
|
|
numTimers = 1; // So far, only the nullTimer.
|
2002-08-27 22:53:30 +04:00
|
|
|
}
|
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
|
|
|
|
2006-03-14 21:11:22 +03:00
|
|
|
void bx_pc_system_c::initialize(Bit32u ips)
|
2002-08-27 22:53:30 +04:00
|
|
|
{
|
2006-09-07 22:50:51 +04:00
|
|
|
ticksTotal = 0;
|
2006-09-16 23:30:56 +04:00
|
|
|
timer[0].timeToFire = NullTimerInterval;
|
|
|
|
currCountdown = NullTimerInterval;
|
|
|
|
currCountdownPeriod = NullTimerInterval;
|
|
|
|
lastTimeUsec = 0;
|
|
|
|
usecSinceLast = 0;
|
|
|
|
triggeredTimer = 0;
|
2001-04-10 05:04:59 +04:00
|
|
|
HRQ = 0;
|
2006-03-14 21:11:22 +03:00
|
|
|
kill_bochs_request = 0;
|
|
|
|
|
2001-04-10 05:04:59 +04:00
|
|
|
// parameter 'ips' is the processor speed in Instructions-Per-Second
|
|
|
|
m_ips = double(ips) / 1000000.0L;
|
2002-10-03 19:47:13 +04:00
|
|
|
|
2001-05-30 22:56:02 +04:00
|
|
|
BX_DEBUG(("ips = %u", (unsigned) ips));
|
2001-04-10 05:04:59 +04:00
|
|
|
}
|
|
|
|
|
2005-04-26 23:19:58 +04:00
|
|
|
void bx_pc_system_c::set_HRQ(bx_bool val)
|
2001-04-10 05:04:59 +04:00
|
|
|
{
|
|
|
|
HRQ = val;
|
|
|
|
if (val)
|
2001-05-23 12:16:07 +04:00
|
|
|
BX_CPU(0)->async_event = 1;
|
2001-12-18 16:14:46 +03:00
|
|
|
}
|
|
|
|
|
2005-04-26 23:19:58 +04:00
|
|
|
void bx_pc_system_c::set_INTR(bx_bool value)
|
2001-04-10 05:04:59 +04:00
|
|
|
{
|
2001-05-23 12:16:07 +04:00
|
|
|
if (bx_dbg.interrupts)
|
2001-05-30 22:56:02 +04:00
|
|
|
BX_INFO(("pc_system: Setting INTR=%d on bootstrap processor %d", (int)value, BX_BOOTSTRAP_PROCESSOR));
|
2002-09-20 19:35:44 +04:00
|
|
|
BX_CPU(BX_BOOTSTRAP_PROCESSOR)->set_INTR(value);
|
2001-04-10 05:04:59 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
//
|
|
|
|
// Read from the IO memory address space
|
|
|
|
//
|
|
|
|
|
2003-03-03 02:59:12 +03:00
|
|
|
Bit32u BX_CPP_AttrRegparmN(2)
|
2001-04-10 05:04:59 +04:00
|
|
|
bx_pc_system_c::inp(Bit16u addr, unsigned io_len)
|
|
|
|
{
|
2006-03-04 19:58:10 +03:00
|
|
|
Bit32u ret = bx_devices.inp(addr, io_len);
|
|
|
|
return ret;
|
2001-04-10 05:04:59 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
//
|
|
|
|
// Write to the IO memory address space.
|
|
|
|
//
|
|
|
|
|
2003-03-03 02:59:12 +03:00
|
|
|
void BX_CPP_AttrRegparmN(3)
|
2001-04-10 05:04:59 +04:00
|
|
|
bx_pc_system_c::outp(Bit16u addr, Bit32u value, unsigned io_len)
|
|
|
|
{
|
|
|
|
bx_devices.outp(addr, value, io_len);
|
|
|
|
}
|
|
|
|
|
2006-03-04 19:58:10 +03:00
|
|
|
void bx_pc_system_c::set_enable_a20(bx_bool value)
|
|
|
|
{
|
2008-04-06 22:27:24 +04:00
|
|
|
#if BX_SUPPORT_A20
|
2006-04-29 21:21:49 +04:00
|
|
|
bx_bool old_enable_a20 = enable_a20;
|
Now, when you compile with --enable-guest2host-tlb, non-paged
mode uses the notion of the guest-to-host TLB. This has the
benefit of allowing more uniform and streamlined acceleration
code in access.cc which does not have to check if CR0.PG
is set, eliminating a few instructions per guest access.
Shaved just a little off execution time, as expected.
Also, access_linear now breaks accesses which span two pages,
into two calls the the physical memory routines, when paging
is off, just like it always has for paging on. Besides
being more uniform, this allows the physical memory access
routines to known the complete data item is contained
within a single physical page, and stop reapplying the
A20ADDR() macro to pointers as it increments them.
Perhaps things can be optimized a little more now there too...
I renamed the routines to {read,write}PhysicalPage() as
a reminder that these routines now operate on data
solely within one page.
I also added a little code so that the paging module is
notified when the A20 line is tweaked, so it can dump
whatever mappings it wants to.
2002-09-05 06:31:24 +04:00
|
|
|
|
2001-04-10 05:04:59 +04:00
|
|
|
if (value) {
|
|
|
|
enable_a20 = 1;
|
2006-03-04 19:58:10 +03:00
|
|
|
#if BX_CPU_LEVEL < 2
|
2008-05-11 00:39:53 +04:00
|
|
|
a20_mask = 0xfffff;
|
2006-03-04 19:58:10 +03:00
|
|
|
#elif BX_CPU_LEVEL == 2
|
2008-05-11 00:39:53 +04:00
|
|
|
a20_mask = 0xffffff;
|
|
|
|
#elif BX_PHY_ADDRESS_LONG
|
|
|
|
a20_mask = BX_CONST64(0xffffffffffffffff);
|
|
|
|
#else /* 386+ */
|
|
|
|
a20_mask = 0xffffffff;
|
2001-04-10 05:04:59 +04:00
|
|
|
#endif
|
2005-04-26 23:19:58 +04:00
|
|
|
}
|
2001-04-10 05:04:59 +04:00
|
|
|
else {
|
|
|
|
enable_a20 = 0;
|
2008-05-11 00:39:53 +04:00
|
|
|
/* mask off A20 address line */
|
|
|
|
#if BX_PHY_ADDRESS_LONG
|
|
|
|
a20_mask = BX_CONST64(0xffffffffffefffff);
|
|
|
|
#else
|
|
|
|
a20_mask = 0xffefffff;
|
|
|
|
#endif
|
2005-04-26 23:19:58 +04:00
|
|
|
}
|
2001-04-10 05:04:59 +04:00
|
|
|
|
2006-04-29 21:21:49 +04:00
|
|
|
BX_DBG_A20_REPORT(enable_a20);
|
2001-04-10 05:04:59 +04:00
|
|
|
|
2001-05-30 22:56:02 +04:00
|
|
|
BX_DEBUG(("A20: set() = %u", (unsigned) enable_a20));
|
Now, when you compile with --enable-guest2host-tlb, non-paged
mode uses the notion of the guest-to-host TLB. This has the
benefit of allowing more uniform and streamlined acceleration
code in access.cc which does not have to check if CR0.PG
is set, eliminating a few instructions per guest access.
Shaved just a little off execution time, as expected.
Also, access_linear now breaks accesses which span two pages,
into two calls the the physical memory routines, when paging
is off, just like it always has for paging on. Besides
being more uniform, this allows the physical memory access
routines to known the complete data item is contained
within a single physical page, and stop reapplying the
A20ADDR() macro to pointers as it increments them.
Perhaps things can be optimized a little more now there too...
I renamed the routines to {read,write}PhysicalPage() as
a reminder that these routines now operate on data
solely within one page.
I also added a little code so that the paging module is
notified when the A20 line is tweaked, so it can dump
whatever mappings it wants to.
2002-09-05 06:31:24 +04:00
|
|
|
|
|
|
|
// If there has been a transition, we need to notify the CPUs so
|
|
|
|
// they can potentially invalidate certain cache info based on
|
|
|
|
// A20-line-applied physical addresses.
|
2006-04-29 21:21:49 +04:00
|
|
|
if (old_enable_a20 != enable_a20) MemoryMappingChanged();
|
2008-04-06 22:27:24 +04:00
|
|
|
#else
|
|
|
|
BX_DEBUG(("set_enable_a20: ignoring: BX_SUPPORT_A20 = 0"));
|
|
|
|
#endif
|
2001-04-10 05:04:59 +04:00
|
|
|
}
|
|
|
|
|
2005-04-26 23:19:58 +04:00
|
|
|
bx_bool bx_pc_system_c::get_enable_a20(void)
|
2001-04-10 05:04:59 +04:00
|
|
|
{
|
2008-04-06 22:27:24 +04:00
|
|
|
#if BX_SUPPORT_A20
|
2009-04-24 12:16:06 +04:00
|
|
|
BX_DEBUG(("A20: get() = %u", (unsigned) enable_a20));
|
2001-04-10 05:04:59 +04:00
|
|
|
|
2006-04-29 21:21:49 +04:00
|
|
|
return enable_a20;
|
2001-04-10 05:04:59 +04:00
|
|
|
#else
|
2008-04-06 22:27:24 +04:00
|
|
|
BX_DEBUG(("get_enable_a20: ignoring: BX_SUPPORT_A20 = 0"));
|
2006-04-29 21:21:49 +04:00
|
|
|
return 1;
|
2008-04-06 22:27:24 +04:00
|
|
|
#endif
|
2001-04-10 05:04:59 +04:00
|
|
|
}
|
2006-04-29 21:21:49 +04:00
|
|
|
|
|
|
|
void bx_pc_system_c::MemoryMappingChanged(void)
|
|
|
|
{
|
|
|
|
for (unsigned i=0; i<BX_SMP_PROCESSORS; i++)
|
2008-08-14 01:51:54 +04:00
|
|
|
BX_CPU(i)->TLB_flush();
|
2006-04-29 21:21:49 +04:00
|
|
|
}
|
|
|
|
|
2007-11-01 21:03:48 +03:00
|
|
|
void bx_pc_system_c::invlpg(bx_address addr)
|
|
|
|
{
|
|
|
|
for (unsigned i=0; i<BX_SMP_PROCESSORS; i++)
|
|
|
|
BX_CPU(i)->TLB_invlpg(addr);
|
|
|
|
}
|
|
|
|
|
2006-03-04 19:58:10 +03:00
|
|
|
int bx_pc_system_c::Reset(unsigned type)
|
2004-04-09 00:56:36 +04:00
|
|
|
{
|
2004-06-21 14:39:24 +04:00
|
|
|
// type is BX_RESET_HARDWARE or BX_RESET_SOFTWARE
|
2006-03-04 19:58:10 +03:00
|
|
|
BX_INFO(("bx_pc_system_c::Reset(%s) called",type==BX_RESET_HARDWARE?"HARDWARE":"SOFTWARE"));
|
|
|
|
|
|
|
|
set_enable_a20(1);
|
2004-04-09 00:56:36 +04:00
|
|
|
|
2004-06-21 14:39:24 +04:00
|
|
|
// Always reset cpu
|
|
|
|
for (int i=0; i<BX_SMP_PROCESSORS; i++) {
|
2004-04-09 00:56:36 +04:00
|
|
|
BX_CPU(i)->reset(type);
|
2004-06-21 14:39:24 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
// Reset devices only on Hardware resets
|
|
|
|
if (type==BX_RESET_HARDWARE) {
|
|
|
|
DEV_reset_devices(type);
|
|
|
|
}
|
|
|
|
|
2004-04-09 00:56:36 +04:00
|
|
|
return(0);
|
|
|
|
}
|
2001-04-10 05:04:59 +04:00
|
|
|
|
2005-04-26 23:19:58 +04:00
|
|
|
Bit8u bx_pc_system_c::IAC(void)
|
2001-04-10 05:04:59 +04:00
|
|
|
{
|
2006-03-04 19:58:10 +03:00
|
|
|
return DEV_pic_iac();
|
2001-04-10 05:04:59 +04:00
|
|
|
}
|
|
|
|
|
2005-04-26 23:19:58 +04:00
|
|
|
void bx_pc_system_c::exit(void)
|
2001-04-10 05:04:59 +04:00
|
|
|
{
|
2006-09-16 23:30:56 +04:00
|
|
|
// delete all registered timers (exception: null timer and APIC timer)
|
|
|
|
numTimers = 1 + BX_SUPPORT_APIC;
|
2006-09-07 22:50:51 +04:00
|
|
|
bx_devices.exit();
|
2006-09-18 00:37:28 +04:00
|
|
|
if (bx_gui) {
|
|
|
|
bx_gui->cleanup();
|
|
|
|
bx_gui->exit();
|
|
|
|
}
|
2001-04-10 05:04:59 +04:00
|
|
|
}
|
|
|
|
|
2006-05-27 19:54:49 +04:00
|
|
|
void bx_pc_system_c::register_state(void)
|
|
|
|
{
|
2009-10-23 12:37:56 +04:00
|
|
|
bx_list_c *list = new bx_list_c(SIM->get_bochs_root(), "pc_system", "PC System State", 10);
|
2006-05-28 21:07:57 +04:00
|
|
|
BXRS_PARAM_BOOL(list, enable_a20, enable_a20);
|
2009-10-22 11:51:07 +04:00
|
|
|
BXRS_HEX_PARAM_SIMPLE(list, a20_mask);
|
2006-09-16 23:30:56 +04:00
|
|
|
BXRS_DEC_PARAM_SIMPLE(list, currCountdown);
|
|
|
|
BXRS_DEC_PARAM_SIMPLE(list, currCountdownPeriod);
|
|
|
|
BXRS_DEC_PARAM_SIMPLE(list, ticksTotal);
|
|
|
|
BXRS_DEC_PARAM_SIMPLE(list, lastTimeUsec);
|
|
|
|
BXRS_DEC_PARAM_SIMPLE(list, usecSinceLast);
|
|
|
|
BXRS_PARAM_BOOL(list, HRQ, HRQ);
|
2006-05-28 21:07:57 +04:00
|
|
|
|
2006-05-27 19:54:49 +04:00
|
|
|
bx_list_c *timers = new bx_list_c(list, "timer", numTimers);
|
2006-05-28 21:07:57 +04:00
|
|
|
for (unsigned i = 0; i < numTimers; i++) {
|
|
|
|
char name[4];
|
2006-05-27 19:54:49 +04:00
|
|
|
sprintf(name, "%d", i);
|
2006-05-30 02:33:38 +04:00
|
|
|
bx_list_c *bxtimer = new bx_list_c(timers, name, 5);
|
2006-05-28 21:07:57 +04:00
|
|
|
BXRS_PARAM_BOOL(bxtimer, inUse, timer[i].inUse);
|
2006-05-29 00:24:51 +04:00
|
|
|
BXRS_DEC_PARAM_FIELD(bxtimer, period, timer[i].period);
|
|
|
|
BXRS_DEC_PARAM_FIELD(bxtimer, timeToFire, timer[i].timeToFire);
|
2006-05-28 21:07:57 +04:00
|
|
|
BXRS_PARAM_BOOL(bxtimer, active, timer[i].active);
|
|
|
|
BXRS_PARAM_BOOL(bxtimer, continuous, timer[i].continuous);
|
2006-05-27 19:54:49 +04:00
|
|
|
}
|
|
|
|
}
|
2001-04-10 05:04:59 +04:00
|
|
|
|
2002-10-03 19:47:13 +04:00
|
|
|
// ================================================
|
|
|
|
// Bochs internal timer delivery framework features
|
|
|
|
// ================================================
|
|
|
|
|
2008-02-16 01:05:43 +03:00
|
|
|
int bx_pc_system_c::register_timer(void *this_ptr, void (*funct)(void *),
|
2002-10-25 15:44:41 +04:00
|
|
|
Bit32u useconds, bx_bool continuous, bx_bool active, const char *id)
|
2002-10-03 19:47:13 +04:00
|
|
|
{
|
|
|
|
// Convert useconds to number of ticks.
|
2006-05-17 00:55:55 +04:00
|
|
|
Bit64u ticks = (Bit64u) (double(useconds) * m_ips);
|
2001-04-10 05:04:59 +04:00
|
|
|
|
2002-10-03 19:47:13 +04:00
|
|
|
return register_timer_ticks(this_ptr, funct, ticks, continuous, active, id);
|
|
|
|
}
|
|
|
|
|
2005-04-26 23:19:58 +04:00
|
|
|
int bx_pc_system_c::register_timer_ticks(void* this_ptr, bx_timer_handler_t funct,
|
2002-10-25 15:44:41 +04:00
|
|
|
Bit64u ticks, bx_bool continuous, bx_bool active, const char *id)
|
2001-04-10 05:04:59 +04:00
|
|
|
{
|
|
|
|
unsigned i;
|
|
|
|
|
2002-10-03 19:47:13 +04:00
|
|
|
// If the timer frequency is rediculously low, make it more sane.
|
|
|
|
// This happens when 'ips' is too low.
|
|
|
|
if (ticks < MinAllowableTimerPeriod) {
|
|
|
|
//BX_INFO(("register_timer_ticks: adjusting ticks of %llu to min of %u",
|
|
|
|
// ticks, MinAllowableTimerPeriod));
|
|
|
|
ticks = MinAllowableTimerPeriod;
|
2005-04-26 23:19:58 +04:00
|
|
|
}
|
2001-04-10 05:04:59 +04:00
|
|
|
|
2006-05-17 00:55:55 +04:00
|
|
|
// search for new timer for i=1, i=0 is reserved for NullTimer
|
|
|
|
for (i=1; i < numTimers; i++) {
|
2002-10-06 21:29:22 +04:00
|
|
|
if (timer[i].inUse == 0)
|
|
|
|
break;
|
2005-04-26 23:19:58 +04:00
|
|
|
}
|
2002-10-06 21:29:22 +04:00
|
|
|
|
2006-05-17 00:55:55 +04:00
|
|
|
#if BX_TIMER_DEBUG
|
|
|
|
if (i==0)
|
|
|
|
BX_PANIC(("register_timer: cannot register NullTimer again!"));
|
|
|
|
if (numTimers >= BX_MAX_TIMERS)
|
|
|
|
BX_PANIC(("register_timer: too many registered timers"));
|
|
|
|
if (this_ptr == NULL)
|
|
|
|
BX_PANIC(("register_timer_ticks: this_ptr is NULL!"));
|
|
|
|
if (funct == NULL)
|
|
|
|
BX_PANIC(("register_timer_ticks: funct is NULL!"));
|
|
|
|
#endif
|
|
|
|
|
2002-10-06 21:29:22 +04:00
|
|
|
timer[i].inUse = 1;
|
2002-10-03 19:47:13 +04:00
|
|
|
timer[i].period = ticks;
|
2002-10-04 20:26:10 +04:00
|
|
|
timer[i].timeToFire = (ticksTotal + Bit64u(currCountdownPeriod-currCountdown)) +
|
2002-10-03 19:47:13 +04:00
|
|
|
ticks;
|
|
|
|
timer[i].active = active;
|
|
|
|
timer[i].continuous = continuous;
|
|
|
|
timer[i].funct = funct;
|
|
|
|
timer[i].this_ptr = this_ptr;
|
|
|
|
strncpy(timer[i].id, id, BxMaxTimerIDLen);
|
|
|
|
timer[i].id[BxMaxTimerIDLen-1] = 0; // Null terminate if not already.
|
2001-04-10 05:04:59 +04:00
|
|
|
|
2002-10-03 19:47:13 +04:00
|
|
|
if (active) {
|
2002-10-04 20:26:10 +04:00
|
|
|
if (ticks < Bit64u(currCountdown)) {
|
2002-10-03 19:47:13 +04:00
|
|
|
// This new timer needs to fire before the current countdown.
|
|
|
|
// Skew the current countdown and countdown period to be smaller
|
|
|
|
// by the delta.
|
2002-10-04 20:26:10 +04:00
|
|
|
currCountdownPeriod -= (currCountdown - Bit32u(ticks));
|
|
|
|
currCountdown = Bit32u(ticks);
|
2001-04-10 05:04:59 +04:00
|
|
|
}
|
2005-04-26 23:19:58 +04:00
|
|
|
}
|
2002-10-03 19:47:13 +04:00
|
|
|
|
2006-09-16 23:30:56 +04:00
|
|
|
BX_DEBUG(("timer id %d registered for '%s'", i, id));
|
2002-10-06 21:29:22 +04:00
|
|
|
// If we didn't find a free slot, increment the bound, numTimers.
|
|
|
|
if (i==numTimers)
|
|
|
|
numTimers++; // One new timer installed.
|
2002-10-03 19:47:13 +04:00
|
|
|
|
|
|
|
// Return timer id.
|
|
|
|
return(i);
|
2001-04-10 05:04:59 +04:00
|
|
|
}
|
|
|
|
|
2005-04-26 23:19:58 +04:00
|
|
|
void bx_pc_system_c::countdownEvent(void)
|
2001-04-10 05:04:59 +04:00
|
|
|
{
|
|
|
|
unsigned i;
|
2002-10-03 19:47:13 +04:00
|
|
|
Bit64u minTimeToFire;
|
2002-10-25 15:44:41 +04:00
|
|
|
bx_bool triggered[BX_MAX_TIMERS];
|
2001-04-10 05:04:59 +04:00
|
|
|
|
2002-10-03 19:47:13 +04:00
|
|
|
// The countdown decremented to 0. We need to service all the active
|
|
|
|
// timers, and invoke callbacks from those timers which have fired.
|
2001-04-10 05:04:59 +04:00
|
|
|
#if BX_TIMER_DEBUG
|
2002-10-03 19:47:13 +04:00
|
|
|
if (currCountdown != 0)
|
|
|
|
BX_PANIC(("countdownEvent: ticks!=0"));
|
2001-04-10 05:04:59 +04:00
|
|
|
#endif
|
|
|
|
|
2002-10-03 19:47:13 +04:00
|
|
|
// Increment global ticks counter by number of ticks which have
|
|
|
|
// elapsed since the last update.
|
2002-10-04 20:26:10 +04:00
|
|
|
ticksTotal += Bit64u(currCountdownPeriod);
|
2002-10-03 19:47:13 +04:00
|
|
|
minTimeToFire = (Bit64u) -1;
|
2001-04-10 05:04:59 +04:00
|
|
|
|
2002-10-03 19:47:13 +04:00
|
|
|
for (i=0; i < numTimers; i++) {
|
|
|
|
triggered[i] = 0; // Reset triggered flag.
|
|
|
|
if (timer[i].active) {
|
|
|
|
#if BX_TIMER_DEBUG
|
|
|
|
if (ticksTotal > timer[i].timeToFire)
|
2003-06-07 23:16:55 +04:00
|
|
|
BX_PANIC(("countdownEvent: ticksTotal > timeToFire[%u], D " FMT_LL "u", i,
|
2002-10-03 19:47:13 +04:00
|
|
|
timer[i].timeToFire-ticksTotal));
|
|
|
|
#endif
|
|
|
|
if (ticksTotal == timer[i].timeToFire) {
|
|
|
|
// This timer is ready to fire.
|
|
|
|
triggered[i] = 1;
|
2001-04-10 05:04:59 +04:00
|
|
|
|
2002-10-03 19:47:13 +04:00
|
|
|
if (timer[i].continuous==0) {
|
|
|
|
// If triggered timer is one-shot, deactive.
|
|
|
|
timer[i].active = 0;
|
2005-04-26 23:19:58 +04:00
|
|
|
}
|
2002-10-03 19:47:13 +04:00
|
|
|
else {
|
|
|
|
// Continuous timer, increment time-to-fire by period.
|
|
|
|
timer[i].timeToFire += timer[i].period;
|
|
|
|
if (timer[i].timeToFire < minTimeToFire)
|
|
|
|
minTimeToFire = timer[i].timeToFire;
|
|
|
|
}
|
2005-04-26 23:19:58 +04:00
|
|
|
}
|
2002-10-03 19:47:13 +04:00
|
|
|
else {
|
|
|
|
// This timer is not ready to fire yet.
|
|
|
|
if (timer[i].timeToFire < minTimeToFire)
|
|
|
|
minTimeToFire = timer[i].timeToFire;
|
|
|
|
}
|
2001-04-10 05:04:59 +04:00
|
|
|
}
|
2005-04-26 23:19:58 +04:00
|
|
|
}
|
2001-04-10 05:04:59 +04:00
|
|
|
|
2002-10-03 19:47:13 +04:00
|
|
|
// Calculate next countdown period. We need to do this before calling
|
|
|
|
// any of the callbacks, as they may call timer features, which need
|
|
|
|
// to be advanced to the next countdown cycle.
|
|
|
|
currCountdown = currCountdownPeriod =
|
2002-10-04 20:26:10 +04:00
|
|
|
Bit32u(minTimeToFire - ticksTotal);
|
2001-04-10 05:04:59 +04:00
|
|
|
|
2002-10-03 19:47:13 +04:00
|
|
|
for (i=0; i < numTimers; i++) {
|
|
|
|
// Call requested timer function. It may request a different
|
|
|
|
// timer period or deactivate etc.
|
|
|
|
if (triggered[i]) {
|
2004-01-17 18:51:09 +03:00
|
|
|
triggeredTimer = i;
|
2002-10-03 19:47:13 +04:00
|
|
|
timer[i].funct(timer[i].this_ptr);
|
2004-01-17 18:51:09 +03:00
|
|
|
triggeredTimer = 0;
|
2001-04-10 05:04:59 +04:00
|
|
|
}
|
2005-04-26 23:19:58 +04:00
|
|
|
}
|
2001-04-10 05:04:59 +04:00
|
|
|
}
|
|
|
|
|
2005-04-26 23:19:58 +04:00
|
|
|
void bx_pc_system_c::nullTimer(void* this_ptr)
|
2001-04-10 05:04:59 +04:00
|
|
|
{
|
2002-10-03 19:47:13 +04:00
|
|
|
// This function is always inserted in timer[0]. It is sort of
|
|
|
|
// a heartbeat timer. It ensures that at least one timer is
|
|
|
|
// always active to make the timer logic more simple, and has
|
|
|
|
// a duration of less than the maximum 32-bit integer, so that
|
|
|
|
// a 32-bit size can be used for the hot countdown timer. The
|
|
|
|
// rest of the timer info can be 64-bits. This is also a good
|
|
|
|
// place for some logic to report actual emulated
|
|
|
|
// instructions-per-second (IPS) data when measured relative to
|
|
|
|
// the host computer's wall clock.
|
|
|
|
|
|
|
|
UNUSED(this_ptr);
|
|
|
|
|
|
|
|
#if SpewPeriodicTimerInfo
|
|
|
|
BX_INFO(("==================================="));
|
|
|
|
for (unsigned i=0; i < bx_pc_system.numTimers; i++) {
|
|
|
|
if (bx_pc_system.timer[i].active) {
|
2003-06-07 23:16:55 +04:00
|
|
|
BX_INFO(("BxTimer(%s): period=" FMT_LL "u, continuous=%u",
|
2002-10-03 19:47:13 +04:00
|
|
|
bx_pc_system.timer[i].id, bx_pc_system.timer[i].period,
|
|
|
|
bx_pc_system.timer[i].continuous));
|
|
|
|
}
|
2005-04-26 23:19:58 +04:00
|
|
|
}
|
2002-10-03 19:47:13 +04:00
|
|
|
#endif
|
2001-04-10 05:04:59 +04:00
|
|
|
}
|
|
|
|
|
2007-09-22 19:59:41 +04:00
|
|
|
void bx_pc_system_c::benchmarkTimer(void* this_ptr)
|
|
|
|
{
|
|
|
|
bx_pc_system_c *class_ptr = (bx_pc_system_c *) this_ptr;
|
|
|
|
class_ptr->kill_bochs_request = 1;
|
|
|
|
bx_user_quit = 1;
|
|
|
|
}
|
|
|
|
|
2001-04-10 05:04:59 +04:00
|
|
|
#if BX_DEBUGGER
|
2005-04-26 23:19:58 +04:00
|
|
|
void bx_pc_system_c::timebp_handler(void* this_ptr)
|
2001-04-10 05:04:59 +04:00
|
|
|
{
|
2006-05-17 00:55:55 +04:00
|
|
|
BX_CPU(0)->break_point = BREAK_POINT_TIME;
|
|
|
|
BX_DEBUG(("Time breakpoint triggered"));
|
|
|
|
|
|
|
|
if (timebp_queue_size > 1) {
|
|
|
|
Bit64s new_diff = timebp_queue[1] - bx_pc_system.time_ticks();
|
|
|
|
bx_pc_system.activate_timer_ticks(timebp_timer, new_diff, 1);
|
|
|
|
}
|
|
|
|
timebp_queue_size--;
|
|
|
|
for (int i = 0; i < timebp_queue_size; i++)
|
|
|
|
timebp_queue[i] = timebp_queue[i+1];
|
2001-04-10 05:04:59 +04:00
|
|
|
}
|
|
|
|
#endif // BX_DEBUGGER
|
|
|
|
|
2005-04-26 23:19:58 +04:00
|
|
|
Bit64u bx_pc_system_c::time_usec_sequential()
|
|
|
|
{
|
2006-05-17 00:55:55 +04:00
|
|
|
Bit64u this_time_usec = time_usec();
|
|
|
|
if(this_time_usec != lastTimeUsec) {
|
2003-02-14 07:22:16 +03:00
|
|
|
Bit64u diff_usec = this_time_usec-lastTimeUsec;
|
|
|
|
lastTimeUsec = this_time_usec;
|
|
|
|
if(diff_usec >= usecSinceLast) {
|
|
|
|
usecSinceLast = 0;
|
|
|
|
} else {
|
|
|
|
usecSinceLast -= diff_usec;
|
|
|
|
}
|
2006-05-17 00:55:55 +04:00
|
|
|
}
|
|
|
|
usecSinceLast++;
|
|
|
|
return (this_time_usec+usecSinceLast);
|
2003-02-14 07:22:16 +03:00
|
|
|
}
|
2005-04-26 23:19:58 +04:00
|
|
|
|
2006-05-17 00:55:55 +04:00
|
|
|
Bit64u bx_pc_system_c::time_usec()
|
|
|
|
{
|
|
|
|
return (Bit64u) (((double)(Bit64s)time_ticks()) / m_ips);
|
2001-07-02 00:42:56 +04:00
|
|
|
}
|
2001-04-10 05:04:59 +04:00
|
|
|
|
2005-04-26 23:19:58 +04:00
|
|
|
void bx_pc_system_c::start_timers(void) { }
|
2001-04-10 05:04:59 +04:00
|
|
|
|
2005-04-26 23:19:58 +04:00
|
|
|
void bx_pc_system_c::activate_timer_ticks(unsigned i, Bit64u ticks, bx_bool continuous)
|
2001-04-10 05:04:59 +04:00
|
|
|
{
|
2002-10-03 19:47:13 +04:00
|
|
|
#if BX_TIMER_DEBUG
|
|
|
|
if (i >= numTimers)
|
|
|
|
BX_PANIC(("activate_timer_ticks: timer %u OOB", i));
|
2006-05-18 22:08:30 +04:00
|
|
|
if (i == 0)
|
|
|
|
BX_PANIC(("activate_timer_ticks: timer 0 is the NullTimer!"));
|
2002-10-03 19:47:13 +04:00
|
|
|
if (timer[i].period < MinAllowableTimerPeriod)
|
2003-06-07 23:16:55 +04:00
|
|
|
BX_PANIC(("activate_timer_ticks: timer[%u].period of " FMT_LL "u < min of %u",
|
2002-10-03 19:47:13 +04:00
|
|
|
i, timer[i].period, MinAllowableTimerPeriod));
|
|
|
|
#endif
|
2001-04-10 05:04:59 +04:00
|
|
|
|
2002-10-03 19:47:13 +04:00
|
|
|
// If the timer frequency is rediculously low, make it more sane.
|
|
|
|
// This happens when 'ips' is too low.
|
|
|
|
if (ticks < MinAllowableTimerPeriod) {
|
|
|
|
//BX_INFO(("activate_timer_ticks: adjusting ticks of %llu to min of %u",
|
|
|
|
// ticks, MinAllowableTimerPeriod));
|
|
|
|
ticks = MinAllowableTimerPeriod;
|
2005-04-26 23:19:58 +04:00
|
|
|
}
|
2001-04-10 05:04:59 +04:00
|
|
|
|
2002-10-03 19:47:13 +04:00
|
|
|
timer[i].period = ticks;
|
2002-10-04 20:26:10 +04:00
|
|
|
timer[i].timeToFire = (ticksTotal + Bit64u(currCountdownPeriod-currCountdown)) +
|
2002-10-03 19:47:13 +04:00
|
|
|
ticks;
|
|
|
|
timer[i].active = 1;
|
|
|
|
timer[i].continuous = continuous;
|
2001-04-10 05:04:59 +04:00
|
|
|
|
2002-10-04 20:26:10 +04:00
|
|
|
if (ticks < Bit64u(currCountdown)) {
|
2002-10-03 19:47:13 +04:00
|
|
|
// This new timer needs to fire before the current countdown.
|
|
|
|
// Skew the current countdown and countdown period to be smaller
|
|
|
|
// by the delta.
|
2002-10-04 20:26:10 +04:00
|
|
|
currCountdownPeriod -= (currCountdown - Bit32u(ticks));
|
|
|
|
currCountdown = Bit32u(ticks);
|
2005-04-26 23:19:58 +04:00
|
|
|
}
|
2001-04-10 05:04:59 +04:00
|
|
|
}
|
|
|
|
|
2005-04-26 23:19:58 +04:00
|
|
|
void bx_pc_system_c::activate_timer(unsigned i, Bit32u useconds, bx_bool continuous)
|
2001-04-10 05:04:59 +04:00
|
|
|
{
|
2002-10-03 19:47:13 +04:00
|
|
|
Bit64u ticks;
|
2001-04-10 05:04:59 +04:00
|
|
|
|
2002-10-03 19:47:13 +04:00
|
|
|
#if BX_TIMER_DEBUG
|
|
|
|
if (i >= numTimers)
|
|
|
|
BX_PANIC(("activate_timer: timer %u OOB", i));
|
2006-05-18 22:08:30 +04:00
|
|
|
if (i == 0)
|
|
|
|
BX_PANIC(("activate_timer: timer 0 is the nullTimer!"));
|
2002-10-03 19:47:13 +04:00
|
|
|
#endif
|
2001-04-10 05:04:59 +04:00
|
|
|
|
|
|
|
// if useconds = 0, use default stored in period field
|
|
|
|
// else set new period from useconds
|
2002-10-03 19:47:13 +04:00
|
|
|
if (useconds==0) {
|
|
|
|
ticks = timer[i].period;
|
2005-04-26 23:19:58 +04:00
|
|
|
}
|
2001-04-10 05:04:59 +04:00
|
|
|
else {
|
2002-10-03 19:47:13 +04:00
|
|
|
// convert useconds to number of ticks
|
|
|
|
ticks = (Bit64u) (double(useconds) * m_ips);
|
|
|
|
|
|
|
|
// If the timer frequency is rediculously low, make it more sane.
|
|
|
|
// This happens when 'ips' is too low.
|
|
|
|
if (ticks < MinAllowableTimerPeriod) {
|
|
|
|
//BX_INFO(("activate_timer: adjusting ticks of %llu to min of %u",
|
|
|
|
// ticks, MinAllowableTimerPeriod));
|
|
|
|
ticks = MinAllowableTimerPeriod;
|
2005-04-26 23:19:58 +04:00
|
|
|
}
|
2002-10-03 19:47:13 +04:00
|
|
|
|
|
|
|
timer[i].period = ticks;
|
2005-04-26 23:19:58 +04:00
|
|
|
}
|
2002-10-03 19:47:13 +04:00
|
|
|
|
|
|
|
activate_timer_ticks(i, ticks, continuous);
|
2001-04-10 05:04:59 +04:00
|
|
|
}
|
|
|
|
|
2006-03-04 19:58:10 +03:00
|
|
|
void bx_pc_system_c::deactivate_timer(unsigned i)
|
2001-04-10 05:04:59 +04:00
|
|
|
{
|
2002-10-03 19:47:13 +04:00
|
|
|
#if BX_TIMER_DEBUG
|
|
|
|
if (i >= numTimers)
|
|
|
|
BX_PANIC(("deactivate_timer: timer %u OOB", i));
|
2006-05-17 00:55:55 +04:00
|
|
|
if (i == 0)
|
|
|
|
BX_PANIC(("deactivate_timer: timer 0 is the nullTimer!"));
|
2002-10-03 19:47:13 +04:00
|
|
|
#endif
|
2001-04-10 05:04:59 +04:00
|
|
|
|
2002-10-03 19:47:13 +04:00
|
|
|
timer[i].active = 0;
|
2001-04-10 05:04:59 +04:00
|
|
|
}
|
2002-10-06 18:55:06 +04:00
|
|
|
|
2006-05-27 18:02:34 +04:00
|
|
|
bx_bool bx_pc_system_c::unregisterTimer(unsigned timerIndex)
|
2002-10-06 18:55:06 +04:00
|
|
|
{
|
2002-10-06 21:29:22 +04:00
|
|
|
#if BX_TIMER_DEBUG
|
2006-05-27 18:02:34 +04:00
|
|
|
if (timerIndex >= numTimers)
|
|
|
|
BX_PANIC(("unregisterTimer: timer %u OOB", timerIndex));
|
|
|
|
if (timerIndex == 0)
|
2002-10-06 21:29:22 +04:00
|
|
|
BX_PANIC(("unregisterTimer: timer 0 is the nullTimer!"));
|
2006-05-27 18:02:34 +04:00
|
|
|
if (timer[timerIndex].inUse == 0)
|
|
|
|
BX_PANIC(("unregisterTimer: timer %u is not in-use!", timerIndex));
|
2002-10-06 21:29:22 +04:00
|
|
|
#endif
|
|
|
|
|
2006-05-27 18:02:34 +04:00
|
|
|
if (timer[timerIndex].active) {
|
|
|
|
BX_PANIC(("unregisterTimer: timer '%s' is still active!", timer[timerIndex].id));
|
2002-10-06 18:55:06 +04:00
|
|
|
return(0); // Fail.
|
2005-04-26 23:19:58 +04:00
|
|
|
}
|
2002-10-06 21:29:22 +04:00
|
|
|
|
|
|
|
// Reset timer fields for good measure.
|
2006-05-27 18:02:34 +04:00
|
|
|
timer[timerIndex].inUse = 0; // No longer registered.
|
|
|
|
timer[timerIndex].period = BX_MAX_BIT64S; // Max value (invalid)
|
|
|
|
timer[timerIndex].timeToFire = BX_MAX_BIT64S; // Max value (invalid)
|
|
|
|
timer[timerIndex].continuous = 0;
|
|
|
|
timer[timerIndex].funct = NULL;
|
|
|
|
timer[timerIndex].this_ptr = NULL;
|
|
|
|
memset(timer[timerIndex].id, 0, BxMaxTimerIDLen);
|
|
|
|
|
|
|
|
if (timerIndex == (numTimers-1)) numTimers--;
|
2002-10-06 21:29:22 +04:00
|
|
|
|
|
|
|
return(1); // OK
|
2002-10-06 18:55:06 +04:00
|
|
|
}
|