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
|
|
|
|
SimpleTimingPort::recvFunctional(Packet *pkt)
|
|
|
|
{
|
2006-10-12 19:59:03 +02:00
|
|
|
//First check queued events
|
|
|
|
std::list<Packet *>::iterator i = transmitList.begin();
|
|
|
|
std::list<Packet *>::iterator end = transmitList.end();
|
2006-10-12 21:30:30 +02:00
|
|
|
bool cont = true;
|
|
|
|
|
|
|
|
while (i != end && cont) {
|
2006-10-12 19:59:03 +02:00
|
|
|
Packet * target = *i;
|
|
|
|
// If the target contains data, and it overlaps the
|
|
|
|
// probed request, need to update data
|
2006-10-12 21:30:30 +02:00
|
|
|
if (target->intersect(pkt))
|
|
|
|
fixPacket(pkt, target);
|
2006-10-12 19:59:03 +02:00
|
|
|
|
|
|
|
}
|
|
|
|
//Then just do an atomic access and throw away the returned latency
|
2006-10-12 21:30:30 +02:00
|
|
|
if (cont)
|
|
|
|
recvAtomic(pkt);
|
2006-08-31 01:24:26 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
bool
|
|
|
|
SimpleTimingPort::recvTiming(Packet *pkt)
|
|
|
|
{
|
|
|
|
// 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();
|
|
|
|
sendTimingLater(pkt, latency);
|
|
|
|
}
|
2006-10-17 22:47:22 +02:00
|
|
|
else {
|
|
|
|
if (pkt->cmd != Packet::UpgradeReq)
|
|
|
|
{
|
|
|
|
delete pkt->req;
|
|
|
|
delete pkt;
|
|
|
|
}
|
|
|
|
}
|
2006-08-31 01:24:26 +02:00
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2006-07-21 01:03:47 +02:00
|
|
|
void
|
|
|
|
SimpleTimingPort::recvRetry()
|
|
|
|
{
|
2006-10-12 01:25:48 +02:00
|
|
|
assert(outTiming > 0);
|
|
|
|
assert(!transmitList.empty());
|
|
|
|
if (sendTiming(transmitList.front())) {
|
|
|
|
transmitList.pop_front();
|
|
|
|
outTiming--;
|
|
|
|
DPRINTF(Bus, "No Longer waiting on retry\n");
|
|
|
|
if (!transmitList.empty())
|
|
|
|
sendTimingLater(transmitList.front(), 1);
|
2006-07-21 01:03:47 +02:00
|
|
|
}
|
2006-10-12 01:25:48 +02:00
|
|
|
|
|
|
|
if (transmitList.empty() && drainEvent) {
|
2006-08-31 01:24:26 +02:00
|
|
|
drainEvent->process();
|
|
|
|
drainEvent = NULL;
|
|
|
|
}
|
2006-07-21 01:03:47 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
SimpleTimingPort::SendEvent::process()
|
|
|
|
{
|
2006-10-12 01:25:48 +02:00
|
|
|
assert(port->outTiming > 0);
|
|
|
|
if (!port->transmitList.empty() && port->transmitList.front() != packet) {
|
|
|
|
//We are not the head of the list
|
2006-10-10 06:49:27 +02:00
|
|
|
port->transmitList.push_back(packet);
|
2006-10-10 23:24:03 +02:00
|
|
|
} else if (port->sendTiming(packet)) {
|
2006-10-10 06:49:27 +02:00
|
|
|
// send successful
|
2006-10-12 01:25:48 +02:00
|
|
|
if (port->transmitList.size()) {
|
|
|
|
port->transmitList.pop_front();
|
|
|
|
port->outTiming--;
|
|
|
|
if (!port->transmitList.empty())
|
|
|
|
port->sendTimingLater(port->transmitList.front(), 1);
|
|
|
|
}
|
|
|
|
if (port->transmitList.empty() && port->drainEvent) {
|
2006-08-31 01:24:26 +02:00
|
|
|
port->drainEvent->process();
|
|
|
|
port->drainEvent = NULL;
|
|
|
|
}
|
2006-07-21 01:03:47 +02:00
|
|
|
} else {
|
2006-08-31 01:24:26 +02:00
|
|
|
// send unsuccessful (due to flow control). Will get retry
|
2006-10-12 01:25:48 +02:00
|
|
|
// callback later; save for then if not already
|
|
|
|
DPRINTF(Bus, "Waiting on retry\n");
|
|
|
|
if (!(port->transmitList.front() == packet))
|
|
|
|
port->transmitList.push_back(packet);
|
2006-07-21 01:03:47 +02:00
|
|
|
}
|
2006-08-31 01:24:26 +02:00
|
|
|
}
|
2006-07-21 01:03:47 +02:00
|
|
|
|
|
|
|
|
|
|
|
unsigned int
|
|
|
|
SimpleTimingPort::drain(Event *de)
|
|
|
|
{
|
|
|
|
if (outTiming == 0 && transmitList.size() == 0)
|
|
|
|
return 0;
|
|
|
|
drainEvent = de;
|
|
|
|
return 1;
|
|
|
|
}
|