mshr_queue.cc revision 4626
12810Srdreslin@umich.edu/* 211375Sandreas.hansson@arm.com * Copyright (c) 2003-2005 The Regents of The University of Michigan 311051Sandreas.hansson@arm.com * All rights reserved. 411051Sandreas.hansson@arm.com * 511051Sandreas.hansson@arm.com * Redistribution and use in source and binary forms, with or without 611051Sandreas.hansson@arm.com * modification, are permitted provided that the following conditions are 711051Sandreas.hansson@arm.com * met: redistributions of source code must retain the above copyright 811051Sandreas.hansson@arm.com * notice, this list of conditions and the following disclaimer; 911051Sandreas.hansson@arm.com * redistributions in binary form must reproduce the above copyright 1011051Sandreas.hansson@arm.com * notice, this list of conditions and the following disclaimer in the 1111051Sandreas.hansson@arm.com * documentation and/or other materials provided with the distribution; 1211051Sandreas.hansson@arm.com * neither the name of the copyright holders nor the names of its 1311051Sandreas.hansson@arm.com * contributors may be used to endorse or promote products derived from 1411051Sandreas.hansson@arm.com * this software without specific prior written permission. 1511051Sandreas.hansson@arm.com * 162810Srdreslin@umich.edu * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS 172810Srdreslin@umich.edu * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT 182810Srdreslin@umich.edu * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR 192810Srdreslin@umich.edu * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT 202810Srdreslin@umich.edu * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, 212810Srdreslin@umich.edu * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT 222810Srdreslin@umich.edu * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 232810Srdreslin@umich.edu * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 242810Srdreslin@umich.edu * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 252810Srdreslin@umich.edu * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE 262810Srdreslin@umich.edu * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 272810Srdreslin@umich.edu * 282810Srdreslin@umich.edu * Authors: Erik Hallnor 292810Srdreslin@umich.edu */ 302810Srdreslin@umich.edu 312810Srdreslin@umich.edu/** @file 322810Srdreslin@umich.edu * Definition of MSHRQueue class functions. 332810Srdreslin@umich.edu */ 342810Srdreslin@umich.edu 352810Srdreslin@umich.edu#include "mem/cache/miss/mshr_queue.hh" 362810Srdreslin@umich.edu 372810Srdreslin@umich.eduusing namespace std; 382810Srdreslin@umich.edu 392810Srdreslin@umich.eduMSHRQueue::MSHRQueue(int num_entries, int reserve) 402810Srdreslin@umich.edu : numEntries(num_entries + reserve - 1), numReserve(reserve) 412810Srdreslin@umich.edu{ 4211051Sandreas.hansson@arm.com allocated = 0; 4311051Sandreas.hansson@arm.com inServiceEntries = 0; 442810Srdreslin@umich.edu registers = new MSHR[numEntries]; 4511051Sandreas.hansson@arm.com for (int i = 0; i < numEntries; ++i) { 4611051Sandreas.hansson@arm.com registers[i].queue = this; 472810Srdreslin@umich.edu freeList.push_back(®isters[i]); 482810Srdreslin@umich.edu } 492810Srdreslin@umich.edu} 502810Srdreslin@umich.edu 5111051Sandreas.hansson@arm.comMSHRQueue::~MSHRQueue() 522810Srdreslin@umich.edu{ 532810Srdreslin@umich.edu delete [] registers; 5411051Sandreas.hansson@arm.com} 552810Srdreslin@umich.edu 5611051Sandreas.hansson@arm.comMSHR * 5711051Sandreas.hansson@arm.comMSHRQueue::findMatch(Addr addr) const 5811051Sandreas.hansson@arm.com{ 5911051Sandreas.hansson@arm.com MSHR::ConstIterator i = allocatedList.begin(); 6011051Sandreas.hansson@arm.com MSHR::ConstIterator end = allocatedList.end(); 6111288Ssteve.reinhardt@amd.com for (; i != end; ++i) { 6211051Sandreas.hansson@arm.com MSHR *mshr = *i; 6311051Sandreas.hansson@arm.com if (mshr->addr == addr) { 6411051Sandreas.hansson@arm.com return mshr; 6511051Sandreas.hansson@arm.com } 6611051Sandreas.hansson@arm.com } 6711053Sandreas.hansson@arm.com return NULL; 6811053Sandreas.hansson@arm.com} 6911051Sandreas.hansson@arm.com 7011051Sandreas.hansson@arm.combool 7111051Sandreas.hansson@arm.comMSHRQueue::findMatches(Addr addr, vector<MSHR*>& matches) const 7211197Sandreas.hansson@arm.com{ 7311197Sandreas.hansson@arm.com // Need an empty vector 7411199Sandreas.hansson@arm.com assert(matches.empty()); 7511197Sandreas.hansson@arm.com bool retval = false; 7611197Sandreas.hansson@arm.com MSHR::ConstIterator i = allocatedList.begin(); 7711197Sandreas.hansson@arm.com MSHR::ConstIterator end = allocatedList.end(); 7811051Sandreas.hansson@arm.com for (; i != end; ++i) { 7911051Sandreas.hansson@arm.com MSHR *mshr = *i; 8011051Sandreas.hansson@arm.com if (mshr->addr == addr) { 8111051Sandreas.hansson@arm.com retval = true; 8211051Sandreas.hansson@arm.com matches.push_back(mshr); 8311051Sandreas.hansson@arm.com } 8411051Sandreas.hansson@arm.com } 8511051Sandreas.hansson@arm.com return retval; 8611051Sandreas.hansson@arm.com 8711051Sandreas.hansson@arm.com} 8811051Sandreas.hansson@arm.com 8911051Sandreas.hansson@arm.comMSHR * 9011051Sandreas.hansson@arm.comMSHRQueue::findPending(Addr addr, int size) const 9111051Sandreas.hansson@arm.com{ 9211051Sandreas.hansson@arm.com MSHR::ConstIterator i = pendingList.begin(); 9311051Sandreas.hansson@arm.com MSHR::ConstIterator end = pendingList.end(); 9411051Sandreas.hansson@arm.com for (; i != end; ++i) { 9511051Sandreas.hansson@arm.com MSHR *mshr = *i; 9611051Sandreas.hansson@arm.com if (mshr->addr < addr) { 9711051Sandreas.hansson@arm.com if (mshr->addr + mshr->size > addr) { 9811051Sandreas.hansson@arm.com return mshr; 9911051Sandreas.hansson@arm.com } 10011051Sandreas.hansson@arm.com } else { 10111051Sandreas.hansson@arm.com if (addr + size > mshr->addr) { 10211051Sandreas.hansson@arm.com return mshr; 10311051Sandreas.hansson@arm.com } 10411051Sandreas.hansson@arm.com } 10511051Sandreas.hansson@arm.com } 10611051Sandreas.hansson@arm.com return NULL; 10711051Sandreas.hansson@arm.com} 10811051Sandreas.hansson@arm.com 10911051Sandreas.hansson@arm.comMSHR * 11011051Sandreas.hansson@arm.comMSHRQueue::allocate(Addr addr, int size, PacketPtr &pkt, bool isFill) 11111051Sandreas.hansson@arm.com{ 11211051Sandreas.hansson@arm.com assert(!freeList.empty()); 11311051Sandreas.hansson@arm.com MSHR *mshr = freeList.front(); 11411051Sandreas.hansson@arm.com assert(mshr->getNumTargets() == 0); 11511051Sandreas.hansson@arm.com freeList.pop_front(); 11611051Sandreas.hansson@arm.com 11711051Sandreas.hansson@arm.com mshr->allocate(addr, size, pkt, isFill); 11811051Sandreas.hansson@arm.com mshr->allocIter = allocatedList.insert(allocatedList.end(), mshr); 11911051Sandreas.hansson@arm.com mshr->readyIter = pendingList.insert(pendingList.end(), mshr); 12011051Sandreas.hansson@arm.com 12111051Sandreas.hansson@arm.com allocated += 1; 12211051Sandreas.hansson@arm.com return mshr; 12311051Sandreas.hansson@arm.com} 12411051Sandreas.hansson@arm.com 12511051Sandreas.hansson@arm.com 12611051Sandreas.hansson@arm.comvoid 12711051Sandreas.hansson@arm.comMSHRQueue::deallocate(MSHR *mshr) 12811051Sandreas.hansson@arm.com{ 12911051Sandreas.hansson@arm.com deallocateOne(mshr); 13011051Sandreas.hansson@arm.com} 13111051Sandreas.hansson@arm.com 13211051Sandreas.hansson@arm.comMSHR::Iterator 13311051Sandreas.hansson@arm.comMSHRQueue::deallocateOne(MSHR *mshr) 13411051Sandreas.hansson@arm.com{ 13511051Sandreas.hansson@arm.com MSHR::Iterator retval = allocatedList.erase(mshr->allocIter); 13611051Sandreas.hansson@arm.com freeList.push_front(mshr); 13711051Sandreas.hansson@arm.com allocated--; 13811051Sandreas.hansson@arm.com if (mshr->inService) { 13911051Sandreas.hansson@arm.com inServiceEntries--; 14011051Sandreas.hansson@arm.com } else { 14111051Sandreas.hansson@arm.com pendingList.erase(mshr->readyIter); 14211051Sandreas.hansson@arm.com } 14311051Sandreas.hansson@arm.com mshr->deallocate(); 14411051Sandreas.hansson@arm.com return retval; 14511051Sandreas.hansson@arm.com} 14611051Sandreas.hansson@arm.com 14711051Sandreas.hansson@arm.comvoid 14811051Sandreas.hansson@arm.comMSHRQueue::moveToFront(MSHR *mshr) 14911051Sandreas.hansson@arm.com{ 15011051Sandreas.hansson@arm.com if (!mshr->inService) { 15111051Sandreas.hansson@arm.com assert(mshr == *(mshr->readyIter)); 15211051Sandreas.hansson@arm.com pendingList.erase(mshr->readyIter); 15311051Sandreas.hansson@arm.com mshr->readyIter = pendingList.insert(pendingList.begin(), mshr); 15411051Sandreas.hansson@arm.com } 15511051Sandreas.hansson@arm.com} 15611051Sandreas.hansson@arm.com 15711051Sandreas.hansson@arm.comvoid 15811051Sandreas.hansson@arm.comMSHRQueue::markInService(MSHR *mshr) 15911051Sandreas.hansson@arm.com{ 16011051Sandreas.hansson@arm.com //assert(mshr == pendingList.front()); 16111284Sandreas.hansson@arm.com#if 0 16211051Sandreas.hansson@arm.com if (!mshr->pkt->needsResponse() && !(mshr->pkt->cmd == MemCmd::UpgradeReq)) { 16311051Sandreas.hansson@arm.com assert(mshr->getNumTargets() == 0); 16411051Sandreas.hansson@arm.com deallocate(mshr); 16511051Sandreas.hansson@arm.com return; 16611051Sandreas.hansson@arm.com } 16711051Sandreas.hansson@arm.com#endif 16811051Sandreas.hansson@arm.com mshr->inService = true; 16911284Sandreas.hansson@arm.com pendingList.erase(mshr->readyIter); 17011284Sandreas.hansson@arm.com //mshr->readyIter = NULL; 17111284Sandreas.hansson@arm.com inServiceEntries += 1; 17211284Sandreas.hansson@arm.com //pendingList.pop_front(); 17311051Sandreas.hansson@arm.com} 17411284Sandreas.hansson@arm.com 17511051Sandreas.hansson@arm.comvoid 17611051Sandreas.hansson@arm.comMSHRQueue::markPending(MSHR *mshr) 17711051Sandreas.hansson@arm.com{ 17811284Sandreas.hansson@arm.com //assert(mshr->readyIter == NULL); 17911284Sandreas.hansson@arm.com mshr->inService = false; 18011284Sandreas.hansson@arm.com --inServiceEntries; 18111284Sandreas.hansson@arm.com /** 18211051Sandreas.hansson@arm.com * @ todo might want to add rerequests to front of pending list for 18311288Ssteve.reinhardt@amd.com * performance. 18411288Ssteve.reinhardt@amd.com */ 18511051Sandreas.hansson@arm.com mshr->readyIter = pendingList.insert(pendingList.end(), mshr); 18611051Sandreas.hansson@arm.com} 18711051Sandreas.hansson@arm.com 18811051Sandreas.hansson@arm.comvoid 18911286Sandreas.hansson@arm.comMSHRQueue::squash(int threadNum) 19011286Sandreas.hansson@arm.com{ 19111286Sandreas.hansson@arm.com MSHR::Iterator i = allocatedList.begin(); 19211051Sandreas.hansson@arm.com MSHR::Iterator end = allocatedList.end(); 19311286Sandreas.hansson@arm.com for (; i != end;) { 19411600Sandreas.hansson@arm.com MSHR *mshr = *i; 19511600Sandreas.hansson@arm.com if (mshr->threadNum == threadNum) { 19611051Sandreas.hansson@arm.com while (mshr->hasTargets()) { 19711051Sandreas.hansson@arm.com mshr->popTarget(); 19811051Sandreas.hansson@arm.com assert(0/*target->req->getThreadNum()*/ == threadNum); 19911284Sandreas.hansson@arm.com } 20011051Sandreas.hansson@arm.com assert(!mshr->hasTargets()); 20111051Sandreas.hansson@arm.com assert(mshr->ntargets==0); 20211051Sandreas.hansson@arm.com if (!mshr->inService) { 20311051Sandreas.hansson@arm.com i = deallocateOne(mshr); 20411051Sandreas.hansson@arm.com } else { 20511284Sandreas.hansson@arm.com //mshr->pkt->flags &= ~CACHE_LINE_FILL; 20611051Sandreas.hansson@arm.com ++i; 20711284Sandreas.hansson@arm.com } 20811051Sandreas.hansson@arm.com } else { 20911197Sandreas.hansson@arm.com ++i; 21011197Sandreas.hansson@arm.com } 21111197Sandreas.hansson@arm.com } 21211197Sandreas.hansson@arm.com} 21311051Sandreas.hansson@arm.com