2 * Copyright (c) 2004-2006 The Regents of The University of Michigan
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
11 * documentation and/or other materials provided with the distribution;
12 * neither the name of the copyright holders nor the names of its
13 * contributors may be used to endorse or promote products derived from
14 * this software without specific prior written permission.
16 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
17 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
18 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
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.
31 #include "cpu/o3/store_set.hh"
33 #include "base/intmath.hh"
34 #include "base/logging.hh"
35 #include "base/trace.hh"
36 #include "debug/StoreSet.hh"
38 StoreSet::StoreSet(uint64_t clear_period
, int _SSIT_size
, int _LFST_size
)
39 : clearPeriod(clear_period
), SSITSize(_SSIT_size
), LFSTSize(_LFST_size
)
41 DPRINTF(StoreSet
, "StoreSet: Creating store set object.\n");
42 DPRINTF(StoreSet
, "StoreSet: SSIT size: %i, LFST size: %i.\n",
45 if (!isPowerOf2(SSITSize
)) {
46 fatal("Invalid SSIT size!\n");
49 SSIT
.resize(SSITSize
);
51 validSSIT
.resize(SSITSize
);
53 for (int i
= 0; i
< SSITSize
; ++i
)
56 if (!isPowerOf2(LFSTSize
)) {
57 fatal("Invalid LFST size!\n");
60 LFST
.resize(LFSTSize
);
62 validLFST
.resize(LFSTSize
);
64 for (int i
= 0; i
< LFSTSize
; ++i
) {
69 indexMask
= SSITSize
- 1;
81 StoreSet::init(uint64_t clear_period
, int _SSIT_size
, int _LFST_size
)
83 SSITSize
= _SSIT_size
;
84 LFSTSize
= _LFST_size
;
85 clearPeriod
= clear_period
;
87 DPRINTF(StoreSet
, "StoreSet: Creating store set object.\n");
88 DPRINTF(StoreSet
, "StoreSet: SSIT size: %i, LFST size: %i.\n",
91 SSIT
.resize(SSITSize
);
93 validSSIT
.resize(SSITSize
);
95 for (int i
= 0; i
< SSITSize
; ++i
)
98 LFST
.resize(LFSTSize
);
100 validLFST
.resize(LFSTSize
);
102 for (int i
= 0; i
< LFSTSize
; ++i
) {
103 validLFST
[i
] = false;
107 indexMask
= SSITSize
- 1;
116 StoreSet::violation(Addr store_PC
, Addr load_PC
)
118 int load_index
= calcIndex(load_PC
);
119 int store_index
= calcIndex(store_PC
);
121 assert(load_index
< SSITSize
&& store_index
< SSITSize
);
123 bool valid_load_SSID
= validSSIT
[load_index
];
124 bool valid_store_SSID
= validSSIT
[store_index
];
126 if (!valid_load_SSID
&& !valid_store_SSID
) {
127 // Calculate a new SSID here.
128 SSID new_set
= calcSSID(load_PC
);
130 validSSIT
[load_index
] = true;
132 SSIT
[load_index
] = new_set
;
134 validSSIT
[store_index
] = true;
136 SSIT
[store_index
] = new_set
;
138 assert(new_set
< LFSTSize
);
140 DPRINTF(StoreSet
, "StoreSet: Neither load nor store had a valid "
141 "storeset, creating a new one: %i for load %#x, store %#x\n",
142 new_set
, load_PC
, store_PC
);
143 } else if (valid_load_SSID
&& !valid_store_SSID
) {
144 SSID load_SSID
= SSIT
[load_index
];
146 validSSIT
[store_index
] = true;
148 SSIT
[store_index
] = load_SSID
;
150 assert(load_SSID
< LFSTSize
);
152 DPRINTF(StoreSet
, "StoreSet: Load had a valid store set. Adding "
153 "store to that set: %i for load %#x, store %#x\n",
154 load_SSID
, load_PC
, store_PC
);
155 } else if (!valid_load_SSID
&& valid_store_SSID
) {
156 SSID store_SSID
= SSIT
[store_index
];
158 validSSIT
[load_index
] = true;
160 SSIT
[load_index
] = store_SSID
;
162 DPRINTF(StoreSet
, "StoreSet: Store had a valid store set: %i for "
163 "load %#x, store %#x\n",
164 store_SSID
, load_PC
, store_PC
);
166 SSID load_SSID
= SSIT
[load_index
];
167 SSID store_SSID
= SSIT
[store_index
];
169 assert(load_SSID
< LFSTSize
&& store_SSID
< LFSTSize
);
171 // The store set with the lower number wins
172 if (store_SSID
> load_SSID
) {
173 SSIT
[store_index
] = load_SSID
;
175 DPRINTF(StoreSet
, "StoreSet: Load had smaller store set: %i; "
176 "for load %#x, store %#x\n",
177 load_SSID
, load_PC
, store_PC
);
179 SSIT
[load_index
] = store_SSID
;
181 DPRINTF(StoreSet
, "StoreSet: Store had smaller store set: %i; "
182 "for load %#x, store %#x\n",
183 store_SSID
, load_PC
, store_PC
);
189 StoreSet::checkClear()
192 if (memOpsPred
> clearPeriod
) {
193 DPRINTF(StoreSet
, "Wiping predictor state beacuse %d ld/st executed\n",
201 StoreSet::insertLoad(Addr load_PC
, InstSeqNum load_seq_num
)
209 StoreSet::insertStore(Addr store_PC
, InstSeqNum store_seq_num
, ThreadID tid
)
211 int index
= calcIndex(store_PC
);
216 assert(index
< SSITSize
);
218 if (!validSSIT
[index
]) {
219 // Do nothing if there's no valid entry.
222 store_SSID
= SSIT
[index
];
224 assert(store_SSID
< LFSTSize
);
226 // Update the last store that was fetched with the current one.
227 LFST
[store_SSID
] = store_seq_num
;
229 validLFST
[store_SSID
] = 1;
231 storeList
[store_seq_num
] = store_SSID
;
233 DPRINTF(StoreSet
, "Store %#x updated the LFST, SSID: %i\n",
234 store_PC
, store_SSID
);
239 StoreSet::checkInst(Addr PC
)
241 int index
= calcIndex(PC
);
245 assert(index
< SSITSize
);
247 if (!validSSIT
[index
]) {
248 DPRINTF(StoreSet
, "Inst %#x with index %i had no SSID\n",
251 // Return 0 if there's no valid entry.
254 inst_SSID
= SSIT
[index
];
256 assert(inst_SSID
< LFSTSize
);
258 if (!validLFST
[inst_SSID
]) {
260 DPRINTF(StoreSet
, "Inst %#x with index %i and SSID %i had no "
261 "dependency\n", PC
, index
, inst_SSID
);
265 DPRINTF(StoreSet
, "Inst %#x with index %i and SSID %i had LFST "
266 "inum of %i\n", PC
, index
, inst_SSID
, LFST
[inst_SSID
]);
268 return LFST
[inst_SSID
];
274 StoreSet::issued(Addr issued_PC
, InstSeqNum issued_seq_num
, bool is_store
)
276 // This only is updated upon a store being issued.
281 int index
= calcIndex(issued_PC
);
285 assert(index
< SSITSize
);
287 SeqNumMapIt store_list_it
= storeList
.find(issued_seq_num
);
289 if (store_list_it
!= storeList
.end()) {
290 storeList
.erase(store_list_it
);
293 // Make sure the SSIT still has a valid entry for the issued store.
294 if (!validSSIT
[index
]) {
298 store_SSID
= SSIT
[index
];
300 assert(store_SSID
< LFSTSize
);
302 // If the last fetched store in the store set refers to the store that
303 // was just issued, then invalidate the entry.
304 if (validLFST
[store_SSID
] && LFST
[store_SSID
] == issued_seq_num
) {
305 DPRINTF(StoreSet
, "StoreSet: store invalidated itself in LFST.\n");
306 validLFST
[store_SSID
] = false;
311 StoreSet::squash(InstSeqNum squashed_num
, ThreadID tid
)
313 DPRINTF(StoreSet
, "StoreSet: Squashing until inum %i\n",
317 SeqNumMapIt store_list_it
= storeList
.begin();
319 //@todo:Fix to only delete from correct thread
320 while (!storeList
.empty()) {
321 idx
= (*store_list_it
).second
;
323 if ((*store_list_it
).first
<= squashed_num
) {
327 bool younger
= LFST
[idx
] > squashed_num
;
329 if (validLFST
[idx
] && younger
) {
330 DPRINTF(StoreSet
, "Squashed [sn:%lli]\n", LFST
[idx
]);
331 validLFST
[idx
] = false;
333 storeList
.erase(store_list_it
++);
334 } else if (!validLFST
[idx
] && younger
) {
335 storeList
.erase(store_list_it
++);
343 for (int i
= 0; i
< SSITSize
; ++i
) {
344 validSSIT
[i
] = false;
347 for (int i
= 0; i
< LFSTSize
; ++i
) {
348 validLFST
[i
] = false;
357 cprintf("storeList.size(): %i\n", storeList
.size());
358 SeqNumMapIt store_list_it
= storeList
.begin();
362 while (store_list_it
!= storeList
.end()) {
363 cprintf("%i: [sn:%lli] SSID:%i\n",
364 num
, (*store_list_it
).first
, (*store_list_it
).second
);