packet_queue.cc revision 3403 
14202Sbinkertn@umich.edu/*
24202Sbinkertn@umich.edu * Copyright (c) 2006 The Regents of The University of Michigan
34202Sbinkertn@umich.edu * All rights reserved.
44202Sbinkertn@umich.edu *
54202Sbinkertn@umich.edu * Redistribution and use in source and binary forms, with or without
64202Sbinkertn@umich.edu * modification, are permitted provided that the following conditions are
74202Sbinkertn@umich.edu * met: redistributions of source code must retain the above copyright
84202Sbinkertn@umich.edu * notice, this list of conditions and the following disclaimer;
94202Sbinkertn@umich.edu * redistributions in binary form must reproduce the above copyright
104202Sbinkertn@umich.edu * notice, this list of conditions and the following disclaimer in the
114202Sbinkertn@umich.edu * documentation and/or other materials provided with the distribution;
124202Sbinkertn@umich.edu * neither the name of the copyright holders nor the names of its
134202Sbinkertn@umich.edu * contributors may be used to endorse or promote products derived from
144202Sbinkertn@umich.edu * this software without specific prior written permission.
154202Sbinkertn@umich.edu *
164202Sbinkertn@umich.edu * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
174202Sbinkertn@umich.edu * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
184202Sbinkertn@umich.edu * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
194202Sbinkertn@umich.edu * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
204202Sbinkertn@umich.edu * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
214202Sbinkertn@umich.edu * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
224202Sbinkertn@umich.edu * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
234202Sbinkertn@umich.edu * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
244202Sbinkertn@umich.edu * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
254202Sbinkertn@umich.edu * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
264202Sbinkertn@umich.edu * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
274202Sbinkertn@umich.edu *
284202Sbinkertn@umich.edu * Authors: Ali Saidi
294202Sbinkertn@umich.edu */
304202Sbinkertn@umich.edu
314202Sbinkertn@umich.edu#include "mem/tport.hh"
324202Sbinkertn@umich.edu
337768SAli.Saidi@ARM.comvoid
347768SAli.Saidi@ARM.comSimpleTimingPort::recvFunctional(PacketPtr pkt)
358831Smrinmoy.ghosh@arm.com{
367768SAli.Saidi@ARM.com    std::list<std::pair<Tick,PacketPtr> >::iterator i = transmitList.begin();
375337Sstever@gmail.com    std::list<std::pair<Tick,PacketPtr> >::iterator end = transmitList.end();
385337Sstever@gmail.com    bool done = false;
395337Sstever@gmail.com
405337Sstever@gmail.com    while (i != end && !done) {
414202Sbinkertn@umich.edu        PacketPtr target = i->second;
42        // If the target contains data, and it overlaps the
43        // probed request, need to update data
44        if (target->intersect(pkt))
45            done = fixPacket(pkt, target);
46
47    }
48
49    //Then just do an atomic access and throw away the returned latency
50    if (pkt->result != Packet::Success)
51        recvAtomic(pkt);
52}
53
54bool
55SimpleTimingPort::recvTiming(PacketPtr pkt)
56{
57    // If the device is only a slave, it should only be sending
58    // responses, which should never get nacked.  There used to be
59    // code to hanldle nacks here, but I'm pretty sure it didn't work
60    // correctly with the drain code, so that would need to be fixed
61    // if we ever added it back.
62    assert(pkt->result != Packet::Nacked);
63    Tick latency = recvAtomic(pkt);
64    // turn packet around to go back to requester if response expected
65    if (pkt->needsResponse()) {
66        pkt->makeTimingResponse();
67        sendTiming(pkt, latency);
68    }
69    else {
70        if (pkt->cmd != Packet::UpgradeReq)
71        {
72            delete pkt->req;
73            delete pkt;
74        }
75    }
76    return true;
77}
78
79void
80SimpleTimingPort::recvRetry()
81{
82    assert(!transmitList.empty());
83    if (Port::sendTiming(transmitList.front().second)) {
84        transmitList.pop_front();
85        DPRINTF(Bus, "No Longer waiting on retry\n");
86        if (!transmitList.empty()) {
87            Tick time = transmitList.front().first;
88            sendEvent.schedule(time <= curTick ? curTick+1 : time);
89        }
90    }
91
92    if (transmitList.empty() && drainEvent) {
93        drainEvent->process();
94        drainEvent = NULL;
95    }
96}
97
98void
99SimpleTimingPort::sendTiming(PacketPtr pkt, Tick time)
100{
101    if (transmitList.empty()) {
102        assert(!sendEvent.scheduled());
103        sendEvent.schedule(curTick+time);
104    }
105    transmitList.push_back(std::pair<Tick,PacketPtr>(time+curTick,pkt));
106}
107
108void
109SimpleTimingPort::SendEvent::process()
110{
111    assert(port->transmitList.size());
112    assert(port->transmitList.front().first <= curTick);
113    if (port->Port::sendTiming(port->transmitList.front().second)) {
114        //send successful, remove packet
115        port->transmitList.pop_front();
116        if (!port->transmitList.empty()) {
117            Tick time = port->transmitList.front().first;
118            schedule(time <= curTick ? curTick+1 : time);
119        }
120        if (port->transmitList.empty() && port->drainEvent) {
121            port->drainEvent->process();
122            port->drainEvent = NULL;
123        }
124        return;
125    }
126    // send unsuccessful (due to flow control).  Will get retry
127    // callback later; save for then if not already
128    DPRINTF(Bus, "Waiting on retry\n");
129}
130
131
132unsigned int
133SimpleTimingPort::drain(Event *de)
134{
135    if (transmitList.size() == 0)
136        return 0;
137    drainEvent = de;
138    return 1;
139}
140