inorder: add activity stats
This commit is contained in:
parent
f3bc2df663
commit
ea8909925f
|
@ -389,9 +389,17 @@ InOrderCPU::regStats()
|
|||
|
||||
idleCycles
|
||||
.name(name() + ".idleCycles")
|
||||
.desc("Total number of cycles that the CPU has spent unscheduled due "
|
||||
"to idling")
|
||||
.prereq(idleCycles);
|
||||
.desc("Number of cycles cpu's stages were not processed");
|
||||
|
||||
runCycles
|
||||
.name(name() + ".runCycles")
|
||||
.desc("Number of cycles cpu stages are processed.");
|
||||
|
||||
activity
|
||||
.name(name() + ".activity")
|
||||
.desc("Percentage of cycles cpu is active")
|
||||
.precision(6);
|
||||
activity = (runCycles / numCycles) * 100;
|
||||
|
||||
threadCycles
|
||||
.init(numThreads)
|
||||
|
@ -463,18 +471,27 @@ InOrderCPU::tick()
|
|||
|
||||
++numCycles;
|
||||
|
||||
bool pipes_idle = true;
|
||||
|
||||
//Tick each of the stages
|
||||
for (int stNum=NumStages - 1; stNum >= 0 ; stNum--) {
|
||||
pipelineStage[stNum]->tick();
|
||||
|
||||
pipes_idle = pipes_idle && pipelineStage[stNum]->idle;
|
||||
}
|
||||
|
||||
if (pipes_idle)
|
||||
idleCycles++;
|
||||
else
|
||||
runCycles++;
|
||||
|
||||
// Now advance the time buffers one tick
|
||||
timeBuffer.advance();
|
||||
for (int sqNum=0; sqNum < NumStages - 1; sqNum++) {
|
||||
stageQueue[sqNum]->advance();
|
||||
}
|
||||
activityRec.advance();
|
||||
|
||||
|
||||
// Any squashed requests, events, or insts then remove them now
|
||||
cleanUpRemovedReqs();
|
||||
cleanUpRemovedEvents();
|
||||
|
|
|
@ -729,9 +729,15 @@ class InOrderCPU : public BaseCPU
|
|||
/** Stat for total number of times the CPU is descheduled. */
|
||||
Stats::Scalar timesIdled;
|
||||
|
||||
/** Stat for total number of cycles the CPU spends descheduled. */
|
||||
/** Stat for total number of cycles the CPU spends descheduled or no stages active. */
|
||||
Stats::Scalar idleCycles;
|
||||
|
||||
/** Stat for total number of cycles the CPU is active. */
|
||||
Stats::Scalar runCycles;
|
||||
|
||||
/** Percentage of cycles a stage was active */
|
||||
Stats::Formula activity;
|
||||
|
||||
/** Stat for the number of committed instructions per thread. */
|
||||
Stats::Vector committedInsts;
|
||||
|
||||
|
|
|
@ -133,8 +133,10 @@ FirstStage::processStage(bool &status_change)
|
|||
|
||||
if (instsProcessed > 0) {
|
||||
++runCycles;
|
||||
idle = false;
|
||||
} else {
|
||||
++idleCycles;
|
||||
++idleCycles;
|
||||
idle = true;
|
||||
}
|
||||
|
||||
}
|
||||
|
|
|
@ -42,7 +42,7 @@ PipelineStage::PipelineStage(Params *params, unsigned stage_num)
|
|||
: stageNum(stage_num), stageWidth(ThePipeline::StageWidth),
|
||||
numThreads(ThePipeline::MaxThreads), _status(Inactive),
|
||||
stageBufferMax(ThePipeline::interStageBuffSize[stage_num]),
|
||||
prevStageValid(false), nextStageValid(false)
|
||||
prevStageValid(false), nextStageValid(false), idle(false)
|
||||
{
|
||||
switchedOutBuffer.resize(ThePipeline::MaxThreads);
|
||||
switchedOutValid.resize(ThePipeline::MaxThreads);
|
||||
|
@ -707,6 +707,8 @@ PipelineStage::checkSignalsAndUpdate(ThreadID tid)
|
|||
void
|
||||
PipelineStage::tick()
|
||||
{
|
||||
idle = false;
|
||||
|
||||
wroteToTimeBuffer = false;
|
||||
|
||||
bool status_change = false;
|
||||
|
@ -794,8 +796,10 @@ PipelineStage::processStage(bool &status_change)
|
|||
|
||||
if (instsProcessed > 0) {
|
||||
++runCycles;
|
||||
idle = false;
|
||||
} else {
|
||||
++idleCycles;
|
||||
idle = true;
|
||||
}
|
||||
|
||||
DPRINTF(InOrderStage, "%i left in stage %i incoming buffer.\n", skidSize(),
|
||||
|
|
|
@ -347,6 +347,8 @@ class PipelineStage
|
|||
/** Is Next Stage Valid? */
|
||||
bool nextStageValid;
|
||||
|
||||
bool idle;
|
||||
|
||||
/** Source of possible stalls. */
|
||||
struct Stalls {
|
||||
bool stage[ThePipeline::NumStages];
|
||||
|
|
|
@ -143,7 +143,8 @@ CacheUnit::getSlot(DynInstPtr inst)
|
|||
Addr req_addr = inst->getMemAddr();
|
||||
|
||||
if (resName == "icache_port" ||
|
||||
find(addrList[tid].begin(), addrList[tid].end(), req_addr) == addrList[tid].end()) {
|
||||
find(addrList[tid].begin(), addrList[tid].end(), req_addr) ==
|
||||
addrList[tid].end()) {
|
||||
|
||||
int new_slot = Resource::getSlot(inst);
|
||||
|
||||
|
@ -171,8 +172,9 @@ CacheUnit::freeSlot(int slot_num)
|
|||
{
|
||||
ThreadID tid = reqMap[slot_num]->inst->readTid();
|
||||
|
||||
vector<Addr>::iterator vect_it = find(addrList[tid].begin(), addrList[tid].end(),
|
||||
reqMap[slot_num]->inst->getMemAddr());
|
||||
vector<Addr>::iterator vect_it =
|
||||
find(addrList[tid].begin(), addrList[tid].end(),
|
||||
reqMap[slot_num]->inst->getMemAddr());
|
||||
assert(vect_it != addrList[tid].end());
|
||||
|
||||
DPRINTF(InOrderCachePort,
|
||||
|
@ -533,8 +535,6 @@ CacheUnit::doCacheAccess(DynInstPtr inst, uint64_t *write_res)
|
|||
}
|
||||
}
|
||||
|
||||
cache_req->dataPkt->time = curTick;
|
||||
|
||||
bool do_access = true; // flag to suppress cache access
|
||||
|
||||
Request *memReq = cache_req->dataPkt->req;
|
||||
|
@ -590,6 +590,7 @@ CacheUnit::processCacheCompletion(PacketPtr pkt)
|
|||
{
|
||||
// Cast to correct packet type
|
||||
CacheReqPacket* cache_pkt = dynamic_cast<CacheReqPacket*>(pkt);
|
||||
|
||||
assert(cache_pkt);
|
||||
|
||||
if (cache_pkt->cacheReq->isSquashed()) {
|
||||
|
@ -600,6 +601,9 @@ CacheUnit::processCacheCompletion(PacketPtr pkt)
|
|||
|
||||
cache_pkt->cacheReq->done();
|
||||
delete cache_pkt;
|
||||
|
||||
cpu->wakeCPU();
|
||||
|
||||
return;
|
||||
}
|
||||
|
||||
|
@ -730,6 +734,8 @@ CacheUnit::recvRetry()
|
|||
|
||||
// Clear the cache port for use again
|
||||
cachePortBlocked = false;
|
||||
|
||||
cpu->wakeCPU();
|
||||
}
|
||||
|
||||
CacheUnitEvent::CacheUnitEvent()
|
||||
|
|
Loading…
Reference in a new issue