mshr_queue.cc revision 10509
12810SN/A/* 29725Sandreas.hansson@arm.com * Copyright (c) 2012-2013 ARM Limited 39347SAndreas.Sandberg@arm.com * All rights reserved. 49347SAndreas.Sandberg@arm.com * 59347SAndreas.Sandberg@arm.com * The license below extends only to copyright in the software and shall 69347SAndreas.Sandberg@arm.com * not be construed as granting a license to any other intellectual 79347SAndreas.Sandberg@arm.com * property including but not limited to intellectual property relating 89347SAndreas.Sandberg@arm.com * to a hardware implementation of the functionality of the software 99347SAndreas.Sandberg@arm.com * licensed hereunder. You may use the software subject to the license 109347SAndreas.Sandberg@arm.com * terms below provided that you ensure that this notice is replicated 119347SAndreas.Sandberg@arm.com * unmodified and in its entirety in all distributions of the software, 129347SAndreas.Sandberg@arm.com * modified or unmodified, in source code or in binary form. 139347SAndreas.Sandberg@arm.com * 142810SN/A * Copyright (c) 2003-2005 The Regents of The University of Michigan 152810SN/A * All rights reserved. 162810SN/A * 172810SN/A * Redistribution and use in source and binary forms, with or without 182810SN/A * modification, are permitted provided that the following conditions are 192810SN/A * met: redistributions of source code must retain the above copyright 202810SN/A * notice, this list of conditions and the following disclaimer; 212810SN/A * redistributions in binary form must reproduce the above copyright 222810SN/A * notice, this list of conditions and the following disclaimer in the 232810SN/A * documentation and/or other materials provided with the distribution; 242810SN/A * neither the name of the copyright holders nor the names of its 252810SN/A * contributors may be used to endorse or promote products derived from 262810SN/A * this software without specific prior written permission. 272810SN/A * 282810SN/A * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS 292810SN/A * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT 302810SN/A * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR 312810SN/A * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT 322810SN/A * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, 332810SN/A * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT 342810SN/A * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 352810SN/A * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 362810SN/A * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 372810SN/A * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE 382810SN/A * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 392810SN/A * 402810SN/A * Authors: Erik Hallnor 419347SAndreas.Sandberg@arm.com * Andreas Sandberg 422810SN/A */ 432810SN/A 442810SN/A/** @file 454626SN/A * Definition of MSHRQueue class functions. 462810SN/A */ 472810SN/A 4810509SAli.Saidi@ARM.com#include "base/trace.hh" 495338Sstever@gmail.com#include "mem/cache/mshr_queue.hh" 5010509SAli.Saidi@ARM.com#include "debug/Drain.hh" 512810SN/A 522810SN/Ausing namespace std; 532810SN/A 545314SN/AMSHRQueue::MSHRQueue(const std::string &_label, 555314SN/A int num_entries, int reserve, int _index) 569725Sandreas.hansson@arm.com : label(_label), numEntries(num_entries + reserve - 1), 579725Sandreas.hansson@arm.com numReserve(reserve), registers(numEntries), 589725Sandreas.hansson@arm.com drainManager(NULL), allocated(0), inServiceEntries(0), index(_index) 592810SN/A{ 604626SN/A for (int i = 0; i < numEntries; ++i) { 614626SN/A registers[i].queue = this; 622810SN/A freeList.push_back(®isters[i]); 632810SN/A } 642810SN/A} 652810SN/A 664626SN/AMSHR * 6710028SGiacomo.Gabrielli@arm.comMSHRQueue::findMatch(Addr addr, bool is_secure) const 682810SN/A{ 692810SN/A MSHR::ConstIterator i = allocatedList.begin(); 702810SN/A MSHR::ConstIterator end = allocatedList.end(); 712810SN/A for (; i != end; ++i) { 722810SN/A MSHR *mshr = *i; 7310028SGiacomo.Gabrielli@arm.com if (mshr->addr == addr && mshr->isSecure == is_secure) { 742810SN/A return mshr; 752810SN/A } 762810SN/A } 772810SN/A return NULL; 782810SN/A} 792810SN/A 802810SN/Abool 8110028SGiacomo.Gabrielli@arm.comMSHRQueue::findMatches(Addr addr, bool is_secure, vector<MSHR*>& matches) const 822810SN/A{ 832810SN/A // Need an empty vector 842810SN/A assert(matches.empty()); 852810SN/A bool retval = false; 862810SN/A MSHR::ConstIterator i = allocatedList.begin(); 872810SN/A MSHR::ConstIterator end = allocatedList.end(); 882810SN/A for (; i != end; ++i) { 892810SN/A MSHR *mshr = *i; 9010028SGiacomo.Gabrielli@arm.com if (mshr->addr == addr && mshr->isSecure == is_secure) { 912810SN/A retval = true; 922810SN/A matches.push_back(mshr); 932810SN/A } 942810SN/A } 952810SN/A return retval; 964920SN/A} 972810SN/A 984920SN/A 994920SN/Abool 1004920SN/AMSHRQueue::checkFunctional(PacketPtr pkt, Addr blk_addr) 1014920SN/A{ 1025314SN/A pkt->pushLabel(label); 1034920SN/A MSHR::ConstIterator i = allocatedList.begin(); 1044920SN/A MSHR::ConstIterator end = allocatedList.end(); 1054920SN/A for (; i != end; ++i) { 1064920SN/A MSHR *mshr = *i; 1074920SN/A if (mshr->addr == blk_addr && mshr->checkFunctional(pkt)) { 1085314SN/A pkt->popLabel(); 1094920SN/A return true; 1104920SN/A } 1114920SN/A } 1125314SN/A pkt->popLabel(); 1134920SN/A return false; 1142810SN/A} 1152810SN/A 1164920SN/A 1174626SN/AMSHR * 11810028SGiacomo.Gabrielli@arm.comMSHRQueue::findPending(Addr addr, int size, bool is_secure) const 1192810SN/A{ 1204666SN/A MSHR::ConstIterator i = readyList.begin(); 1214666SN/A MSHR::ConstIterator end = readyList.end(); 1222810SN/A for (; i != end; ++i) { 1232810SN/A MSHR *mshr = *i; 12410028SGiacomo.Gabrielli@arm.com if (mshr->isSecure == is_secure) { 12510028SGiacomo.Gabrielli@arm.com if (mshr->addr < addr) { 12610028SGiacomo.Gabrielli@arm.com if (mshr->addr + mshr->size > addr) 12710028SGiacomo.Gabrielli@arm.com return mshr; 12810028SGiacomo.Gabrielli@arm.com } else { 12910028SGiacomo.Gabrielli@arm.com if (addr + size > mshr->addr) 13010028SGiacomo.Gabrielli@arm.com return mshr; 1312810SN/A } 1322810SN/A } 1332810SN/A } 1342810SN/A return NULL; 1352810SN/A} 1362810SN/A 1374666SN/A 1384666SN/AMSHR::Iterator 1394666SN/AMSHRQueue::addToReadyList(MSHR *mshr) 1404666SN/A{ 1414871SN/A if (readyList.empty() || readyList.back()->readyTime <= mshr->readyTime) { 1424666SN/A return readyList.insert(readyList.end(), mshr); 1434666SN/A } 1444666SN/A 1454666SN/A MSHR::Iterator i = readyList.begin(); 1464666SN/A MSHR::Iterator end = readyList.end(); 1474666SN/A for (; i != end; ++i) { 1484871SN/A if ((*i)->readyTime > mshr->readyTime) { 1494666SN/A return readyList.insert(i, mshr); 1504666SN/A } 1514666SN/A } 1524666SN/A assert(false); 1534904SN/A return end; // keep stupid compilers happy 1544666SN/A} 1554666SN/A 1564666SN/A 1574626SN/AMSHR * 1584666SN/AMSHRQueue::allocate(Addr addr, int size, PacketPtr &pkt, 1594666SN/A Tick when, Counter order) 1602810SN/A{ 1613149SN/A assert(!freeList.empty()); 1622810SN/A MSHR *mshr = freeList.front(); 1632810SN/A assert(mshr->getNumTargets() == 0); 1642810SN/A freeList.pop_front(); 1652810SN/A 1664666SN/A mshr->allocate(addr, size, pkt, when, order); 1672810SN/A mshr->allocIter = allocatedList.insert(allocatedList.end(), mshr); 1684666SN/A mshr->readyIter = addToReadyList(mshr); 1692810SN/A 1702810SN/A allocated += 1; 1712810SN/A return mshr; 1722810SN/A} 1732810SN/A 1742810SN/A 1752810SN/Avoid 1764626SN/AMSHRQueue::deallocate(MSHR *mshr) 1772810SN/A{ 1782810SN/A deallocateOne(mshr); 1792810SN/A} 1802810SN/A 1812810SN/AMSHR::Iterator 1824626SN/AMSHRQueue::deallocateOne(MSHR *mshr) 1832810SN/A{ 1842810SN/A MSHR::Iterator retval = allocatedList.erase(mshr->allocIter); 1852810SN/A freeList.push_front(mshr); 1862810SN/A allocated--; 1872810SN/A if (mshr->inService) { 1884626SN/A inServiceEntries--; 1892810SN/A } else { 1904666SN/A readyList.erase(mshr->readyIter); 1912810SN/A } 1922810SN/A mshr->deallocate(); 1939347SAndreas.Sandberg@arm.com if (drainManager && allocated == 0) { 1949347SAndreas.Sandberg@arm.com // Notify the drain manager that we have completed draining if 1959347SAndreas.Sandberg@arm.com // there are no other outstanding requests in this MSHR queue. 19610509SAli.Saidi@ARM.com DPRINTF(Drain, "MSHRQueue now empty, signalling drained\n"); 1979347SAndreas.Sandberg@arm.com drainManager->signalDrainDone(); 1989347SAndreas.Sandberg@arm.com drainManager = NULL; 1999347SAndreas.Sandberg@arm.com setDrainState(Drainable::Drained); 2009347SAndreas.Sandberg@arm.com } 2012810SN/A return retval; 2022810SN/A} 2032810SN/A 2042810SN/Avoid 2052810SN/AMSHRQueue::moveToFront(MSHR *mshr) 2062810SN/A{ 2072810SN/A if (!mshr->inService) { 2082810SN/A assert(mshr == *(mshr->readyIter)); 2094666SN/A readyList.erase(mshr->readyIter); 2104666SN/A mshr->readyIter = readyList.insert(readyList.begin(), mshr); 2112810SN/A } 2122810SN/A} 2132810SN/A 2142810SN/Avoid 2157667Ssteve.reinhardt@amd.comMSHRQueue::markInService(MSHR *mshr, PacketPtr pkt) 2162810SN/A{ 2177667Ssteve.reinhardt@amd.com if (mshr->markInService(pkt)) { 2182810SN/A deallocate(mshr); 2194908SN/A } else { 2204908SN/A readyList.erase(mshr->readyIter); 2214908SN/A inServiceEntries += 1; 2222810SN/A } 2232810SN/A} 2242810SN/A 2252810SN/Avoid 2264626SN/AMSHRQueue::markPending(MSHR *mshr) 2272810SN/A{ 2284666SN/A assert(mshr->inService); 2292810SN/A mshr->inService = false; 2304626SN/A --inServiceEntries; 2312810SN/A /** 2322810SN/A * @ todo might want to add rerequests to front of pending list for 2332810SN/A * performance. 2342810SN/A */ 2354666SN/A mshr->readyIter = addToReadyList(mshr); 2362810SN/A} 2372810SN/A 23810192Smitch.hayenga@arm.combool 23910192Smitch.hayenga@arm.comMSHRQueue::forceDeallocateTarget(MSHR *mshr) 24010192Smitch.hayenga@arm.com{ 24110192Smitch.hayenga@arm.com bool was_full = isFull(); 24210192Smitch.hayenga@arm.com assert(mshr->hasTargets()); 24310192Smitch.hayenga@arm.com // Pop the prefetch off of the target list 24410192Smitch.hayenga@arm.com mshr->popTarget(); 24510192Smitch.hayenga@arm.com // Delete mshr if no remaining targets 24610192Smitch.hayenga@arm.com if (!mshr->hasTargets() && !mshr->promoteDeferredTargets()) { 24710192Smitch.hayenga@arm.com deallocateOne(mshr); 24810192Smitch.hayenga@arm.com } 24910192Smitch.hayenga@arm.com 25010192Smitch.hayenga@arm.com // Notify if MSHR queue no longer full 25110192Smitch.hayenga@arm.com return was_full && !isFull(); 25210192Smitch.hayenga@arm.com} 25310192Smitch.hayenga@arm.com 2542810SN/Avoid 2552813SN/AMSHRQueue::squash(int threadNum) 2562810SN/A{ 2572810SN/A MSHR::Iterator i = allocatedList.begin(); 2582810SN/A MSHR::Iterator end = allocatedList.end(); 2592810SN/A for (; i != end;) { 2602810SN/A MSHR *mshr = *i; 2612813SN/A if (mshr->threadNum == threadNum) { 2622810SN/A while (mshr->hasTargets()) { 2632810SN/A mshr->popTarget(); 2645715Shsul@eecs.umich.edu assert(0/*target->req->threadId()*/ == threadNum); 2652810SN/A } 2662810SN/A assert(!mshr->hasTargets()); 2679725Sandreas.hansson@arm.com assert(mshr->getNumTargets()==0); 2682810SN/A if (!mshr->inService) { 2692810SN/A i = deallocateOne(mshr); 2702810SN/A } else { 2712810SN/A //mshr->pkt->flags &= ~CACHE_LINE_FILL; 2722810SN/A ++i; 2732810SN/A } 2742810SN/A } else { 2752810SN/A ++i; 2762810SN/A } 2772810SN/A } 2782810SN/A} 2799347SAndreas.Sandberg@arm.com 2809347SAndreas.Sandberg@arm.comunsigned int 2819347SAndreas.Sandberg@arm.comMSHRQueue::drain(DrainManager *dm) 2829347SAndreas.Sandberg@arm.com{ 2839347SAndreas.Sandberg@arm.com if (allocated == 0) { 2849347SAndreas.Sandberg@arm.com setDrainState(Drainable::Drained); 2859347SAndreas.Sandberg@arm.com return 0; 2869347SAndreas.Sandberg@arm.com } else { 2879347SAndreas.Sandberg@arm.com drainManager = dm; 2889347SAndreas.Sandberg@arm.com setDrainState(Drainable::Draining); 2899347SAndreas.Sandberg@arm.com return 1; 2909347SAndreas.Sandberg@arm.com } 2919347SAndreas.Sandberg@arm.com} 292