ltage.cc (13420:5cb2b90e1cb5) ltage.cc (13433:fd8c49bea81f)
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.

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

574
575
576 //Allocate only one entry
577 for (int i = X; i <= nHistoryTables; i++) {
578 if ((gtable[i][bi->tableIndices[i]].u == 0)) {
579 gtable[i][bi->tableIndices[i]].tag = bi->tableTags[i];
580 gtable[i][bi->tableIndices[i]].ctr = (taken) ? 0 : -1;
581 gtable[i][bi->tableIndices[i]].u = 0; //?
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.

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

574
575
576 //Allocate only one entry
577 for (int i = X; i <= nHistoryTables; i++) {
578 if ((gtable[i][bi->tableIndices[i]].u == 0)) {
579 gtable[i][bi->tableIndices[i]].tag = bi->tableTags[i];
580 gtable[i][bi->tableIndices[i]].ctr = (taken) ? 0 : -1;
581 gtable[i][bi->tableIndices[i]].u = 0; //?
582 break;
582 }
583 }
584 }
585 //periodic reset of u: reset is not complete but bit by bit
586 tCounter++;
587 if ((tCounter & ((ULL(1) << logTick) - 1)) == 0) {
588 // reset least significant bit
589 // most significant bit becomes least significant bit

--- 166 unchanged lines hidden --- 		583 }
584 }
585 }
586 //periodic reset of u: reset is not complete but bit by bit
587 tCounter++;
588 if ((tCounter & ((ULL(1) << logTick) - 1)) == 0) {
589 // reset least significant bit
590 // most significant bit becomes least significant bit

--- 166 unchanged lines hidden ---