lsq_impl.hh revision 13472:7ceacede4f1e
1/* 2 * Copyright (c) 2011-2012, 2014 ARM Limited 3 * Copyright (c) 2013 Advanced Micro Devices, Inc. 4 * All rights reserved 5 * 6 * The license below extends only to copyright in the software and shall 7 * not be construed as granting a license to any other intellectual 8 * property including but not limited to intellectual property relating 9 * to a hardware implementation of the functionality of the software 10 * licensed hereunder. You may use the software subject to the license 11 * terms below provided that you ensure that this notice is replicated 12 * unmodified and in its entirety in all distributions of the software, 13 * modified or unmodified, in source code or in binary form. 14 * 15 * Copyright (c) 2005-2006 The Regents of The University of Michigan 16 * All rights reserved. 17 * 18 * Redistribution and use in source and binary forms, with or without 19 * modification, are permitted provided that the following conditions are 20 * met: redistributions of source code must retain the above copyright 21 * notice, this list of conditions and the following disclaimer; 22 * redistributions in binary form must reproduce the above copyright 23 * notice, this list of conditions and the following disclaimer in the 24 * documentation and/or other materials provided with the distribution; 25 * neither the name of the copyright holders nor the names of its 26 * contributors may be used to endorse or promote products derived from 27 * this software without specific prior written permission. 28 * 29 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS 30 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT 31 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR 32 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT 33 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, 34 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT 35 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 36 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 37 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 38 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE 39 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 40 * 41 * Authors: Korey Sewell 42 */ 43 44#ifndef __CPU_O3_LSQ_IMPL_HH__ 45#define __CPU_O3_LSQ_IMPL_HH__ 46 47#include <algorithm> 48#include <list> 49#include <string> 50 51#include "base/logging.hh" 52#include "cpu/o3/lsq.hh" 53#include "debug/Drain.hh" 54#include "debug/Fetch.hh" 55#include "debug/LSQ.hh" 56#include "debug/Writeback.hh" 57#include "params/DerivO3CPU.hh" 58 59using namespace std; 60 61template <class Impl> 62LSQ<Impl>::LSQ(O3CPU *cpu_ptr, IEW *iew_ptr, DerivO3CPUParams *params) 63 : cpu(cpu_ptr), iewStage(iew_ptr), 64 lsqPolicy(readLSQPolicy(params->smtLSQPolicy)), 65 LQEntries(params->LQEntries), 66 SQEntries(params->SQEntries), 67 maxLQEntries(maxLSQAllocation(lsqPolicy, LQEntries, params->numThreads, 68 params->smtLSQThreshold)), 69 maxSQEntries(maxLSQAllocation(lsqPolicy, SQEntries, params->numThreads, 70 params->smtLSQThreshold)), 71 numThreads(params->numThreads) 72{ 73 assert(numThreads > 0 && numThreads <= Impl::MaxThreads); 74 75 //**********************************************/ 76 //************ Handle SMT Parameters ***********/ 77 //**********************************************/ 78 79 //Figure out fetch policy 80 if (lsqPolicy == Dynamic) { 81 DPRINTF(LSQ, "LSQ sharing policy set to Dynamic\n"); 82 } else if (lsqPolicy == Partitioned) { 83 DPRINTF(Fetch, "LSQ sharing policy set to Partitioned: " 84 "%i entries per LQ | %i entries per SQ\n", 85 maxLQEntries,maxSQEntries); 86 } else if (lsqPolicy == Threshold) { 87 88 assert(params->smtLSQThreshold > LQEntries); 89 assert(params->smtLSQThreshold > SQEntries); 90 91 DPRINTF(LSQ, "LSQ sharing policy set to Threshold: " 92 "%i entries per LQ | %i entries per SQ\n", 93 maxLQEntries,maxSQEntries); 94 } else { 95 panic("Invalid LSQ sharing policy. Options are: Dynamic, " 96 "Partitioned, Threshold"); 97 } 98 99 thread.reserve(numThreads); 100 for (ThreadID tid = 0; tid < numThreads; tid++) { 101 thread.emplace_back(maxLQEntries, maxSQEntries); 102 thread[tid].init(cpu, iew_ptr, params, this, tid); 103 thread[tid].setDcachePort(&cpu_ptr->getDataPort()); 104 } 105} 106 107 108template<class Impl> 109std::string 110LSQ<Impl>::name() const 111{ 112 return iewStage->name() + ".lsq"; 113} 114 115template<class Impl> 116void 117LSQ<Impl>::regStats() 118{ 119 //Initialize LSQs 120 for (ThreadID tid = 0; tid < numThreads; tid++) { 121 thread[tid].regStats(); 122 } 123} 124 125template<class Impl> 126void 127LSQ<Impl>::setActiveThreads(list<ThreadID> *at_ptr) 128{ 129 activeThreads = at_ptr; 130 assert(activeThreads != 0); 131} 132 133template <class Impl> 134void 135LSQ<Impl>::drainSanityCheck() const 136{ 137 assert(isDrained()); 138 139 for (ThreadID tid = 0; tid < numThreads; tid++) 140 thread[tid].drainSanityCheck(); 141} 142 143template <class Impl> 144bool 145LSQ<Impl>::isDrained() const 146{ 147 bool drained(true); 148 149 if (!lqEmpty()) { 150 DPRINTF(Drain, "Not drained, LQ not empty.\n"); 151 drained = false; 152 } 153 154 if (!sqEmpty()) { 155 DPRINTF(Drain, "Not drained, SQ not empty.\n"); 156 drained = false; 157 } 158 159 return drained; 160} 161 162template <class Impl> 163void 164LSQ<Impl>::takeOverFrom() 165{ 166 for (ThreadID tid = 0; tid < numThreads; tid++) { 167 thread[tid].takeOverFrom(); 168 } 169} 170 171template <class Impl> 172int 173LSQ<Impl>::entryAmount(ThreadID num_threads) 174{ 175 if (lsqPolicy == Partitioned) { 176 return LQEntries / num_threads; 177 } else { 178 return 0; 179 } 180} 181 182template <class Impl> 183void 184LSQ<Impl>::resetEntries() 185{ 186 if (lsqPolicy != Dynamic || numThreads > 1) { 187 int active_threads = activeThreads->size(); 188 189 int maxEntries; 190 191 if (lsqPolicy == Partitioned) { 192 maxEntries = LQEntries / active_threads; 193 } else if (lsqPolicy == Threshold && active_threads == 1) { 194 maxEntries = LQEntries; 195 } else { 196 maxEntries = LQEntries; 197 } 198 199 list<ThreadID>::iterator threads = activeThreads->begin(); 200 list<ThreadID>::iterator end = activeThreads->end(); 201 202 while (threads != end) { 203 ThreadID tid = *threads++; 204 205 resizeEntries(maxEntries, tid); 206 } 207 } 208} 209 210template<class Impl> 211void 212LSQ<Impl>::removeEntries(ThreadID tid) 213{ 214 thread[tid].clearLQ(); 215 thread[tid].clearSQ(); 216} 217 218template<class Impl> 219void 220LSQ<Impl>::resizeEntries(unsigned size, ThreadID tid) 221{ 222 thread[tid].resizeLQ(size); 223 thread[tid].resizeSQ(size); 224} 225 226template<class Impl> 227void 228LSQ<Impl>::tick() 229{ 230 list<ThreadID>::iterator threads = activeThreads->begin(); 231 list<ThreadID>::iterator end = activeThreads->end(); 232 233 while (threads != end) { 234 ThreadID tid = *threads++; 235 236 thread[tid].tick(); 237 } 238} 239 240template<class Impl> 241void 242LSQ<Impl>::insertLoad(const DynInstPtr &load_inst) 243{ 244 ThreadID tid = load_inst->threadNumber; 245 246 thread[tid].insertLoad(load_inst); 247} 248 249template<class Impl> 250void 251LSQ<Impl>::insertStore(const DynInstPtr &store_inst) 252{ 253 ThreadID tid = store_inst->threadNumber; 254 255 thread[tid].insertStore(store_inst); 256} 257 258template<class Impl> 259Fault 260LSQ<Impl>::executeLoad(const DynInstPtr &inst) 261{ 262 ThreadID tid = inst->threadNumber; 263 264 return thread[tid].executeLoad(inst); 265} 266 267template<class Impl> 268Fault 269LSQ<Impl>::executeStore(const DynInstPtr &inst) 270{ 271 ThreadID tid = inst->threadNumber; 272 273 return thread[tid].executeStore(inst); 274} 275 276template<class Impl> 277void 278LSQ<Impl>::writebackStores() 279{ 280 list<ThreadID>::iterator threads = activeThreads->begin(); 281 list<ThreadID>::iterator end = activeThreads->end(); 282 283 while (threads != end) { 284 ThreadID tid = *threads++; 285 286 if (numStoresToWB(tid) > 0) { 287 DPRINTF(Writeback,"[tid:%i] Writing back stores. %i stores " 288 "available for Writeback.\n", tid, numStoresToWB(tid)); 289 } 290 291 thread[tid].writebackStores(); 292 } 293} 294 295template<class Impl> 296bool 297LSQ<Impl>::violation() 298{ 299 /* Answers: Does Anybody Have a Violation?*/ 300 list<ThreadID>::iterator threads = activeThreads->begin(); 301 list<ThreadID>::iterator end = activeThreads->end(); 302 303 while (threads != end) { 304 ThreadID tid = *threads++; 305 306 if (thread[tid].violation()) 307 return true; 308 } 309 310 return false; 311} 312 313template <class Impl> 314void 315LSQ<Impl>::recvReqRetry() 316{ 317 iewStage->cacheUnblocked(); 318 319 for (ThreadID tid : *activeThreads) { 320 thread[tid].recvRetry(); 321 } 322} 323 324template <class Impl> 325bool 326LSQ<Impl>::recvTimingResp(PacketPtr pkt) 327{ 328 if (pkt->isError()) 329 DPRINTF(LSQ, "Got error packet back for address: %#X\n", 330 pkt->getAddr()); 331 332 thread[cpu->contextToThread(pkt->req->contextId())] 333 .completeDataAccess(pkt); 334 335 if (pkt->isInvalidate()) { 336 // This response also contains an invalidate; e.g. this can be the case 337 // if cmd is ReadRespWithInvalidate. 338 // 339 // The calling order between completeDataAccess and checkSnoop matters. 340 // By calling checkSnoop after completeDataAccess, we ensure that the 341 // fault set by checkSnoop is not lost. Calling writeback (more 342 // specifically inst->completeAcc) in completeDataAccess overwrites 343 // fault, and in case this instruction requires squashing (as 344 // determined by checkSnoop), the ReExec fault set by checkSnoop would 345 // be lost otherwise. 346 347 DPRINTF(LSQ, "received invalidation with response for addr:%#x\n", 348 pkt->getAddr()); 349 350 for (ThreadID tid = 0; tid < numThreads; tid++) { 351 thread[tid].checkSnoop(pkt); 352 } 353 } 354 355 delete pkt; 356 return true; 357} 358 359template <class Impl> 360void 361LSQ<Impl>::recvTimingSnoopReq(PacketPtr pkt) 362{ 363 DPRINTF(LSQ, "received pkt for addr:%#x %s\n", pkt->getAddr(), 364 pkt->cmdString()); 365 366 // must be a snoop 367 if (pkt->isInvalidate()) { 368 DPRINTF(LSQ, "received invalidation for addr:%#x\n", 369 pkt->getAddr()); 370 for (ThreadID tid = 0; tid < numThreads; tid++) { 371 thread[tid].checkSnoop(pkt); 372 } 373 } 374} 375 376template<class Impl> 377int 378LSQ<Impl>::getCount() 379{ 380 unsigned total = 0; 381 382 list<ThreadID>::iterator threads = activeThreads->begin(); 383 list<ThreadID>::iterator end = activeThreads->end(); 384 385 while (threads != end) { 386 ThreadID tid = *threads++; 387 388 total += getCount(tid); 389 } 390 391 return total; 392} 393 394template<class Impl> 395int 396LSQ<Impl>::numLoads() 397{ 398 unsigned total = 0; 399 400 list<ThreadID>::iterator threads = activeThreads->begin(); 401 list<ThreadID>::iterator end = activeThreads->end(); 402 403 while (threads != end) { 404 ThreadID tid = *threads++; 405 406 total += numLoads(tid); 407 } 408 409 return total; 410} 411 412template<class Impl> 413int 414LSQ<Impl>::numStores() 415{ 416 unsigned total = 0; 417 418 list<ThreadID>::iterator threads = activeThreads->begin(); 419 list<ThreadID>::iterator end = activeThreads->end(); 420 421 while (threads != end) { 422 ThreadID tid = *threads++; 423 424 total += thread[tid].numStores(); 425 } 426 427 return total; 428} 429 430template<class Impl> 431unsigned 432LSQ<Impl>::numFreeLoadEntries() 433{ 434 unsigned total = 0; 435 436 list<ThreadID>::iterator threads = activeThreads->begin(); 437 list<ThreadID>::iterator end = activeThreads->end(); 438 439 while (threads != end) { 440 ThreadID tid = *threads++; 441 442 total += thread[tid].numFreeLoadEntries(); 443 } 444 445 return total; 446} 447 448template<class Impl> 449unsigned 450LSQ<Impl>::numFreeStoreEntries() 451{ 452 unsigned total = 0; 453 454 list<ThreadID>::iterator threads = activeThreads->begin(); 455 list<ThreadID>::iterator end = activeThreads->end(); 456 457 while (threads != end) { 458 ThreadID tid = *threads++; 459 460 total += thread[tid].numFreeStoreEntries(); 461 } 462 463 return total; 464} 465 466template<class Impl> 467unsigned 468LSQ<Impl>::numFreeLoadEntries(ThreadID tid) 469{ 470 return thread[tid].numFreeLoadEntries(); 471} 472 473template<class Impl> 474unsigned 475LSQ<Impl>::numFreeStoreEntries(ThreadID tid) 476{ 477 return thread[tid].numFreeStoreEntries(); 478} 479 480template<class Impl> 481bool 482LSQ<Impl>::isFull() 483{ 484 list<ThreadID>::iterator threads = activeThreads->begin(); 485 list<ThreadID>::iterator end = activeThreads->end(); 486 487 while (threads != end) { 488 ThreadID tid = *threads++; 489 490 if (!(thread[tid].lqFull() || thread[tid].sqFull())) 491 return false; 492 } 493 494 return true; 495} 496 497template<class Impl> 498bool 499LSQ<Impl>::isFull(ThreadID tid) 500{ 501 //@todo: Change to Calculate All Entries for 502 //Dynamic Policy 503 if (lsqPolicy == Dynamic) 504 return isFull(); 505 else 506 return thread[tid].lqFull() || thread[tid].sqFull(); 507} 508 509template<class Impl> 510bool 511LSQ<Impl>::isEmpty() const 512{ 513 return lqEmpty() && sqEmpty(); 514} 515 516template<class Impl> 517bool 518LSQ<Impl>::lqEmpty() const 519{ 520 list<ThreadID>::const_iterator threads = activeThreads->begin(); 521 list<ThreadID>::const_iterator end = activeThreads->end(); 522 523 while (threads != end) { 524 ThreadID tid = *threads++; 525 526 if (!thread[tid].lqEmpty()) 527 return false; 528 } 529 530 return true; 531} 532 533template<class Impl> 534bool 535LSQ<Impl>::sqEmpty() const 536{ 537 list<ThreadID>::const_iterator threads = activeThreads->begin(); 538 list<ThreadID>::const_iterator end = activeThreads->end(); 539 540 while (threads != end) { 541 ThreadID tid = *threads++; 542 543 if (!thread[tid].sqEmpty()) 544 return false; 545 } 546 547 return true; 548} 549 550template<class Impl> 551bool 552LSQ<Impl>::lqFull() 553{ 554 list<ThreadID>::iterator threads = activeThreads->begin(); 555 list<ThreadID>::iterator end = activeThreads->end(); 556 557 while (threads != end) { 558 ThreadID tid = *threads++; 559 560 if (!thread[tid].lqFull()) 561 return false; 562 } 563 564 return true; 565} 566 567template<class Impl> 568bool 569LSQ<Impl>::lqFull(ThreadID tid) 570{ 571 //@todo: Change to Calculate All Entries for 572 //Dynamic Policy 573 if (lsqPolicy == Dynamic) 574 return lqFull(); 575 else 576 return thread[tid].lqFull(); 577} 578 579template<class Impl> 580bool 581LSQ<Impl>::sqFull() 582{ 583 list<ThreadID>::iterator threads = activeThreads->begin(); 584 list<ThreadID>::iterator end = activeThreads->end(); 585 586 while (threads != end) { 587 ThreadID tid = *threads++; 588 589 if (!sqFull(tid)) 590 return false; 591 } 592 593 return true; 594} 595 596template<class Impl> 597bool 598LSQ<Impl>::sqFull(ThreadID tid) 599{ 600 //@todo: Change to Calculate All Entries for 601 //Dynamic Policy 602 if (lsqPolicy == Dynamic) 603 return sqFull(); 604 else 605 return thread[tid].sqFull(); 606} 607 608template<class Impl> 609bool 610LSQ<Impl>::isStalled() 611{ 612 list<ThreadID>::iterator threads = activeThreads->begin(); 613 list<ThreadID>::iterator end = activeThreads->end(); 614 615 while (threads != end) { 616 ThreadID tid = *threads++; 617 618 if (!thread[tid].isStalled()) 619 return false; 620 } 621 622 return true; 623} 624 625template<class Impl> 626bool 627LSQ<Impl>::isStalled(ThreadID tid) 628{ 629 if (lsqPolicy == Dynamic) 630 return isStalled(); 631 else 632 return thread[tid].isStalled(); 633} 634 635template<class Impl> 636bool 637LSQ<Impl>::hasStoresToWB() 638{ 639 list<ThreadID>::iterator threads = activeThreads->begin(); 640 list<ThreadID>::iterator end = activeThreads->end(); 641 642 while (threads != end) { 643 ThreadID tid = *threads++; 644 645 if (hasStoresToWB(tid)) 646 return true; 647 } 648 649 return false; 650} 651 652template<class Impl> 653bool 654LSQ<Impl>::willWB() 655{ 656 list<ThreadID>::iterator threads = activeThreads->begin(); 657 list<ThreadID>::iterator end = activeThreads->end(); 658 659 while (threads != end) { 660 ThreadID tid = *threads++; 661 662 if (willWB(tid)) 663 return true; 664 } 665 666 return false; 667} 668 669template<class Impl> 670void 671LSQ<Impl>::dumpInsts() const 672{ 673 list<ThreadID>::const_iterator threads = activeThreads->begin(); 674 list<ThreadID>::const_iterator end = activeThreads->end(); 675 676 while (threads != end) { 677 ThreadID tid = *threads++; 678 679 thread[tid].dumpInsts(); 680 } 681} 682 683#endif//__CPU_O3_LSQ_IMPL_HH__ 684