Searched refs:history (Results 1 - 9 of 9) sorted by relevance

/gem5/src/cpu/pred/
H A Dbi_mode.cc55 fatal("Invalid global history predictor size.\n");
67 * For an unconditional branch we set its history such that
74 BPHistory *history = new BPHistory; local
75 history->globalHistoryReg = globalHistoryReg[tid];
76 history->takenUsed = true;
77 history->takenPred = true;
78 history->notTakenPred = true;
79 history->finalPred = true;
80 bpHistory = static_cast<void*>(history);
87 BPHistory *history local
[all...]
H A Dtournament.cc79 fatal("Invalid local history table size!\n");
82 //Setup the history table for the local table
88 // Set up the global history mask
105 fatal("Global predictor too large for global history bits!\n");
108 fatal("Choice predictor too large for global history bits!\n");
113 inform("More global history bits than required by predictors\n");
200 BPHistory *history = new BPHistory;
201 history->globalHistory = globalHistory[tid];
202 history->localPredTaken = local_prediction;
203 history
[all...]
H A Dtage_sc_l_8KB.cc85 // only 1 local history here
147 TAGE_SC_L_TAGE_8KB::initFoldedHistories(ThreadHistory & history) argument
152 history.computeIndices[i].init(
154 history.computeTags[0][i].init(
155 history.computeIndices[i].origLength, 13);
156 history.computeTags[1][i].init(
157 history.computeIndices[i].origLength, 11);
H A Dtage_base.cc93 // we use int type for the path history, so it cannot be more than
105 for (auto& history : threadHistory) {
106 history.pathHist = 0;
107 history.globalHistory = new uint8_t[histBufferSize];
108 history.gHist = history.globalHistory;
109 memset(history.gHist, 0, histBufferSize);
110 history.ptGhist = 0;
124 for (auto& history : threadHistory) {
125 history
146 initFoldedHistories(ThreadHistory & history) argument
[all...]
H A Dtage_sc_l_8KB.hh56 void initFoldedHistories(ThreadHistory & history) override;
72 // global branch history GEHL
84 int64_t globalHist; // global history
H A Dtage_base.hh38 * Implementation of a TAGE branch predictor. TAGE is a global-history based
41 * branch history. The different lengths of global branch history used to
42 * index the partially tagged tables grow geometrically. A small path history
46 * history that matches provides the prediction (some exceptions apply).
47 * Entries are allocated in components using a longer history than the
80 // Folded History Table - compressed history
123 // Primary branch history entry
202 * Utility function to shuffle the path history
204 * @param phist The path history
[all...]
/gem5/ext/googletest/googletest/test/
H A Dgtest-linked_ptr_test.cc44 Message* history = NULL; member in namespace:__anon50
49 A(): mynum(num++) { *history << "A" << mynum << " ctor\n"; }
50 virtual ~A() { *history << "A" << mynum << " dtor\n"; }
51 virtual void Use() { *history << "A" << mynum << " use\n"; }
59 B() { *history << "B" << mynum << " ctor\n"; }
60 ~B() { *history << "B" << mynum << " dtor\n"; }
61 virtual void Use() { *history << "B" << mynum << " use\n"; }
68 history = new Message;
72 delete history;
73 history
[all...]
/gem5/src/mem/qos/
H A Dpolicy_pf.cc65 history.push_back(std::make_pair(m_id, score));
67 fatal_if(history.size() > memCtrl->numPriorities(),
98 // Sorting in reverse in base of personal history:
99 // First elements have higher history/score -> lower priority.
101 std::sort(history.begin(), history.end(), sort_pred);
106 for (auto m_hist = history.begin(); m_hist != history.end(); m_hist++) {
113 pkt_priority = std::distance(history.begin(), m_hist);
H A Dpolicy_pf.hh110 /** history is keeping track of every master's score */
112 std::vector<MasterHistory> history;

Completed in 12 milliseconds