a15b713cba
This patch squashes prefetch requests from downstream caches, so that they do not steal cachelines away from caches closer to the cpu. It was originally coded by Mitch Hayenga and modified by Aasheesh Kolli.
289 lines
8.2 KiB
C++
289 lines
8.2 KiB
C++
/*
|
|
* Copyright (c) 2012-2013 ARM Limited
|
|
* All rights reserved.
|
|
*
|
|
* The license below extends only to copyright in the software and shall
|
|
* not be construed as granting a license to any other intellectual
|
|
* property including but not limited to intellectual property relating
|
|
* to a hardware implementation of the functionality of the software
|
|
* licensed hereunder. You may use the software subject to the license
|
|
* terms below provided that you ensure that this notice is replicated
|
|
* unmodified and in its entirety in all distributions of the software,
|
|
* modified or unmodified, in source code or in binary form.
|
|
*
|
|
* Copyright (c) 2003-2005 The Regents of The University of Michigan
|
|
* All rights reserved.
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted provided that the following conditions are
|
|
* met: redistributions of source code must retain the above copyright
|
|
* notice, this list of conditions and the following disclaimer;
|
|
* redistributions in binary form must reproduce the above copyright
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
* documentation and/or other materials provided with the distribution;
|
|
* neither the name of the copyright holders nor the names of its
|
|
* contributors may be used to endorse or promote products derived from
|
|
* this software without specific prior written permission.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
|
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
|
|
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
|
|
* A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
|
|
* OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
|
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
|
* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
|
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
|
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
|
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
|
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
*
|
|
* Authors: Erik Hallnor
|
|
* Andreas Sandberg
|
|
*/
|
|
|
|
/** @file
|
|
* Definition of MSHRQueue class functions.
|
|
*/
|
|
|
|
#include "mem/cache/mshr_queue.hh"
|
|
|
|
using namespace std;
|
|
|
|
MSHRQueue::MSHRQueue(const std::string &_label,
|
|
int num_entries, int reserve, int _index)
|
|
: label(_label), numEntries(num_entries + reserve - 1),
|
|
numReserve(reserve), registers(numEntries),
|
|
drainManager(NULL), allocated(0), inServiceEntries(0), index(_index)
|
|
{
|
|
for (int i = 0; i < numEntries; ++i) {
|
|
registers[i].queue = this;
|
|
freeList.push_back(®isters[i]);
|
|
}
|
|
}
|
|
|
|
MSHR *
|
|
MSHRQueue::findMatch(Addr addr, bool is_secure) const
|
|
{
|
|
MSHR::ConstIterator i = allocatedList.begin();
|
|
MSHR::ConstIterator end = allocatedList.end();
|
|
for (; i != end; ++i) {
|
|
MSHR *mshr = *i;
|
|
if (mshr->addr == addr && mshr->isSecure == is_secure) {
|
|
return mshr;
|
|
}
|
|
}
|
|
return NULL;
|
|
}
|
|
|
|
bool
|
|
MSHRQueue::findMatches(Addr addr, bool is_secure, vector<MSHR*>& matches) const
|
|
{
|
|
// Need an empty vector
|
|
assert(matches.empty());
|
|
bool retval = false;
|
|
MSHR::ConstIterator i = allocatedList.begin();
|
|
MSHR::ConstIterator end = allocatedList.end();
|
|
for (; i != end; ++i) {
|
|
MSHR *mshr = *i;
|
|
if (mshr->addr == addr && mshr->isSecure == is_secure) {
|
|
retval = true;
|
|
matches.push_back(mshr);
|
|
}
|
|
}
|
|
return retval;
|
|
}
|
|
|
|
|
|
bool
|
|
MSHRQueue::checkFunctional(PacketPtr pkt, Addr blk_addr)
|
|
{
|
|
pkt->pushLabel(label);
|
|
MSHR::ConstIterator i = allocatedList.begin();
|
|
MSHR::ConstIterator end = allocatedList.end();
|
|
for (; i != end; ++i) {
|
|
MSHR *mshr = *i;
|
|
if (mshr->addr == blk_addr && mshr->checkFunctional(pkt)) {
|
|
pkt->popLabel();
|
|
return true;
|
|
}
|
|
}
|
|
pkt->popLabel();
|
|
return false;
|
|
}
|
|
|
|
|
|
MSHR *
|
|
MSHRQueue::findPending(Addr addr, int size, bool is_secure) const
|
|
{
|
|
MSHR::ConstIterator i = readyList.begin();
|
|
MSHR::ConstIterator end = readyList.end();
|
|
for (; i != end; ++i) {
|
|
MSHR *mshr = *i;
|
|
if (mshr->isSecure == is_secure) {
|
|
if (mshr->addr < addr) {
|
|
if (mshr->addr + mshr->size > addr)
|
|
return mshr;
|
|
} else {
|
|
if (addr + size > mshr->addr)
|
|
return mshr;
|
|
}
|
|
}
|
|
}
|
|
return NULL;
|
|
}
|
|
|
|
|
|
MSHR::Iterator
|
|
MSHRQueue::addToReadyList(MSHR *mshr)
|
|
{
|
|
if (readyList.empty() || readyList.back()->readyTime <= mshr->readyTime) {
|
|
return readyList.insert(readyList.end(), mshr);
|
|
}
|
|
|
|
MSHR::Iterator i = readyList.begin();
|
|
MSHR::Iterator end = readyList.end();
|
|
for (; i != end; ++i) {
|
|
if ((*i)->readyTime > mshr->readyTime) {
|
|
return readyList.insert(i, mshr);
|
|
}
|
|
}
|
|
assert(false);
|
|
return end; // keep stupid compilers happy
|
|
}
|
|
|
|
|
|
MSHR *
|
|
MSHRQueue::allocate(Addr addr, int size, PacketPtr &pkt,
|
|
Tick when, Counter order)
|
|
{
|
|
assert(!freeList.empty());
|
|
MSHR *mshr = freeList.front();
|
|
assert(mshr->getNumTargets() == 0);
|
|
freeList.pop_front();
|
|
|
|
mshr->allocate(addr, size, pkt, when, order);
|
|
mshr->allocIter = allocatedList.insert(allocatedList.end(), mshr);
|
|
mshr->readyIter = addToReadyList(mshr);
|
|
|
|
allocated += 1;
|
|
return mshr;
|
|
}
|
|
|
|
|
|
void
|
|
MSHRQueue::deallocate(MSHR *mshr)
|
|
{
|
|
deallocateOne(mshr);
|
|
}
|
|
|
|
MSHR::Iterator
|
|
MSHRQueue::deallocateOne(MSHR *mshr)
|
|
{
|
|
MSHR::Iterator retval = allocatedList.erase(mshr->allocIter);
|
|
freeList.push_front(mshr);
|
|
allocated--;
|
|
if (mshr->inService) {
|
|
inServiceEntries--;
|
|
} else {
|
|
readyList.erase(mshr->readyIter);
|
|
}
|
|
mshr->deallocate();
|
|
if (drainManager && allocated == 0) {
|
|
// Notify the drain manager that we have completed draining if
|
|
// there are no other outstanding requests in this MSHR queue.
|
|
drainManager->signalDrainDone();
|
|
drainManager = NULL;
|
|
setDrainState(Drainable::Drained);
|
|
}
|
|
return retval;
|
|
}
|
|
|
|
void
|
|
MSHRQueue::moveToFront(MSHR *mshr)
|
|
{
|
|
if (!mshr->inService) {
|
|
assert(mshr == *(mshr->readyIter));
|
|
readyList.erase(mshr->readyIter);
|
|
mshr->readyIter = readyList.insert(readyList.begin(), mshr);
|
|
}
|
|
}
|
|
|
|
void
|
|
MSHRQueue::markInService(MSHR *mshr, PacketPtr pkt)
|
|
{
|
|
if (mshr->markInService(pkt)) {
|
|
deallocate(mshr);
|
|
} else {
|
|
readyList.erase(mshr->readyIter);
|
|
inServiceEntries += 1;
|
|
}
|
|
}
|
|
|
|
void
|
|
MSHRQueue::markPending(MSHR *mshr)
|
|
{
|
|
assert(mshr->inService);
|
|
mshr->inService = false;
|
|
--inServiceEntries;
|
|
/**
|
|
* @ todo might want to add rerequests to front of pending list for
|
|
* performance.
|
|
*/
|
|
mshr->readyIter = addToReadyList(mshr);
|
|
}
|
|
|
|
bool
|
|
MSHRQueue::forceDeallocateTarget(MSHR *mshr)
|
|
{
|
|
bool was_full = isFull();
|
|
assert(mshr->hasTargets());
|
|
// Pop the prefetch off of the target list
|
|
mshr->popTarget();
|
|
// Delete mshr if no remaining targets
|
|
if (!mshr->hasTargets() && !mshr->promoteDeferredTargets()) {
|
|
deallocateOne(mshr);
|
|
}
|
|
|
|
// Notify if MSHR queue no longer full
|
|
return was_full && !isFull();
|
|
}
|
|
|
|
void
|
|
MSHRQueue::squash(int threadNum)
|
|
{
|
|
MSHR::Iterator i = allocatedList.begin();
|
|
MSHR::Iterator end = allocatedList.end();
|
|
for (; i != end;) {
|
|
MSHR *mshr = *i;
|
|
if (mshr->threadNum == threadNum) {
|
|
while (mshr->hasTargets()) {
|
|
mshr->popTarget();
|
|
assert(0/*target->req->threadId()*/ == threadNum);
|
|
}
|
|
assert(!mshr->hasTargets());
|
|
assert(mshr->getNumTargets()==0);
|
|
if (!mshr->inService) {
|
|
i = deallocateOne(mshr);
|
|
} else {
|
|
//mshr->pkt->flags &= ~CACHE_LINE_FILL;
|
|
++i;
|
|
}
|
|
} else {
|
|
++i;
|
|
}
|
|
}
|
|
}
|
|
|
|
unsigned int
|
|
MSHRQueue::drain(DrainManager *dm)
|
|
{
|
|
if (allocated == 0) {
|
|
setDrainState(Drainable::Drained);
|
|
return 0;
|
|
} else {
|
|
drainManager = dm;
|
|
setDrainState(Drainable::Draining);
|
|
return 1;
|
|
}
|
|
}
|