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>
|
|
|
|
|
|
|
|
#include "mem/cache/miss/mshr.hh"
|
|
|
|
#include "sim/root.hh" // for curTick
|
|
|
|
#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
|
2006-08-15 22:21:46 +02:00
|
|
|
MSHR::allocate(Packet::Command cmd, Addr _addr, int size,
|
2006-06-28 17:02:14 +02:00
|
|
|
Packet * &target)
|
|
|
|
{
|
2006-07-10 23:16:15 +02:00
|
|
|
addr = _addr;
|
2006-07-05 21:13:27 +02:00
|
|
|
if (target)
|
|
|
|
{
|
|
|
|
//Have a request, just use it
|
|
|
|
pkt = new Packet(target->req, cmd, Packet::Broadcast, size);
|
|
|
|
pkt->time = curTick;
|
|
|
|
pkt->allocate();
|
|
|
|
pkt->senderState = (Packet::SenderState *)this;
|
2006-06-28 17:02:14 +02:00
|
|
|
allocateTarget(target);
|
|
|
|
}
|
2006-07-05 21:13:27 +02:00
|
|
|
else
|
|
|
|
{
|
|
|
|
//need a request first
|
|
|
|
Request * req = new Request();
|
|
|
|
req->setPhys(addr, size, 0);
|
|
|
|
//Thread context??
|
|
|
|
pkt = new Packet(req, cmd, Packet::Broadcast, size);
|
|
|
|
pkt->time = curTick;
|
|
|
|
pkt->allocate();
|
|
|
|
pkt->senderState = (Packet::SenderState *)this;
|
|
|
|
}
|
2006-06-28 17:02:14 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
// Since we aren't sure if data is being used, don't copy here.
|
|
|
|
/**
|
|
|
|
* @todo When we have a "global" data flag, might want to copy data here.
|
|
|
|
*/
|
|
|
|
void
|
|
|
|
MSHR::allocateAsBuffer(Packet * &target)
|
|
|
|
{
|
2006-06-29 22:07:19 +02:00
|
|
|
addr = target->getAddr();
|
2006-10-06 15:15:53 +02:00
|
|
|
threadNum = 0/*target->req->getThreadNum()*/;
|
2006-06-29 22:07:19 +02:00
|
|
|
pkt = new Packet(target->req, target->cmd, -1);
|
2006-06-30 17:34:27 +02:00
|
|
|
pkt->allocate();
|
2006-06-29 22:07:19 +02:00
|
|
|
pkt->senderState = (Packet::SenderState*)this;
|
2006-06-28 20:35:00 +02:00
|
|
|
pkt->time = curTick;
|
2006-06-28 17:02:14 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
MSHR::deallocate()
|
|
|
|
{
|
|
|
|
assert(targets.empty());
|
|
|
|
assert(ntargets == 0);
|
2006-10-10 07:32:18 +02:00
|
|
|
delete pkt;
|
2006-06-28 17:02:14 +02:00
|
|
|
pkt = NULL;
|
|
|
|
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
|
|
|
|
MSHR::allocateTarget(Packet * &target)
|
|
|
|
{
|
|
|
|
//If we append an invalidate and we issued a read to the bus,
|
|
|
|
//but now have some pending writes, we need to move
|
|
|
|
//the invalidate to before the first non-read
|
2006-06-29 22:07:19 +02:00
|
|
|
if (inService && pkt->isRead() && target->isInvalidate()) {
|
2006-06-28 17:02:14 +02:00
|
|
|
std::list<Packet *> temp;
|
|
|
|
|
|
|
|
while (!targets.empty()) {
|
2006-06-29 22:07:19 +02:00
|
|
|
if (!targets.front()->isRead()) break;
|
2006-06-28 17:02:14 +02:00
|
|
|
//Place on top of temp stack
|
|
|
|
temp.push_front(targets.front());
|
|
|
|
//Remove from targets
|
|
|
|
targets.pop_front();
|
|
|
|
}
|
|
|
|
|
|
|
|
//Now that we have all the reads off until first non-read, we can
|
|
|
|
//place the invalidate on
|
|
|
|
targets.push_front(target);
|
|
|
|
|
|
|
|
//Now we pop off the temp_stack and put them back
|
|
|
|
while (!temp.empty()) {
|
|
|
|
targets.push_front(temp.front());
|
|
|
|
temp.pop_front();
|
|
|
|
}
|
|
|
|
}
|
|
|
|
else {
|
|
|
|
targets.push_back(target);
|
|
|
|
}
|
|
|
|
|
|
|
|
++ntargets;
|
|
|
|
assert(targets.size() == ntargets);
|
|
|
|
/**
|
|
|
|
* @todo really prioritize the target commands.
|
|
|
|
*/
|
|
|
|
|
2006-06-29 22:07:19 +02:00
|
|
|
if (!inService && target->isWrite()) {
|
|
|
|
pkt->cmd = Packet::WriteReq;
|
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());
|
|
|
|
|
|
|
|
ccprintf(cerr, "\t%d: Addr: %x cmd: %d\n",
|
2006-06-29 22:07:19 +02:00
|
|
|
i, (*tar_it)->getAddr(), (*tar_it)->cmdToIndex());
|
2006-06-28 17:02:14 +02:00
|
|
|
|
|
|
|
tar_it++;
|
|
|
|
}
|
|
|
|
ccprintf(cerr, "\n");
|
|
|
|
}
|
|
|
|
|
|
|
|
MSHR::~MSHR()
|
|
|
|
{
|
|
|
|
if (pkt)
|
|
|
|
pkt = NULL;
|
|
|
|
}
|