mshr_queue.cc revision 11197
15389Sgblack@eecs.umich.edu/* 25446Sgblack@eecs.umich.edu * Copyright (c) 2012-2013, 2015 ARM Limited 35389Sgblack@eecs.umich.edu * All rights reserved. 45389Sgblack@eecs.umich.edu * 55389Sgblack@eecs.umich.edu * The license below extends only to copyright in the software and shall 65389Sgblack@eecs.umich.edu * not be construed as granting a license to any other intellectual 75389Sgblack@eecs.umich.edu * property including but not limited to intellectual property relating 85389Sgblack@eecs.umich.edu * to a hardware implementation of the functionality of the software 95389Sgblack@eecs.umich.edu * licensed hereunder. You may use the software subject to the license 105389Sgblack@eecs.umich.edu * terms below provided that you ensure that this notice is replicated 115389Sgblack@eecs.umich.edu * unmodified and in its entirety in all distributions of the software, 125389Sgblack@eecs.umich.edu * modified or unmodified, in source code or in binary form. 135389Sgblack@eecs.umich.edu * 145389Sgblack@eecs.umich.edu * Copyright (c) 2003-2005 The Regents of The University of Michigan 155389Sgblack@eecs.umich.edu * All rights reserved. 165389Sgblack@eecs.umich.edu * 175389Sgblack@eecs.umich.edu * Redistribution and use in source and binary forms, with or without 185389Sgblack@eecs.umich.edu * modification, are permitted provided that the following conditions are 195389Sgblack@eecs.umich.edu * met: redistributions of source code must retain the above copyright 205389Sgblack@eecs.umich.edu * notice, this list of conditions and the following disclaimer; 215389Sgblack@eecs.umich.edu * redistributions in binary form must reproduce the above copyright 225389Sgblack@eecs.umich.edu * notice, this list of conditions and the following disclaimer in the 235389Sgblack@eecs.umich.edu * documentation and/or other materials provided with the distribution; 245389Sgblack@eecs.umich.edu * neither the name of the copyright holders nor the names of its 255389Sgblack@eecs.umich.edu * contributors may be used to endorse or promote products derived from 265389Sgblack@eecs.umich.edu * this software without specific prior written permission. 275389Sgblack@eecs.umich.edu * 285389Sgblack@eecs.umich.edu * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS 295389Sgblack@eecs.umich.edu * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT 305389Sgblack@eecs.umich.edu * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR 315389Sgblack@eecs.umich.edu * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT 325389Sgblack@eecs.umich.edu * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, 335389Sgblack@eecs.umich.edu * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT 345389Sgblack@eecs.umich.edu * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 355389Sgblack@eecs.umich.edu * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 365389Sgblack@eecs.umich.edu * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 375389Sgblack@eecs.umich.edu * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE 385389Sgblack@eecs.umich.edu * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 395389Sgblack@eecs.umich.edu * 405389Sgblack@eecs.umich.edu * Authors: Erik Hallnor 415478Snate@binkert.org * Andreas Sandberg 425636Sgblack@eecs.umich.edu */ 435389Sgblack@eecs.umich.edu 445636Sgblack@eecs.umich.edu/** @file 455389Sgblack@eecs.umich.edu * Definition of MSHRQueue class functions. 465389Sgblack@eecs.umich.edu */ 475389Sgblack@eecs.umich.edu 485389Sgblack@eecs.umich.edu#include "base/trace.hh" 495389Sgblack@eecs.umich.edu#include "mem/cache/mshr_queue.hh" 505389Sgblack@eecs.umich.edu#include "debug/Drain.hh" 515389Sgblack@eecs.umich.edu 525389Sgblack@eecs.umich.eduusing namespace std; 535446Sgblack@eecs.umich.edu 545389Sgblack@eecs.umich.eduMSHRQueue::MSHRQueue(const std::string &_label, 555389Sgblack@eecs.umich.edu int num_entries, int reserve, int demand_reserve, 565389Sgblack@eecs.umich.edu int _index) 575389Sgblack@eecs.umich.edu : label(_label), numEntries(num_entries + reserve - 1), 585446Sgblack@eecs.umich.edu numReserve(reserve), demandReserve(demand_reserve), 595446Sgblack@eecs.umich.edu registers(numEntries), allocated(0), 605446Sgblack@eecs.umich.edu inServiceEntries(0), index(_index) 615446Sgblack@eecs.umich.edu{ 625636Sgblack@eecs.umich.edu for (int i = 0; i < numEntries; ++i) { 635446Sgblack@eecs.umich.edu registers[i].queue = this; 645446Sgblack@eecs.umich.edu freeList.push_back(®isters[i]); 655446Sgblack@eecs.umich.edu } 665446Sgblack@eecs.umich.edu} 675446Sgblack@eecs.umich.edu 685635Sgblack@eecs.umich.eduMSHR * 695635Sgblack@eecs.umich.eduMSHRQueue::findMatch(Addr blk_addr, bool is_secure) const 705446Sgblack@eecs.umich.edu{ 715446Sgblack@eecs.umich.edu for (const auto& mshr : allocatedList) { 725389Sgblack@eecs.umich.edu // we ignore any MSHRs allocated for uncacheable accesses and 735389Sgblack@eecs.umich.edu // simply ignore them when matching, in the cache we never 745389Sgblack@eecs.umich.edu // check for matches when adding new uncacheable entries, and 755389Sgblack@eecs.umich.edu // we do not want normal cacheable accesses being added to an 765389Sgblack@eecs.umich.edu // MSHR serving an uncacheable access 775389Sgblack@eecs.umich.edu if (!mshr->isUncacheable() && mshr->blkAddr == blk_addr && 785389Sgblack@eecs.umich.edu mshr->isSecure == is_secure) { 795389Sgblack@eecs.umich.edu return mshr; 805389Sgblack@eecs.umich.edu } 815389Sgblack@eecs.umich.edu } 825389Sgblack@eecs.umich.edu return NULL; 835389Sgblack@eecs.umich.edu} 845389Sgblack@eecs.umich.edu 855389Sgblack@eecs.umich.edubool 865389Sgblack@eecs.umich.eduMSHRQueue::findMatches(Addr blk_addr, bool is_secure, 875389Sgblack@eecs.umich.edu vector<MSHR*>& matches) const 885389Sgblack@eecs.umich.edu{ 895389Sgblack@eecs.umich.edu // Need an empty vector 905389Sgblack@eecs.umich.edu assert(matches.empty()); 915389Sgblack@eecs.umich.edu bool retval = false; 925389Sgblack@eecs.umich.edu for (const auto& mshr : allocatedList) { 935389Sgblack@eecs.umich.edu if (!mshr->isUncacheable() && mshr->blkAddr == blk_addr && 945389Sgblack@eecs.umich.edu mshr->isSecure == is_secure) { 955389Sgblack@eecs.umich.edu retval = true; 965389Sgblack@eecs.umich.edu matches.push_back(mshr); 975389Sgblack@eecs.umich.edu } 985389Sgblack@eecs.umich.edu } 995389Sgblack@eecs.umich.edu return retval; 1005389Sgblack@eecs.umich.edu} 1015389Sgblack@eecs.umich.edu 1025389Sgblack@eecs.umich.edu 1035389Sgblack@eecs.umich.edubool 1045389Sgblack@eecs.umich.eduMSHRQueue::checkFunctional(PacketPtr pkt, Addr blk_addr) 1055389Sgblack@eecs.umich.edu{ 1065389Sgblack@eecs.umich.edu pkt->pushLabel(label); 1075389Sgblack@eecs.umich.edu for (const auto& mshr : allocatedList) { 1085389Sgblack@eecs.umich.edu if (mshr->blkAddr == blk_addr && mshr->checkFunctional(pkt)) { 1095389Sgblack@eecs.umich.edu pkt->popLabel(); 1105389Sgblack@eecs.umich.edu return true; 1115389Sgblack@eecs.umich.edu } 1125389Sgblack@eecs.umich.edu } 1135389Sgblack@eecs.umich.edu pkt->popLabel(); 1145389Sgblack@eecs.umich.edu return false; 1155389Sgblack@eecs.umich.edu} 1165389Sgblack@eecs.umich.edu 1175389Sgblack@eecs.umich.edu 1185389Sgblack@eecs.umich.eduMSHR * 1195389Sgblack@eecs.umich.eduMSHRQueue::findPending(Addr blk_addr, bool is_secure) const 1205389Sgblack@eecs.umich.edu{ 1215389Sgblack@eecs.umich.edu for (const auto& mshr : readyList) { 1225389Sgblack@eecs.umich.edu if (mshr->blkAddr == blk_addr && mshr->isSecure == is_secure) { 1235389Sgblack@eecs.umich.edu return mshr; 1245389Sgblack@eecs.umich.edu } 1255389Sgblack@eecs.umich.edu } 1265389Sgblack@eecs.umich.edu return NULL; 127} 128 129 130MSHR::Iterator 131MSHRQueue::addToReadyList(MSHR *mshr) 132{ 133 if (readyList.empty() || readyList.back()->readyTime <= mshr->readyTime) { 134 return readyList.insert(readyList.end(), mshr); 135 } 136 137 for (auto i = readyList.begin(); i != readyList.end(); ++i) { 138 if ((*i)->readyTime > mshr->readyTime) { 139 return readyList.insert(i, mshr); 140 } 141 } 142 assert(false); 143 return readyList.end(); // keep stupid compilers happy 144} 145 146 147MSHR * 148MSHRQueue::allocate(Addr blk_addr, unsigned blk_size, PacketPtr pkt, 149 Tick when_ready, Counter order, bool alloc_on_fill) 150{ 151 assert(!freeList.empty()); 152 MSHR *mshr = freeList.front(); 153 assert(mshr->getNumTargets() == 0); 154 freeList.pop_front(); 155 156 mshr->allocate(blk_addr, blk_size, pkt, when_ready, order, alloc_on_fill); 157 mshr->allocIter = allocatedList.insert(allocatedList.end(), mshr); 158 mshr->readyIter = addToReadyList(mshr); 159 160 allocated += 1; 161 return mshr; 162} 163 164 165void 166MSHRQueue::deallocate(MSHR *mshr) 167{ 168 deallocateOne(mshr); 169} 170 171MSHR::Iterator 172MSHRQueue::deallocateOne(MSHR *mshr) 173{ 174 MSHR::Iterator retval = allocatedList.erase(mshr->allocIter); 175 freeList.push_front(mshr); 176 allocated--; 177 if (mshr->inService) { 178 inServiceEntries--; 179 } else { 180 readyList.erase(mshr->readyIter); 181 } 182 mshr->deallocate(); 183 if (drainState() == DrainState::Draining && allocated == 0) { 184 // Notify the drain manager that we have completed draining if 185 // there are no other outstanding requests in this MSHR queue. 186 DPRINTF(Drain, "MSHRQueue now empty, signalling drained\n"); 187 signalDrainDone(); 188 } 189 return retval; 190} 191 192void 193MSHRQueue::moveToFront(MSHR *mshr) 194{ 195 if (!mshr->inService) { 196 assert(mshr == *(mshr->readyIter)); 197 readyList.erase(mshr->readyIter); 198 mshr->readyIter = readyList.insert(readyList.begin(), mshr); 199 } 200} 201 202void 203MSHRQueue::markInService(MSHR *mshr, bool pending_dirty_resp) 204{ 205 if (mshr->markInService(pending_dirty_resp)) { 206 deallocate(mshr); 207 } else { 208 readyList.erase(mshr->readyIter); 209 inServiceEntries += 1; 210 } 211} 212 213void 214MSHRQueue::markPending(MSHR *mshr) 215{ 216 assert(mshr->inService); 217 mshr->inService = false; 218 --inServiceEntries; 219 /** 220 * @ todo might want to add rerequests to front of pending list for 221 * performance. 222 */ 223 mshr->readyIter = addToReadyList(mshr); 224} 225 226bool 227MSHRQueue::forceDeallocateTarget(MSHR *mshr) 228{ 229 bool was_full = isFull(); 230 assert(mshr->hasTargets()); 231 // Pop the prefetch off of the target list 232 mshr->popTarget(); 233 // Delete mshr if no remaining targets 234 if (!mshr->hasTargets() && !mshr->promoteDeferredTargets()) { 235 deallocateOne(mshr); 236 } 237 238 // Notify if MSHR queue no longer full 239 return was_full && !isFull(); 240} 241 242void 243MSHRQueue::squash(int threadNum) 244{ 245 for (auto i = allocatedList.begin(); i != allocatedList.end();) { 246 MSHR *mshr = *i; 247 if (mshr->threadNum == threadNum) { 248 while (mshr->hasTargets()) { 249 mshr->popTarget(); 250 assert(0/*target->req->threadId()*/ == threadNum); 251 } 252 assert(!mshr->hasTargets()); 253 assert(mshr->getNumTargets()==0); 254 if (!mshr->inService) { 255 i = deallocateOne(mshr); 256 } else { 257 //mshr->pkt->flags &= ~CACHE_LINE_FILL; 258 ++i; 259 } 260 } else { 261 ++i; 262 } 263 } 264} 265 266DrainState 267MSHRQueue::drain() 268{ 269 return allocated == 0 ? DrainState::Drained : DrainState::Draining; 270} 271