/*
+ * Copyright (c) 2012 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) 2006 The Regents of The University of Michigan
* All rights reserved.
*
* 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"
+#include "sim/sim_object.hh"
-void
-SimpleTimingPort::recvFunctional(PacketPtr pkt)
+SimpleTimingPort::SimpleTimingPort(const std::string& _name,
+ SimObject* _owner) :
+ QueuedResponsePort(_name, _owner, queueImpl), queueImpl(*_owner, *this)
{
- std::list<std::pair<Tick,PacketPtr> >::iterator i = transmitList.begin();
- std::list<std::pair<Tick,PacketPtr> >::iterator end = transmitList.end();
- bool done = false;
-
- while (i != end && !done) {
- PacketPtr target = i->second;
- // If the target contains data, and it overlaps the
- // probed request, need to update data
- if (target->intersect(pkt))
- done = fixPacket(pkt, target);
-
- i++;
- }
-
- //Then just do an atomic access and throw away the returned latency
- if (pkt->result != Packet::Success)
- recvAtomic(pkt);
-}
-
-bool
-SimpleTimingPort::recvTiming(PacketPtr 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);
- // turn packet around to go back to requester if response expected
- if (pkt->needsResponse()) {
- pkt->makeTimingResponse();
- sendTiming(pkt, latency);
- }
- else {
- if (pkt->cmd != Packet::UpgradeReq)
- {
- delete pkt->req;
- delete pkt;
- }
- }
- return true;
}
void
-SimpleTimingPort::recvRetry()
+SimpleTimingPort::recvFunctional(PacketPtr pkt)
{
- assert(!transmitList.empty());
- if (Port::sendTiming(transmitList.front().second)) {
- transmitList.pop_front();
- DPRINTF(Bus, "No Longer waiting on retry\n");
- if (!transmitList.empty()) {
- Tick time = transmitList.front().first;
- sendEvent.schedule(time <= curTick ? curTick+1 : time);
- }
- }
-
- if (transmitList.empty() && drainEvent) {
- drainEvent->process();
- drainEvent = NULL;
+ if (!respQueue.trySatisfyFunctional(pkt)) {
+ // do an atomic access and throw away the returned latency
+ recvAtomic(pkt);
}
}
-void
-SimpleTimingPort::sendTiming(PacketPtr pkt, Tick time)
+bool
+SimpleTimingPort::recvTimingReq(PacketPtr pkt)
{
- // Nothing is on the list: add it and schedule an event
- if (transmitList.empty()) {
- assert(!sendEvent.scheduled());
- sendEvent.schedule(curTick+time);
- transmitList.push_back(std::pair<Tick,PacketPtr>(time+curTick,pkt));
- return;
- }
+ // the SimpleTimingPort should not be used anywhere where there is
+ // a need to deal with snoop responses and their flow control
+ // requirements
+ if (pkt->cacheResponding())
+ panic("SimpleTimingPort should never see packets with the "
+ "cacheResponding flag set\n");
- // something is on the list and this belongs at the end
- if (time+curTick >= transmitList.back().first) {
- transmitList.push_back(std::pair<Tick,PacketPtr>(time+curTick,pkt));
- return;
- }
- // Something is on the list and this belongs somewhere else
- std::list<std::pair<Tick,PacketPtr> >::iterator i = transmitList.begin();
- std::list<std::pair<Tick,PacketPtr> >::iterator end = transmitList.end();
- bool done = false;
-
- while (i != end && !done) {
- if (time+curTick < i->first)
- transmitList.insert(i,std::pair<Tick,PacketPtr>(time+curTick,pkt));
- i++;
- }
-}
-
-void
-SimpleTimingPort::SendEvent::process()
-{
- assert(port->transmitList.size());
- assert(port->transmitList.front().first <= curTick);
- if (port->Port::sendTiming(port->transmitList.front().second)) {
- //send successful, remove packet
- port->transmitList.pop_front();
- if (!port->transmitList.empty()) {
- Tick time = port->transmitList.front().first;
- schedule(time <= curTick ? curTick+1 : time);
- }
- if (port->transmitList.empty() && port->drainEvent) {
- port->drainEvent->process();
- port->drainEvent = NULL;
- }
- return;
+ bool needsResponse = pkt->needsResponse();
+ Tick latency = recvAtomic(pkt);
+ // turn packet around to go back to requestor if response expected
+ if (needsResponse) {
+ // recvAtomic() should already have turned packet into
+ // atomic response
+ assert(pkt->isResponse());
+ schedTimingResp(pkt, curTick() + latency);
+ } else {
+ // queue the packet for deletion
+ pendingDelete.reset(pkt);
}
- // send unsuccessful (due to flow control). Will get retry
- // callback later; save for then if not already
- DPRINTF(Bus, "Waiting on retry\n");
-}
-
-unsigned int
-SimpleTimingPort::drain(Event *de)
-{
- if (transmitList.size() == 0)
- return 0;
- drainEvent = de;
- return 1;
+ return true;
}
projects / gem5.git / blobdiff