1/* 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 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. 15 * 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. 27 * 28 * Authors: Kevin Lim 29 * Korey Sewell 30 */ 31 32#include "cpu/checker/cpu.hh" 33#include "cpu/o3/lsq_unit.hh" 34#include "base/str.hh" 35#include "mem/request.hh" 36 37template<class Impl> 38LSQUnit<Impl>::WritebackEvent::WritebackEvent(DynInstPtr &_inst, PacketPtr _pkt, 39 LSQUnit *lsq_ptr) 40 : Event(&mainEventQueue), inst(_inst), pkt(_pkt), lsqPtr(lsq_ptr) 41{ 42 this->setFlags(Event::AutoDelete); 43} 44 45template<class Impl> 46void 47LSQUnit<Impl>::WritebackEvent::process() 48{ 49 if (!lsqPtr->isSwitchedOut()) { 50 lsqPtr->writeback(inst, pkt); 51 } 52 delete pkt; 53} 54 55template<class Impl> 56const char * 57LSQUnit<Impl>::WritebackEvent::description() 58{ 59 return "Store writeback event"; 60} 61 62template<class Impl> 63void 64LSQUnit<Impl>::completeDataAccess(PacketPtr pkt) 65{ 66 LSQSenderState *state = dynamic_cast<LSQSenderState *>(pkt->senderState); 67 DynInstPtr inst = state->inst; 68 DPRINTF(IEW, "Writeback event [sn:%lli]\n", inst->seqNum); 69// DPRINTF(Activity, "Activity: Ld Writeback event [sn:%lli]\n", inst->seqNum); 70 71 //iewStage->ldstQueue.removeMSHR(inst->threadNumber,inst->seqNum); 72 73 if (isSwitchedOut() || inst->isSquashed()) { 74 delete state; 75 delete pkt; 76 return; 77 } else { 78 if (!state->noWB) { 79 writeback(inst, pkt); 80 } 81 82 if (inst->isStore()) { 83 completeStore(state->idx); 84 } 85 } 86 87 delete state; 88 delete pkt; 89} 90 91template <class Impl> 92Tick 93LSQUnit<Impl>::DcachePort::recvAtomic(PacketPtr pkt) 94{ 95 panic("O3CPU model does not work with atomic mode!"); 96 return curTick; 97} 98 99template <class Impl> 100void 101LSQUnit<Impl>::DcachePort::recvFunctional(PacketPtr pkt) 102{ 103 panic("O3CPU doesn't expect recvFunctional callback!"); 104} 105 106template <class Impl> 107void 108LSQUnit<Impl>::DcachePort::recvStatusChange(Status status) 109{ 110 if (status == RangeChange) 111 return; 112 113 panic("O3CPU doesn't expect recvStatusChange callback!"); 114} 115 116template <class Impl> 117bool 118LSQUnit<Impl>::DcachePort::recvTiming(PacketPtr pkt) 119{ 120 lsq->completeDataAccess(pkt); 121 return true; 122} 123 124template <class Impl> 125void 126LSQUnit<Impl>::DcachePort::recvRetry() 127{
| 1/* 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 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. 15 * 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. 27 * 28 * Authors: Kevin Lim 29 * Korey Sewell 30 */ 31 32#include "cpu/checker/cpu.hh" 33#include "cpu/o3/lsq_unit.hh" 34#include "base/str.hh" 35#include "mem/request.hh" 36 37template<class Impl> 38LSQUnit<Impl>::WritebackEvent::WritebackEvent(DynInstPtr &_inst, PacketPtr _pkt, 39 LSQUnit *lsq_ptr) 40 : Event(&mainEventQueue), inst(_inst), pkt(_pkt), lsqPtr(lsq_ptr) 41{ 42 this->setFlags(Event::AutoDelete); 43} 44 45template<class Impl> 46void 47LSQUnit<Impl>::WritebackEvent::process() 48{ 49 if (!lsqPtr->isSwitchedOut()) { 50 lsqPtr->writeback(inst, pkt); 51 } 52 delete pkt; 53} 54 55template<class Impl> 56const char * 57LSQUnit<Impl>::WritebackEvent::description() 58{ 59 return "Store writeback event"; 60} 61 62template<class Impl> 63void 64LSQUnit<Impl>::completeDataAccess(PacketPtr pkt) 65{ 66 LSQSenderState *state = dynamic_cast<LSQSenderState *>(pkt->senderState); 67 DynInstPtr inst = state->inst; 68 DPRINTF(IEW, "Writeback event [sn:%lli]\n", inst->seqNum); 69// DPRINTF(Activity, "Activity: Ld Writeback event [sn:%lli]\n", inst->seqNum); 70 71 //iewStage->ldstQueue.removeMSHR(inst->threadNumber,inst->seqNum); 72 73 if (isSwitchedOut() || inst->isSquashed()) { 74 delete state; 75 delete pkt; 76 return; 77 } else { 78 if (!state->noWB) { 79 writeback(inst, pkt); 80 } 81 82 if (inst->isStore()) { 83 completeStore(state->idx); 84 } 85 } 86 87 delete state; 88 delete pkt; 89} 90 91template <class Impl> 92Tick 93LSQUnit<Impl>::DcachePort::recvAtomic(PacketPtr pkt) 94{ 95 panic("O3CPU model does not work with atomic mode!"); 96 return curTick; 97} 98 99template <class Impl> 100void 101LSQUnit<Impl>::DcachePort::recvFunctional(PacketPtr pkt) 102{ 103 panic("O3CPU doesn't expect recvFunctional callback!"); 104} 105 106template <class Impl> 107void 108LSQUnit<Impl>::DcachePort::recvStatusChange(Status status) 109{ 110 if (status == RangeChange) 111 return; 112 113 panic("O3CPU doesn't expect recvStatusChange callback!"); 114} 115 116template <class Impl> 117bool 118LSQUnit<Impl>::DcachePort::recvTiming(PacketPtr pkt) 119{ 120 lsq->completeDataAccess(pkt); 121 return true; 122} 123 124template <class Impl> 125void 126LSQUnit<Impl>::DcachePort::recvRetry() 127{
|
128 panic("Retry unsupported for now!"); 129 // we shouldn't get a retry unless we have a packet that we're 130 // waiting to transmit 131/* 132 assert(cpu->dcache_pkt != NULL); 133 assert(cpu->_status == DcacheRetry); 134 PacketPtr tmp = cpu->dcache_pkt; 135 if (sendTiming(tmp)) { 136 cpu->_status = DcacheWaitResponse; 137 cpu->dcache_pkt = NULL; 138 } 139*/
| 128 lsq->recvRetry();
|
140} 141 142template <class Impl> 143LSQUnit<Impl>::LSQUnit() 144 : loads(0), stores(0), storesToWB(0), stalled(false), 145 isStoreBlocked(false), isLoadBlocked(false), 146 loadBlockedHandled(false) 147{ 148} 149 150template<class Impl> 151void 152LSQUnit<Impl>::init(Params *params, unsigned maxLQEntries, 153 unsigned maxSQEntries, unsigned id) 154{ 155 DPRINTF(LSQUnit, "Creating LSQUnit%i object.\n",id); 156 157 switchedOut = false; 158 159 lsqID = id; 160 161 // Add 1 for the sentinel entry (they are circular queues). 162 LQEntries = maxLQEntries + 1; 163 SQEntries = maxSQEntries + 1; 164 165 loadQueue.resize(LQEntries); 166 storeQueue.resize(SQEntries); 167 168 loadHead = loadTail = 0; 169 170 storeHead = storeWBIdx = storeTail = 0; 171 172 usedPorts = 0; 173 cachePorts = params->cachePorts; 174 175 mem = params->mem; 176 177 memDepViolator = NULL; 178 179 blockedLoadSeqNum = 0; 180} 181 182template<class Impl> 183void 184LSQUnit<Impl>::setCPU(FullCPU *cpu_ptr) 185{ 186 cpu = cpu_ptr; 187 dcachePort = new DcachePort(cpu, this); 188 189 Port *mem_dport = mem->getPort(""); 190 dcachePort->setPeer(mem_dport); 191 mem_dport->setPeer(dcachePort); 192 193 if (cpu->checker) { 194 cpu->checker->setDcachePort(dcachePort); 195 } 196} 197 198template<class Impl> 199std::string 200LSQUnit<Impl>::name() const 201{ 202 if (Impl::MaxThreads == 1) { 203 return iewStage->name() + ".lsq"; 204 } else { 205 return iewStage->name() + ".lsq.thread." + to_string(lsqID); 206 } 207} 208 209template<class Impl> 210void 211LSQUnit<Impl>::clearLQ() 212{ 213 loadQueue.clear(); 214} 215 216template<class Impl> 217void 218LSQUnit<Impl>::clearSQ() 219{ 220 storeQueue.clear(); 221} 222 223#if 0 224template<class Impl> 225void 226LSQUnit<Impl>::setPageTable(PageTable *pt_ptr) 227{ 228 DPRINTF(LSQUnit, "Setting the page table pointer.\n"); 229 pTable = pt_ptr; 230} 231#endif 232 233template<class Impl> 234void 235LSQUnit<Impl>::switchOut() 236{ 237 switchedOut = true; 238 for (int i = 0; i < loadQueue.size(); ++i) 239 loadQueue[i] = NULL; 240 241 assert(storesToWB == 0); 242} 243 244template<class Impl> 245void 246LSQUnit<Impl>::takeOverFrom() 247{ 248 switchedOut = false; 249 loads = stores = storesToWB = 0; 250 251 loadHead = loadTail = 0; 252 253 storeHead = storeWBIdx = storeTail = 0; 254 255 usedPorts = 0; 256 257 memDepViolator = NULL; 258 259 blockedLoadSeqNum = 0; 260 261 stalled = false; 262 isLoadBlocked = false; 263 loadBlockedHandled = false; 264} 265 266template<class Impl> 267void 268LSQUnit<Impl>::resizeLQ(unsigned size) 269{ 270 unsigned size_plus_sentinel = size + 1; 271 assert(size_plus_sentinel >= LQEntries); 272 273 if (size_plus_sentinel > LQEntries) { 274 while (size_plus_sentinel > loadQueue.size()) { 275 DynInstPtr dummy; 276 loadQueue.push_back(dummy); 277 LQEntries++; 278 } 279 } else { 280 LQEntries = size_plus_sentinel; 281 } 282 283} 284 285template<class Impl> 286void 287LSQUnit<Impl>::resizeSQ(unsigned size) 288{ 289 unsigned size_plus_sentinel = size + 1; 290 if (size_plus_sentinel > SQEntries) { 291 while (size_plus_sentinel > storeQueue.size()) { 292 SQEntry dummy; 293 storeQueue.push_back(dummy); 294 SQEntries++; 295 } 296 } else { 297 SQEntries = size_plus_sentinel; 298 } 299} 300 301template <class Impl> 302void 303LSQUnit<Impl>::insert(DynInstPtr &inst) 304{ 305 assert(inst->isMemRef()); 306 307 assert(inst->isLoad() || inst->isStore()); 308 309 if (inst->isLoad()) { 310 insertLoad(inst); 311 } else { 312 insertStore(inst); 313 } 314 315 inst->setInLSQ(); 316} 317 318template <class Impl> 319void 320LSQUnit<Impl>::insertLoad(DynInstPtr &load_inst) 321{ 322 assert((loadTail + 1) % LQEntries != loadHead); 323 assert(loads < LQEntries); 324 325 DPRINTF(LSQUnit, "Inserting load PC %#x, idx:%i [sn:%lli]\n", 326 load_inst->readPC(), loadTail, load_inst->seqNum); 327 328 load_inst->lqIdx = loadTail; 329 330 if (stores == 0) { 331 load_inst->sqIdx = -1; 332 } else { 333 load_inst->sqIdx = storeTail; 334 } 335 336 loadQueue[loadTail] = load_inst; 337 338 incrLdIdx(loadTail); 339 340 ++loads; 341} 342 343template <class Impl> 344void 345LSQUnit<Impl>::insertStore(DynInstPtr &store_inst) 346{ 347 // Make sure it is not full before inserting an instruction. 348 assert((storeTail + 1) % SQEntries != storeHead); 349 assert(stores < SQEntries); 350 351 DPRINTF(LSQUnit, "Inserting store PC %#x, idx:%i [sn:%lli]\n", 352 store_inst->readPC(), storeTail, store_inst->seqNum); 353 354 store_inst->sqIdx = storeTail; 355 store_inst->lqIdx = loadTail; 356 357 storeQueue[storeTail] = SQEntry(store_inst); 358 359 incrStIdx(storeTail); 360 361 ++stores; 362} 363 364template <class Impl> 365typename Impl::DynInstPtr 366LSQUnit<Impl>::getMemDepViolator() 367{ 368 DynInstPtr temp = memDepViolator; 369 370 memDepViolator = NULL; 371 372 return temp; 373} 374 375template <class Impl> 376unsigned 377LSQUnit<Impl>::numFreeEntries() 378{ 379 unsigned free_lq_entries = LQEntries - loads; 380 unsigned free_sq_entries = SQEntries - stores; 381 382 // Both the LQ and SQ entries have an extra dummy entry to differentiate 383 // empty/full conditions. Subtract 1 from the free entries. 384 if (free_lq_entries < free_sq_entries) { 385 return free_lq_entries - 1; 386 } else { 387 return free_sq_entries - 1; 388 } 389} 390 391template <class Impl> 392int 393LSQUnit<Impl>::numLoadsReady() 394{ 395 int load_idx = loadHead; 396 int retval = 0; 397 398 while (load_idx != loadTail) { 399 assert(loadQueue[load_idx]); 400 401 if (loadQueue[load_idx]->readyToIssue()) { 402 ++retval; 403 } 404 } 405 406 return retval; 407} 408 409template <class Impl> 410Fault 411LSQUnit<Impl>::executeLoad(DynInstPtr &inst) 412{ 413 // Execute a specific load. 414 Fault load_fault = NoFault; 415 416 DPRINTF(LSQUnit, "Executing load PC %#x, [sn:%lli]\n", 417 inst->readPC(),inst->seqNum); 418 419 load_fault = inst->initiateAcc(); 420 421 // If the instruction faulted, then we need to send it along to commit 422 // without the instruction completing. 423 if (load_fault != NoFault) { 424 // Send this instruction to commit, also make sure iew stage 425 // realizes there is activity. 426 iewStage->instToCommit(inst); 427 iewStage->activityThisCycle(); 428 } 429 430 return load_fault; 431} 432 433template <class Impl> 434Fault 435LSQUnit<Impl>::executeStore(DynInstPtr &store_inst) 436{ 437 using namespace TheISA; 438 // Make sure that a store exists. 439 assert(stores != 0); 440 441 int store_idx = store_inst->sqIdx; 442 443 DPRINTF(LSQUnit, "Executing store PC %#x [sn:%lli]\n", 444 store_inst->readPC(), store_inst->seqNum); 445 446 // Check the recently completed loads to see if any match this store's 447 // address. If so, then we have a memory ordering violation. 448 int load_idx = store_inst->lqIdx; 449 450 Fault store_fault = store_inst->initiateAcc(); 451 452 if (storeQueue[store_idx].size == 0) { 453 DPRINTF(LSQUnit,"Fault on Store PC %#x, [sn:%lli],Size = 0\n", 454 store_inst->readPC(),store_inst->seqNum); 455 456 return store_fault; 457 } 458 459 assert(store_fault == NoFault); 460 461 if (store_inst->isStoreConditional()) { 462 // Store conditionals need to set themselves as able to 463 // writeback if we haven't had a fault by here. 464 storeQueue[store_idx].canWB = true; 465 466 ++storesToWB; 467 } 468 469 if (!memDepViolator) { 470 while (load_idx != loadTail) { 471 // Really only need to check loads that have actually executed 472 // It's safe to check all loads because effAddr is set to 473 // InvalAddr when the dyn inst is created. 474 475 // @todo: For now this is extra conservative, detecting a 476 // violation if the addresses match assuming all accesses 477 // are quad word accesses. 478 479 // @todo: Fix this, magic number being used here 480 if ((loadQueue[load_idx]->effAddr >> 8) == 481 (store_inst->effAddr >> 8)) { 482 // A load incorrectly passed this store. Squash and refetch. 483 // For now return a fault to show that it was unsuccessful. 484 memDepViolator = loadQueue[load_idx]; 485 486 return genMachineCheckFault(); 487 } 488 489 incrLdIdx(load_idx); 490 } 491 492 // If we've reached this point, there was no violation. 493 memDepViolator = NULL; 494 } 495 496 return store_fault; 497} 498 499template <class Impl> 500void 501LSQUnit<Impl>::commitLoad() 502{ 503 assert(loadQueue[loadHead]); 504 505 DPRINTF(LSQUnit, "Committing head load instruction, PC %#x\n", 506 loadQueue[loadHead]->readPC()); 507 508 loadQueue[loadHead] = NULL; 509 510 incrLdIdx(loadHead); 511 512 --loads; 513} 514 515template <class Impl> 516void 517LSQUnit<Impl>::commitLoads(InstSeqNum &youngest_inst) 518{ 519 assert(loads == 0 || loadQueue[loadHead]); 520 521 while (loads != 0 && loadQueue[loadHead]->seqNum <= youngest_inst) { 522 commitLoad(); 523 } 524} 525 526template <class Impl> 527void 528LSQUnit<Impl>::commitStores(InstSeqNum &youngest_inst) 529{ 530 assert(stores == 0 || storeQueue[storeHead].inst); 531 532 int store_idx = storeHead; 533 534 while (store_idx != storeTail) { 535 assert(storeQueue[store_idx].inst); 536 // Mark any stores that are now committed and have not yet 537 // been marked as able to write back. 538 if (!storeQueue[store_idx].canWB) { 539 if (storeQueue[store_idx].inst->seqNum > youngest_inst) { 540 break; 541 } 542 DPRINTF(LSQUnit, "Marking store as able to write back, PC " 543 "%#x [sn:%lli]\n", 544 storeQueue[store_idx].inst->readPC(), 545 storeQueue[store_idx].inst->seqNum); 546 547 storeQueue[store_idx].canWB = true; 548 549 ++storesToWB; 550 } 551 552 incrStIdx(store_idx); 553 } 554} 555 556template <class Impl> 557void 558LSQUnit<Impl>::writebackStores() 559{ 560 while (storesToWB > 0 && 561 storeWBIdx != storeTail && 562 storeQueue[storeWBIdx].inst && 563 storeQueue[storeWBIdx].canWB && 564 usedPorts < cachePorts) { 565 566 if (isStoreBlocked) { 567 DPRINTF(LSQUnit, "Unable to write back any more stores, cache" 568 " is blocked!\n"); 569 break; 570 } 571 572 // Store didn't write any data so no need to write it back to 573 // memory. 574 if (storeQueue[storeWBIdx].size == 0) { 575 completeStore(storeWBIdx); 576 577 incrStIdx(storeWBIdx); 578 579 continue; 580 } 581 582 ++usedPorts; 583 584 if (storeQueue[storeWBIdx].inst->isDataPrefetch()) { 585 incrStIdx(storeWBIdx); 586 587 continue; 588 } 589 590 assert(storeQueue[storeWBIdx].req); 591 assert(!storeQueue[storeWBIdx].committed); 592 593 DynInstPtr inst = storeQueue[storeWBIdx].inst; 594 595 Request *req = storeQueue[storeWBIdx].req; 596 storeQueue[storeWBIdx].committed = true; 597 598 assert(!inst->memData); 599 inst->memData = new uint8_t[64]; 600 memcpy(inst->memData, (uint8_t *)&storeQueue[storeWBIdx].data, 601 req->getSize()); 602 603 PacketPtr data_pkt = new Packet(req, Packet::WriteReq, Packet::Broadcast); 604 data_pkt->dataStatic(inst->memData); 605 606 LSQSenderState *state = new LSQSenderState; 607 state->isLoad = false; 608 state->idx = storeWBIdx; 609 state->inst = inst; 610 data_pkt->senderState = state; 611 612 DPRINTF(LSQUnit, "D-Cache: Writing back store idx:%i PC:%#x " 613 "to Addr:%#x, data:%#x [sn:%lli]\n", 614 storeWBIdx, storeQueue[storeWBIdx].inst->readPC(), 615 req->getPaddr(), *(inst->memData), 616 storeQueue[storeWBIdx].inst->seqNum); 617
| 129} 130 131template <class Impl> 132LSQUnit<Impl>::LSQUnit() 133 : loads(0), stores(0), storesToWB(0), stalled(false), 134 isStoreBlocked(false), isLoadBlocked(false), 135 loadBlockedHandled(false) 136{ 137} 138 139template<class Impl> 140void 141LSQUnit<Impl>::init(Params *params, unsigned maxLQEntries, 142 unsigned maxSQEntries, unsigned id) 143{ 144 DPRINTF(LSQUnit, "Creating LSQUnit%i object.\n",id); 145 146 switchedOut = false; 147 148 lsqID = id; 149 150 // Add 1 for the sentinel entry (they are circular queues). 151 LQEntries = maxLQEntries + 1; 152 SQEntries = maxSQEntries + 1; 153 154 loadQueue.resize(LQEntries); 155 storeQueue.resize(SQEntries); 156 157 loadHead = loadTail = 0; 158 159 storeHead = storeWBIdx = storeTail = 0; 160 161 usedPorts = 0; 162 cachePorts = params->cachePorts; 163 164 mem = params->mem; 165 166 memDepViolator = NULL; 167 168 blockedLoadSeqNum = 0; 169} 170 171template<class Impl> 172void 173LSQUnit<Impl>::setCPU(FullCPU *cpu_ptr) 174{ 175 cpu = cpu_ptr; 176 dcachePort = new DcachePort(cpu, this); 177 178 Port *mem_dport = mem->getPort(""); 179 dcachePort->setPeer(mem_dport); 180 mem_dport->setPeer(dcachePort); 181 182 if (cpu->checker) { 183 cpu->checker->setDcachePort(dcachePort); 184 } 185} 186 187template<class Impl> 188std::string 189LSQUnit<Impl>::name() const 190{ 191 if (Impl::MaxThreads == 1) { 192 return iewStage->name() + ".lsq"; 193 } else { 194 return iewStage->name() + ".lsq.thread." + to_string(lsqID); 195 } 196} 197 198template<class Impl> 199void 200LSQUnit<Impl>::clearLQ() 201{ 202 loadQueue.clear(); 203} 204 205template<class Impl> 206void 207LSQUnit<Impl>::clearSQ() 208{ 209 storeQueue.clear(); 210} 211 212#if 0 213template<class Impl> 214void 215LSQUnit<Impl>::setPageTable(PageTable *pt_ptr) 216{ 217 DPRINTF(LSQUnit, "Setting the page table pointer.\n"); 218 pTable = pt_ptr; 219} 220#endif 221 222template<class Impl> 223void 224LSQUnit<Impl>::switchOut() 225{ 226 switchedOut = true; 227 for (int i = 0; i < loadQueue.size(); ++i) 228 loadQueue[i] = NULL; 229 230 assert(storesToWB == 0); 231} 232 233template<class Impl> 234void 235LSQUnit<Impl>::takeOverFrom() 236{ 237 switchedOut = false; 238 loads = stores = storesToWB = 0; 239 240 loadHead = loadTail = 0; 241 242 storeHead = storeWBIdx = storeTail = 0; 243 244 usedPorts = 0; 245 246 memDepViolator = NULL; 247 248 blockedLoadSeqNum = 0; 249 250 stalled = false; 251 isLoadBlocked = false; 252 loadBlockedHandled = false; 253} 254 255template<class Impl> 256void 257LSQUnit<Impl>::resizeLQ(unsigned size) 258{ 259 unsigned size_plus_sentinel = size + 1; 260 assert(size_plus_sentinel >= LQEntries); 261 262 if (size_plus_sentinel > LQEntries) { 263 while (size_plus_sentinel > loadQueue.size()) { 264 DynInstPtr dummy; 265 loadQueue.push_back(dummy); 266 LQEntries++; 267 } 268 } else { 269 LQEntries = size_plus_sentinel; 270 } 271 272} 273 274template<class Impl> 275void 276LSQUnit<Impl>::resizeSQ(unsigned size) 277{ 278 unsigned size_plus_sentinel = size + 1; 279 if (size_plus_sentinel > SQEntries) { 280 while (size_plus_sentinel > storeQueue.size()) { 281 SQEntry dummy; 282 storeQueue.push_back(dummy); 283 SQEntries++; 284 } 285 } else { 286 SQEntries = size_plus_sentinel; 287 } 288} 289 290template <class Impl> 291void 292LSQUnit<Impl>::insert(DynInstPtr &inst) 293{ 294 assert(inst->isMemRef()); 295 296 assert(inst->isLoad() || inst->isStore()); 297 298 if (inst->isLoad()) { 299 insertLoad(inst); 300 } else { 301 insertStore(inst); 302 } 303 304 inst->setInLSQ(); 305} 306 307template <class Impl> 308void 309LSQUnit<Impl>::insertLoad(DynInstPtr &load_inst) 310{ 311 assert((loadTail + 1) % LQEntries != loadHead); 312 assert(loads < LQEntries); 313 314 DPRINTF(LSQUnit, "Inserting load PC %#x, idx:%i [sn:%lli]\n", 315 load_inst->readPC(), loadTail, load_inst->seqNum); 316 317 load_inst->lqIdx = loadTail; 318 319 if (stores == 0) { 320 load_inst->sqIdx = -1; 321 } else { 322 load_inst->sqIdx = storeTail; 323 } 324 325 loadQueue[loadTail] = load_inst; 326 327 incrLdIdx(loadTail); 328 329 ++loads; 330} 331 332template <class Impl> 333void 334LSQUnit<Impl>::insertStore(DynInstPtr &store_inst) 335{ 336 // Make sure it is not full before inserting an instruction. 337 assert((storeTail + 1) % SQEntries != storeHead); 338 assert(stores < SQEntries); 339 340 DPRINTF(LSQUnit, "Inserting store PC %#x, idx:%i [sn:%lli]\n", 341 store_inst->readPC(), storeTail, store_inst->seqNum); 342 343 store_inst->sqIdx = storeTail; 344 store_inst->lqIdx = loadTail; 345 346 storeQueue[storeTail] = SQEntry(store_inst); 347 348 incrStIdx(storeTail); 349 350 ++stores; 351} 352 353template <class Impl> 354typename Impl::DynInstPtr 355LSQUnit<Impl>::getMemDepViolator() 356{ 357 DynInstPtr temp = memDepViolator; 358 359 memDepViolator = NULL; 360 361 return temp; 362} 363 364template <class Impl> 365unsigned 366LSQUnit<Impl>::numFreeEntries() 367{ 368 unsigned free_lq_entries = LQEntries - loads; 369 unsigned free_sq_entries = SQEntries - stores; 370 371 // Both the LQ and SQ entries have an extra dummy entry to differentiate 372 // empty/full conditions. Subtract 1 from the free entries. 373 if (free_lq_entries < free_sq_entries) { 374 return free_lq_entries - 1; 375 } else { 376 return free_sq_entries - 1; 377 } 378} 379 380template <class Impl> 381int 382LSQUnit<Impl>::numLoadsReady() 383{ 384 int load_idx = loadHead; 385 int retval = 0; 386 387 while (load_idx != loadTail) { 388 assert(loadQueue[load_idx]); 389 390 if (loadQueue[load_idx]->readyToIssue()) { 391 ++retval; 392 } 393 } 394 395 return retval; 396} 397 398template <class Impl> 399Fault 400LSQUnit<Impl>::executeLoad(DynInstPtr &inst) 401{ 402 // Execute a specific load. 403 Fault load_fault = NoFault; 404 405 DPRINTF(LSQUnit, "Executing load PC %#x, [sn:%lli]\n", 406 inst->readPC(),inst->seqNum); 407 408 load_fault = inst->initiateAcc(); 409 410 // If the instruction faulted, then we need to send it along to commit 411 // without the instruction completing. 412 if (load_fault != NoFault) { 413 // Send this instruction to commit, also make sure iew stage 414 // realizes there is activity. 415 iewStage->instToCommit(inst); 416 iewStage->activityThisCycle(); 417 } 418 419 return load_fault; 420} 421 422template <class Impl> 423Fault 424LSQUnit<Impl>::executeStore(DynInstPtr &store_inst) 425{ 426 using namespace TheISA; 427 // Make sure that a store exists. 428 assert(stores != 0); 429 430 int store_idx = store_inst->sqIdx; 431 432 DPRINTF(LSQUnit, "Executing store PC %#x [sn:%lli]\n", 433 store_inst->readPC(), store_inst->seqNum); 434 435 // Check the recently completed loads to see if any match this store's 436 // address. If so, then we have a memory ordering violation. 437 int load_idx = store_inst->lqIdx; 438 439 Fault store_fault = store_inst->initiateAcc(); 440 441 if (storeQueue[store_idx].size == 0) { 442 DPRINTF(LSQUnit,"Fault on Store PC %#x, [sn:%lli],Size = 0\n", 443 store_inst->readPC(),store_inst->seqNum); 444 445 return store_fault; 446 } 447 448 assert(store_fault == NoFault); 449 450 if (store_inst->isStoreConditional()) { 451 // Store conditionals need to set themselves as able to 452 // writeback if we haven't had a fault by here. 453 storeQueue[store_idx].canWB = true; 454 455 ++storesToWB; 456 } 457 458 if (!memDepViolator) { 459 while (load_idx != loadTail) { 460 // Really only need to check loads that have actually executed 461 // It's safe to check all loads because effAddr is set to 462 // InvalAddr when the dyn inst is created. 463 464 // @todo: For now this is extra conservative, detecting a 465 // violation if the addresses match assuming all accesses 466 // are quad word accesses. 467 468 // @todo: Fix this, magic number being used here 469 if ((loadQueue[load_idx]->effAddr >> 8) == 470 (store_inst->effAddr >> 8)) { 471 // A load incorrectly passed this store. Squash and refetch. 472 // For now return a fault to show that it was unsuccessful. 473 memDepViolator = loadQueue[load_idx]; 474 475 return genMachineCheckFault(); 476 } 477 478 incrLdIdx(load_idx); 479 } 480 481 // If we've reached this point, there was no violation. 482 memDepViolator = NULL; 483 } 484 485 return store_fault; 486} 487 488template <class Impl> 489void 490LSQUnit<Impl>::commitLoad() 491{ 492 assert(loadQueue[loadHead]); 493 494 DPRINTF(LSQUnit, "Committing head load instruction, PC %#x\n", 495 loadQueue[loadHead]->readPC()); 496 497 loadQueue[loadHead] = NULL; 498 499 incrLdIdx(loadHead); 500 501 --loads; 502} 503 504template <class Impl> 505void 506LSQUnit<Impl>::commitLoads(InstSeqNum &youngest_inst) 507{ 508 assert(loads == 0 || loadQueue[loadHead]); 509 510 while (loads != 0 && loadQueue[loadHead]->seqNum <= youngest_inst) { 511 commitLoad(); 512 } 513} 514 515template <class Impl> 516void 517LSQUnit<Impl>::commitStores(InstSeqNum &youngest_inst) 518{ 519 assert(stores == 0 || storeQueue[storeHead].inst); 520 521 int store_idx = storeHead; 522 523 while (store_idx != storeTail) { 524 assert(storeQueue[store_idx].inst); 525 // Mark any stores that are now committed and have not yet 526 // been marked as able to write back. 527 if (!storeQueue[store_idx].canWB) { 528 if (storeQueue[store_idx].inst->seqNum > youngest_inst) { 529 break; 530 } 531 DPRINTF(LSQUnit, "Marking store as able to write back, PC " 532 "%#x [sn:%lli]\n", 533 storeQueue[store_idx].inst->readPC(), 534 storeQueue[store_idx].inst->seqNum); 535 536 storeQueue[store_idx].canWB = true; 537 538 ++storesToWB; 539 } 540 541 incrStIdx(store_idx); 542 } 543} 544 545template <class Impl> 546void 547LSQUnit<Impl>::writebackStores() 548{ 549 while (storesToWB > 0 && 550 storeWBIdx != storeTail && 551 storeQueue[storeWBIdx].inst && 552 storeQueue[storeWBIdx].canWB && 553 usedPorts < cachePorts) { 554 555 if (isStoreBlocked) { 556 DPRINTF(LSQUnit, "Unable to write back any more stores, cache" 557 " is blocked!\n"); 558 break; 559 } 560 561 // Store didn't write any data so no need to write it back to 562 // memory. 563 if (storeQueue[storeWBIdx].size == 0) { 564 completeStore(storeWBIdx); 565 566 incrStIdx(storeWBIdx); 567 568 continue; 569 } 570 571 ++usedPorts; 572 573 if (storeQueue[storeWBIdx].inst->isDataPrefetch()) { 574 incrStIdx(storeWBIdx); 575 576 continue; 577 } 578 579 assert(storeQueue[storeWBIdx].req); 580 assert(!storeQueue[storeWBIdx].committed); 581 582 DynInstPtr inst = storeQueue[storeWBIdx].inst; 583 584 Request *req = storeQueue[storeWBIdx].req; 585 storeQueue[storeWBIdx].committed = true; 586 587 assert(!inst->memData); 588 inst->memData = new uint8_t[64]; 589 memcpy(inst->memData, (uint8_t *)&storeQueue[storeWBIdx].data, 590 req->getSize()); 591 592 PacketPtr data_pkt = new Packet(req, Packet::WriteReq, Packet::Broadcast); 593 data_pkt->dataStatic(inst->memData); 594 595 LSQSenderState *state = new LSQSenderState; 596 state->isLoad = false; 597 state->idx = storeWBIdx; 598 state->inst = inst; 599 data_pkt->senderState = state; 600 601 DPRINTF(LSQUnit, "D-Cache: Writing back store idx:%i PC:%#x " 602 "to Addr:%#x, data:%#x [sn:%lli]\n", 603 storeWBIdx, storeQueue[storeWBIdx].inst->readPC(), 604 req->getPaddr(), *(inst->memData), 605 storeQueue[storeWBIdx].inst->seqNum); 606
|
| 607 // @todo: Remove this SC hack once the memory system handles it. 608 if (req->getFlags() & LOCKED) { 609 if (req->getFlags() & UNCACHEABLE) { 610 req->setScResult(2); 611 } else { 612 if (cpu->lockFlag) { 613 req->setScResult(1); 614 } else { 615 req->setScResult(0); 616 // Hack: Instantly complete this store. 617 completeDataAccess(data_pkt); 618 incrStIdx(storeWBIdx); 619 continue; 620 } 621 } 622 } else { 623 // Non-store conditionals do not need a writeback. 624 state->noWB = true; 625 } 626
|
618 if (!dcachePort->sendTiming(data_pkt)) { 619 // Need to handle becoming blocked on a store. 620 isStoreBlocked = true;
| 627 if (!dcachePort->sendTiming(data_pkt)) { 628 // Need to handle becoming blocked on a store. 629 isStoreBlocked = true;
|
621 } else { 622 if (isStalled() && 623 storeQueue[storeWBIdx].inst->seqNum == stallingStoreIsn) { 624 DPRINTF(LSQUnit, "Unstalling, stalling store [sn:%lli] " 625 "load idx:%i\n", 626 stallingStoreIsn, stallingLoadIdx); 627 stalled = false; 628 stallingStoreIsn = 0; 629 iewStage->replayMemInst(loadQueue[stallingLoadIdx]); 630 }
| |
631
| 630
|
632 if (!(req->getFlags() & LOCKED)) { 633 assert(!storeQueue[storeWBIdx].inst->isStoreConditional()); 634 // Non-store conditionals do not need a writeback. 635 state->noWB = true; 636 637 // The store is basically completed at this time. This 638 // only works so long as the checker doesn't try to 639 // verify the value in memory for stores. 640 storeQueue[storeWBIdx].inst->setCompleted(); 641 if (cpu->checker) { 642 cpu->checker->tick(storeQueue[storeWBIdx].inst); 643 } 644 } 645 646 if (data_pkt->result != Packet::Success) { 647 DPRINTF(LSQUnit,"D-Cache Write Miss on idx:%i!\n", 648 storeWBIdx); 649 650 DPRINTF(Activity, "Active st accessing mem miss [sn:%lli]\n", 651 storeQueue[storeWBIdx].inst->seqNum); 652 653 //mshrSeqNums.push_back(storeQueue[storeWBIdx].inst->seqNum); 654 655 //DPRINTF(LSQUnit, "Added MSHR. count = %i\n",mshrSeqNums.size()); 656 657 // @todo: Increment stat here. 658 } else { 659 DPRINTF(LSQUnit,"D-Cache: Write Hit on idx:%i !\n", 660 storeWBIdx); 661 662 DPRINTF(Activity, "Active st accessing mem hit [sn:%lli]\n", 663 storeQueue[storeWBIdx].inst->seqNum); 664 } 665 666 incrStIdx(storeWBIdx);
| 631 assert(sendingPkt == NULL); 632 sendingPkt = data_pkt; 633 } else { 634 storePostSend(data_pkt);
|
667 } 668 } 669 670 // Not sure this should set it to 0. 671 usedPorts = 0; 672 673 assert(stores >= 0 && storesToWB >= 0); 674} 675 676/*template <class Impl> 677void 678LSQUnit<Impl>::removeMSHR(InstSeqNum seqNum) 679{ 680 list<InstSeqNum>::iterator mshr_it = find(mshrSeqNums.begin(), 681 mshrSeqNums.end(), 682 seqNum); 683 684 if (mshr_it != mshrSeqNums.end()) { 685 mshrSeqNums.erase(mshr_it); 686 DPRINTF(LSQUnit, "Removing MSHR. count = %i\n",mshrSeqNums.size()); 687 } 688}*/ 689 690template <class Impl> 691void 692LSQUnit<Impl>::squash(const InstSeqNum &squashed_num) 693{ 694 DPRINTF(LSQUnit, "Squashing until [sn:%lli]!" 695 "(Loads:%i Stores:%i)\n", squashed_num, loads, stores); 696 697 int load_idx = loadTail; 698 decrLdIdx(load_idx); 699 700 while (loads != 0 && loadQueue[load_idx]->seqNum > squashed_num) { 701 DPRINTF(LSQUnit,"Load Instruction PC %#x squashed, " 702 "[sn:%lli]\n", 703 loadQueue[load_idx]->readPC(), 704 loadQueue[load_idx]->seqNum); 705 706 if (isStalled() && load_idx == stallingLoadIdx) { 707 stalled = false; 708 stallingStoreIsn = 0; 709 stallingLoadIdx = 0; 710 } 711 712 // Clear the smart pointer to make sure it is decremented. 713 loadQueue[load_idx]->squashed = true; 714 loadQueue[load_idx] = NULL; 715 --loads; 716 717 // Inefficient! 718 loadTail = load_idx; 719 720 decrLdIdx(load_idx); 721 } 722 723 if (isLoadBlocked) { 724 if (squashed_num < blockedLoadSeqNum) { 725 isLoadBlocked = false; 726 loadBlockedHandled = false; 727 blockedLoadSeqNum = 0; 728 } 729 } 730 731 int store_idx = storeTail; 732 decrStIdx(store_idx); 733 734 while (stores != 0 && 735 storeQueue[store_idx].inst->seqNum > squashed_num) { 736 // Instructions marked as can WB are already committed. 737 if (storeQueue[store_idx].canWB) { 738 break; 739 } 740 741 DPRINTF(LSQUnit,"Store Instruction PC %#x squashed, " 742 "idx:%i [sn:%lli]\n", 743 storeQueue[store_idx].inst->readPC(), 744 store_idx, storeQueue[store_idx].inst->seqNum); 745 746 // I don't think this can happen. It should have been cleared 747 // by the stalling load. 748 if (isStalled() && 749 storeQueue[store_idx].inst->seqNum == stallingStoreIsn) { 750 panic("Is stalled should have been cleared by stalling load!\n"); 751 stalled = false; 752 stallingStoreIsn = 0; 753 } 754 755 // Clear the smart pointer to make sure it is decremented. 756 storeQueue[store_idx].inst->squashed = true; 757 storeQueue[store_idx].inst = NULL; 758 storeQueue[store_idx].canWB = 0; 759 760 storeQueue[store_idx].req = NULL; 761 --stores; 762 763 // Inefficient! 764 storeTail = store_idx; 765 766 decrStIdx(store_idx); 767 } 768} 769 770template <class Impl> 771void
| 635 } 636 } 637 638 // Not sure this should set it to 0. 639 usedPorts = 0; 640 641 assert(stores >= 0 && storesToWB >= 0); 642} 643 644/*template <class Impl> 645void 646LSQUnit<Impl>::removeMSHR(InstSeqNum seqNum) 647{ 648 list<InstSeqNum>::iterator mshr_it = find(mshrSeqNums.begin(), 649 mshrSeqNums.end(), 650 seqNum); 651 652 if (mshr_it != mshrSeqNums.end()) { 653 mshrSeqNums.erase(mshr_it); 654 DPRINTF(LSQUnit, "Removing MSHR. count = %i\n",mshrSeqNums.size()); 655 } 656}*/ 657 658template <class Impl> 659void 660LSQUnit<Impl>::squash(const InstSeqNum &squashed_num) 661{ 662 DPRINTF(LSQUnit, "Squashing until [sn:%lli]!" 663 "(Loads:%i Stores:%i)\n", squashed_num, loads, stores); 664 665 int load_idx = loadTail; 666 decrLdIdx(load_idx); 667 668 while (loads != 0 && loadQueue[load_idx]->seqNum > squashed_num) { 669 DPRINTF(LSQUnit,"Load Instruction PC %#x squashed, " 670 "[sn:%lli]\n", 671 loadQueue[load_idx]->readPC(), 672 loadQueue[load_idx]->seqNum); 673 674 if (isStalled() && load_idx == stallingLoadIdx) { 675 stalled = false; 676 stallingStoreIsn = 0; 677 stallingLoadIdx = 0; 678 } 679 680 // Clear the smart pointer to make sure it is decremented. 681 loadQueue[load_idx]->squashed = true; 682 loadQueue[load_idx] = NULL; 683 --loads; 684 685 // Inefficient! 686 loadTail = load_idx; 687 688 decrLdIdx(load_idx); 689 } 690 691 if (isLoadBlocked) { 692 if (squashed_num < blockedLoadSeqNum) { 693 isLoadBlocked = false; 694 loadBlockedHandled = false; 695 blockedLoadSeqNum = 0; 696 } 697 } 698 699 int store_idx = storeTail; 700 decrStIdx(store_idx); 701 702 while (stores != 0 && 703 storeQueue[store_idx].inst->seqNum > squashed_num) { 704 // Instructions marked as can WB are already committed. 705 if (storeQueue[store_idx].canWB) { 706 break; 707 } 708 709 DPRINTF(LSQUnit,"Store Instruction PC %#x squashed, " 710 "idx:%i [sn:%lli]\n", 711 storeQueue[store_idx].inst->readPC(), 712 store_idx, storeQueue[store_idx].inst->seqNum); 713 714 // I don't think this can happen. It should have been cleared 715 // by the stalling load. 716 if (isStalled() && 717 storeQueue[store_idx].inst->seqNum == stallingStoreIsn) { 718 panic("Is stalled should have been cleared by stalling load!\n"); 719 stalled = false; 720 stallingStoreIsn = 0; 721 } 722 723 // Clear the smart pointer to make sure it is decremented. 724 storeQueue[store_idx].inst->squashed = true; 725 storeQueue[store_idx].inst = NULL; 726 storeQueue[store_idx].canWB = 0; 727 728 storeQueue[store_idx].req = NULL; 729 --stores; 730 731 // Inefficient! 732 storeTail = store_idx; 733 734 decrStIdx(store_idx); 735 } 736} 737 738template <class Impl> 739void
|
| 740LSQUnit<Impl>::storePostSend(Packet *pkt) 741{ 742 if (isStalled() && 743 storeQueue[storeWBIdx].inst->seqNum == stallingStoreIsn) { 744 DPRINTF(LSQUnit, "Unstalling, stalling store [sn:%lli] " 745 "load idx:%i\n", 746 stallingStoreIsn, stallingLoadIdx); 747 stalled = false; 748 stallingStoreIsn = 0; 749 iewStage->replayMemInst(loadQueue[stallingLoadIdx]); 750 } 751 752 if (!storeQueue[storeWBIdx].inst->isStoreConditional()) { 753 // The store is basically completed at this time. This 754 // only works so long as the checker doesn't try to 755 // verify the value in memory for stores. 756 storeQueue[storeWBIdx].inst->setCompleted(); 757 if (cpu->checker) { 758 cpu->checker->tick(storeQueue[storeWBIdx].inst); 759 } 760 } 761 762 if (pkt->result != Packet::Success) { 763 DPRINTF(LSQUnit,"D-Cache Write Miss on idx:%i!\n", 764 storeWBIdx); 765 766 DPRINTF(Activity, "Active st accessing mem miss [sn:%lli]\n", 767 storeQueue[storeWBIdx].inst->seqNum); 768 769 //mshrSeqNums.push_back(storeQueue[storeWBIdx].inst->seqNum); 770 771 //DPRINTF(LSQUnit, "Added MSHR. count = %i\n",mshrSeqNums.size()); 772 773 // @todo: Increment stat here. 774 } else { 775 DPRINTF(LSQUnit,"D-Cache: Write Hit on idx:%i !\n", 776 storeWBIdx); 777 778 DPRINTF(Activity, "Active st accessing mem hit [sn:%lli]\n", 779 storeQueue[storeWBIdx].inst->seqNum); 780 } 781 782 incrStIdx(storeWBIdx); 783} 784 785template <class Impl> 786void
|
772LSQUnit<Impl>::writeback(DynInstPtr &inst, PacketPtr pkt) 773{ 774 iewStage->wakeCPU(); 775 776 // Squashed instructions do not need to complete their access. 777 if (inst->isSquashed()) { 778 assert(!inst->isStore()); 779 return; 780 } 781 782 if (!inst->isExecuted()) { 783 inst->setExecuted(); 784 785 // Complete access to copy data to proper place. 786 inst->completeAcc(pkt); 787 } 788 789 // Need to insert instruction into queue to commit 790 iewStage->instToCommit(inst); 791 792 iewStage->activityThisCycle(); 793} 794 795template <class Impl> 796void 797LSQUnit<Impl>::completeStore(int store_idx) 798{ 799 assert(storeQueue[store_idx].inst); 800 storeQueue[store_idx].completed = true; 801 --storesToWB; 802 // A bit conservative because a store completion may not free up entries, 803 // but hopefully avoids two store completions in one cycle from making 804 // the CPU tick twice. 805 cpu->activityThisCycle(); 806 807 if (store_idx == storeHead) { 808 do { 809 incrStIdx(storeHead); 810 811 --stores; 812 } while (storeQueue[storeHead].completed && 813 storeHead != storeTail); 814 815 iewStage->updateLSQNextCycle = true; 816 } 817 818 DPRINTF(LSQUnit, "Completing store [sn:%lli], idx:%i, store head " 819 "idx:%i\n", 820 storeQueue[store_idx].inst->seqNum, store_idx, storeHead); 821 822 if (isStalled() && 823 storeQueue[store_idx].inst->seqNum == stallingStoreIsn) { 824 DPRINTF(LSQUnit, "Unstalling, stalling store [sn:%lli] " 825 "load idx:%i\n", 826 stallingStoreIsn, stallingLoadIdx); 827 stalled = false; 828 stallingStoreIsn = 0; 829 iewStage->replayMemInst(loadQueue[stallingLoadIdx]); 830 } 831 832 storeQueue[store_idx].inst->setCompleted(); 833 834 // Tell the checker we've completed this instruction. Some stores 835 // may get reported twice to the checker, but the checker can 836 // handle that case. 837 if (cpu->checker) { 838 cpu->checker->tick(storeQueue[store_idx].inst); 839 } 840} 841 842template <class Impl>
| 787LSQUnit<Impl>::writeback(DynInstPtr &inst, PacketPtr pkt) 788{ 789 iewStage->wakeCPU(); 790 791 // Squashed instructions do not need to complete their access. 792 if (inst->isSquashed()) { 793 assert(!inst->isStore()); 794 return; 795 } 796 797 if (!inst->isExecuted()) { 798 inst->setExecuted(); 799 800 // Complete access to copy data to proper place. 801 inst->completeAcc(pkt); 802 } 803 804 // Need to insert instruction into queue to commit 805 iewStage->instToCommit(inst); 806 807 iewStage->activityThisCycle(); 808} 809 810template <class Impl> 811void 812LSQUnit<Impl>::completeStore(int store_idx) 813{ 814 assert(storeQueue[store_idx].inst); 815 storeQueue[store_idx].completed = true; 816 --storesToWB; 817 // A bit conservative because a store completion may not free up entries, 818 // but hopefully avoids two store completions in one cycle from making 819 // the CPU tick twice. 820 cpu->activityThisCycle(); 821 822 if (store_idx == storeHead) { 823 do { 824 incrStIdx(storeHead); 825 826 --stores; 827 } while (storeQueue[storeHead].completed && 828 storeHead != storeTail); 829 830 iewStage->updateLSQNextCycle = true; 831 } 832 833 DPRINTF(LSQUnit, "Completing store [sn:%lli], idx:%i, store head " 834 "idx:%i\n", 835 storeQueue[store_idx].inst->seqNum, store_idx, storeHead); 836 837 if (isStalled() && 838 storeQueue[store_idx].inst->seqNum == stallingStoreIsn) { 839 DPRINTF(LSQUnit, "Unstalling, stalling store [sn:%lli] " 840 "load idx:%i\n", 841 stallingStoreIsn, stallingLoadIdx); 842 stalled = false; 843 stallingStoreIsn = 0; 844 iewStage->replayMemInst(loadQueue[stallingLoadIdx]); 845 } 846 847 storeQueue[store_idx].inst->setCompleted(); 848 849 // Tell the checker we've completed this instruction. Some stores 850 // may get reported twice to the checker, but the checker can 851 // handle that case. 852 if (cpu->checker) { 853 cpu->checker->tick(storeQueue[store_idx].inst); 854 } 855} 856 857template <class Impl>
|
| 858void 859LSQUnit<Impl>::recvRetry() 860{ 861 assert(sendingPkt != NULL); 862 863 if (isStoreBlocked) { 864 if (dcachePort->sendTiming(sendingPkt)) { 865 storePostSend(sendingPkt); 866 sendingPkt = NULL; 867 isStoreBlocked = false; 868 } else { 869 // Still blocked! 870 } 871 } else if (isLoadBlocked) { 872 DPRINTF(LSQUnit, "Loads squash themselves and all younger insts, " 873 "no need to resend packet.\n"); 874 } else { 875 DPRINTF(LSQUnit, "Retry received but LSQ is no longer blocked.\n"); 876 } 877} 878 879template <class Impl>
|
843inline void 844LSQUnit<Impl>::incrStIdx(int &store_idx) 845{ 846 if (++store_idx >= SQEntries) 847 store_idx = 0; 848} 849 850template <class Impl> 851inline void 852LSQUnit<Impl>::decrStIdx(int &store_idx) 853{ 854 if (--store_idx < 0) 855 store_idx += SQEntries; 856} 857 858template <class Impl> 859inline void 860LSQUnit<Impl>::incrLdIdx(int &load_idx) 861{ 862 if (++load_idx >= LQEntries) 863 load_idx = 0; 864} 865 866template <class Impl> 867inline void 868LSQUnit<Impl>::decrLdIdx(int &load_idx) 869{ 870 if (--load_idx < 0) 871 load_idx += LQEntries; 872} 873 874template <class Impl> 875void 876LSQUnit<Impl>::dumpInsts() 877{ 878 cprintf("Load store queue: Dumping instructions.\n"); 879 cprintf("Load queue size: %i\n", loads); 880 cprintf("Load queue: "); 881 882 int load_idx = loadHead; 883 884 while (load_idx != loadTail && loadQueue[load_idx]) { 885 cprintf("%#x ", loadQueue[load_idx]->readPC()); 886 887 incrLdIdx(load_idx); 888 } 889 890 cprintf("Store queue size: %i\n", stores); 891 cprintf("Store queue: "); 892 893 int store_idx = storeHead; 894 895 while (store_idx != storeTail && storeQueue[store_idx].inst) { 896 cprintf("%#x ", storeQueue[store_idx].inst->readPC()); 897 898 incrStIdx(store_idx); 899 } 900 901 cprintf("\n"); 902}
| 880inline void 881LSQUnit<Impl>::incrStIdx(int &store_idx) 882{ 883 if (++store_idx >= SQEntries) 884 store_idx = 0; 885} 886 887template <class Impl> 888inline void 889LSQUnit<Impl>::decrStIdx(int &store_idx) 890{ 891 if (--store_idx < 0) 892 store_idx += SQEntries; 893} 894 895template <class Impl> 896inline void 897LSQUnit<Impl>::incrLdIdx(int &load_idx) 898{ 899 if (++load_idx >= LQEntries) 900 load_idx = 0; 901} 902 903template <class Impl> 904inline void 905LSQUnit<Impl>::decrLdIdx(int &load_idx) 906{ 907 if (--load_idx < 0) 908 load_idx += LQEntries; 909} 910 911template <class Impl> 912void 913LSQUnit<Impl>::dumpInsts() 914{ 915 cprintf("Load store queue: Dumping instructions.\n"); 916 cprintf("Load queue size: %i\n", loads); 917 cprintf("Load queue: "); 918 919 int load_idx = loadHead; 920 921 while (load_idx != loadTail && loadQueue[load_idx]) { 922 cprintf("%#x ", loadQueue[load_idx]->readPC()); 923 924 incrLdIdx(load_idx); 925 } 926 927 cprintf("Store queue size: %i\n", stores); 928 cprintf("Store queue: "); 929 930 int store_idx = storeHead; 931 932 while (store_idx != storeTail && storeQueue[store_idx].inst) { 933 cprintf("%#x ", storeQueue[store_idx].inst->readPC()); 934 935 incrStIdx(store_idx); 936 } 937 938 cprintf("\n"); 939}
|