cpu/pred/BranchPredictor.py

115     minHist = Param.Unsigned(5, "Minimum history size of TAGE")
116     maxHist = Param.Unsigned(130, "Maximum history size of TAGE")
119         [0, 9, 9, 10, 10, 11, 11, 12], "Tag size in TAGE tag tables")
121         [13, 9, 9, 9, 9, 9, 9, 9], "Log2 of TAGE table sizes")
134         "Log period in number of branches to reset TAGE useful counters")
140         "Max number of TAGE entries allocted on mispredict")
142     # List of enabled TAGE tables. If empty, all are enabled
143     noSkip = VectorParam.Bool([], "Vector of enabled TAGE tables")
148 # TAGE branch predictor as described in https://www.jilp.org/vol8/v8paper1.pdf
149 # The default sizes below are for the 8C-TAGE configuration (63.5 Kbits)
150 class TAGE(BranchPredictor):
151     type = 'TAGE'
152     cxx_class = 'TAGE'
179     # They have been copied from TAGE-GSC-IMLI
180     # (http://www.irisa.fr/alf/downloads/seznec/TAGE-GSC-IMLI.tar)
221     # Instead, the number of TAGE entries comes from shortTagsTageEntries and
226         "Factor for calculating the total number of short tags TAGE entries")
229         "Factor for calculating the total number of long tags TAGE entries")
297 # https://www.irisa.fr/caps/people/seznec/L-TAGE.pdf
298 # It is basically a TAGE predictor plus a loop predictor
299 # The differnt TAGE sizes are updated according to the paper values (256 Kbits)
300 class LTAGE(TAGE):
376 # TAGE-SC-L branch predictor as desribed in
379 # The TAGE modifications include bank interleaving and partial associativity
474 # 64KB TAGE-SC-L branch predictor as described in
485 # 8KB TAGE-SC-L branch predictor as described in