1/*
2 * Copyright (c) 2006 The Regents of The University of Michigan
3 * All rights reserved.
4 *
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.
15 *
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.
27 */
28
29#include "base/trace.hh"
30#include "dev/io_device.hh"
31#include "sim/builder.hh"
32
33
34PioPort::PioPort(PioDevice *dev, Platform *p)
35 : Port(dev->name() + "-pioport"), device(dev), platform(p)
36{ }
37
38
39Tick
40PioPort::recvAtomic(Packet *pkt)
41{
42 return device->recvAtomic(pkt);
43}
44
45void
46PioPort::recvFunctional(Packet *pkt)
47{
48 device->recvAtomic(pkt);
49}
50
51void
52PioPort::getDeviceAddressRanges(AddrRangeList &resp, AddrRangeList &snoop)
53{
54 snoop.clear();
55 device->addressRanges(resp);
56}
57
58
59void
60PioPort::recvRetry()
61{
62 Packet* pkt = transmitList.front();
63 if (Port::sendTiming(pkt)) {
64 transmitList.pop_front();
65 }
66}
67
68
69void
70PioPort::SendEvent::process()
71{
72 if (port->Port::sendTiming(packet))
73 return;
74
75 port->transmitList.push_back(packet);
76}
77
78
79
80bool
81PioPort::recvTiming(Packet *pkt)
82{
83 Tick latency = device->recvAtomic(pkt);
84 // turn packet around to go back to requester
85 pkt->makeTimingResponse();
86 sendTiming(pkt, latency);
87 return true;
88}
89
90PioDevice::~PioDevice()
91{
92 if (pioPort)
93 delete pioPort;
94}
95
96void
97PioDevice::init()
98{
99 if (!pioPort)
100 panic("Pio port not connected to anything!");
101 pioPort->sendStatusChange(Port::RangeChange);
102}
103
104void
105BasicPioDevice::addressRanges(AddrRangeList &range_list)
106{
107 assert(pioSize != 0);
108 range_list.clear();
109 range_list.push_back(RangeSize(pioAddr, pioSize));
110}
111
112
113DmaPort::DmaPort(DmaDevice *dev, Platform *p)
114 : Port(dev->name() + "-dmaport"), device(dev), platform(p), pendingCount(0)
115{ }
116
117bool
118DmaPort::recvTiming(Packet *pkt)
119{
120 if (pkt->senderState) {
121 DmaReqState *state;
122 DPRINTF(DMA, "Received response Packet %#x with senderState: %#x\n",
123 pkt, pkt->senderState);
124 state = dynamic_cast<DmaReqState*>(pkt->senderState);
125 assert(state);
126 state->completionEvent->process();
127 delete pkt->req;
128 delete pkt;
129 } else {
130 DPRINTF(DMA, "Received response Packet %#x with no senderState\n", pkt);
131 delete pkt->req;
132 delete pkt;
133 }
134
135 return true;
136}
137
138DmaDevice::DmaDevice(Params *p)
139 : PioDevice(p), dmaPort(NULL)
140{ }
141
142void
143DmaPort::recvRetry()
144{
145 Packet* pkt = transmitList.front();
146 DPRINTF(DMA, "Retry on Packet %#x with senderState: %#x\n",
147 pkt, pkt->senderState);
148 if (sendTiming(pkt)) {
149 DPRINTF(DMA, "-- Done\n");
150 transmitList.pop_front();
151 pendingCount--;
152 assert(pendingCount >= 0);
153 } else {
154 DPRINTF(DMA, "-- Failed, queued\n");
155 }
156}
157
158
159void
160DmaPort::dmaAction(Packet::Command cmd, Addr addr, int size, Event *event,
161 uint8_t *data)
162{
163 assert(event);
164
165 int prevSize = 0;
166
167 for (ChunkGenerator gen(addr, size, peerBlockSize());
168 !gen.done(); gen.next()) {
| 1/*
2 * Copyright (c) 2006 The Regents of The University of Michigan
3 * All rights reserved.
4 *
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.
15 *
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.
27 */
28
29#include "base/trace.hh"
30#include "dev/io_device.hh"
31#include "sim/builder.hh"
32
33
34PioPort::PioPort(PioDevice *dev, Platform *p)
35 : Port(dev->name() + "-pioport"), device(dev), platform(p)
36{ }
37
38
39Tick
40PioPort::recvAtomic(Packet *pkt)
41{
42 return device->recvAtomic(pkt);
43}
44
45void
46PioPort::recvFunctional(Packet *pkt)
47{
48 device->recvAtomic(pkt);
49}
50
51void
52PioPort::getDeviceAddressRanges(AddrRangeList &resp, AddrRangeList &snoop)
53{
54 snoop.clear();
55 device->addressRanges(resp);
56}
57
58
59void
60PioPort::recvRetry()
61{
62 Packet* pkt = transmitList.front();
63 if (Port::sendTiming(pkt)) {
64 transmitList.pop_front();
65 }
66}
67
68
69void
70PioPort::SendEvent::process()
71{
72 if (port->Port::sendTiming(packet))
73 return;
74
75 port->transmitList.push_back(packet);
76}
77
78
79
80bool
81PioPort::recvTiming(Packet *pkt)
82{
83 Tick latency = device->recvAtomic(pkt);
84 // turn packet around to go back to requester
85 pkt->makeTimingResponse();
86 sendTiming(pkt, latency);
87 return true;
88}
89
90PioDevice::~PioDevice()
91{
92 if (pioPort)
93 delete pioPort;
94}
95
96void
97PioDevice::init()
98{
99 if (!pioPort)
100 panic("Pio port not connected to anything!");
101 pioPort->sendStatusChange(Port::RangeChange);
102}
103
104void
105BasicPioDevice::addressRanges(AddrRangeList &range_list)
106{
107 assert(pioSize != 0);
108 range_list.clear();
109 range_list.push_back(RangeSize(pioAddr, pioSize));
110}
111
112
113DmaPort::DmaPort(DmaDevice *dev, Platform *p)
114 : Port(dev->name() + "-dmaport"), device(dev), platform(p), pendingCount(0)
115{ }
116
117bool
118DmaPort::recvTiming(Packet *pkt)
119{
120 if (pkt->senderState) {
121 DmaReqState *state;
122 DPRINTF(DMA, "Received response Packet %#x with senderState: %#x\n",
123 pkt, pkt->senderState);
124 state = dynamic_cast<DmaReqState*>(pkt->senderState);
125 assert(state);
126 state->completionEvent->process();
127 delete pkt->req;
128 delete pkt;
129 } else {
130 DPRINTF(DMA, "Received response Packet %#x with no senderState\n", pkt);
131 delete pkt->req;
132 delete pkt;
133 }
134
135 return true;
136}
137
138DmaDevice::DmaDevice(Params *p)
139 : PioDevice(p), dmaPort(NULL)
140{ }
141
142void
143DmaPort::recvRetry()
144{
145 Packet* pkt = transmitList.front();
146 DPRINTF(DMA, "Retry on Packet %#x with senderState: %#x\n",
147 pkt, pkt->senderState);
148 if (sendTiming(pkt)) {
149 DPRINTF(DMA, "-- Done\n");
150 transmitList.pop_front();
151 pendingCount--;
152 assert(pendingCount >= 0);
153 } else {
154 DPRINTF(DMA, "-- Failed, queued\n");
155 }
156}
157
158
159void
160DmaPort::dmaAction(Packet::Command cmd, Addr addr, int size, Event *event,
161 uint8_t *data)
162{
163 assert(event);
164
165 int prevSize = 0;
166
167 for (ChunkGenerator gen(addr, size, peerBlockSize());
168 !gen.done(); gen.next()) {
|
178
179 prevSize += gen.size();
180
181 // Set the last bit of the dma as the final packet for this dma
182 // and set it's completion event.
183 if (prevSize == size) {
184 pkt->senderState = new DmaReqState(event, true);
185 }
186 assert(pendingCount >= 0);
187 pendingCount++;
188 sendDma(pkt);
189 }
190}
191
192
193void
194DmaPort::sendDma(Packet *pkt)
195{
196 // some kind of selction between access methods
197 // more work is going to have to be done to make
198 // switching actually work
199 /* MemState state = device->platform->system->memState;
200
201 if (state == Timing) { */
202 DPRINTF(DMA, "Attempting to send Packet %#x with senderState: %#x\n",
203 pkt, pkt->senderState);
204 if (!sendTiming(pkt)) {
205 transmitList.push_back(pkt);
206 DPRINTF(DMA, "-- Failed: queued\n");
207 } else {
208 DPRINTF(DMA, "-- Done\n");
209 pendingCount--;
210 assert(pendingCount >= 0);
211 }
212 /* } else if (state == Atomic) {
213 sendAtomic(pkt);
214 if (pkt->senderState) {
215 DmaReqState *state = dynamic_cast<DmaReqState*>(pkt->senderState);
216 assert(state);
217 state->completionEvent->schedule(curTick + (pkt->time - pkt->req->getTime()) +1);
218 }
219 pendingCount--;
220 assert(pendingCount >= 0);
221 delete pkt->req;
222 delete pkt;
223
224 } else if (state == Functional) {
225 sendFunctional(pkt);
226 // Is this correct???
227 completionEvent->schedule(pkt->req->responseTime - pkt->req->requestTime);
228 completionEvent == NULL;
229 } else
230 panic("Unknown memory command state.");
231 */
232}
233
234DmaDevice::~DmaDevice()
235{
236 if (dmaPort)
237 delete dmaPort;
238}
239
240
| 175
176 prevSize += gen.size();
177
178 // Set the last bit of the dma as the final packet for this dma
179 // and set it's completion event.
180 if (prevSize == size) {
181 pkt->senderState = new DmaReqState(event, true);
182 }
183 assert(pendingCount >= 0);
184 pendingCount++;
185 sendDma(pkt);
186 }
187}
188
189
190void
191DmaPort::sendDma(Packet *pkt)
192{
193 // some kind of selction between access methods
194 // more work is going to have to be done to make
195 // switching actually work
196 /* MemState state = device->platform->system->memState;
197
198 if (state == Timing) { */
199 DPRINTF(DMA, "Attempting to send Packet %#x with senderState: %#x\n",
200 pkt, pkt->senderState);
201 if (!sendTiming(pkt)) {
202 transmitList.push_back(pkt);
203 DPRINTF(DMA, "-- Failed: queued\n");
204 } else {
205 DPRINTF(DMA, "-- Done\n");
206 pendingCount--;
207 assert(pendingCount >= 0);
208 }
209 /* } else if (state == Atomic) {
210 sendAtomic(pkt);
211 if (pkt->senderState) {
212 DmaReqState *state = dynamic_cast<DmaReqState*>(pkt->senderState);
213 assert(state);
214 state->completionEvent->schedule(curTick + (pkt->time - pkt->req->getTime()) +1);
215 }
216 pendingCount--;
217 assert(pendingCount >= 0);
218 delete pkt->req;
219 delete pkt;
220
221 } else if (state == Functional) {
222 sendFunctional(pkt);
223 // Is this correct???
224 completionEvent->schedule(pkt->req->responseTime - pkt->req->requestTime);
225 completionEvent == NULL;
226 } else
227 panic("Unknown memory command state.");
228 */
229}
230
231DmaDevice::~DmaDevice()
232{
233 if (dmaPort)
234 delete dmaPort;
235}
236
237
|