2006-04-23 00:45:01 +02:00
|
|
|
|
|
|
|
#ifndef __CPU_OZONE_FRONT_END_HH__
|
|
|
|
#define __CPU_OZONE_FRONT_END_HH__
|
|
|
|
|
|
|
|
#include <deque>
|
|
|
|
|
|
|
|
//#include "cpu/ozone/cpu.hh"
|
|
|
|
#include "cpu/inst_seq.hh"
|
|
|
|
#include "cpu/o3/bpred_unit.hh"
|
|
|
|
#include "cpu/ozone/rename_table.hh"
|
|
|
|
//#include "cpu/ozone/thread_state.hh"
|
|
|
|
#include "mem/mem_req.hh"
|
|
|
|
#include "sim/eventq.hh"
|
|
|
|
#include "sim/stats.hh"
|
|
|
|
|
|
|
|
class ExecContext;
|
|
|
|
class MemInterface;
|
|
|
|
template <class>
|
|
|
|
class OzoneThreadState;
|
|
|
|
class PageTable;
|
|
|
|
template <class>
|
|
|
|
class TimeBuffer;
|
|
|
|
|
|
|
|
template <class Impl>
|
|
|
|
class FrontEnd
|
|
|
|
{
|
|
|
|
public:
|
|
|
|
typedef typename Impl::Params Params;
|
|
|
|
typedef typename Impl::DynInst DynInst;
|
|
|
|
typedef typename Impl::DynInstPtr DynInstPtr;
|
|
|
|
typedef typename Impl::FullCPU FullCPU;
|
|
|
|
typedef typename Impl::BackEnd BackEnd;
|
|
|
|
|
|
|
|
typedef typename Impl::FullCPU::OzoneXC OzoneXC;
|
|
|
|
typedef typename Impl::FullCPU::CommStruct CommStruct;
|
|
|
|
|
|
|
|
FrontEnd(Params *params);
|
|
|
|
|
|
|
|
std::string name() const;
|
|
|
|
|
|
|
|
void setCPU(FullCPU *cpu_ptr)
|
|
|
|
{ cpu = cpu_ptr; }
|
|
|
|
|
|
|
|
void setBackEnd(BackEnd *back_end_ptr)
|
|
|
|
{ backEnd = back_end_ptr; }
|
|
|
|
|
|
|
|
void setCommBuffer(TimeBuffer<CommStruct> *_comm);
|
|
|
|
|
|
|
|
void setXC(ExecContext *xc_ptr);
|
|
|
|
|
|
|
|
void setThreadState(OzoneThreadState<Impl> *thread_ptr)
|
|
|
|
{ thread = thread_ptr; }
|
|
|
|
|
|
|
|
void regStats();
|
|
|
|
|
|
|
|
void tick();
|
|
|
|
Fault fetchCacheLine();
|
|
|
|
void processInst(DynInstPtr &inst);
|
|
|
|
void squash(const InstSeqNum &squash_num, const Addr &next_PC,
|
|
|
|
const bool is_branch = false, const bool branch_taken = false);
|
|
|
|
DynInstPtr getInst();
|
|
|
|
|
2006-04-24 23:10:06 +02:00
|
|
|
void processCacheCompletion(MemReqPtr &req);
|
2006-04-23 00:45:01 +02:00
|
|
|
|
|
|
|
void addFreeRegs(int num_freed);
|
|
|
|
|
|
|
|
bool isEmpty() { return instBuffer.empty(); }
|
|
|
|
|
|
|
|
private:
|
|
|
|
bool updateStatus();
|
|
|
|
|
|
|
|
void checkBE();
|
|
|
|
DynInstPtr getInstFromCacheline();
|
|
|
|
void renameInst(DynInstPtr &inst);
|
|
|
|
// Returns true if we need to stop the front end this cycle
|
|
|
|
bool processBarriers(DynInstPtr &inst);
|
|
|
|
|
|
|
|
void handleFault(Fault &fault);
|
2006-04-23 01:10:39 +02:00
|
|
|
public:
|
|
|
|
Fault getFault() { return fetchFault; }
|
|
|
|
private:
|
|
|
|
Fault fetchFault;
|
2006-04-23 00:45:01 +02:00
|
|
|
|
|
|
|
// Align an address (typically a PC) to the start of an I-cache block.
|
|
|
|
// We fold in the PISA 64- to 32-bit conversion here as well.
|
|
|
|
Addr icacheBlockAlignPC(Addr addr)
|
|
|
|
{
|
|
|
|
addr = TheISA::realPCToFetchPC(addr);
|
|
|
|
return (addr & ~(cacheBlkMask));
|
|
|
|
}
|
|
|
|
|
|
|
|
InstSeqNum getAndIncrementInstSeq()
|
|
|
|
{ return cpu->globalSeqNum++; }
|
|
|
|
|
|
|
|
public:
|
|
|
|
FullCPU *cpu;
|
|
|
|
|
|
|
|
BackEnd *backEnd;
|
|
|
|
|
|
|
|
ExecContext *xc;
|
|
|
|
|
|
|
|
OzoneThreadState<Impl> *thread;
|
|
|
|
|
|
|
|
enum Status {
|
|
|
|
Running,
|
|
|
|
Idle,
|
|
|
|
IcacheMissStall,
|
|
|
|
IcacheMissComplete,
|
|
|
|
SerializeBlocked,
|
|
|
|
SerializeComplete,
|
|
|
|
RenameBlocked,
|
2006-04-24 23:10:06 +02:00
|
|
|
QuiescePending,
|
2006-04-23 00:45:01 +02:00
|
|
|
BEBlocked
|
|
|
|
};
|
|
|
|
|
|
|
|
Status status;
|
|
|
|
|
|
|
|
private:
|
|
|
|
TimeBuffer<CommStruct> *comm;
|
|
|
|
typename TimeBuffer<CommStruct>::wire fromCommit;
|
|
|
|
|
|
|
|
typedef typename Impl::BranchPred BranchPred;
|
|
|
|
|
|
|
|
// Typedef for semi-opaque type that holds any information the branch
|
|
|
|
// predictor needs to update itself. Only two fields are used outside of
|
|
|
|
// branch predictor, nextPC and isTaken.
|
|
|
|
// typedef typename BranchPred::BPredInfo BPredInfo;
|
|
|
|
|
|
|
|
BranchPred branchPred;
|
|
|
|
|
|
|
|
class ICacheCompletionEvent : public Event
|
|
|
|
{
|
|
|
|
private:
|
2006-04-24 23:10:06 +02:00
|
|
|
MemReqPtr req;
|
2006-04-23 00:45:01 +02:00
|
|
|
FrontEnd *frontEnd;
|
|
|
|
|
|
|
|
public:
|
2006-04-24 23:10:06 +02:00
|
|
|
ICacheCompletionEvent(MemReqPtr &_req, FrontEnd *_fe);
|
2006-04-23 00:45:01 +02:00
|
|
|
|
|
|
|
virtual void process();
|
|
|
|
virtual const char *description();
|
|
|
|
};
|
|
|
|
|
|
|
|
MemInterface *icacheInterface;
|
|
|
|
|
|
|
|
#if !FULL_SYSTEM
|
|
|
|
PageTable *pTable;
|
|
|
|
#endif
|
|
|
|
|
|
|
|
MemReqPtr memReq;
|
|
|
|
|
|
|
|
/** Mask to get a cache block's address. */
|
|
|
|
Addr cacheBlkMask;
|
|
|
|
|
|
|
|
unsigned cacheBlkSize;
|
|
|
|
|
|
|
|
Addr cacheBlkPC;
|
|
|
|
|
|
|
|
/** The cache line being fetched. */
|
|
|
|
uint8_t *cacheData;
|
|
|
|
|
|
|
|
bool fetchCacheLineNextCycle;
|
|
|
|
|
|
|
|
bool cacheBlkValid;
|
|
|
|
|
|
|
|
public:
|
|
|
|
RenameTable<Impl> renameTable;
|
|
|
|
|
|
|
|
private:
|
|
|
|
Addr PC;
|
|
|
|
Addr nextPC;
|
|
|
|
|
|
|
|
public:
|
|
|
|
void setPC(Addr val) { PC = val; }
|
|
|
|
void setNextPC(Addr val) { nextPC = val; }
|
|
|
|
|
2006-04-24 23:10:06 +02:00
|
|
|
void wakeFromQuiesce();
|
|
|
|
|
2006-04-23 00:45:01 +02:00
|
|
|
void dumpInsts();
|
|
|
|
|
|
|
|
private:
|
|
|
|
typedef typename std::deque<DynInstPtr> InstBuff;
|
|
|
|
typedef typename InstBuff::iterator InstBuffIt;
|
|
|
|
|
|
|
|
InstBuff instBuffer;
|
|
|
|
|
|
|
|
int instBufferSize;
|
|
|
|
|
|
|
|
int maxInstBufferSize;
|
|
|
|
|
|
|
|
int width;
|
|
|
|
|
|
|
|
int freeRegs;
|
|
|
|
|
|
|
|
int numPhysRegs;
|
|
|
|
|
|
|
|
bool serializeNext;
|
|
|
|
|
|
|
|
DynInstPtr barrierInst;
|
|
|
|
|
|
|
|
// number of idle cycles
|
|
|
|
/*
|
|
|
|
Stats::Average<> notIdleFraction;
|
|
|
|
Stats::Formula idleFraction;
|
|
|
|
*/
|
|
|
|
// @todo: Consider making these vectors and tracking on a per thread basis.
|
|
|
|
/** Stat for total number of cycles stalled due to an icache miss. */
|
|
|
|
Stats::Scalar<> icacheStallCycles;
|
|
|
|
/** Stat for total number of fetched instructions. */
|
|
|
|
Stats::Scalar<> fetchedInsts;
|
|
|
|
Stats::Scalar<> fetchedBranches;
|
|
|
|
/** Stat for total number of predicted branches. */
|
|
|
|
Stats::Scalar<> predictedBranches;
|
|
|
|
/** Stat for total number of cycles spent fetching. */
|
|
|
|
Stats::Scalar<> fetchCycles;
|
|
|
|
|
|
|
|
Stats::Scalar<> fetchIdleCycles;
|
|
|
|
/** Stat for total number of cycles spent squashing. */
|
|
|
|
Stats::Scalar<> fetchSquashCycles;
|
|
|
|
/** Stat for total number of cycles spent blocked due to other stages in
|
|
|
|
* the pipeline.
|
|
|
|
*/
|
|
|
|
Stats::Scalar<> fetchBlockedCycles;
|
|
|
|
/** Stat for total number of fetched cache lines. */
|
|
|
|
Stats::Scalar<> fetchedCacheLines;
|
|
|
|
/** Distribution of number of instructions fetched each cycle. */
|
|
|
|
Stats::Distribution<> fetchNisnDist;
|
|
|
|
// Stats::Vector<> qfull_iq_occupancy;
|
|
|
|
// Stats::VectorDistribution<> qfull_iq_occ_dist_;
|
|
|
|
Stats::Formula idleRate;
|
|
|
|
Stats::Formula branchRate;
|
|
|
|
Stats::Formula fetchRate;
|
|
|
|
Stats::Scalar<> IFQCount; // cumulative IFQ occupancy
|
|
|
|
Stats::Formula IFQOccupancy;
|
|
|
|
Stats::Formula IFQLatency;
|
|
|
|
Stats::Scalar<> IFQFcount; // cumulative IFQ full count
|
|
|
|
Stats::Formula IFQFullRate;
|
|
|
|
|
|
|
|
Stats::Scalar<> dispatchCountStat;
|
|
|
|
Stats::Scalar<> dispatchedSerializing;
|
|
|
|
Stats::Scalar<> dispatchedTempSerializing;
|
|
|
|
Stats::Scalar<> dispatchSerializeStallCycles;
|
|
|
|
Stats::Formula dispatchRate;
|
|
|
|
Stats::Formula regIntFull;
|
|
|
|
Stats::Formula regFpFull;
|
|
|
|
};
|
|
|
|
|
|
|
|
#endif // __CPU_OZONE_FRONT_END_HH__
|