2fb632dbda
branch prediction, and makes memory dependence work properly.
SConscript:
Added return address stack, tournament predictor.
cpu/base_cpu.cc:
Added debug break and print statements.
cpu/base_dyn_inst.cc:
cpu/base_dyn_inst.hh:
Comment out possibly unneeded variables.
cpu/beta_cpu/2bit_local_pred.cc:
2bit predictor no longer speculatively updates itself.
cpu/beta_cpu/alpha_dyn_inst.hh:
Comment formatting.
cpu/beta_cpu/alpha_full_cpu.hh:
Formatting
cpu/beta_cpu/alpha_full_cpu_builder.cc:
Added new parameters for branch predictors, and IQ parameters.
cpu/beta_cpu/alpha_full_cpu_impl.hh:
Register stats.
cpu/beta_cpu/alpha_params.hh:
Added parameters for IQ, branch predictors, and store sets.
cpu/beta_cpu/bpred_unit.cc:
Removed one class.
cpu/beta_cpu/bpred_unit.hh:
Add in RAS, stats. Changed branch predictor unit functionality
so that it holds a history of past branches so it can update, and also
hold a proper history of the RAS so it can be restored on branch
mispredicts.
cpu/beta_cpu/bpred_unit_impl.hh:
Added in stats, history of branches, RAS. Now bpred unit actually
modifies the instruction's predicted next PC.
cpu/beta_cpu/btb.cc:
Add in sanity checks.
cpu/beta_cpu/comm.hh:
Add in communication where needed, remove it where it's not.
cpu/beta_cpu/commit.hh:
cpu/beta_cpu/rename.hh:
cpu/beta_cpu/rename_impl.hh:
Add in stats.
cpu/beta_cpu/commit_impl.hh:
Stats, update what is sent back on branch mispredict.
cpu/beta_cpu/cpu_policy.hh:
Change the bpred unit being used.
cpu/beta_cpu/decode.hh:
cpu/beta_cpu/decode_impl.hh:
Stats.
cpu/beta_cpu/fetch.hh:
Stats, change squash so it can handle squashes from decode differently
than squashes from commit.
cpu/beta_cpu/fetch_impl.hh:
Add in stats. Change how a cache line is fetched. Update to work with
caches. Also have separate functions for different behavior if squash
is coming from decode vs commit.
cpu/beta_cpu/free_list.hh:
Remove some old comments.
cpu/beta_cpu/full_cpu.cc:
cpu/beta_cpu/full_cpu.hh:
Added function to remove instructions from back of instruction list
until a certain sequence number.
cpu/beta_cpu/iew.hh:
Stats, separate squashing behavior due to branches vs memory.
cpu/beta_cpu/iew_impl.hh:
Stats, separate squashing behavior for branches vs memory.
cpu/beta_cpu/inst_queue.cc:
Debug stuff
cpu/beta_cpu/inst_queue.hh:
Stats, change how mem dep unit works, debug stuff
cpu/beta_cpu/inst_queue_impl.hh:
Stats, change how mem dep unit works, debug stuff. Also add in
parameters that used to be hardcoded.
cpu/beta_cpu/mem_dep_unit.hh:
cpu/beta_cpu/mem_dep_unit_impl.hh:
Add in stats, change how memory dependence unit works. It now holds
the memory instructions that are waiting for their memory dependences
to resolve. It provides which instructions are ready directly to the
IQ.
cpu/beta_cpu/regfile.hh:
Fix up sanity checks.
cpu/beta_cpu/rename_map.cc:
Fix loop variable type.
cpu/beta_cpu/rob_impl.hh:
Remove intermediate DynInstPtr
cpu/beta_cpu/store_set.cc:
Add in debugging statements.
cpu/beta_cpu/store_set.hh:
Reorder function arguments to match the rest of the calls.
--HG--
extra : convert_revision : aabf9b1fecd1d743265dfc3b174d6159937c6f44
91 lines
1.9 KiB
C++
91 lines
1.9 KiB
C++
#include <math.h>
|
|
|
|
#include "cpu/beta_cpu/btb.hh"
|
|
#include "base/trace.hh"
|
|
|
|
DefaultBTB::DefaultBTB(unsigned _numEntries,
|
|
unsigned _tagBits,
|
|
unsigned _instShiftAmt)
|
|
: numEntries(_numEntries),
|
|
tagBits(_tagBits),
|
|
instShiftAmt(_instShiftAmt)
|
|
{
|
|
// @todo Check to make sure num_entries is valid (a power of 2)
|
|
|
|
DPRINTF(Fetch, "BTB: Creating BTB object.\n");
|
|
|
|
btb = new BTBEntry[numEntries];
|
|
|
|
for (int i = 0; i < numEntries; ++i)
|
|
{
|
|
btb[i].valid = false;
|
|
}
|
|
|
|
idxMask = numEntries - 1;
|
|
|
|
tagMask = (1 << tagBits) - 1;
|
|
|
|
tagShiftAmt = instShiftAmt + (int)log2(numEntries);
|
|
}
|
|
|
|
inline
|
|
unsigned
|
|
DefaultBTB::getIndex(const Addr &inst_PC)
|
|
{
|
|
// Need to shift PC over by the word offset.
|
|
return (inst_PC >> instShiftAmt) & idxMask;
|
|
}
|
|
|
|
inline
|
|
Addr
|
|
DefaultBTB::getTag(const Addr &inst_PC)
|
|
{
|
|
return (inst_PC >> tagShiftAmt) & tagMask;
|
|
}
|
|
|
|
bool
|
|
DefaultBTB::valid(const Addr &inst_PC)
|
|
{
|
|
unsigned btb_idx = getIndex(inst_PC);
|
|
|
|
Addr inst_tag = getTag(inst_PC);
|
|
|
|
assert(btb_idx < numEntries);
|
|
|
|
if (btb[btb_idx].valid && inst_tag == btb[btb_idx].tag) {
|
|
return true;
|
|
} else {
|
|
return false;
|
|
}
|
|
}
|
|
|
|
// @todo Create some sort of return struct that has both whether or not the
|
|
// address is valid, and also the address. For now will just use addr = 0 to
|
|
// represent invalid entry.
|
|
Addr
|
|
DefaultBTB::lookup(const Addr &inst_PC)
|
|
{
|
|
unsigned btb_idx = getIndex(inst_PC);
|
|
|
|
Addr inst_tag = getTag(inst_PC);
|
|
|
|
assert(btb_idx < numEntries);
|
|
|
|
if (btb[btb_idx].valid && inst_tag == btb[btb_idx].tag) {
|
|
return btb[btb_idx].target;
|
|
} else {
|
|
return 0;
|
|
}
|
|
}
|
|
|
|
void
|
|
DefaultBTB::update(const Addr &inst_PC, const Addr &target)
|
|
{
|
|
unsigned btb_idx = getIndex(inst_PC);
|
|
|
|
assert(btb_idx < numEntries);
|
|
|
|
btb[btb_idx].valid = true;
|
|
btb[btb_idx].target = target;
|
|
btb[btb_idx].tag = getTag(inst_PC);
|
|
}
|