Searched refs:pathHist (Results 1 - 8 of 8) sorted by relevance

/gem5/src/cpu/pred/
H A Dsimple_indirect.cc119 threadInfo[tid].pathHist.push_back(entry);
133 if (t_info.pathHist.empty()) return;
135 if (t_info.headHistEntry < t_info.pathHist.size() &&
136 t_info.pathHist[t_info.headHistEntry].seqNum <= seq_num) {
138 t_info.pathHist.pop_front();
150 auto squash_itr = t_info.pathHist.begin();
151 while (squash_itr != t_info.pathHist.end()) {
157 if (squash_itr != t_info.pathHist.end()) {
161 t_info.pathHist.erase(squash_itr, t_info.pathHist
[all...]
H A Dtage_sc_l.cc144 Addr t = (pc ^ (threadHistory[tid].pathHist &
157 t = (pc ^ (threadHistory[tid].pathHist & ((1 << histLengths[1]) - 1)))
191 F(threadHistory[tid].pathHist, hlen, bank);
251 tHist.pathHist = (tHist.pathHist << 1) ^ pathbit;
254 tHist.pathHist = (tHist.pathHist & ((ULL(1) << pathHistBits) - 1));
284 "path Hist: %x; pointer:%d\n", branch_pc, taken, tHist.pathHist,
H A Dtage_base.cc106 history.pathHist = 0;
223 // gindex computes a full hash of pc, ghist and pathHist
235 F(threadHistory[tid].pathHist, hlen, bank);
596 tHist.pathHist = (tHist.pathHist << 1) + pathbit;
597 tHist.pathHist = (tHist.pathHist & ((ULL(1) << pathHistBits) - 1));
601 bi->pathHist = tHist.pathHist;
617 "path Hist: %x; pointer:%d\n", branch_pc, taken, tHist.pathHist,
[all...]
H A Dsimple_indirect.hh96 std::deque<HistoryEntry> pathHist; member in struct:SimpleIndirectPredictor::ThreadInfo
H A Dtage_base.hh126 int pathHist; member in struct:TAGEBase::BranchInfo
158 : pathHist(0), ptGhist(0),
441 int pathHist; member in struct:TAGEBase::ThreadHistory
H A Dtage_sc_l_64KB.cc94 BranchInfo* bi, int & lsum, int64_t pathHist)
104 branch_pc, pathHist, pm, pgehl, pnb, logPnb, wp);
93 gPredictions(ThreadID tid, Addr branch_pc, BranchInfo* bi, int & lsum, int64_t pathHist) argument
H A Dmultiperspective_perceptron_tage.cc222 tHist.pathHist = (tHist.pathHist << 1) ^ pathbit;
H A Dtage_sc_l_8KB.cc180 F(threadHistory[tid].pathHist, hlen, bank);

Completed in 19 milliseconds