tournament.cc revision 10785 
1/*
2 * Copyright (c) 2011, 2014 ARM Limited
3 * All rights reserved
4 *
5 * The license below extends only to copyright in the software and shall
6 * not be construed as granting a license to any other intellectual
7 * property including but not limited to intellectual property relating
8 * to a hardware implementation of the functionality of the software
9 * licensed hereunder.  You may use the software subject to the license
10 * terms below provided that you ensure that this notice is replicated
11 * unmodified and in its entirety in all distributions of the software,
12 * modified or unmodified, in source code or in binary form.
13 *
14 * Copyright (c) 2004-2006 The Regents of The University of Michigan
15 * All rights reserved.
16 *
17 * Redistribution and use in source and binary forms, with or without
18 * modification, are permitted provided that the following conditions are
19 * met: redistributions of source code must retain the above copyright
20 * notice, this list of conditions and the following disclaimer;
21 * redistributions in binary form must reproduce the above copyright
22 * notice, this list of conditions and the following disclaimer in the
23 * documentation and/or other materials provided with the distribution;
24 * neither the name of the copyright holders nor the names of its
25 * contributors may be used to endorse or promote products derived from
26 * this software without specific prior written permission.
27 *
28 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
29 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
30 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
31 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
32 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
33 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
34 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
35 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
36 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
37 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
38 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
39 *
40 * Authors: Kevin Lim
41 */
42
43#include "base/bitfield.hh"
44#include "base/intmath.hh"
45#include "cpu/pred/tournament.hh"
46
47TournamentBP::TournamentBP(const TournamentBPParams *params)
48    : BPredUnit(params),
49      localPredictorSize(params->localPredictorSize),
50      localCtrBits(params->localCtrBits),
51      localHistoryTableSize(params->localHistoryTableSize),
52      localHistoryBits(ceilLog2(params->localPredictorSize)),
53      globalPredictorSize(params->globalPredictorSize),
54      globalCtrBits(params->globalCtrBits),
55      globalHistoryBits(
56          ceilLog2(params->globalPredictorSize) >
57          ceilLog2(params->choicePredictorSize) ?
58          ceilLog2(params->globalPredictorSize) :
59          ceilLog2(params->choicePredictorSize)),
60      choicePredictorSize(params->choicePredictorSize),
61      choiceCtrBits(params->choiceCtrBits)
62{
63    if (!isPowerOf2(localPredictorSize)) {
64        fatal("Invalid local predictor size!\n");
65    }
66
67    if (!isPowerOf2(globalPredictorSize)) {
68        fatal("Invalid global predictor size!\n");
69    }
70
71    //Set up the array of counters for the local predictor
72    localCtrs.resize(localPredictorSize);
73
74    for (int i = 0; i < localPredictorSize; ++i)
75        localCtrs[i].setBits(localCtrBits);
76
77    localPredictorMask = mask(localHistoryBits);
78
79    if (!isPowerOf2(localHistoryTableSize)) {
80        fatal("Invalid local history table size!\n");
81    }
82
83    //Setup the history table for the local table
84    localHistoryTable.resize(localHistoryTableSize);
85
86    for (int i = 0; i < localHistoryTableSize; ++i)
87        localHistoryTable[i] = 0;
88
89    //Setup the array of counters for the global predictor
90    globalCtrs.resize(globalPredictorSize);
91
92    for (int i = 0; i < globalPredictorSize; ++i)
93        globalCtrs[i].setBits(globalCtrBits);
94
95    //Clear the global history
96    globalHistory = 0;
97    // Set up the global history mask
98    // this is equivalent to mask(log2(globalPredictorSize)
99    globalHistoryMask = globalPredictorSize - 1;
100
101    if (!isPowerOf2(choicePredictorSize)) {
102        fatal("Invalid choice predictor size!\n");
103    }
104
105    // Set up choiceHistoryMask
106    // this is equivalent to mask(log2(choicePredictorSize)
107    choiceHistoryMask = choicePredictorSize - 1;
108
109    //Setup the array of counters for the choice predictor
110    choiceCtrs.resize(choicePredictorSize);
111
112    for (int i = 0; i < choicePredictorSize; ++i)
113        choiceCtrs[i].setBits(choiceCtrBits);
114
115    //Set up historyRegisterMask
116    historyRegisterMask = mask(globalHistoryBits);
117
118    //Check that predictors don't use more bits than they have available
119    if (globalHistoryMask > historyRegisterMask) {
120        fatal("Global predictor too large for global history bits!\n");
121    }
122    if (choiceHistoryMask > historyRegisterMask) {
123        fatal("Choice predictor too large for global history bits!\n");
124    }
125
126    if (globalHistoryMask < historyRegisterMask &&
127        choiceHistoryMask < historyRegisterMask) {
128        inform("More global history bits than required by predictors\n");
129    }
130
131    // Set thresholds for the three predictors' counters
132    // This is equivalent to (2^(Ctr))/2 - 1
133    localThreshold  = (ULL(1) << (localCtrBits  - 1)) - 1;
134    globalThreshold = (ULL(1) << (globalCtrBits - 1)) - 1;
135    choiceThreshold = (ULL(1) << (choiceCtrBits - 1)) - 1;
136}
137
138inline
139unsigned
140TournamentBP::calcLocHistIdx(Addr &branch_addr)
141{
142    // Get low order bits after removing instruction offset.
143    return (branch_addr >> instShiftAmt) & (localHistoryTableSize - 1);
144}
145
146inline
147void
148TournamentBP::updateGlobalHistTaken()
149{
150    globalHistory = (globalHistory << 1) | 1;
151    globalHistory = globalHistory & historyRegisterMask;
152}
153
154inline
155void
156TournamentBP::updateGlobalHistNotTaken()
157{
158    globalHistory = (globalHistory << 1);
159    globalHistory = globalHistory & historyRegisterMask;
160}
161
162inline
163void
164TournamentBP::updateLocalHistTaken(unsigned local_history_idx)
165{
166    localHistoryTable[local_history_idx] =
167        (localHistoryTable[local_history_idx] << 1) | 1;
168}
169
170inline
171void
172TournamentBP::updateLocalHistNotTaken(unsigned local_history_idx)
173{
174    localHistoryTable[local_history_idx] =
175        (localHistoryTable[local_history_idx] << 1);
176}
177
178
179void
180TournamentBP::btbUpdate(Addr branch_addr, void * &bp_history)
181{
182    unsigned local_history_idx = calcLocHistIdx(branch_addr);
183    //Update Global History to Not Taken (clear LSB)
184    globalHistory &= (historyRegisterMask & ~ULL(1));
185    //Update Local History to Not Taken
186    localHistoryTable[local_history_idx] =
187       localHistoryTable[local_history_idx] & (localPredictorMask & ~ULL(1));
188}
189
190bool
191TournamentBP::lookup(Addr branch_addr, void * &bp_history)
192{
193    bool local_prediction;
194    unsigned local_history_idx;
195    unsigned local_predictor_idx;
196
197    bool global_prediction;
198    bool choice_prediction;
199
200    //Lookup in the local predictor to get its branch prediction
201    local_history_idx = calcLocHistIdx(branch_addr);
202    local_predictor_idx = localHistoryTable[local_history_idx]
203        & localPredictorMask;
204    local_prediction = localCtrs[local_predictor_idx].read() > localThreshold;
205
206    //Lookup in the global predictor to get its branch prediction
207    global_prediction =
208      globalCtrs[globalHistory & globalHistoryMask].read() > globalThreshold;
209
210    //Lookup in the choice predictor to see which one to use
211    choice_prediction =
212      choiceCtrs[globalHistory & choiceHistoryMask].read() > choiceThreshold;
213
214    // Create BPHistory and pass it back to be recorded.
215    BPHistory *history = new BPHistory;
216    history->globalHistory = globalHistory;
217    history->localPredTaken = local_prediction;
218    history->globalPredTaken = global_prediction;
219    history->globalUsed = choice_prediction;
220    history->localHistory = local_predictor_idx;
221    bp_history = (void *)history;
222
223    assert(local_history_idx < localHistoryTableSize);
224
225    // Commented code is for doing speculative update of counters and
226    // all histories.
227    if (choice_prediction) {
228        if (global_prediction) {
229            updateGlobalHistTaken();
230            updateLocalHistTaken(local_history_idx);
231            return true;
232        } else {
233            updateGlobalHistNotTaken();
234            updateLocalHistNotTaken(local_history_idx);
235            return false;
236        }
237    } else {
238        if (local_prediction) {
239            updateGlobalHistTaken();
240            updateLocalHistTaken(local_history_idx);
241            return true;
242        } else {
243            updateGlobalHistNotTaken();
244            updateLocalHistNotTaken(local_history_idx);
245            return false;
246        }
247    }
248}
249
250void
251TournamentBP::uncondBranch(Addr pc, void * &bp_history)
252{
253    // Create BPHistory and pass it back to be recorded.
254    BPHistory *history = new BPHistory;
255    history->globalHistory = globalHistory;
256    history->localPredTaken = true;
257    history->globalPredTaken = true;
258    history->globalUsed = true;
259    history->localHistory = invalidPredictorIndex;
260    bp_history = static_cast<void *>(history);
261
262    updateGlobalHistTaken();
263}
264
265void
266TournamentBP::update(Addr branch_addr, bool taken, void *bp_history,
267                     bool squashed)
268{
269    unsigned local_history_idx;
270    unsigned local_predictor_idx M5_VAR_USED;
271    unsigned local_predictor_hist;
272
273    // Get the local predictor's current prediction
274    local_history_idx = calcLocHistIdx(branch_addr);
275    local_predictor_hist = localHistoryTable[local_history_idx];
276    local_predictor_idx = local_predictor_hist & localPredictorMask;
277
278    if (bp_history) {
279        BPHistory *history = static_cast<BPHistory *>(bp_history);
280        // Update may also be called if the Branch target is incorrect even if
281        // the prediction is correct. In that case do not update the counters.
282        bool historyPred = false;
283        unsigned old_local_pred_index = history->localHistory &
284                localPredictorMask;
285
286        bool old_local_pred_valid = history->localHistory !=
287            invalidPredictorIndex;
288
289        assert(old_local_pred_index < localPredictorSize);
290
291        if (history->globalUsed) {
292           historyPred = history->globalPredTaken;
293        } else {
294           historyPred = history->localPredTaken;
295        }
296        if (historyPred != taken || !squashed) {
297            // Update the choice predictor to tell it which one was correct if
298            // there was a prediction.
299            if (history->localPredTaken != history->globalPredTaken) {
300                 // If the local prediction matches the actual outcome,
301                 // decerement the counter.  Otherwise increment the
302                 // counter.
303                 unsigned choice_predictor_idx =
304                   history->globalHistory & choiceHistoryMask;
305                 if (history->localPredTaken == taken) {
306                     choiceCtrs[choice_predictor_idx].decrement();
307                 } else if (history->globalPredTaken == taken) {
308                     choiceCtrs[choice_predictor_idx].increment();
309                 }
310
311             }
312
313             // Update the counters and local history with the proper
314             // resolution of the branch.  Global history is updated
315             // speculatively and restored upon squash() calls, so it does not
316             // need to be updated.
317             unsigned global_predictor_idx =
318               history->globalHistory & globalHistoryMask;
319             if (taken) {
320                  globalCtrs[global_predictor_idx].increment();
321                  if (old_local_pred_valid) {
322                          localCtrs[old_local_pred_index].increment();
323                  }
324             } else {
325                  globalCtrs[global_predictor_idx].decrement();
326                  if (old_local_pred_valid) {
327                          localCtrs[old_local_pred_index].decrement();
328                  }
329             }
330        }
331        if (squashed) {
332             if (taken) {
333                globalHistory = (history->globalHistory << 1) | 1;
334                globalHistory = globalHistory & historyRegisterMask;
335                if (old_local_pred_valid) {
336                    localHistoryTable[local_history_idx] =
337                     (history->localHistory << 1) | 1;
338                }
339             } else {
340                globalHistory = (history->globalHistory << 1);
341                globalHistory = globalHistory & historyRegisterMask;
342                if (old_local_pred_valid) {
343                     localHistoryTable[local_history_idx] =
344                     history->localHistory << 1;
345                }
346             }
347
348        } else {
349            // We're done with this history, now delete it.
350            delete history;
351        }
352    }
353
354    assert(local_history_idx < localHistoryTableSize);
355
356
357}
358
359void
360TournamentBP::retireSquashed(void *bp_history)
361{
362    BPHistory *history = static_cast<BPHistory *>(bp_history);
363    delete history;
364}
365
366void
367TournamentBP::squash(void *bp_history)
368{
369    BPHistory *history = static_cast<BPHistory *>(bp_history);
370
371    // Restore global history to state prior to this branch.
372    globalHistory = history->globalHistory;
373
374    // Delete this BPHistory now that we're done with it.
375    delete history;
376}
377
378TournamentBP*
379TournamentBPParams::create()
380{
381    return new TournamentBP(this);
382}
383
384#ifdef DEBUG
385int
386TournamentBP::BPHistory::newCount = 0;
387#endif
388