panic("FIFO ordering violated: %s name: %s current time: %d "
"delta: %d arrival_time: %d last arrival_time: %d\n",
*this, m_name,
- current_time * g_system_ptr->getClock(),
- delta * g_system_ptr->getClock(),
- arrival_time * g_system_ptr->getClock(),
- m_last_arrival_time * g_system_ptr->getClock());
+ current_time * g_system_ptr->clockPeriod(),
+ delta * g_system_ptr->clockPeriod(),
+ arrival_time * g_system_ptr->clockPeriod(),
+ m_last_arrival_time * g_system_ptr->clockPeriod());
}
}
greater<MessageBufferNode>());
DPRINTF(RubyQueue, "Enqueue with arrival_time %lld.\n",
- arrival_time * g_system_ptr->getClock());
+ arrival_time * g_system_ptr->clockPeriod());
DPRINTF(RubyQueue, "Enqueue Message: %s.\n", (*(message.get())));
// Schedule the wakeup
void
Consumer::scheduleEventAbsolute(EventManager *em, Time timeAbs)
{
- Tick evt_time = timeAbs * g_system_ptr->getClock();
+ Tick evt_time = g_system_ptr->clockPeriod() * timeAbs;
if (!alreadyScheduled(evt_time)) {
// This wakeup is not redundant
ConsumerEvent *evt = new ConsumerEvent(this);
}
//g_system_ptr->getNetwork()->printStats(out);
- schedule(m_event, curTick() + m_stats_period * g_system_ptr->getClock());
+ schedule(m_event, g_system_ptr->clockEdge(Cycles(m_stats_period )));
}
void
}
m_periodic_output_file_ptr = new ofstream(filename.c_str());
- schedule(m_event, curTick() + g_system_ptr->getClock());
+ schedule(m_event, g_system_ptr->clockEdge(Cycles(1)));
}
void
<< " Ruby cycles" << endl;
m_stats_period = period;
- schedule(m_event, curTick() + g_system_ptr->getClock());
+ schedule(m_event, g_system_ptr->clockEdge(Cycles(1)));
}
void
DPRINTF(RubyMemory,
"New memory request%7d: %#08x %c arrived at %10d bank = %3x sched %c\n",
m_msg_counter, addr, memRef.m_is_mem_read ? 'R':'W',
- memRef.m_time * g_system_ptr->getClock(),
+ memRef.m_time * g_system_ptr->clockPeriod(),
bank, m_event.scheduled() ? 'Y':'N');
m_profiler_ptr->profileMemReq(bank);
RubyMemoryControl::enqueueToDirectory(MemoryNode req, int latency)
{
Time arrival_time = curTick() + (latency * clock);
- Time ruby_arrival_time = arrival_time / g_system_ptr->getClock();
+ Time ruby_arrival_time = arrival_time / g_system_ptr->clockPeriod();
req.m_time = ruby_arrival_time;
m_response_queue.push_back(req);
pkt->getAddr());
// send next cycle
- ruby_port->pio_port.schedTimingReq(pkt, curTick() +
- g_system_ptr->getClock());
+ ruby_port->pio_port.schedTimingReq(pkt,
+ curTick() + g_system_ptr->clockPeriod());
return true;
}
if (needsResponse) {
DPRINTF(RubyPort, "Sending packet back over port\n");
// send next cycle
- schedTimingResp(pkt, curTick() + g_system_ptr->getClock());
+ schedTimingResp(pkt, curTick() + g_system_ptr->clockPeriod());
} else {
delete pkt;
}
# Brad Beckmann
from m5.params import *
-from m5.SimObject import SimObject
+from ClockedObject import ClockedObject
-class RubySystem(SimObject):
+class RubySystem(ClockedObject):
type = 'RubySystem'
random_seed = Param.Int(1234, "random seed used by the simulation");
randomization = Param.Bool(False,
"insert random delays on message enqueue times");
- clock = Param.Clock('1GHz', "")
+ clock = '1GHz'
block_size_bytes = Param.Int(64,
"default cache block size; must be a power of two");
mem_size = Param.MemorySize("total memory size of the system");
if (m_outstanding_count > 0) {
// If there are still outstanding requests, keep checking
schedule(deadlockCheckEvent,
- m_deadlock_threshold * g_system_ptr->getClock() +
- curTick());
+ g_system_ptr->clockPeriod() * m_deadlock_threshold + curTick());
}
}
// See if we should schedule a deadlock check
if (deadlockCheckEvent.scheduled() == false) {
schedule(deadlockCheckEvent,
- m_deadlock_threshold * g_system_ptr->getClock()
- + curTick());
+ g_system_ptr->clockPeriod() * m_deadlock_threshold + curTick());
}
Address line_addr(pkt->getAddr());
int RubySystem::m_random_seed;
bool RubySystem::m_randomization;
-Tick RubySystem::m_clock;
int RubySystem::m_block_size_bytes;
int RubySystem::m_block_size_bits;
uint64 RubySystem::m_memory_size_bytes;
MemoryVector* RubySystem::m_mem_vec_ptr;
RubySystem::RubySystem(const Params *p)
- : SimObject(p)
+ : ClockedObject(p)
{
if (g_system_ptr != NULL)
fatal("Only one RubySystem object currently allowed.\n");
m_random_seed = p->random_seed;
srandom(m_random_seed);
m_randomization = p->randomization;
- m_clock = p->clock;
m_block_size_bytes = p->block_size_bytes;
assert(isPowerOf2(m_block_size_bytes));
#include "mem/ruby/system/MemoryVector.hh"
#include "mem/ruby/system/SparseMemory.hh"
#include "params/RubySystem.hh"
-#include "sim/sim_object.hh"
+#include "sim/clocked_object.hh"
class Network;
class Profiler;
class MemoryControl;
-class RubySystem : public SimObject
+class RubySystem : public ClockedObject
{
public:
class RubyEvent : public Event
static int getBlockSizeBits() { return m_block_size_bits; }
static uint64 getMemorySizeBytes() { return m_memory_size_bytes; }
static int getMemorySizeBits() { return m_memory_size_bits; }
- Tick getTime() const { return curTick() / m_clock; }
- Tick getClock() const { return m_clock; }
+ Cycles getTime() const { return curCycle(); }
// Public Methods
static Network*
// configuration parameters
static int m_random_seed;
static bool m_randomization;
- static Tick m_clock;
static int m_block_size_bytes;
static int m_block_size_bits;
static uint64 m_memory_size_bytes;
code('out << "${{dm.ident}} = " << m_${{dm.ident}} << " ";''')
if self.isMessage:
- code('out << "Time = " << getTime() * g_system_ptr->getClock() << " ";')
+ code('out << "Time = " << g_system_ptr->clockPeriod() * getTime() << " ";')
code.dedent()
# Trailer