store_set.cc (2654:9559cfa91b9d) | store_set.cc (2665:a124942bacb8) |
---|---|
1/* | 1/* |
2 * Copyright (c) 2004-2006 The Regents of The University of Michigan | 2 * Copyright (c) 2004-2005 The Regents of The University of Michigan |
3 * All rights reserved. 4 * 5 * Redistribution and use in source and binary forms, with or without 6 * modification, are permitted provided that the following conditions are 7 * met: redistributions of source code must retain the above copyright 8 * notice, this list of conditions and the following disclaimer; 9 * redistributions in binary form must reproduce the above copyright 10 * notice, this list of conditions and the following disclaimer in the --- 8 unchanged lines hidden (view full) --- 19 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT 20 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, 21 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT 22 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 23 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 24 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 25 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE 26 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | 3 * All rights reserved. 4 * 5 * Redistribution and use in source and binary forms, with or without 6 * modification, are permitted provided that the following conditions are 7 * met: redistributions of source code must retain the above copyright 8 * notice, this list of conditions and the following disclaimer; 9 * redistributions in binary form must reproduce the above copyright 10 * notice, this list of conditions and the following disclaimer in the --- 8 unchanged lines hidden (view full) --- 19 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT 20 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, 21 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT 22 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 23 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 24 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 25 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE 26 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
27 * 28 * Authors: Kevin Lim |
|
27 */ 28 29#include "base/trace.hh" 30#include "cpu/o3/store_set.hh" 31 32StoreSet::StoreSet(int _SSIT_size, int _LFST_size) | 29 */ 30 31#include "base/trace.hh" 32#include "cpu/o3/store_set.hh" 33 34StoreSet::StoreSet(int _SSIT_size, int _LFST_size) |
33 : SSITSize(_SSIT_size), LFSTSize(_LFST_size) | 35 : SSIT_size(_SSIT_size), LFST_size(_LFST_size) |
34{ 35 DPRINTF(StoreSet, "StoreSet: Creating store set object.\n"); 36 DPRINTF(StoreSet, "StoreSet: SSIT size: %i, LFST size: %i.\n", | 36{ 37 DPRINTF(StoreSet, "StoreSet: Creating store set object.\n"); 38 DPRINTF(StoreSet, "StoreSet: SSIT size: %i, LFST size: %i.\n", |
37 SSITSize, LFSTSize); | 39 SSIT_size, LFST_size); |
38 | 40 |
39 SSIT.resize(SSITSize); | 41 SSIT = new SSID[SSIT_size]; |
40 | 42 |
41 validSSIT.resize(SSITSize); | 43 validSSIT.resize(SSIT_size); |
42 | 44 |
43 for (int i = 0; i < SSITSize; ++i) | 45 for (int i = 0; i < SSIT_size; ++i) |
44 validSSIT[i] = false; 45 | 46 validSSIT[i] = false; 47 |
46 LFST.resize(LFSTSize); | 48 LFST = new InstSeqNum[LFST_size]; |
47 | 49 |
48 validLFST.resize(LFSTSize); | 50 validLFST.resize(LFST_size); |
49 | 51 |
50 for (int i = 0; i < LFSTSize; ++i) { 51 validLFST[i] = false; 52 LFST[i] = 0; 53 } | 52 SSCounters = new int[LFST_size]; |
54 | 53 |
55 indexMask = SSITSize - 1; 56 57 offsetBits = 2; 58} 59 60StoreSet::~StoreSet() 61{ 62} 63 64void 65StoreSet::init(int _SSIT_size, int _LFST_size) 66{ 67 SSITSize = _SSIT_size; 68 LFSTSize = _LFST_size; 69 70 DPRINTF(StoreSet, "StoreSet: Creating store set object.\n"); 71 DPRINTF(StoreSet, "StoreSet: SSIT size: %i, LFST size: %i.\n", 72 SSITSize, LFSTSize); 73 74 SSIT.resize(SSITSize); 75 76 validSSIT.resize(SSITSize); 77 78 for (int i = 0; i < SSITSize; ++i) 79 validSSIT[i] = false; 80 81 LFST.resize(LFSTSize); 82 83 validLFST.resize(LFSTSize); 84 85 for (int i = 0; i < LFSTSize; ++i) { | 54 for (int i = 0; i < LFST_size; ++i) 55 { |
86 validLFST[i] = false; | 56 validLFST[i] = false; |
87 LFST[i] = 0; | 57 SSCounters[i] = 0; |
88 } 89 | 58 } 59 |
90 indexMask = SSITSize - 1; | 60 index_mask = SSIT_size - 1; |
91 | 61 |
92 offsetBits = 2; | 62 offset_bits = 2; |
93} 94 | 63} 64 |
95 | |
96void 97StoreSet::violation(Addr store_PC, Addr load_PC) 98{ 99 int load_index = calcIndex(load_PC); 100 int store_index = calcIndex(store_PC); 101 | 65void 66StoreSet::violation(Addr store_PC, Addr load_PC) 67{ 68 int load_index = calcIndex(load_PC); 69 int store_index = calcIndex(store_PC); 70 |
102 assert(load_index < SSITSize && store_index < SSITSize); | 71 assert(load_index < SSIT_size && store_index < SSIT_size); |
103 104 bool valid_load_SSID = validSSIT[load_index]; 105 bool valid_store_SSID = validSSIT[store_index]; 106 107 if (!valid_load_SSID && !valid_store_SSID) { 108 // Calculate a new SSID here. 109 SSID new_set = calcSSID(load_PC); 110 111 validSSIT[load_index] = true; 112 113 SSIT[load_index] = new_set; 114 115 validSSIT[store_index] = true; 116 117 SSIT[store_index] = new_set; 118 | 72 73 bool valid_load_SSID = validSSIT[load_index]; 74 bool valid_store_SSID = validSSIT[store_index]; 75 76 if (!valid_load_SSID && !valid_store_SSID) { 77 // Calculate a new SSID here. 78 SSID new_set = calcSSID(load_PC); 79 80 validSSIT[load_index] = true; 81 82 SSIT[load_index] = new_set; 83 84 validSSIT[store_index] = true; 85 86 SSIT[store_index] = new_set; 87 |
119 assert(new_set < LFSTSize); | 88 assert(new_set < LFST_size); |
120 | 89 |
90 SSCounters[new_set]++; 91 92 |
|
121 DPRINTF(StoreSet, "StoreSet: Neither load nor store had a valid " 122 "storeset, creating a new one: %i for load %#x, store %#x\n", 123 new_set, load_PC, store_PC); 124 } else if (valid_load_SSID && !valid_store_SSID) { 125 SSID load_SSID = SSIT[load_index]; 126 127 validSSIT[store_index] = true; 128 129 SSIT[store_index] = load_SSID; 130 | 93 DPRINTF(StoreSet, "StoreSet: Neither load nor store had a valid " 94 "storeset, creating a new one: %i for load %#x, store %#x\n", 95 new_set, load_PC, store_PC); 96 } else if (valid_load_SSID && !valid_store_SSID) { 97 SSID load_SSID = SSIT[load_index]; 98 99 validSSIT[store_index] = true; 100 101 SSIT[store_index] = load_SSID; 102 |
131 assert(load_SSID < LFSTSize); | 103 assert(load_SSID < LFST_size); |
132 | 104 |
105 SSCounters[load_SSID]++; 106 |
|
133 DPRINTF(StoreSet, "StoreSet: Load had a valid store set. Adding " 134 "store to that set: %i for load %#x, store %#x\n", 135 load_SSID, load_PC, store_PC); 136 } else if (!valid_load_SSID && valid_store_SSID) { 137 SSID store_SSID = SSIT[store_index]; 138 139 validSSIT[load_index] = true; 140 141 SSIT[load_index] = store_SSID; 142 | 107 DPRINTF(StoreSet, "StoreSet: Load had a valid store set. Adding " 108 "store to that set: %i for load %#x, store %#x\n", 109 load_SSID, load_PC, store_PC); 110 } else if (!valid_load_SSID && valid_store_SSID) { 111 SSID store_SSID = SSIT[store_index]; 112 113 validSSIT[load_index] = true; 114 115 SSIT[load_index] = store_SSID; 116 |
117 // Because we are having a load point to an already existing set, 118 // the size of the store set is not incremented. 119 |
|
143 DPRINTF(StoreSet, "StoreSet: Store had a valid store set: %i for " 144 "load %#x, store %#x\n", 145 store_SSID, load_PC, store_PC); 146 } else { 147 SSID load_SSID = SSIT[load_index]; 148 SSID store_SSID = SSIT[store_index]; 149 | 120 DPRINTF(StoreSet, "StoreSet: Store had a valid store set: %i for " 121 "load %#x, store %#x\n", 122 store_SSID, load_PC, store_PC); 123 } else { 124 SSID load_SSID = SSIT[load_index]; 125 SSID store_SSID = SSIT[store_index]; 126 |
150 assert(load_SSID < LFSTSize && store_SSID < LFSTSize); | 127 assert(load_SSID < LFST_size && store_SSID < LFST_size); |
151 | 128 |
152 // The store set with the lower number wins 153 if (store_SSID > load_SSID) { | 129 int load_SS_size = SSCounters[load_SSID]; 130 int store_SS_size = SSCounters[store_SSID]; 131 132 // If the load has the bigger store set, then assign the store 133 // to the same store set as the load. Otherwise vice-versa. 134 if (load_SS_size > store_SS_size) { |
154 SSIT[store_index] = load_SSID; 155 | 135 SSIT[store_index] = load_SSID; 136 |
156 DPRINTF(StoreSet, "StoreSet: Load had smaller store set: %i; " | 137 SSCounters[load_SSID]++; 138 SSCounters[store_SSID]--; 139 140 DPRINTF(StoreSet, "StoreSet: Load had bigger store set: %i; " |
157 "for load %#x, store %#x\n", 158 load_SSID, load_PC, store_PC); 159 } else { 160 SSIT[load_index] = store_SSID; 161 | 141 "for load %#x, store %#x\n", 142 load_SSID, load_PC, store_PC); 143 } else { 144 SSIT[load_index] = store_SSID; 145 |
162 DPRINTF(StoreSet, "StoreSet: Store had smaller store set: %i; " | 146 SSCounters[store_SSID]++; 147 SSCounters[load_SSID]--; 148 149 DPRINTF(StoreSet, "StoreSet: Store had bigger store set: %i; " |
163 "for load %#x, store %#x\n", 164 store_SSID, load_PC, store_PC); 165 } 166 } 167} 168 169void 170StoreSet::insertLoad(Addr load_PC, InstSeqNum load_seq_num) 171{ 172 // Does nothing. 173 return; 174} 175 176void | 150 "for load %#x, store %#x\n", 151 store_SSID, load_PC, store_PC); 152 } 153 } 154} 155 156void 157StoreSet::insertLoad(Addr load_PC, InstSeqNum load_seq_num) 158{ 159 // Does nothing. 160 return; 161} 162 163void |
177StoreSet::insertStore(Addr store_PC, InstSeqNum store_seq_num, 178 unsigned tid) | 164StoreSet::insertStore(Addr store_PC, InstSeqNum store_seq_num) |
179{ 180 int index = calcIndex(store_PC); 181 182 int store_SSID; 183 | 165{ 166 int index = calcIndex(store_PC); 167 168 int store_SSID; 169 |
184 assert(index < SSITSize); | 170 assert(index < SSIT_size); |
185 186 if (!validSSIT[index]) { 187 // Do nothing if there's no valid entry. 188 return; 189 } else { 190 store_SSID = SSIT[index]; 191 | 171 172 if (!validSSIT[index]) { 173 // Do nothing if there's no valid entry. 174 return; 175 } else { 176 store_SSID = SSIT[index]; 177 |
192 assert(store_SSID < LFSTSize); | 178 assert(store_SSID < LFST_size); |
193 194 // Update the last store that was fetched with the current one. 195 LFST[store_SSID] = store_seq_num; 196 197 validLFST[store_SSID] = 1; 198 | 179 180 // Update the last store that was fetched with the current one. 181 LFST[store_SSID] = store_seq_num; 182 183 validLFST[store_SSID] = 1; 184 |
199 storeList[store_seq_num] = store_SSID; 200 | |
201 DPRINTF(StoreSet, "Store %#x updated the LFST, SSID: %i\n", 202 store_PC, store_SSID); 203 } 204} 205 206InstSeqNum 207StoreSet::checkInst(Addr PC) 208{ 209 int index = calcIndex(PC); 210 211 int inst_SSID; 212 | 185 DPRINTF(StoreSet, "Store %#x updated the LFST, SSID: %i\n", 186 store_PC, store_SSID); 187 } 188} 189 190InstSeqNum 191StoreSet::checkInst(Addr PC) 192{ 193 int index = calcIndex(PC); 194 195 int inst_SSID; 196 |
213 assert(index < SSITSize); | 197 assert(index < SSIT_size); |
214 215 if (!validSSIT[index]) { 216 DPRINTF(StoreSet, "Inst %#x with index %i had no SSID\n", 217 PC, index); 218 219 // Return 0 if there's no valid entry. 220 return 0; 221 } else { 222 inst_SSID = SSIT[index]; 223 | 198 199 if (!validSSIT[index]) { 200 DPRINTF(StoreSet, "Inst %#x with index %i had no SSID\n", 201 PC, index); 202 203 // Return 0 if there's no valid entry. 204 return 0; 205 } else { 206 inst_SSID = SSIT[index]; 207 |
224 assert(inst_SSID < LFSTSize); | 208 assert(inst_SSID < LFST_size); |
225 226 if (!validLFST[inst_SSID]) { 227 228 DPRINTF(StoreSet, "Inst %#x with index %i and SSID %i had no " 229 "dependency\n", PC, index, inst_SSID); 230 231 return 0; 232 } else { --- 12 unchanged lines hidden (view full) --- 245 if (!is_store) { 246 return; 247 } 248 249 int index = calcIndex(issued_PC); 250 251 int store_SSID; 252 | 209 210 if (!validLFST[inst_SSID]) { 211 212 DPRINTF(StoreSet, "Inst %#x with index %i and SSID %i had no " 213 "dependency\n", PC, index, inst_SSID); 214 215 return 0; 216 } else { --- 12 unchanged lines hidden (view full) --- 229 if (!is_store) { 230 return; 231 } 232 233 int index = calcIndex(issued_PC); 234 235 int store_SSID; 236 |
253 assert(index < SSITSize); | 237 assert(index < SSIT_size); |
254 | 238 |
255 SeqNumMapIt store_list_it = storeList.find(issued_seq_num); 256 257 if (store_list_it != storeList.end()) { 258 storeList.erase(store_list_it); 259 } 260 | |
261 // Make sure the SSIT still has a valid entry for the issued store. 262 if (!validSSIT[index]) { 263 return; 264 } 265 266 store_SSID = SSIT[index]; 267 | 239 // Make sure the SSIT still has a valid entry for the issued store. 240 if (!validSSIT[index]) { 241 return; 242 } 243 244 store_SSID = SSIT[index]; 245 |
268 assert(store_SSID < LFSTSize); | 246 assert(store_SSID < LFST_size); |
269 270 // If the last fetched store in the store set refers to the store that 271 // was just issued, then invalidate the entry. 272 if (validLFST[store_SSID] && LFST[store_SSID] == issued_seq_num) { 273 DPRINTF(StoreSet, "StoreSet: store invalidated itself in LFST.\n"); 274 validLFST[store_SSID] = false; 275 } 276} 277 278void | 247 248 // If the last fetched store in the store set refers to the store that 249 // was just issued, then invalidate the entry. 250 if (validLFST[store_SSID] && LFST[store_SSID] == issued_seq_num) { 251 DPRINTF(StoreSet, "StoreSet: store invalidated itself in LFST.\n"); 252 validLFST[store_SSID] = false; 253 } 254} 255 256void |
279StoreSet::squash(InstSeqNum squashed_num, unsigned tid) | 257StoreSet::squash(InstSeqNum squashed_num) |
280{ | 258{ |
259 // Not really sure how to do this well. 260 // Generally this is small enough that it should be okay; short circuit 261 // evaluation should take care of invalid entries. 262 |
|
281 DPRINTF(StoreSet, "StoreSet: Squashing until inum %i\n", 282 squashed_num); 283 | 263 DPRINTF(StoreSet, "StoreSet: Squashing until inum %i\n", 264 squashed_num); 265 |
284 int idx; 285 SeqNumMapIt store_list_it = storeList.begin(); 286 287 //@todo:Fix to only delete from correct thread 288 while (!storeList.empty()) { 289 idx = (*store_list_it).second; 290 291 if ((*store_list_it).first <= squashed_num) { 292 break; | 266 for (int i = 0; i < LFST_size; ++i) { 267 if (validLFST[i] && LFST[i] < squashed_num) { 268 validLFST[i] = false; |
293 } | 269 } |
294 295 bool younger = LFST[idx] > squashed_num; 296 297 if (validLFST[idx] && younger) { 298 DPRINTF(StoreSet, "Squashed [sn:%lli]\n", LFST[idx]); 299 validLFST[idx] = false; 300 301 storeList.erase(store_list_it++); 302 } else if (!validLFST[idx] && younger) { 303 storeList.erase(store_list_it++); 304 } | |
305 } 306} 307 308void 309StoreSet::clear() 310{ | 270 } 271} 272 273void 274StoreSet::clear() 275{ |
311 for (int i = 0; i < SSITSize; ++i) { | 276 for (int i = 0; i < SSIT_size; ++i) { |
312 validSSIT[i] = false; 313 } 314 | 277 validSSIT[i] = false; 278 } 279 |
315 for (int i = 0; i < LFSTSize; ++i) { | 280 for (int i = 0; i < LFST_size; ++i) { |
316 validLFST[i] = false; 317 } | 281 validLFST[i] = false; 282 } |
318 319 storeList.clear(); | |
320} | 283} |
284 |
|