2 * Copyright (c) 2006 The Regents of The University of Michigan
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions are
7 * met: redistributions of source code must retain the above copyright
8 * notice, this list of conditions and the following disclaimer;
9 * redistributions in binary form must reproduce the above copyright
10 * notice, this list of conditions and the following disclaimer in the
11 * documentation and/or other materials provided with the distribution;
12 * neither the name of the copyright holders nor the names of its
13 * contributors may be used to endorse or promote products derived from
14 * this software without specific prior written permission.
16 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
17 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
18 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
19 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
20 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
21 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
22 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
23 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
24 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
25 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
26 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
31 #include "mem/tport.hh"
34 SimpleTimingPort::recvFunctional(PacketPtr pkt
)
36 std::list
<std::pair
<Tick
,PacketPtr
> >::iterator i
= transmitList
.begin();
37 std::list
<std::pair
<Tick
,PacketPtr
> >::iterator end
= transmitList
.end();
40 while (i
!= end
&& notDone
) {
41 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 notDone
= fixPacket(pkt
, target
);
50 //Then just do an atomic access and throw away the returned latency
51 if (pkt
->result
!= Packet::Success
)
56 SimpleTimingPort::recvTiming(PacketPtr pkt
)
58 // If the device is only a slave, it should only be sending
59 // responses, which should never get nacked. There used to be
60 // code to hanldle nacks here, but I'm pretty sure it didn't work
61 // correctly with the drain code, so that would need to be fixed
62 // if we ever added it back.
63 assert(pkt
->result
!= Packet::Nacked
);
64 Tick latency
= recvAtomic(pkt
);
65 // turn packet around to go back to requester if response expected
66 if (pkt
->needsResponse()) {
67 pkt
->makeTimingResponse();
68 sendTiming(pkt
, latency
);
71 if (pkt
->cmd
!= MemCmd::UpgradeReq
)
81 SimpleTimingPort::recvRetry()
83 assert(!transmitList
.empty());
84 if (Port::sendTiming(transmitList
.front().second
)) {
85 transmitList
.pop_front();
86 DPRINTF(Bus
, "No Longer waiting on retry\n");
87 if (!transmitList
.empty()) {
88 Tick time
= transmitList
.front().first
;
89 sendEvent
.schedule(time
<= curTick
? curTick
+1 : time
);
93 if (transmitList
.empty() && drainEvent
) {
94 drainEvent
->process();
100 SimpleTimingPort::sendTiming(PacketPtr pkt
, Tick time
)
102 // Nothing is on the list: add it and schedule an event
103 if (transmitList
.empty()) {
104 assert(!sendEvent
.scheduled());
105 sendEvent
.schedule(curTick
+time
);
106 transmitList
.push_back(std::pair
<Tick
,PacketPtr
>(time
+curTick
,pkt
));
110 // something is on the list and this belongs at the end
111 if (time
+curTick
>= transmitList
.back().first
) {
112 transmitList
.push_back(std::pair
<Tick
,PacketPtr
>(time
+curTick
,pkt
));
115 // Something is on the list and this belongs somewhere else
116 std::list
<std::pair
<Tick
,PacketPtr
> >::iterator i
= transmitList
.begin();
117 std::list
<std::pair
<Tick
,PacketPtr
> >::iterator end
= transmitList
.end();
120 while (i
!= end
&& !done
) {
121 if (time
+curTick
< i
->first
) {
122 if (i
== transmitList
.begin()) {
123 //Inserting at begining, reschedule
124 sendEvent
.reschedule(time
+curTick
);
126 transmitList
.insert(i
,std::pair
<Tick
,PacketPtr
>(time
+curTick
,pkt
));
135 SimpleTimingPort::SendEvent::process()
137 assert(port
->transmitList
.size());
138 assert(port
->transmitList
.front().first
<= curTick
);
139 if (port
->Port::sendTiming(port
->transmitList
.front().second
)) {
140 //send successful, remove packet
141 port
->transmitList
.pop_front();
142 if (!port
->transmitList
.empty()) {
143 Tick time
= port
->transmitList
.front().first
;
144 schedule(time
<= curTick
? curTick
+1 : time
);
146 if (port
->transmitList
.empty() && port
->drainEvent
) {
147 port
->drainEvent
->process();
148 port
->drainEvent
= NULL
;
152 // send unsuccessful (due to flow control). Will get retry
153 // callback later; save for then if not already
154 DPRINTF(Bus
, "Waiting on retry\n");
159 SimpleTimingPort::drain(Event
*de
)
161 if (transmitList
.size() == 0)