2006-06-28 17:02:14 +02:00
|
|
|
/*
|
|
|
|
* Copyright (c) 2002-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
|
|
|
|
* Dave Greene
|
|
|
|
*/
|
|
|
|
|
|
|
|
/**
|
|
|
|
* @file
|
|
|
|
* Miss Status and Handling Register (MSHR) definitions.
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include <assert.h>
|
|
|
|
#include <string>
|
|
|
|
#include <vector>
|
2007-06-25 15:47:05 +02:00
|
|
|
#include <algorithm>
|
2006-06-28 17:02:14 +02:00
|
|
|
|
|
|
|
#include "mem/cache/miss/mshr.hh"
|
2007-03-06 20:13:43 +01:00
|
|
|
#include "sim/core.hh" // for curTick
|
2006-06-28 17:02:14 +02:00
|
|
|
#include "sim/host.hh"
|
|
|
|
#include "base/misc.hh"
|
|
|
|
#include "mem/cache/cache.hh"
|
|
|
|
|
|
|
|
using namespace std;
|
|
|
|
|
|
|
|
MSHR::MSHR()
|
|
|
|
{
|
|
|
|
inService = false;
|
|
|
|
ntargets = 0;
|
2006-06-29 22:07:19 +02:00
|
|
|
threadNum = -1;
|
2006-06-28 17:02:14 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
void
|
2007-06-25 15:47:05 +02:00
|
|
|
MSHR::allocate(Addr _addr, int _size, PacketPtr target,
|
2007-06-30 22:34:16 +02:00
|
|
|
Tick whenReady, Counter _order)
|
2006-06-28 17:02:14 +02:00
|
|
|
{
|
2006-07-10 23:16:15 +02:00
|
|
|
addr = _addr;
|
2007-06-18 02:27:53 +02:00
|
|
|
size = _size;
|
2007-06-30 22:34:16 +02:00
|
|
|
readyTime = whenReady;
|
2007-06-25 15:47:05 +02:00
|
|
|
order = _order;
|
2007-06-18 02:27:53 +02:00
|
|
|
assert(target);
|
2007-06-21 20:59:17 +02:00
|
|
|
isCacheFill = false;
|
2007-06-18 02:27:53 +02:00
|
|
|
needsExclusive = target->needsExclusive();
|
|
|
|
_isUncacheable = target->req->isUncacheable();
|
|
|
|
inService = false;
|
|
|
|
threadNum = 0;
|
|
|
|
ntargets = 1;
|
|
|
|
// Don't know of a case where we would allocate a new MSHR for a
|
2007-06-25 15:47:05 +02:00
|
|
|
// snoop (mem-side request), so set cpuSide to true here.
|
2007-06-30 22:34:16 +02:00
|
|
|
targets.push_back(Target(target, whenReady, _order, true));
|
2007-06-25 02:32:31 +02:00
|
|
|
assert(deferredTargets.empty());
|
|
|
|
deferredNeedsExclusive = false;
|
|
|
|
pendingInvalidate = false;
|
2007-06-27 07:23:10 +02:00
|
|
|
pendingShared = false;
|
2007-06-26 23:53:15 +02:00
|
|
|
data = NULL;
|
2006-06-28 17:02:14 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
MSHR::deallocate()
|
|
|
|
{
|
|
|
|
assert(targets.empty());
|
2007-06-25 02:32:31 +02:00
|
|
|
assert(deferredTargets.empty());
|
2006-06-28 17:02:14 +02:00
|
|
|
assert(ntargets == 0);
|
|
|
|
inService = false;
|
2006-08-15 23:41:22 +02:00
|
|
|
//allocIter = NULL;
|
|
|
|
//readyIter = NULL;
|
2006-06-28 17:02:14 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Adds a target to an MSHR
|
|
|
|
*/
|
|
|
|
void
|
2007-06-30 22:34:16 +02:00
|
|
|
MSHR::allocateTarget(PacketPtr target, Tick whenReady, Counter _order)
|
2006-06-28 17:02:14 +02:00
|
|
|
{
|
2007-06-25 02:32:31 +02:00
|
|
|
if (inService) {
|
|
|
|
if (!deferredTargets.empty() || pendingInvalidate ||
|
|
|
|
(!needsExclusive && target->needsExclusive())) {
|
|
|
|
// need to put on deferred list
|
2007-06-30 22:34:16 +02:00
|
|
|
deferredTargets.push_back(Target(target, whenReady, _order, true));
|
2007-06-25 02:32:31 +02:00
|
|
|
if (target->needsExclusive()) {
|
|
|
|
deferredNeedsExclusive = true;
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
// still OK to append to outstanding request
|
2007-06-30 22:34:16 +02:00
|
|
|
targets.push_back(Target(target, whenReady, _order, true));
|
2007-06-25 02:32:31 +02:00
|
|
|
}
|
|
|
|
} else {
|
|
|
|
if (target->needsExclusive()) {
|
|
|
|
needsExclusive = true;
|
2006-06-28 17:02:14 +02:00
|
|
|
}
|
|
|
|
|
2007-06-30 22:34:16 +02:00
|
|
|
targets.push_back(Target(target, whenReady, _order, true));
|
2007-06-25 02:32:31 +02:00
|
|
|
}
|
2006-06-28 17:02:14 +02:00
|
|
|
|
2007-06-25 02:32:31 +02:00
|
|
|
++ntargets;
|
|
|
|
}
|
|
|
|
|
|
|
|
void
|
2007-06-30 22:34:16 +02:00
|
|
|
MSHR::allocateSnoopTarget(PacketPtr pkt, Tick whenReady, Counter _order)
|
2007-06-25 02:32:31 +02:00
|
|
|
{
|
|
|
|
assert(inService); // don't bother to call otherwise
|
|
|
|
|
|
|
|
if (pendingInvalidate) {
|
|
|
|
// a prior snoop has already appended an invalidation, so
|
|
|
|
// logically we don't have the block anymore...
|
|
|
|
return;
|
2006-06-28 17:02:14 +02:00
|
|
|
}
|
2007-06-25 02:32:31 +02:00
|
|
|
|
2007-06-27 07:23:10 +02:00
|
|
|
DPRINTF(Cache, "deferred snoop on %x: %s %s\n", addr,
|
|
|
|
needsExclusive ? "needsExclusive" : "",
|
|
|
|
pkt->needsExclusive() ? "pkt->needsExclusive()" : "");
|
|
|
|
|
|
|
|
if (needsExclusive || pkt->needsExclusive()) {
|
|
|
|
// actual target device (typ. PhysicalMemory) will delete the
|
|
|
|
// packet on reception, so we need to save a copy here
|
2007-06-30 22:34:16 +02:00
|
|
|
targets.push_back(Target(new Packet(pkt), whenReady, _order, false));
|
2007-06-27 07:23:10 +02:00
|
|
|
++ntargets;
|
|
|
|
|
|
|
|
if (needsExclusive) {
|
|
|
|
// We're awaiting an exclusive copy, so ownership is pending.
|
|
|
|
// It's up to us to respond once the data arrives.
|
|
|
|
pkt->assertMemInhibit();
|
|
|
|
}
|
2007-06-26 07:23:29 +02:00
|
|
|
|
2007-06-27 07:23:10 +02:00
|
|
|
if (pkt->needsExclusive()) {
|
|
|
|
// This transaction will take away our pending copy
|
|
|
|
pendingInvalidate = true;
|
|
|
|
}
|
2007-06-25 02:32:31 +02:00
|
|
|
} else {
|
2007-06-27 07:23:10 +02:00
|
|
|
// Read to a read: no conflict, so no need to record as
|
|
|
|
// target, but make sure neither reader thinks he's getting an
|
|
|
|
// exclusive copy
|
|
|
|
pendingShared = true;
|
|
|
|
pkt->assertShared();
|
2006-06-28 17:02:14 +02:00
|
|
|
}
|
2007-06-25 02:32:31 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
bool
|
|
|
|
MSHR::promoteDeferredTargets()
|
|
|
|
{
|
|
|
|
if (deferredTargets.empty()) {
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
assert(targets.empty());
|
|
|
|
targets = deferredTargets;
|
|
|
|
deferredTargets.clear();
|
2006-06-28 17:02:14 +02:00
|
|
|
assert(targets.size() == ntargets);
|
|
|
|
|
2007-06-25 02:32:31 +02:00
|
|
|
needsExclusive = deferredNeedsExclusive;
|
|
|
|
pendingInvalidate = false;
|
2007-06-27 07:23:10 +02:00
|
|
|
pendingShared = false;
|
2007-06-25 02:32:31 +02:00
|
|
|
deferredNeedsExclusive = false;
|
2007-06-25 15:47:05 +02:00
|
|
|
order = targets.front().order;
|
2007-06-30 22:34:16 +02:00
|
|
|
readyTime = std::max(curTick, targets.front().readyTime);
|
2007-06-25 02:32:31 +02:00
|
|
|
|
|
|
|
return true;
|
2006-06-28 17:02:14 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2007-06-26 23:53:15 +02:00
|
|
|
void
|
2007-06-27 07:23:10 +02:00
|
|
|
MSHR::handleFill(Packet *pkt, CacheBlk *blk)
|
2007-06-26 23:53:15 +02:00
|
|
|
{
|
2007-06-27 08:30:30 +02:00
|
|
|
if (pendingShared) {
|
2007-06-27 07:23:10 +02:00
|
|
|
// we snooped another read while this read was in
|
|
|
|
// service... assert shared line on its behalf
|
|
|
|
pkt->assertShared();
|
2007-06-26 23:53:15 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2006-06-28 17:02:14 +02:00
|
|
|
void
|
|
|
|
MSHR::dump()
|
|
|
|
{
|
|
|
|
ccprintf(cerr,
|
|
|
|
"inService: %d thread: %d\n"
|
2006-08-15 22:21:46 +02:00
|
|
|
"Addr: %x ntargets %d\n"
|
2006-06-28 17:02:14 +02:00
|
|
|
"Targets:\n",
|
2006-08-15 22:21:46 +02:00
|
|
|
inService, threadNum, addr, ntargets);
|
2006-06-28 17:02:14 +02:00
|
|
|
|
|
|
|
TargetListIterator tar_it = targets.begin();
|
|
|
|
for (int i = 0; i < ntargets; i++) {
|
|
|
|
assert(tar_it != targets.end());
|
|
|
|
|
2007-06-18 02:27:53 +02:00
|
|
|
ccprintf(cerr, "\t%d: Addr: %x cmd: %s\n",
|
|
|
|
i, tar_it->pkt->getAddr(), tar_it->pkt->cmdString());
|
2006-06-28 17:02:14 +02:00
|
|
|
|
|
|
|
tar_it++;
|
|
|
|
}
|
|
|
|
ccprintf(cerr, "\n");
|
|
|
|
}
|
|
|
|
|
|
|
|
MSHR::~MSHR()
|
|
|
|
{
|
|
|
|
}
|