2006-07-21 01:03:47 +02:00
|
|
|
/*
|
|
|
|
* Copyright (c) 2006 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: Ali Saidi
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include "mem/tport.hh"
|
|
|
|
|
2006-08-31 01:24:26 +02:00
|
|
|
void
|
2007-05-28 17:11:43 +02:00
|
|
|
SimpleTimingPort::checkFunctional(PacketPtr pkt)
|
2006-08-31 01:24:26 +02:00
|
|
|
{
|
2007-05-28 17:11:43 +02:00
|
|
|
DeferredPacketIterator i = transmitList.begin();
|
|
|
|
DeferredPacketIterator end = transmitList.end();
|
2006-10-12 21:30:30 +02:00
|
|
|
|
2007-05-30 07:23:41 +02:00
|
|
|
for (; i != end; ++i) {
|
2007-05-28 17:11:43 +02:00
|
|
|
PacketPtr target = i->pkt;
|
2006-10-12 19:59:03 +02:00
|
|
|
// If the target contains data, and it overlaps the
|
|
|
|
// probed request, need to update data
|
2007-05-28 17:11:43 +02:00
|
|
|
if (target->intersect(pkt)) {
|
|
|
|
if (!fixPacket(pkt, target)) {
|
|
|
|
// fixPacket returns true for continue, false for done
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
}
|
2006-10-12 19:59:03 +02:00
|
|
|
}
|
2007-05-28 17:11:43 +02:00
|
|
|
}
|
2006-10-20 19:01:21 +02:00
|
|
|
|
2007-05-28 17:11:43 +02:00
|
|
|
void
|
|
|
|
SimpleTimingPort::recvFunctional(PacketPtr pkt)
|
|
|
|
{
|
|
|
|
checkFunctional(pkt);
|
|
|
|
|
|
|
|
// Just do an atomic access and throw away the returned latency
|
2006-10-20 19:01:21 +02:00
|
|
|
if (pkt->result != Packet::Success)
|
2006-10-12 21:30:30 +02:00
|
|
|
recvAtomic(pkt);
|
2006-08-31 01:24:26 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
bool
|
2006-10-20 09:10:12 +02:00
|
|
|
SimpleTimingPort::recvTiming(PacketPtr pkt)
|
2006-08-31 01:24:26 +02:00
|
|
|
{
|
|
|
|
// If the device is only a slave, it should only be sending
|
|
|
|
// responses, which should never get nacked. There used to be
|
|
|
|
// code to hanldle nacks here, but I'm pretty sure it didn't work
|
|
|
|
// correctly with the drain code, so that would need to be fixed
|
|
|
|
// if we ever added it back.
|
|
|
|
assert(pkt->result != Packet::Nacked);
|
|
|
|
Tick latency = recvAtomic(pkt);
|
2006-10-09 01:05:48 +02:00
|
|
|
// turn packet around to go back to requester if response expected
|
|
|
|
if (pkt->needsResponse()) {
|
|
|
|
pkt->makeTimingResponse();
|
2007-05-30 07:53:28 +02:00
|
|
|
schedSendTiming(pkt, curTick + latency);
|
2006-10-09 01:05:48 +02:00
|
|
|
}
|
2007-05-28 17:11:43 +02:00
|
|
|
else if (pkt->cmd != MemCmd::UpgradeReq) {
|
|
|
|
delete pkt->req;
|
|
|
|
delete pkt;
|
2006-10-17 22:47:22 +02:00
|
|
|
}
|
2006-08-31 01:24:26 +02:00
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2006-07-21 01:03:47 +02:00
|
|
|
|
2006-10-26 00:34:21 +02:00
|
|
|
void
|
2007-05-30 07:23:41 +02:00
|
|
|
SimpleTimingPort::schedSendTiming(PacketPtr pkt, Tick when)
|
2006-10-26 00:34:21 +02:00
|
|
|
{
|
2007-05-30 07:23:41 +02:00
|
|
|
assert(when > curTick);
|
|
|
|
|
2006-10-31 19:23:17 +01:00
|
|
|
// Nothing is on the list: add it and schedule an event
|
2006-10-26 00:34:21 +02:00
|
|
|
if (transmitList.empty()) {
|
2007-05-28 17:11:43 +02:00
|
|
|
assert(!sendEvent->scheduled());
|
2007-05-30 07:23:41 +02:00
|
|
|
sendEvent->schedule(when);
|
|
|
|
transmitList.push_back(DeferredPacket(when, pkt));
|
2006-10-31 19:23:17 +01:00
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
// something is on the list and this belongs at the end
|
2007-05-30 07:23:41 +02:00
|
|
|
if (when >= transmitList.back().tick) {
|
|
|
|
transmitList.push_back(DeferredPacket(when, pkt));
|
2006-10-31 19:23:17 +01:00
|
|
|
return;
|
|
|
|
}
|
|
|
|
// Something is on the list and this belongs somewhere else
|
2007-05-28 17:11:43 +02:00
|
|
|
DeferredPacketIterator i = transmitList.begin();
|
|
|
|
DeferredPacketIterator end = transmitList.end();
|
2006-10-31 19:23:17 +01:00
|
|
|
|
2007-05-30 07:23:41 +02:00
|
|
|
for (; i != end; ++i) {
|
|
|
|
if (when < i->tick) {
|
2006-11-12 13:16:34 +01:00
|
|
|
if (i == transmitList.begin()) {
|
|
|
|
//Inserting at begining, reschedule
|
2007-05-30 07:23:41 +02:00
|
|
|
sendEvent->reschedule(when);
|
2006-11-12 13:16:34 +01:00
|
|
|
}
|
2007-05-30 07:23:41 +02:00
|
|
|
transmitList.insert(i, DeferredPacket(when, pkt));
|
|
|
|
return;
|
2006-11-12 13:16:34 +01:00
|
|
|
}
|
2006-10-26 00:34:21 +02:00
|
|
|
}
|
2007-05-30 07:23:41 +02:00
|
|
|
assert(false); // should never get here
|
2006-10-26 00:34:21 +02:00
|
|
|
}
|
|
|
|
|
2007-05-30 07:23:41 +02:00
|
|
|
|
2006-07-21 01:03:47 +02:00
|
|
|
void
|
2007-05-30 07:23:41 +02:00
|
|
|
SimpleTimingPort::sendDeferredPacket()
|
2006-07-21 01:03:47 +02:00
|
|
|
{
|
2007-05-30 07:23:41 +02:00
|
|
|
assert(deferredPacketReady());
|
|
|
|
bool success = sendTiming(transmitList.front().pkt);
|
|
|
|
|
|
|
|
if (success) {
|
2006-10-26 00:34:21 +02:00
|
|
|
//send successful, remove packet
|
2007-05-28 17:11:43 +02:00
|
|
|
transmitList.pop_front();
|
|
|
|
if (!transmitList.empty()) {
|
|
|
|
Tick time = transmitList.front().tick;
|
|
|
|
sendEvent->schedule(time <= curTick ? curTick+1 : time);
|
2006-10-12 01:25:48 +02:00
|
|
|
}
|
2007-05-30 07:23:41 +02:00
|
|
|
|
2007-05-28 17:11:43 +02:00
|
|
|
if (transmitList.empty() && drainEvent) {
|
|
|
|
drainEvent->process();
|
|
|
|
drainEvent = NULL;
|
2006-08-31 01:24:26 +02:00
|
|
|
}
|
2006-07-21 01:03:47 +02:00
|
|
|
}
|
2007-05-30 07:23:41 +02:00
|
|
|
|
|
|
|
waitingOnRetry = !success;
|
|
|
|
|
|
|
|
if (waitingOnRetry) {
|
|
|
|
DPRINTF(Bus, "Send failed, waiting on retry\n");
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
void
|
|
|
|
SimpleTimingPort::recvRetry()
|
|
|
|
{
|
|
|
|
DPRINTF(Bus, "Received retry\n");
|
|
|
|
assert(waitingOnRetry);
|
|
|
|
sendDeferredPacket();
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
void
|
|
|
|
SimpleTimingPort::processSendEvent()
|
|
|
|
{
|
|
|
|
assert(!waitingOnRetry);
|
|
|
|
sendDeferredPacket();
|
2006-08-31 01:24:26 +02:00
|
|
|
}
|
2006-07-21 01:03:47 +02:00
|
|
|
|
|
|
|
|
|
|
|
unsigned int
|
|
|
|
SimpleTimingPort::drain(Event *de)
|
|
|
|
{
|
2006-10-26 00:34:21 +02:00
|
|
|
if (transmitList.size() == 0)
|
2006-07-21 01:03:47 +02:00
|
|
|
return 0;
|
|
|
|
drainEvent = de;
|
|
|
|
return 1;
|
|
|
|
}
|