Minor updates for stats.
src/cpu/o3/commit_impl.hh: src/cpu/o3/fetch.hh: Update stats comments. src/cpu/o3/fetch_impl.hh: Differentiate stats. src/cpu/o3/iew.hh: src/cpu/o3/iew_impl.hh: src/cpu/o3/inst_queue.hh: src/cpu/o3/inst_queue_impl.hh: Update for stats. src/cpu/o3/lsq.hh: LSQ now has stats. src/cpu/o3/lsq_impl.hh: Register stats of all LSQ units. src/cpu/o3/lsq_unit.hh: src/cpu/o3/lsq_unit_impl.hh: Add in stats. --HG-- extra : convert_revision : 7672ecf3c02515b268c28d5a986af1432197654a
This commit is contained in:
parent
dcf02c25e3
commit
2f043aafbc
11 changed files with 165 additions and 146 deletions
|
@ -204,19 +204,6 @@ DefaultCommit<Impl>::regStats()
|
||||||
.flags(total)
|
.flags(total)
|
||||||
;
|
;
|
||||||
|
|
||||||
//
|
|
||||||
// Commit-Eligible instructions...
|
|
||||||
//
|
|
||||||
// -> The number of instructions eligible to commit in those
|
|
||||||
// cycles where we reached our commit BW limit (less the number
|
|
||||||
// actually committed)
|
|
||||||
//
|
|
||||||
// -> The average value is computed over ALL CYCLES... not just
|
|
||||||
// the BW limited cycles
|
|
||||||
//
|
|
||||||
// -> The standard deviation is computed only over cycles where
|
|
||||||
// we reached the BW limit
|
|
||||||
//
|
|
||||||
commitEligible
|
commitEligible
|
||||||
.init(cpu->number_of_threads)
|
.init(cpu->number_of_threads)
|
||||||
.name(name() + ".COM:bw_limited")
|
.name(name() + ".COM:bw_limited")
|
||||||
|
|
|
@ -421,6 +421,7 @@ class DefaultFetch
|
||||||
Stats::Scalar<> icacheStallCycles;
|
Stats::Scalar<> icacheStallCycles;
|
||||||
/** Stat for total number of fetched instructions. */
|
/** Stat for total number of fetched instructions. */
|
||||||
Stats::Scalar<> fetchedInsts;
|
Stats::Scalar<> fetchedInsts;
|
||||||
|
/** Total number of fetched branches. */
|
||||||
Stats::Scalar<> fetchedBranches;
|
Stats::Scalar<> fetchedBranches;
|
||||||
/** Stat for total number of predicted branches. */
|
/** Stat for total number of predicted branches. */
|
||||||
Stats::Scalar<> predictedBranches;
|
Stats::Scalar<> predictedBranches;
|
||||||
|
|
|
@ -915,7 +915,11 @@ DefaultFetch<Impl>::fetch(bool &status_change)
|
||||||
|
|
||||||
bool fetch_success = fetchCacheLine(fetch_PC, fault, tid);
|
bool fetch_success = fetchCacheLine(fetch_PC, fault, tid);
|
||||||
if (!fetch_success) {
|
if (!fetch_success) {
|
||||||
++fetchMiscStallCycles;
|
if (cacheBlocked) {
|
||||||
|
++icacheStallCycles;
|
||||||
|
} else {
|
||||||
|
++fetchMiscStallCycles;
|
||||||
|
}
|
||||||
return;
|
return;
|
||||||
}
|
}
|
||||||
} else {
|
} else {
|
||||||
|
|
|
@ -437,14 +437,6 @@ class DefaultIEW
|
||||||
Stats::Scalar<> iewIQFullEvents;
|
Stats::Scalar<> iewIQFullEvents;
|
||||||
/** Stat for number of times the LSQ becomes full. */
|
/** Stat for number of times the LSQ becomes full. */
|
||||||
Stats::Scalar<> iewLSQFullEvents;
|
Stats::Scalar<> iewLSQFullEvents;
|
||||||
/** Stat for total number of executed instructions. */
|
|
||||||
Stats::Scalar<> iewExecutedInsts;
|
|
||||||
/** Stat for total number of executed load instructions. */
|
|
||||||
Stats::Vector<> iewExecLoadInsts;
|
|
||||||
/** Stat for total number of executed store instructions. */
|
|
||||||
// Stats::Scalar<> iewExecStoreInsts;
|
|
||||||
/** Stat for total number of squashed instructions skipped at execute. */
|
|
||||||
Stats::Scalar<> iewExecSquashedInsts;
|
|
||||||
/** Stat for total number of memory ordering violation events. */
|
/** Stat for total number of memory ordering violation events. */
|
||||||
Stats::Scalar<> memOrderViolationEvents;
|
Stats::Scalar<> memOrderViolationEvents;
|
||||||
/** Stat for total number of incorrect predicted taken branches. */
|
/** Stat for total number of incorrect predicted taken branches. */
|
||||||
|
@ -454,28 +446,25 @@ class DefaultIEW
|
||||||
/** Stat for total number of mispredicted branches detected at execute. */
|
/** Stat for total number of mispredicted branches detected at execute. */
|
||||||
Stats::Formula branchMispredicts;
|
Stats::Formula branchMispredicts;
|
||||||
|
|
||||||
|
/** Stat for total number of executed instructions. */
|
||||||
|
Stats::Scalar<> iewExecutedInsts;
|
||||||
|
/** Stat for total number of executed load instructions. */
|
||||||
|
Stats::Vector<> iewExecLoadInsts;
|
||||||
|
/** Stat for total number of squashed instructions skipped at execute. */
|
||||||
|
Stats::Scalar<> iewExecSquashedInsts;
|
||||||
/** Number of executed software prefetches. */
|
/** Number of executed software prefetches. */
|
||||||
Stats::Vector<> exeSwp;
|
Stats::Vector<> iewExecutedSwp;
|
||||||
/** Number of executed nops. */
|
/** Number of executed nops. */
|
||||||
Stats::Vector<> exeNop;
|
Stats::Vector<> iewExecutedNop;
|
||||||
/** Number of executed meomory references. */
|
/** Number of executed meomory references. */
|
||||||
Stats::Vector<> exeRefs;
|
Stats::Vector<> iewExecutedRefs;
|
||||||
/** Number of executed branches. */
|
/** Number of executed branches. */
|
||||||
Stats::Vector<> exeBranches;
|
Stats::Vector<> iewExecutedBranches;
|
||||||
|
|
||||||
// Stats::Vector<> issued_ops;
|
|
||||||
/*
|
|
||||||
Stats::Vector<> stat_fu_busy;
|
|
||||||
Stats::Vector2d<> stat_fuBusy;
|
|
||||||
Stats::Vector<> dist_unissued;
|
|
||||||
Stats::Vector2d<> stat_issued_inst_type;
|
|
||||||
*/
|
|
||||||
/** Number of instructions issued per cycle. */
|
|
||||||
Stats::Formula issueRate;
|
|
||||||
/** Number of executed store instructions. */
|
/** Number of executed store instructions. */
|
||||||
Stats::Formula iewExecStoreInsts;
|
Stats::Formula iewExecStoreInsts;
|
||||||
// Stats::Formula issue_op_rate;
|
/** Number of instructions executed per cycle. */
|
||||||
// Stats::Formula fu_busy_rate;
|
Stats::Formula iewExecRate;
|
||||||
|
|
||||||
/** Number of instructions sent to commit. */
|
/** Number of instructions sent to commit. */
|
||||||
Stats::Vector<> iewInstsToCommit;
|
Stats::Vector<> iewInstsToCommit;
|
||||||
/** Number of instructions that writeback. */
|
/** Number of instructions that writeback. */
|
||||||
|
@ -488,7 +477,6 @@ class DefaultIEW
|
||||||
* to resource contention.
|
* to resource contention.
|
||||||
*/
|
*/
|
||||||
Stats::Vector<> wbPenalized;
|
Stats::Vector<> wbPenalized;
|
||||||
|
|
||||||
/** Number of instructions per cycle written back. */
|
/** Number of instructions per cycle written back. */
|
||||||
Stats::Formula wbRate;
|
Stats::Formula wbRate;
|
||||||
/** Average number of woken instructions per writeback. */
|
/** Average number of woken instructions per writeback. */
|
||||||
|
|
|
@ -93,6 +93,7 @@ DefaultIEW<Impl>::regStats()
|
||||||
using namespace Stats;
|
using namespace Stats;
|
||||||
|
|
||||||
instQueue.regStats();
|
instQueue.regStats();
|
||||||
|
ldstQueue.regStats();
|
||||||
|
|
||||||
iewIdleCycles
|
iewIdleCycles
|
||||||
.name(name() + ".iewIdleCycles")
|
.name(name() + ".iewIdleCycles")
|
||||||
|
@ -138,20 +139,6 @@ DefaultIEW<Impl>::regStats()
|
||||||
.name(name() + ".iewLSQFullEvents")
|
.name(name() + ".iewLSQFullEvents")
|
||||||
.desc("Number of times the LSQ has become full, causing a stall");
|
.desc("Number of times the LSQ has become full, causing a stall");
|
||||||
|
|
||||||
iewExecutedInsts
|
|
||||||
.name(name() + ".iewExecutedInsts")
|
|
||||||
.desc("Number of executed instructions");
|
|
||||||
|
|
||||||
iewExecLoadInsts
|
|
||||||
.init(cpu->number_of_threads)
|
|
||||||
.name(name() + ".iewExecLoadInsts")
|
|
||||||
.desc("Number of load instructions executed")
|
|
||||||
.flags(total);
|
|
||||||
|
|
||||||
iewExecSquashedInsts
|
|
||||||
.name(name() + ".iewExecSquashedInsts")
|
|
||||||
.desc("Number of squashed instructions skipped in execute");
|
|
||||||
|
|
||||||
memOrderViolationEvents
|
memOrderViolationEvents
|
||||||
.name(name() + ".memOrderViolationEvents")
|
.name(name() + ".memOrderViolationEvents")
|
||||||
.desc("Number of memory order violations");
|
.desc("Number of memory order violations");
|
||||||
|
@ -170,114 +157,105 @@ DefaultIEW<Impl>::regStats()
|
||||||
|
|
||||||
branchMispredicts = predictedTakenIncorrect + predictedNotTakenIncorrect;
|
branchMispredicts = predictedTakenIncorrect + predictedNotTakenIncorrect;
|
||||||
|
|
||||||
exeSwp
|
iewExecutedInsts
|
||||||
|
.name(name() + ".EXEC:insts")
|
||||||
|
.desc("Number of executed instructions");
|
||||||
|
|
||||||
|
iewExecLoadInsts
|
||||||
|
.init(cpu->number_of_threads)
|
||||||
|
.name(name() + ".EXEC:loads")
|
||||||
|
.desc("Number of load instructions executed")
|
||||||
|
.flags(total);
|
||||||
|
|
||||||
|
iewExecSquashedInsts
|
||||||
|
.name(name() + ".EXEC:squashedInsts")
|
||||||
|
.desc("Number of squashed instructions skipped in execute");
|
||||||
|
|
||||||
|
iewExecutedSwp
|
||||||
.init(cpu->number_of_threads)
|
.init(cpu->number_of_threads)
|
||||||
.name(name() + ".EXEC:swp")
|
.name(name() + ".EXEC:swp")
|
||||||
.desc("number of swp insts executed")
|
.desc("number of swp insts executed")
|
||||||
.flags(total)
|
.flags(total);
|
||||||
;
|
|
||||||
|
|
||||||
exeNop
|
iewExecutedNop
|
||||||
.init(cpu->number_of_threads)
|
.init(cpu->number_of_threads)
|
||||||
.name(name() + ".EXEC:nop")
|
.name(name() + ".EXEC:nop")
|
||||||
.desc("number of nop insts executed")
|
.desc("number of nop insts executed")
|
||||||
.flags(total)
|
.flags(total);
|
||||||
;
|
|
||||||
|
|
||||||
exeRefs
|
iewExecutedRefs
|
||||||
.init(cpu->number_of_threads)
|
.init(cpu->number_of_threads)
|
||||||
.name(name() + ".EXEC:refs")
|
.name(name() + ".EXEC:refs")
|
||||||
.desc("number of memory reference insts executed")
|
.desc("number of memory reference insts executed")
|
||||||
.flags(total)
|
.flags(total);
|
||||||
;
|
|
||||||
|
|
||||||
exeBranches
|
iewExecutedBranches
|
||||||
.init(cpu->number_of_threads)
|
.init(cpu->number_of_threads)
|
||||||
.name(name() + ".EXEC:branches")
|
.name(name() + ".EXEC:branches")
|
||||||
.desc("Number of branches executed")
|
.desc("Number of branches executed")
|
||||||
.flags(total)
|
.flags(total);
|
||||||
;
|
|
||||||
|
|
||||||
issueRate
|
|
||||||
.name(name() + ".EXEC:rate")
|
|
||||||
.desc("Inst execution rate")
|
|
||||||
.flags(total)
|
|
||||||
;
|
|
||||||
issueRate = iewExecutedInsts / cpu->numCycles;
|
|
||||||
|
|
||||||
iewExecStoreInsts
|
iewExecStoreInsts
|
||||||
.name(name() + ".EXEC:stores")
|
.name(name() + ".EXEC:stores")
|
||||||
.desc("Number of stores executed")
|
.desc("Number of stores executed")
|
||||||
.flags(total)
|
.flags(total);
|
||||||
;
|
iewExecStoreInsts = iewExecutedRefs - iewExecLoadInsts;
|
||||||
iewExecStoreInsts = exeRefs - iewExecLoadInsts;
|
|
||||||
/*
|
iewExecRate
|
||||||
for (int i=0; i<Num_OpClasses; ++i) {
|
.name(name() + ".EXEC:rate")
|
||||||
stringstream subname;
|
.desc("Inst execution rate")
|
||||||
subname << opClassStrings[i] << "_delay";
|
.flags(total);
|
||||||
issue_delay_dist.subname(i, subname.str());
|
|
||||||
}
|
iewExecRate = iewExecutedInsts / cpu->numCycles;
|
||||||
*/
|
|
||||||
//
|
|
||||||
// Other stats
|
|
||||||
//
|
|
||||||
|
|
||||||
iewInstsToCommit
|
iewInstsToCommit
|
||||||
.init(cpu->number_of_threads)
|
.init(cpu->number_of_threads)
|
||||||
.name(name() + ".WB:sent")
|
.name(name() + ".WB:sent")
|
||||||
.desc("cumulative count of insts sent to commit")
|
.desc("cumulative count of insts sent to commit")
|
||||||
.flags(total)
|
.flags(total);
|
||||||
;
|
|
||||||
|
|
||||||
writebackCount
|
writebackCount
|
||||||
.init(cpu->number_of_threads)
|
.init(cpu->number_of_threads)
|
||||||
.name(name() + ".WB:count")
|
.name(name() + ".WB:count")
|
||||||
.desc("cumulative count of insts written-back")
|
.desc("cumulative count of insts written-back")
|
||||||
.flags(total)
|
.flags(total);
|
||||||
;
|
|
||||||
|
|
||||||
producerInst
|
producerInst
|
||||||
.init(cpu->number_of_threads)
|
.init(cpu->number_of_threads)
|
||||||
.name(name() + ".WB:producers")
|
.name(name() + ".WB:producers")
|
||||||
.desc("num instructions producing a value")
|
.desc("num instructions producing a value")
|
||||||
.flags(total)
|
.flags(total);
|
||||||
;
|
|
||||||
|
|
||||||
consumerInst
|
consumerInst
|
||||||
.init(cpu->number_of_threads)
|
.init(cpu->number_of_threads)
|
||||||
.name(name() + ".WB:consumers")
|
.name(name() + ".WB:consumers")
|
||||||
.desc("num instructions consuming a value")
|
.desc("num instructions consuming a value")
|
||||||
.flags(total)
|
.flags(total);
|
||||||
;
|
|
||||||
|
|
||||||
wbPenalized
|
wbPenalized
|
||||||
.init(cpu->number_of_threads)
|
.init(cpu->number_of_threads)
|
||||||
.name(name() + ".WB:penalized")
|
.name(name() + ".WB:penalized")
|
||||||
.desc("number of instrctions required to write to 'other' IQ")
|
.desc("number of instrctions required to write to 'other' IQ")
|
||||||
.flags(total)
|
.flags(total);
|
||||||
;
|
|
||||||
|
|
||||||
wbPenalizedRate
|
wbPenalizedRate
|
||||||
.name(name() + ".WB:penalized_rate")
|
.name(name() + ".WB:penalized_rate")
|
||||||
.desc ("fraction of instructions written-back that wrote to 'other' IQ")
|
.desc ("fraction of instructions written-back that wrote to 'other' IQ")
|
||||||
.flags(total)
|
.flags(total);
|
||||||
;
|
|
||||||
|
|
||||||
wbPenalizedRate = wbPenalized / writebackCount;
|
wbPenalizedRate = wbPenalized / writebackCount;
|
||||||
|
|
||||||
wbFanout
|
wbFanout
|
||||||
.name(name() + ".WB:fanout")
|
.name(name() + ".WB:fanout")
|
||||||
.desc("average fanout of values written-back")
|
.desc("average fanout of values written-back")
|
||||||
.flags(total)
|
.flags(total);
|
||||||
;
|
|
||||||
|
|
||||||
wbFanout = producerInst / consumerInst;
|
wbFanout = producerInst / consumerInst;
|
||||||
|
|
||||||
wbRate
|
wbRate
|
||||||
.name(name() + ".WB:rate")
|
.name(name() + ".WB:rate")
|
||||||
.desc("insts written-back per cycle")
|
.desc("insts written-back per cycle")
|
||||||
.flags(total)
|
.flags(total);
|
||||||
;
|
|
||||||
wbRate = writebackCount / cpu->numCycles;
|
wbRate = writebackCount / cpu->numCycles;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
@ -1098,7 +1076,7 @@ DefaultIEW<Impl>::dispatchInsts(unsigned tid)
|
||||||
|
|
||||||
instQueue.recordProducer(inst);
|
instQueue.recordProducer(inst);
|
||||||
|
|
||||||
exeNop[tid]++;
|
iewExecutedNop[tid]++;
|
||||||
|
|
||||||
add_to_iq = false;
|
add_to_iq = false;
|
||||||
} else if (inst->isExecuted()) {
|
} else if (inst->isExecuted()) {
|
||||||
|
@ -1509,9 +1487,9 @@ DefaultIEW<Impl>::updateExeInstStats(DynInstPtr &inst)
|
||||||
//
|
//
|
||||||
#ifdef TARGET_ALPHA
|
#ifdef TARGET_ALPHA
|
||||||
if (inst->isDataPrefetch())
|
if (inst->isDataPrefetch())
|
||||||
exeSwp[thread_number]++;
|
iewExecutedSwp[thread_number]++;
|
||||||
else
|
else
|
||||||
iewExecutedInsts++;
|
iewIewExecutedcutedInsts++;
|
||||||
#else
|
#else
|
||||||
iewExecutedInsts++;
|
iewExecutedInsts++;
|
||||||
#endif
|
#endif
|
||||||
|
@ -1520,13 +1498,13 @@ DefaultIEW<Impl>::updateExeInstStats(DynInstPtr &inst)
|
||||||
// Control operations
|
// Control operations
|
||||||
//
|
//
|
||||||
if (inst->isControl())
|
if (inst->isControl())
|
||||||
exeBranches[thread_number]++;
|
iewExecutedBranches[thread_number]++;
|
||||||
|
|
||||||
//
|
//
|
||||||
// Memory operations
|
// Memory operations
|
||||||
//
|
//
|
||||||
if (inst->isMemRef()) {
|
if (inst->isMemRef()) {
|
||||||
exeRefs[thread_number]++;
|
iewExecutedRefs[thread_number]++;
|
||||||
|
|
||||||
if (inst->isLoad()) {
|
if (inst->isLoad()) {
|
||||||
iewExecLoadInsts[thread_number]++;
|
iewExecLoadInsts[thread_number]++;
|
||||||
|
|
|
@ -474,12 +474,17 @@ class InstructionQueue
|
||||||
/** Stat for number of non-speculative instructions removed due to a squash.
|
/** Stat for number of non-speculative instructions removed due to a squash.
|
||||||
*/
|
*/
|
||||||
Stats::Scalar<> iqSquashedNonSpecRemoved;
|
Stats::Scalar<> iqSquashedNonSpecRemoved;
|
||||||
|
// Also include number of instructions rescheduled and replayed.
|
||||||
|
|
||||||
/** Distribution of number of instructions in the queue. */
|
/** Distribution of number of instructions in the queue.
|
||||||
|
* @todo: Need to create struct to track the entry time for each
|
||||||
|
* instruction. */
|
||||||
Stats::VectorDistribution<> queueResDist;
|
Stats::VectorDistribution<> queueResDist;
|
||||||
/** Distribution of the number of instructions issued. */
|
/** Distribution of the number of instructions issued. */
|
||||||
Stats::Distribution<> numIssuedDist;
|
Stats::Distribution<> numIssuedDist;
|
||||||
/** Distribution of the cycles it takes to issue an instruction. */
|
/** Distribution of the cycles it takes to issue an instruction.
|
||||||
|
* @todo: Need to create struct to track the ready time for each
|
||||||
|
* instruction. */
|
||||||
Stats::VectorDistribution<> issueDelayDist;
|
Stats::VectorDistribution<> issueDelayDist;
|
||||||
|
|
||||||
/** Number of times an instruction could not be issued because a
|
/** Number of times an instruction could not be issued because a
|
||||||
|
@ -492,8 +497,7 @@ class InstructionQueue
|
||||||
|
|
||||||
/** Number of instructions issued per cycle. */
|
/** Number of instructions issued per cycle. */
|
||||||
Stats::Formula issueRate;
|
Stats::Formula issueRate;
|
||||||
// Stats::Formula issue_stores;
|
|
||||||
// Stats::Formula issue_op_rate;
|
|
||||||
/** Number of times the FU was busy. */
|
/** Number of times the FU was busy. */
|
||||||
Stats::Vector<> fuBusy;
|
Stats::Vector<> fuBusy;
|
||||||
/** Number of times the FU was busy per instruction issued. */
|
/** Number of times the FU was busy per instruction issued. */
|
||||||
|
|
|
@ -289,22 +289,7 @@ InstructionQueue<Impl>::regStats()
|
||||||
.flags(total)
|
.flags(total)
|
||||||
;
|
;
|
||||||
issueRate = iqInstsIssued / cpu->numCycles;
|
issueRate = iqInstsIssued / cpu->numCycles;
|
||||||
/*
|
|
||||||
issue_stores
|
|
||||||
.name(name() + ".ISSUE:stores")
|
|
||||||
.desc("Number of stores issued")
|
|
||||||
.flags(total)
|
|
||||||
;
|
|
||||||
issue_stores = exe_refs - exe_loads;
|
|
||||||
*/
|
|
||||||
/*
|
|
||||||
issue_op_rate
|
|
||||||
.name(name() + ".ISSUE:op_rate")
|
|
||||||
.desc("Operation issue rate")
|
|
||||||
.flags(total)
|
|
||||||
;
|
|
||||||
issue_op_rate = issued_ops / numCycles;
|
|
||||||
*/
|
|
||||||
statFuBusy
|
statFuBusy
|
||||||
.init(Num_OpClasses)
|
.init(Num_OpClasses)
|
||||||
.name(name() + ".ISSUE:fu_full")
|
.name(name() + ".ISSUE:fu_full")
|
||||||
|
|
|
@ -62,6 +62,9 @@ class LSQ {
|
||||||
/** Returns the name of the LSQ. */
|
/** Returns the name of the LSQ. */
|
||||||
std::string name() const;
|
std::string name() const;
|
||||||
|
|
||||||
|
/** Registers statistics of each LSQ unit. */
|
||||||
|
void regStats();
|
||||||
|
|
||||||
/** Sets the pointer to the list of active threads. */
|
/** Sets the pointer to the list of active threads. */
|
||||||
void setActiveThreads(std::list<unsigned> *at_ptr);
|
void setActiveThreads(std::list<unsigned> *at_ptr);
|
||||||
/** Sets the CPU pointer. */
|
/** Sets the CPU pointer. */
|
||||||
|
|
|
@ -1,5 +1,5 @@
|
||||||
/*
|
/*
|
||||||
* Copyright (c) 2004-2006 The Regents of The University of Michigan
|
* Copyright (c) 2005-2006 The Regents of The University of Michigan
|
||||||
* All rights reserved.
|
* All rights reserved.
|
||||||
*
|
*
|
||||||
* Redistribution and use in source and binary forms, with or without
|
* Redistribution and use in source and binary forms, with or without
|
||||||
|
@ -106,6 +106,16 @@ LSQ<Impl>::name() const
|
||||||
return iewStage->name() + ".lsq";
|
return iewStage->name() + ".lsq";
|
||||||
}
|
}
|
||||||
|
|
||||||
|
template<class Impl>
|
||||||
|
void
|
||||||
|
LSQ<Impl>::regStats()
|
||||||
|
{
|
||||||
|
//Initialize LSQs
|
||||||
|
for (int tid=0; tid < numThreads; tid++) {
|
||||||
|
thread[tid].regStats();
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
template<class Impl>
|
template<class Impl>
|
||||||
void
|
void
|
||||||
LSQ<Impl>::setActiveThreads(list<unsigned> *at_ptr)
|
LSQ<Impl>::setActiveThreads(list<unsigned> *at_ptr)
|
||||||
|
|
|
@ -77,6 +77,9 @@ class LSQUnit {
|
||||||
/** Returns the name of the LSQ unit. */
|
/** Returns the name of the LSQ unit. */
|
||||||
std::string name() const;
|
std::string name() const;
|
||||||
|
|
||||||
|
/** Registers statistics. */
|
||||||
|
void regStats();
|
||||||
|
|
||||||
/** Sets the CPU pointer. */
|
/** Sets the CPU pointer. */
|
||||||
void setCPU(FullCPU *cpu_ptr);
|
void setCPU(FullCPU *cpu_ptr);
|
||||||
|
|
||||||
|
@ -127,9 +130,6 @@ class LSQUnit {
|
||||||
|
|
||||||
void completeDataAccess(PacketPtr pkt);
|
void completeDataAccess(PacketPtr pkt);
|
||||||
|
|
||||||
// @todo: Include stats in the LSQ unit.
|
|
||||||
//void regStats();
|
|
||||||
|
|
||||||
/** Clears all the entries in the LQ. */
|
/** Clears all the entries in the LQ. */
|
||||||
void clearLQ();
|
void clearLQ();
|
||||||
|
|
||||||
|
@ -443,25 +443,35 @@ class LSQUnit {
|
||||||
// Will also need how many read/write ports the Dcache has. Or keep track
|
// Will also need how many read/write ports the Dcache has. Or keep track
|
||||||
// of that in stage that is one level up, and only call executeLoad/Store
|
// of that in stage that is one level up, and only call executeLoad/Store
|
||||||
// the appropriate number of times.
|
// the appropriate number of times.
|
||||||
/*
|
|
||||||
// total number of loads forwaded from LSQ stores
|
|
||||||
Stats::Vector<> lsq_forw_loads;
|
|
||||||
|
|
||||||
// total number of loads ignored due to invalid addresses
|
/** Total number of loads forwaded from LSQ stores. */
|
||||||
Stats::Vector<> inv_addr_loads;
|
Stats::Scalar<> lsqForwLoads;
|
||||||
|
|
||||||
// total number of software prefetches ignored due to invalid addresses
|
/** Total number of loads ignored due to invalid addresses. */
|
||||||
Stats::Vector<> inv_addr_swpfs;
|
Stats::Scalar<> invAddrLoads;
|
||||||
|
|
||||||
// total non-speculative bogus addresses seen (debug var)
|
/** Total number of squashed loads. */
|
||||||
Counter sim_invalid_addrs;
|
Stats::Scalar<> lsqSquashedLoads;
|
||||||
Stats::Vector<> fu_busy; //cumulative fu busy
|
|
||||||
|
|
||||||
// ready loads blocked due to memory disambiguation
|
/** Total number of responses from the memory system that are
|
||||||
Stats::Vector<> lsq_blocked_loads;
|
* ignored due to the instruction already being squashed. */
|
||||||
|
Stats::Scalar<> lsqIgnoredResponses;
|
||||||
|
|
||||||
|
/** Total number of squashed stores. */
|
||||||
|
Stats::Scalar<> lsqSquashedStores;
|
||||||
|
|
||||||
|
/** Total number of software prefetches ignored due to invalid addresses. */
|
||||||
|
Stats::Scalar<> invAddrSwpfs;
|
||||||
|
|
||||||
|
/** Ready loads blocked due to partial store-forwarding. */
|
||||||
|
Stats::Scalar<> lsqBlockedLoads;
|
||||||
|
|
||||||
|
/** Number of loads that were rescheduled. */
|
||||||
|
Stats::Scalar<> lsqRescheduledLoads;
|
||||||
|
|
||||||
|
/** Number of times the LSQ is blocked due to the cache. */
|
||||||
|
Stats::Scalar<> lsqCacheBlocked;
|
||||||
|
|
||||||
Stats::Scalar<> lsqInversion;
|
|
||||||
*/
|
|
||||||
public:
|
public:
|
||||||
/** Executes the load at the given index. */
|
/** Executes the load at the given index. */
|
||||||
template <class T>
|
template <class T>
|
||||||
|
@ -519,6 +529,7 @@ LSQUnit<Impl>::read(Request *req, T &data, int load_idx)
|
||||||
if (req->getFlags() & UNCACHEABLE &&
|
if (req->getFlags() & UNCACHEABLE &&
|
||||||
(load_idx != loadHead || !load_inst->reachedCommit)) {
|
(load_idx != loadHead || !load_inst->reachedCommit)) {
|
||||||
iewStage->rescheduleMemInst(load_inst);
|
iewStage->rescheduleMemInst(load_inst);
|
||||||
|
++lsqRescheduledLoads;
|
||||||
return TheISA::genMachineCheckFault();
|
return TheISA::genMachineCheckFault();
|
||||||
}
|
}
|
||||||
|
|
||||||
|
@ -598,7 +609,7 @@ LSQUnit<Impl>::read(Request *req, T &data, int load_idx)
|
||||||
// @todo: Need to make this a parameter.
|
// @todo: Need to make this a parameter.
|
||||||
wb->schedule(curTick);
|
wb->schedule(curTick);
|
||||||
|
|
||||||
// Should keep track of stat for forwarded data
|
++lsqForwLoads;
|
||||||
return NoFault;
|
return NoFault;
|
||||||
} else if ((store_has_lower_limit && lower_load_has_store_part) ||
|
} else if ((store_has_lower_limit && lower_load_has_store_part) ||
|
||||||
(store_has_upper_limit && upper_load_has_store_part) ||
|
(store_has_upper_limit && upper_load_has_store_part) ||
|
||||||
|
@ -626,6 +637,7 @@ LSQUnit<Impl>::read(Request *req, T &data, int load_idx)
|
||||||
// Tell IQ/mem dep unit that this instruction will need to be
|
// Tell IQ/mem dep unit that this instruction will need to be
|
||||||
// rescheduled eventually
|
// rescheduled eventually
|
||||||
iewStage->rescheduleMemInst(load_inst);
|
iewStage->rescheduleMemInst(load_inst);
|
||||||
|
++lsqRescheduledLoads;
|
||||||
|
|
||||||
// Do not generate a writeback event as this instruction is not
|
// Do not generate a writeback event as this instruction is not
|
||||||
// complete.
|
// complete.
|
||||||
|
@ -633,6 +645,7 @@ LSQUnit<Impl>::read(Request *req, T &data, int load_idx)
|
||||||
"Store idx %i to load addr %#x\n",
|
"Store idx %i to load addr %#x\n",
|
||||||
store_idx, req->getVaddr());
|
store_idx, req->getVaddr());
|
||||||
|
|
||||||
|
++lsqBlockedLoads;
|
||||||
return NoFault;
|
return NoFault;
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
@ -660,6 +673,7 @@ LSQUnit<Impl>::read(Request *req, T &data, int load_idx)
|
||||||
|
|
||||||
// if we have a cache, do cache access too
|
// if we have a cache, do cache access too
|
||||||
if (!dcachePort->sendTiming(data_pkt)) {
|
if (!dcachePort->sendTiming(data_pkt)) {
|
||||||
|
++lsqCacheBlocked;
|
||||||
// There's an older load that's already going to squash.
|
// There's an older load that's already going to squash.
|
||||||
if (isLoadBlocked && blockedLoadSeqNum < load_inst->seqNum)
|
if (isLoadBlocked && blockedLoadSeqNum < load_inst->seqNum)
|
||||||
return NoFault;
|
return NoFault;
|
||||||
|
|
|
@ -196,6 +196,47 @@ LSQUnit<Impl>::name() const
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
template<class Impl>
|
||||||
|
void
|
||||||
|
LSQUnit<Impl>::regStats()
|
||||||
|
{
|
||||||
|
lsqForwLoads
|
||||||
|
.name(name() + ".forwLoads")
|
||||||
|
.desc("Number of loads that had data forwarded from stores");
|
||||||
|
|
||||||
|
invAddrLoads
|
||||||
|
.name(name() + ".invAddrLoads")
|
||||||
|
.desc("Number of loads ignored due to an invalid address");
|
||||||
|
|
||||||
|
lsqSquashedLoads
|
||||||
|
.name(name() + ".squashedLoads")
|
||||||
|
.desc("Number of loads squashed");
|
||||||
|
|
||||||
|
lsqIgnoredResponses
|
||||||
|
.name(name() + ".ignoredResponses")
|
||||||
|
.desc("Number of memory responses ignored because the instruction is squashed");
|
||||||
|
|
||||||
|
lsqSquashedStores
|
||||||
|
.name(name() + ".squashedStores")
|
||||||
|
.desc("Number of stores squashed");
|
||||||
|
|
||||||
|
invAddrSwpfs
|
||||||
|
.name(name() + ".invAddrSwpfs")
|
||||||
|
.desc("Number of software prefetches ignored due to an invalid address");
|
||||||
|
|
||||||
|
lsqBlockedLoads
|
||||||
|
.name(name() + ".blockedLoads")
|
||||||
|
.desc("Number of blocked loads due to partial load-store forwarding");
|
||||||
|
|
||||||
|
lsqRescheduledLoads
|
||||||
|
.name(name() + ".rescheduledLoads")
|
||||||
|
.desc("Number of loads that were rescheduled");
|
||||||
|
|
||||||
|
lsqCacheBlocked
|
||||||
|
.name(name() + ".cacheBlocked")
|
||||||
|
.desc("Number of times an access to memory failed due to the cache being blocked");
|
||||||
|
}
|
||||||
|
|
||||||
template<class Impl>
|
template<class Impl>
|
||||||
void
|
void
|
||||||
LSQUnit<Impl>::clearLQ()
|
LSQUnit<Impl>::clearLQ()
|
||||||
|
@ -618,7 +659,7 @@ LSQUnit<Impl>::writebackStores()
|
||||||
if (!dcachePort->sendTiming(data_pkt)) {
|
if (!dcachePort->sendTiming(data_pkt)) {
|
||||||
// Need to handle becoming blocked on a store.
|
// Need to handle becoming blocked on a store.
|
||||||
isStoreBlocked = true;
|
isStoreBlocked = true;
|
||||||
|
++lsqCacheBlocked;
|
||||||
assert(retryPkt == NULL);
|
assert(retryPkt == NULL);
|
||||||
retryPkt = data_pkt;
|
retryPkt = data_pkt;
|
||||||
} else {
|
} else {
|
||||||
|
@ -677,6 +718,7 @@ LSQUnit<Impl>::squash(const InstSeqNum &squashed_num)
|
||||||
loadTail = load_idx;
|
loadTail = load_idx;
|
||||||
|
|
||||||
decrLdIdx(load_idx);
|
decrLdIdx(load_idx);
|
||||||
|
++lsqSquashedLoads;
|
||||||
}
|
}
|
||||||
|
|
||||||
if (isLoadBlocked) {
|
if (isLoadBlocked) {
|
||||||
|
@ -723,6 +765,7 @@ LSQUnit<Impl>::squash(const InstSeqNum &squashed_num)
|
||||||
storeTail = store_idx;
|
storeTail = store_idx;
|
||||||
|
|
||||||
decrStIdx(store_idx);
|
decrStIdx(store_idx);
|
||||||
|
++lsqSquashedStores;
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
@ -782,6 +825,7 @@ LSQUnit<Impl>::writeback(DynInstPtr &inst, PacketPtr pkt)
|
||||||
// Squashed instructions do not need to complete their access.
|
// Squashed instructions do not need to complete their access.
|
||||||
if (inst->isSquashed()) {
|
if (inst->isSquashed()) {
|
||||||
assert(!inst->isStore());
|
assert(!inst->isStore());
|
||||||
|
++lsqIgnoredResponses;
|
||||||
return;
|
return;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
@ -858,6 +902,7 @@ LSQUnit<Impl>::recvRetry()
|
||||||
isStoreBlocked = false;
|
isStoreBlocked = false;
|
||||||
} else {
|
} else {
|
||||||
// Still blocked!
|
// Still blocked!
|
||||||
|
++lsqCacheBlocked;
|
||||||
}
|
}
|
||||||
} else if (isLoadBlocked) {
|
} else if (isLoadBlocked) {
|
||||||
DPRINTF(LSQUnit, "Loads squash themselves and all younger insts, "
|
DPRINTF(LSQUnit, "Loads squash themselves and all younger insts, "
|
||||||
|
|
Loading…
Reference in a new issue