SimEng’s fetch unit is supplied with an instance of the abstract
BranchPredictor class to enable speculative execution.
Access to the
BranchPredictor is supported through the
predict provides a branch prediction, both target and direction,
update updates an instructions’ prediction, and
flush provides optional algorithm specific flushing functionality.
predict function is passed an instruction address, branch type, and a possible known target. The branch type argument currently supports the following types:
The usage of these parameters within a branch predictor’s
predict function is algorithm specific.
update function is passed the branch outcome, the instruction address, and the branch type. From this information, any algorithms or branch structures may be updated.
The algorithm(s) held within a
BranchPredictor class instance can be model-specific, however, SimEng provides a
GenericPredictor which contains the following logic.
- Global History
- For indexing relevant prediction structures, a global history can be utilised. The global history value uses n-bits to store the n most recent branch direction outcomes, with the left-most bit being the oldest.
- Branch Target Buffer (BTB)
For each entry, the BTB stores the most recent target along with an n-bit saturating counter for an associated direction. The indexing of this structure uses the lower bits of an instruction address XOR’ed with the current global branch history value.
If the supplied branch type is
Unconditional, then the predicted direction is overridden to be taken. If the supplied branch type is
Conditionaland the predicted direction is not taken, then the predicted target is overridden to be the next sequential instruction.
- Return Address Stack (RAS)
- Identified through the supplied branch type, Return instructions pop values off of the RAS to get their branch target whilst Branch-and-Link instructions push values onto the RAS, for use by a proceeding Return instruction.
- Static Prediction
- Based on the chosen static prediction method of “always taken” or “always not taken”, the n-bit saturating counter value in the initial entries of the BTB structure are filled with the weakest variant of taken or not-taken respectively.