1/*
2 * Copyright (c) 2014 The University of Wisconsin
3 *
4 * Copyright (c) 2006 INRIA (Institut National de Recherche en
5 * Informatique et en Automatique / French National Research Institute
6 * for Computer Science and Applied Mathematics)
7 *
8 * All rights reserved.

--- 121 unchanged lines hidden (view full) ---

130 {
131 int pathHist;
132 int ptGhist;
133 int hitBank;
134 int hitBankIndex;
135 int altBank;
136 int altBankIndex;
137 int bimodalIndex;
138 int loopTag;
139 uint16_t currentIter;
140
141 bool tagePred;
142 bool altTaken;
143 bool loopPred;
144 bool loopPredValid;
145 int loopIndex;
146 int loopHit;

--- 86 unchanged lines hidden (view full) ---

233 * branch outcome.
234 * @param ctr Reference to counter to update.
235 * @param taken Actual branch outcome.
236 * @param nbits Counter width.
237 */
238 void ctrUpdate(int8_t & ctr, bool taken, int nbits);
239
240 /**
241 * Get a branch prediction from the bimodal
242 * predictor.
243 * @param pc The unshifted branch PC.
244 * @param bi Pointer to information on the
245 * prediction.
246 */
247 bool getBimodePred(Addr pc, BranchInfo* bi) const;
248

--- 101 unchanged lines hidden (view full) ---

350 const unsigned logSizeTagTables;
351 const unsigned logSizeLoopPred;
352 const unsigned nHistoryTables;
353 const unsigned tagTableCounterBits;
354 const unsigned histBufferSize;
355 const unsigned minHist;
356 const unsigned maxHist;
357 const unsigned minTagWidth;
358
359 std::vector<bool> btablePrediction;
360 std::vector<bool> btableHysteresis;
361 TageEntry **gtable;
362 LoopEntry *ltable;
363
364 // Keep per-thread histories to
365 // support SMT.
366 struct ThreadHistory {

--- 35 unchanged lines hidden ---