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. --- 80 unchanged lines hidden (view full) --- 89 confidence(0), tag(0), age(0), dir(0) { } 90 }; 91 92 // Tage Entry 93 struct TageEntry 94 { 95 int8_t ctr; 96 uint16_t tag; |
97 uint8_t u; |
98 TageEntry() : ctr(0), tag(0), u(0) { } 99 }; 100 101 // Folded History Table - compressed history 102 // to mix with instruction PC to index partially 103 // tagged tables. 104 struct FoldedHistory 105 { --- 249 unchanged lines hidden (view full) --- 355 void specLoopUpdate(Addr pc, bool taken, BranchInfo* bi); 356 357 const unsigned logSizeBiMP; 358 const unsigned logRatioBiModalHystEntries; 359 const unsigned logSizeTagTables; 360 const unsigned logSizeLoopPred; 361 const unsigned nHistoryTables; 362 const unsigned tagTableCounterBits; |
363 const unsigned tagTableUBits; |
364 const unsigned histBufferSize; 365 const unsigned minHist; 366 const unsigned maxHist; 367 const unsigned minTagWidth; 368 const unsigned loopTableAgeBits; 369 const unsigned loopTableConfidenceBits; 370 const unsigned loopTableTagBits; 371 const unsigned loopTableIterBits; --- 48 unchanged lines hidden --- |