867a9b84d9
cpu/simple_cpu/simple_cpu.cc: Send Copy cpu/trace/opt_cpu.cc: Calculate the block size correctly. Set lookupTable value directly, since the old way only worked for FA caches. cpu/trace/trace_cpu.cc: Don't start events if the hierarchy is in non-event mode. --HG-- extra : convert_revision : daf2db5ed7428c2fb08652cf76f6fe99d8357db5
179 lines
5.4 KiB
C++
179 lines
5.4 KiB
C++
/*
|
|
* Copyright (c) 2004 The Regents of The University of Michigan
|
|
* All rights reserved.
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted provided that the following conditions are
|
|
* met: redistributions of source code must retain the above copyright
|
|
* notice, this list of conditions and the following disclaimer;
|
|
* redistributions in binary form must reproduce the above copyright
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
* documentation and/or other materials provided with the distribution;
|
|
* neither the name of the copyright holders nor the names of its
|
|
* contributors may be used to endorse or promote products derived from
|
|
* this software without specific prior written permission.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
|
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
|
|
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
|
|
* A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
|
|
* OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
|
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
|
* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
|
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
|
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
|
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
|
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
*/
|
|
|
|
/**
|
|
* @file
|
|
* Declaration of a memory trace CPU object. Uses a memory trace to drive the
|
|
* provided memory hierarchy.
|
|
*/
|
|
|
|
#include <algorithm> // For min
|
|
|
|
#include "cpu/trace/trace_cpu.hh"
|
|
#include "cpu/trace/reader/mem_trace_reader.hh"
|
|
#include "mem/base_mem.hh" // For PARAM constructor
|
|
#include "mem/mem_interface.hh"
|
|
#include "sim/builder.hh"
|
|
#include "sim/sim_events.hh"
|
|
|
|
using namespace std;
|
|
|
|
TraceCPU::TraceCPU(const string &name,
|
|
MemInterface *icache_interface,
|
|
MemInterface *dcache_interface,
|
|
MemTraceReader *data_trace)
|
|
: BaseCPU(name, 4), icacheInterface(icache_interface),
|
|
dcacheInterface(dcache_interface),
|
|
dataTrace(data_trace), outstandingRequests(0), tickEvent(this)
|
|
{
|
|
assert(dcacheInterface);
|
|
nextCycle = dataTrace->getNextReq(nextReq);
|
|
tickEvent.schedule(0);
|
|
}
|
|
|
|
void
|
|
TraceCPU::tick()
|
|
{
|
|
assert(outstandingRequests >= 0);
|
|
assert(outstandingRequests < 1000);
|
|
int instReqs = 0;
|
|
int dataReqs = 0;
|
|
|
|
while (nextReq && curTick >= nextCycle) {
|
|
assert(nextReq->thread_num < 4 && "Not enough threads");
|
|
if (nextReq->isInstRead() && icacheInterface) {
|
|
if (icacheInterface->isBlocked())
|
|
break;
|
|
|
|
nextReq->time = curTick;
|
|
if (nextReq->cmd == Squash) {
|
|
icacheInterface->squash(nextReq->asid);
|
|
} else {
|
|
++instReqs;
|
|
if (icacheInterface->doEvents()) {
|
|
nextReq->completionEvent =
|
|
new TraceCompleteEvent(nextReq, this);
|
|
icacheInterface->access(nextReq);
|
|
} else {
|
|
icacheInterface->access(nextReq);
|
|
completeRequest(nextReq);
|
|
}
|
|
}
|
|
} else {
|
|
if (dcacheInterface->isBlocked())
|
|
break;
|
|
|
|
++dataReqs;
|
|
nextReq->time = curTick;
|
|
if (dcacheInterface->doEvents()) {
|
|
nextReq->completionEvent =
|
|
new TraceCompleteEvent(nextReq, this);
|
|
dcacheInterface->access(nextReq);
|
|
} else {
|
|
dcacheInterface->access(nextReq);
|
|
completeRequest(nextReq);
|
|
}
|
|
|
|
}
|
|
nextCycle = dataTrace->getNextReq(nextReq);
|
|
}
|
|
|
|
if (!nextReq) {
|
|
// No more requests to send. Finish trailing events and exit.
|
|
if (mainEventQueue.empty()) {
|
|
new SimExitEvent("Finshed Memory Trace");
|
|
} else {
|
|
tickEvent.schedule(mainEventQueue.nextEventTime() + 1);
|
|
}
|
|
} else {
|
|
tickEvent.schedule(max(curTick + 1, nextCycle));
|
|
}
|
|
}
|
|
|
|
void
|
|
TraceCPU::completeRequest(MemReqPtr& req)
|
|
{
|
|
}
|
|
|
|
void
|
|
TraceCompleteEvent::process()
|
|
{
|
|
tester->completeRequest(req);
|
|
}
|
|
|
|
const char *
|
|
TraceCompleteEvent::description()
|
|
{
|
|
return "trace access complete";
|
|
}
|
|
|
|
TraceCPU::TickEvent::TickEvent(TraceCPU *c)
|
|
: Event(&mainEventQueue, CPU_Tick_Pri), cpu(c)
|
|
{
|
|
}
|
|
|
|
void
|
|
TraceCPU::TickEvent::process()
|
|
{
|
|
cpu->tick();
|
|
}
|
|
|
|
const char *
|
|
TraceCPU::TickEvent::description()
|
|
{
|
|
return "TraceCPU tick event";
|
|
}
|
|
|
|
|
|
|
|
BEGIN_DECLARE_SIM_OBJECT_PARAMS(TraceCPU)
|
|
|
|
SimObjectParam<BaseMem *> icache;
|
|
SimObjectParam<BaseMem *> dcache;
|
|
SimObjectParam<MemTraceReader *> data_trace;
|
|
|
|
END_DECLARE_SIM_OBJECT_PARAMS(TraceCPU)
|
|
|
|
BEGIN_INIT_SIM_OBJECT_PARAMS(TraceCPU)
|
|
|
|
INIT_PARAM_DFLT(icache, "instruction cache", NULL),
|
|
INIT_PARAM_DFLT(dcache, "data cache", NULL),
|
|
INIT_PARAM_DFLT(data_trace, "data trace", NULL)
|
|
|
|
END_INIT_SIM_OBJECT_PARAMS(TraceCPU)
|
|
|
|
CREATE_SIM_OBJECT(TraceCPU)
|
|
{
|
|
return new TraceCPU(getInstanceName(),
|
|
(icache) ? icache->getInterface() : NULL,
|
|
(dcache) ? dcache->getInterface() : NULL,
|
|
data_trace);
|
|
}
|
|
|
|
REGISTER_SIM_OBJECT("TraceCPU", TraceCPU)
|
|
|