tage.cc (13654:dc3878f03a0c) tage.cc (13685:bb3377c81303)
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.

--- 45 unchanged lines hidden (view full) ---

54// PREDICTOR UPDATE
55void
56TAGE::update(ThreadID tid, Addr branch_pc, bool taken, void* bp_history,
57 bool squashed, const StaticInstPtr & inst, Addr corrTarget)
58{
59 assert(bp_history);
60
61 TageBranchInfo *bi = static_cast<TageBranchInfo*>(bp_history);
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.

--- 45 unchanged lines hidden (view full) ---

54// PREDICTOR UPDATE
55void
56TAGE::update(ThreadID tid, Addr branch_pc, bool taken, void* bp_history,
57 bool squashed, const StaticInstPtr & inst, Addr corrTarget)
58{
59 assert(bp_history);
60
61 TageBranchInfo *bi = static_cast<TageBranchInfo*>(bp_history);
62 TAGEBase::BranchInfo *tage_bi = bi->tageBranchInfo;
62
63 assert(corrTarget != MaxAddr);
64
65 if (squashed) {
66 // This restores the global history, then update it
67 // and recomputes the folded histories.
63
64 assert(corrTarget != MaxAddr);
65
66 if (squashed) {
67 // This restores the global history, then update it
68 // and recomputes the folded histories.
68 tage->squash(tid, taken, bi->tageBranchInfo, corrTarget);
69 tage->squash(tid, taken, tage_bi, corrTarget);
69 return;
70 }
71
70 return;
71 }
72
72 int nrand = TAGEBase::getRandom() & 3;
73 int nrand = random_mt.random<int>() & 3;
73 if (bi->tageBranchInfo->condBranch) {
74 DPRINTF(Tage, "Updating tables for branch:%lx; taken?:%d\n",
75 branch_pc, taken);
76 tage->updateStats(taken, bi->tageBranchInfo);
74 if (bi->tageBranchInfo->condBranch) {
75 DPRINTF(Tage, "Updating tables for branch:%lx; taken?:%d\n",
76 branch_pc, taken);
77 tage->updateStats(taken, bi->tageBranchInfo);
77 tage->condBranchUpdate(tid, branch_pc, taken, bi->tageBranchInfo,
78 nrand, corrTarget);
78 tage->condBranchUpdate(tid, branch_pc, taken, tage_bi, nrand,
79 corrTarget, bi->tageBranchInfo->tagePred);
79 }
80
80 }
81
81 tage->updateHistories(tid, branch_pc, taken, bi->tageBranchInfo, false,
82 inst, corrTarget);
83
82 // optional non speculative update of the histories
83 tage->updateHistories(tid, branch_pc, taken, tage_bi, false, inst,
84 corrTarget);
84 delete bi;
85}
86
87void
88TAGE::squash(ThreadID tid, void *bp_history)
89{
90 TageBranchInfo *bi = static_cast<TageBranchInfo*>(bp_history);
91 DPRINTF(Tage, "Deleting branch info: %lx\n", bi->tageBranchInfo->branchPC);
92 delete bi;
93}
94
95bool
96TAGE::predict(ThreadID tid, Addr branch_pc, bool cond_branch, void* &b)
97{
85 delete bi;
86}
87
88void
89TAGE::squash(ThreadID tid, void *bp_history)
90{
91 TageBranchInfo *bi = static_cast<TageBranchInfo*>(bp_history);
92 DPRINTF(Tage, "Deleting branch info: %lx\n", bi->tageBranchInfo->branchPC);
93 delete bi;
94}
95
96bool
97TAGE::predict(ThreadID tid, Addr branch_pc, bool cond_branch, void* &b)
98{
98 TageBranchInfo *bi = new TageBranchInfo(*tage);
99 TageBranchInfo *bi = new TageBranchInfo(*tage);//nHistoryTables+1);
99 b = (void*)(bi);
100 return tage->tagePredict(tid, branch_pc, cond_branch, bi->tageBranchInfo);
101}
102
103bool
104TAGE::lookup(ThreadID tid, Addr branch_pc, void* &bp_history)
105{
106 bool retval = predict(tid, branch_pc, true, bp_history);

--- 31 unchanged lines hidden --- 		100 b = (void*)(bi);
101 return tage->tagePredict(tid, branch_pc, cond_branch, bi->tageBranchInfo);
102}
103
104bool
105TAGE::lookup(ThreadID tid, Addr branch_pc, void* &bp_history)
106{
107 bool retval = predict(tid, branch_pc, true, bp_history);

--- 31 unchanged lines hidden ---