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