ltage.hh revision 13626
111784Sarthur.perais@inria.fr/* 211784Sarthur.perais@inria.fr * Copyright (c) 2014 The University of Wisconsin 311784Sarthur.perais@inria.fr * 411784Sarthur.perais@inria.fr * Copyright (c) 2006 INRIA (Institut National de Recherche en 511784Sarthur.perais@inria.fr * Informatique et en Automatique / French National Research Institute 611784Sarthur.perais@inria.fr * for Computer Science and Applied Mathematics) 711784Sarthur.perais@inria.fr * 811784Sarthur.perais@inria.fr * All rights reserved. 911784Sarthur.perais@inria.fr * 1011784Sarthur.perais@inria.fr * Redistribution and use in source and binary forms, with or without 1111784Sarthur.perais@inria.fr * modification, are permitted provided that the following conditions are 1211784Sarthur.perais@inria.fr * met: redistributions of source code must retain the above copyright 1311784Sarthur.perais@inria.fr * notice, this list of conditions and the following disclaimer; 1411784Sarthur.perais@inria.fr * redistributions in binary form must reproduce the above copyright 1511784Sarthur.perais@inria.fr * notice, this list of conditions and the following disclaimer in the 1611784Sarthur.perais@inria.fr * documentation and/or other materials provided with the distribution; 1711784Sarthur.perais@inria.fr * neither the name of the copyright holders nor the names of its 1811784Sarthur.perais@inria.fr * contributors may be used to endorse or promote products derived from 1911784Sarthur.perais@inria.fr * this software without specific prior written permission. 2011784Sarthur.perais@inria.fr * 2111784Sarthur.perais@inria.fr * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS 2211784Sarthur.perais@inria.fr * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT 2311784Sarthur.perais@inria.fr * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR 2411784Sarthur.perais@inria.fr * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT 2511784Sarthur.perais@inria.fr * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, 2611784Sarthur.perais@inria.fr * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT 2711784Sarthur.perais@inria.fr * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 2811784Sarthur.perais@inria.fr * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 2911784Sarthur.perais@inria.fr * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 3011784Sarthur.perais@inria.fr * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE 3111784Sarthur.perais@inria.fr * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 3211784Sarthur.perais@inria.fr * 3311784Sarthur.perais@inria.fr * Authors: Vignyan Reddy, Dibakar Gope and Arthur Perais, 3411784Sarthur.perais@inria.fr * from André Seznec's code. 3511784Sarthur.perais@inria.fr */ 3611784Sarthur.perais@inria.fr 3711784Sarthur.perais@inria.fr/* @file 3811784Sarthur.perais@inria.fr * Implementation of a L-TAGE branch predictor. TAGE is a global-history based 3911784Sarthur.perais@inria.fr * branch predictor. It features a PC-indexed bimodal predictor and N 4011784Sarthur.perais@inria.fr * partially tagged tables, indexed with a hash of the PC and the global 4111784Sarthur.perais@inria.fr * branch history. The different lengths of global branch history used to 4211784Sarthur.perais@inria.fr * index the partially tagged tables grow geometrically. A small path history 4311784Sarthur.perais@inria.fr * is also used in the hash. L-TAGE also features a loop predictor that records 4411784Sarthur.perais@inria.fr * iteration count of loops and predicts accordingly. 4511784Sarthur.perais@inria.fr * 4611784Sarthur.perais@inria.fr * All TAGE tables are accessed in parallel, and the one using the longest 4711784Sarthur.perais@inria.fr * history that matches provides the prediction (some exceptions apply). 4811784Sarthur.perais@inria.fr * Entries are allocated in components using a longer history than the 4911784Sarthur.perais@inria.fr * one that predicted when the prediction is incorrect. 5011784Sarthur.perais@inria.fr */ 5111784Sarthur.perais@inria.fr 5211784Sarthur.perais@inria.fr#ifndef __CPU_PRED_LTAGE 5311784Sarthur.perais@inria.fr#define __CPU_PRED_LTAGE 5411784Sarthur.perais@inria.fr 5513454Spau.cabre@metempsy.com 5611784Sarthur.perais@inria.fr#include <vector> 5711784Sarthur.perais@inria.fr 5811784Sarthur.perais@inria.fr#include "base/types.hh" 5913454Spau.cabre@metempsy.com#include "cpu/pred/tage.hh" 6011784Sarthur.perais@inria.fr#include "params/LTAGE.hh" 6111784Sarthur.perais@inria.fr 6213454Spau.cabre@metempsy.comclass LTAGE: public TAGE 6311784Sarthur.perais@inria.fr{ 6411784Sarthur.perais@inria.fr public: 6511784Sarthur.perais@inria.fr LTAGE(const LTAGEParams *params); 6611784Sarthur.perais@inria.fr 6711784Sarthur.perais@inria.fr // Base class methods. 6811784Sarthur.perais@inria.fr void squash(ThreadID tid, void *bp_history) override; 6913626Sjairo.balart@metempsy.com void update(ThreadID tid, Addr branch_addr, bool taken, void *bp_history, 7013626Sjairo.balart@metempsy.com bool squashed, const StaticInstPtr & inst, 7113626Sjairo.balart@metempsy.com Addr corrTarget) override; 7211784Sarthur.perais@inria.fr 7313455Spau.cabre@metempsy.com void regStats() override; 7413455Spau.cabre@metempsy.com 7511784Sarthur.perais@inria.fr private: 7611784Sarthur.perais@inria.fr // Prediction Structures 7711784Sarthur.perais@inria.fr // Loop Predictor Entry 7811784Sarthur.perais@inria.fr struct LoopEntry 7911784Sarthur.perais@inria.fr { 8011784Sarthur.perais@inria.fr uint16_t numIter; 8111784Sarthur.perais@inria.fr uint16_t currentIter; 8213493Spau.cabre@metempsy.com uint16_t currentIterSpec; // only for useSpeculation 8311784Sarthur.perais@inria.fr uint8_t confidence; 8411784Sarthur.perais@inria.fr uint16_t tag; 8511784Sarthur.perais@inria.fr uint8_t age; 8613493Spau.cabre@metempsy.com bool dir; // only for useDirectionBit 8711784Sarthur.perais@inria.fr 8811784Sarthur.perais@inria.fr LoopEntry() : numIter(0), currentIter(0), currentIterSpec(0), 8911784Sarthur.perais@inria.fr confidence(0), tag(0), age(0), dir(0) { } 9011784Sarthur.perais@inria.fr }; 9111784Sarthur.perais@inria.fr 9213455Spau.cabre@metempsy.com // more provider types 9313455Spau.cabre@metempsy.com enum { 9413626Sjairo.balart@metempsy.com LOOP = TAGEBase::LAST_TAGE_PROVIDER_TYPE + 1 9513455Spau.cabre@metempsy.com }; 9613455Spau.cabre@metempsy.com 9713454Spau.cabre@metempsy.com // Primary branch history entry 9813454Spau.cabre@metempsy.com struct LTageBranchInfo : public TageBranchInfo 9911784Sarthur.perais@inria.fr { 10013442Spau.cabre@metempsy.com uint16_t loopTag; 10111784Sarthur.perais@inria.fr uint16_t currentIter; 10211784Sarthur.perais@inria.fr 10311784Sarthur.perais@inria.fr bool loopPred; 10411784Sarthur.perais@inria.fr bool loopPredValid; 10511784Sarthur.perais@inria.fr int loopIndex; 10613493Spau.cabre@metempsy.com int loopLowPcBits; // only for useHashing 10711784Sarthur.perais@inria.fr int loopHit; 10811784Sarthur.perais@inria.fr 10913626Sjairo.balart@metempsy.com LTageBranchInfo(TAGEBase &tage) 11013626Sjairo.balart@metempsy.com : TageBranchInfo(tage), 11113454Spau.cabre@metempsy.com loopTag(0), currentIter(0), 11213454Spau.cabre@metempsy.com loopPred(false), 11313493Spau.cabre@metempsy.com loopPredValid(false), loopIndex(0), loopLowPcBits(0), loopHit(0) 11413454Spau.cabre@metempsy.com {} 11513626Sjairo.balart@metempsy.com 11613626Sjairo.balart@metempsy.com virtual ~LTageBranchInfo() 11713626Sjairo.balart@metempsy.com {} 11811784Sarthur.perais@inria.fr }; 11911784Sarthur.perais@inria.fr 12011784Sarthur.perais@inria.fr /** 12111784Sarthur.perais@inria.fr * Computes the index used to access the 12211784Sarthur.perais@inria.fr * loop predictor. 12311784Sarthur.perais@inria.fr * @param pc_in The unshifted branch PC. 12411784Sarthur.perais@inria.fr */ 12511784Sarthur.perais@inria.fr int lindex(Addr pc_in) const; 12611784Sarthur.perais@inria.fr 12711784Sarthur.perais@inria.fr /** 12813493Spau.cabre@metempsy.com * Computes the index used to access the 12913493Spau.cabre@metempsy.com * ltable structures. 13013493Spau.cabre@metempsy.com * It may take hashing into account 13113493Spau.cabre@metempsy.com * @param index Result of lindex function 13213493Spau.cabre@metempsy.com * @param lowPcBits PC bits masked with set size 13313493Spau.cabre@metempsy.com * @param way Way to be used 13413493Spau.cabre@metempsy.com */ 13513493Spau.cabre@metempsy.com int finallindex(int lindex, int lowPcBits, int way) const; 13613493Spau.cabre@metempsy.com 13713493Spau.cabre@metempsy.com /** 13811784Sarthur.perais@inria.fr * Get a branch prediction from the loop 13911784Sarthur.perais@inria.fr * predictor. 14011784Sarthur.perais@inria.fr * @param pc The unshifted branch PC. 14111784Sarthur.perais@inria.fr * @param bi Pointer to information on the 14211784Sarthur.perais@inria.fr * prediction. 14313493Spau.cabre@metempsy.com * @param speculative Use speculative number of iterations 14411784Sarthur.perais@inria.fr */ 14513493Spau.cabre@metempsy.com bool getLoop(Addr pc, LTageBranchInfo* bi, bool speculative) const; 14611784Sarthur.perais@inria.fr 14711784Sarthur.perais@inria.fr /** 14811784Sarthur.perais@inria.fr * Updates the loop predictor. 14911784Sarthur.perais@inria.fr * @param pc The unshifted branch PC. 15011784Sarthur.perais@inria.fr * @param taken The actual branch outcome. 15111784Sarthur.perais@inria.fr * @param bi Pointer to information on the 15211784Sarthur.perais@inria.fr * prediction recorded at prediction time. 15311784Sarthur.perais@inria.fr */ 15413454Spau.cabre@metempsy.com void loopUpdate(Addr pc, bool Taken, LTageBranchInfo* bi); 15511784Sarthur.perais@inria.fr 15611784Sarthur.perais@inria.fr /** 15711784Sarthur.perais@inria.fr * Speculatively updates the loop predictor 15813493Spau.cabre@metempsy.com * iteration count (only for useSpeculation). 15911784Sarthur.perais@inria.fr * @param taken The predicted branch outcome. 16011784Sarthur.perais@inria.fr * @param bi Pointer to information on the prediction 16111784Sarthur.perais@inria.fr * recorded at prediction time. 16211784Sarthur.perais@inria.fr */ 16313493Spau.cabre@metempsy.com void specLoopUpdate(bool taken, LTageBranchInfo* bi); 16411784Sarthur.perais@inria.fr 16513454Spau.cabre@metempsy.com /** 16613454Spau.cabre@metempsy.com * Get a branch prediction from LTAGE. *NOT* an override of 16713454Spau.cabre@metempsy.com * BpredUnit::predict(). 16813454Spau.cabre@metempsy.com * @param tid The thread ID to select the global 16913454Spau.cabre@metempsy.com * histories to use. 17013454Spau.cabre@metempsy.com * @param branch_pc The unshifted branch PC. 17113454Spau.cabre@metempsy.com * @param cond_branch True if the branch is conditional. 17213454Spau.cabre@metempsy.com * @param b Reference to wrapping pointer to allow storing 17313454Spau.cabre@metempsy.com * derived class prediction information in the base class. 17413454Spau.cabre@metempsy.com */ 17513454Spau.cabre@metempsy.com bool predict( 17613454Spau.cabre@metempsy.com ThreadID tid, Addr branch_pc, bool cond_branch, void* &b) override; 17713454Spau.cabre@metempsy.com 17813454Spau.cabre@metempsy.com /** 17913454Spau.cabre@metempsy.com * Restores speculatively updated path and direction histories. 18013454Spau.cabre@metempsy.com * Also recomputes compressed (folded) histories based on the 18113454Spau.cabre@metempsy.com * correct branch outcome. 18213626Sjairo.balart@metempsy.com * @param bi Branch information. 18313454Spau.cabre@metempsy.com */ 18413626Sjairo.balart@metempsy.com void squashLoop(LTageBranchInfo * bi); 18513455Spau.cabre@metempsy.com 18611784Sarthur.perais@inria.fr const unsigned logSizeLoopPred; 18713442Spau.cabre@metempsy.com const unsigned loopTableAgeBits; 18813442Spau.cabre@metempsy.com const unsigned loopTableConfidenceBits; 18913442Spau.cabre@metempsy.com const unsigned loopTableTagBits; 19013442Spau.cabre@metempsy.com const unsigned loopTableIterBits; 19113444Spau.cabre@metempsy.com const unsigned logLoopTableAssoc; 19213442Spau.cabre@metempsy.com const uint8_t confidenceThreshold; 19313442Spau.cabre@metempsy.com const uint16_t loopTagMask; 19413442Spau.cabre@metempsy.com const uint16_t loopNumIterMask; 19513493Spau.cabre@metempsy.com const int loopSetMask; 19611784Sarthur.perais@inria.fr 19711784Sarthur.perais@inria.fr LoopEntry *ltable; 19811784Sarthur.perais@inria.fr 19911784Sarthur.perais@inria.fr int8_t loopUseCounter; 20013444Spau.cabre@metempsy.com unsigned withLoopBits; 20113455Spau.cabre@metempsy.com 20213493Spau.cabre@metempsy.com const bool useDirectionBit; 20313493Spau.cabre@metempsy.com const bool useSpeculation; 20413493Spau.cabre@metempsy.com const bool useHashing; 20513493Spau.cabre@metempsy.com 20613455Spau.cabre@metempsy.com // stats 20713455Spau.cabre@metempsy.com Stats::Scalar loopPredictorCorrect; 20813455Spau.cabre@metempsy.com Stats::Scalar loopPredictorWrong; 20911784Sarthur.perais@inria.fr}; 21011784Sarthur.perais@inria.fr 21111784Sarthur.perais@inria.fr#endif // __CPU_PRED_LTAGE 212