1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
|
/*
* 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.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are
* met: redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer;
* redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution;
* neither the name of the copyright holders nor the names of its
* contributors may be used to endorse or promote products derived from
* this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
* A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
* OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
* 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: Andreas Hansson
*/
#include "mem/addr_mapper.hh"
AddrMapper::AddrMapper(const AddrMapperParams* p)
: MemObject(p),
masterPort(name() + "-master", *this),
slavePort(name() + "-slave", *this)
{
}
void
AddrMapper::init()
{
if (!slavePort.isConnected() || !masterPort.isConnected())
fatal("Address mapper is not connected on both sides.\n");
if ((slavePort.peerBlockSize() != masterPort.peerBlockSize()) &&
slavePort.peerBlockSize() && masterPort.peerBlockSize())
fatal("Slave port size %d, master port size %d \n "
"don't have the same block size... Not supported.\n",
slavePort.peerBlockSize(), masterPort.peerBlockSize());
}
BaseMasterPort&
AddrMapper::getMasterPort(const std::string& if_name, PortID idx)
{
if (if_name == "master") {
return masterPort;
} else {
return MemObject::getMasterPort(if_name, idx);
}
}
BaseSlavePort&
AddrMapper::getSlavePort(const std::string& if_name, PortID idx)
{
if (if_name == "slave") {
return slavePort;
} else {
return MemObject::getSlavePort(if_name, idx);
}
}
void
AddrMapper::recvFunctional(PacketPtr pkt)
{
Addr orig_addr = pkt->getAddr();
pkt->setAddr(remapAddr(orig_addr));
masterPort.sendFunctional(pkt);
pkt->setAddr(orig_addr);
}
void
AddrMapper::recvFunctionalSnoop(PacketPtr pkt)
{
Addr orig_addr = pkt->getAddr();
pkt->setAddr(remapAddr(orig_addr));
slavePort.sendFunctionalSnoop(pkt);
pkt->setAddr(orig_addr);
}
Tick
AddrMapper::recvAtomic(PacketPtr pkt)
{
Addr orig_addr = pkt->getAddr();
pkt->setAddr(remapAddr(orig_addr));
Tick ret_tick = masterPort.sendAtomic(pkt);
pkt->setAddr(orig_addr);
return ret_tick;
}
Tick
AddrMapper::recvAtomicSnoop(PacketPtr pkt)
{
Addr orig_addr = pkt->getAddr();
pkt->setAddr(remapAddr(orig_addr));
Tick ret_tick = slavePort.sendAtomicSnoop(pkt);
pkt->setAddr(orig_addr);
return ret_tick;
}
bool
AddrMapper::recvTimingReq(PacketPtr pkt)
{
Addr orig_addr = pkt->getAddr();
bool needsResponse = pkt->needsResponse();
bool memInhibitAsserted = pkt->memInhibitAsserted();
Packet::SenderState* senderState = pkt->senderState;
if (needsResponse && !memInhibitAsserted) {
pkt->senderState = new AddrMapperSenderState(senderState, orig_addr);
}
pkt->setAddr(remapAddr(orig_addr));
// Attempt to send the packet (always succeeds for inhibited
// packets)
bool successful = masterPort.sendTimingReq(pkt);
// If not successful, restore the sender state
if (!successful && needsResponse) {
delete pkt->senderState;
pkt->senderState = senderState;
}
return successful;
}
bool
AddrMapper::recvTimingResp(PacketPtr pkt)
{
AddrMapperSenderState* receivedState =
dynamic_cast<AddrMapperSenderState*>(pkt->senderState);
// Restore initial sender state
if (receivedState == NULL)
panic("AddrMapper %s got a response without sender state\n",
name());
Addr remapped_addr = pkt->getAddr();
// Restore the state and address
pkt->senderState = receivedState->origSenderState;
pkt->setAddr(receivedState->origAddr);
// Attempt to send the packet
bool successful = slavePort.sendTimingResp(pkt);
// If packet successfully sent, delete the sender state, otherwise
// restore state
if (successful) {
delete receivedState;
} else {
// Don't delete anything and let the packet look like we did
// not touch it
pkt->senderState = receivedState;
pkt->setAddr(remapped_addr);
}
return successful;
}
void
AddrMapper::recvTimingSnoopReq(PacketPtr pkt)
{
slavePort.sendTimingSnoopReq(pkt);
}
bool
AddrMapper::recvTimingSnoopResp(PacketPtr pkt)
{
return masterPort.sendTimingSnoopResp(pkt);
}
bool
AddrMapper::isSnooping() const
{
if (slavePort.isSnooping())
fatal("AddrMapper doesn't support remapping of snooping requests\n");
return false;
}
unsigned
AddrMapper::deviceBlockSizeMaster()
{
return slavePort.peerBlockSize();
}
unsigned
AddrMapper::deviceBlockSizeSlave()
{
return masterPort.peerBlockSize();
}
void
AddrMapper::recvRetryMaster()
{
slavePort.sendRetry();
}
void
AddrMapper::recvRetrySlave()
{
masterPort.sendRetry();
}
void
AddrMapper::recvRangeChange()
{
slavePort.sendRangeChange();
}
RangeAddrMapper::RangeAddrMapper(const RangeAddrMapperParams* p) :
AddrMapper(p),
originalRanges(p->original_ranges),
remappedRanges(p->remapped_ranges)
{
if (originalRanges.size() != remappedRanges.size())
fatal("AddrMapper: original and shadowed range list must "
"be same size\n");
for (size_t x = 0; x < originalRanges.size(); x++) {
if (originalRanges[x].size() != remappedRanges[x].size())
fatal("AddrMapper: original and shadowed range list elements"
" aren't all of the same size\n");
}
}
RangeAddrMapper*
RangeAddrMapperParams::create()
{
return new RangeAddrMapper(this);
}
Addr
RangeAddrMapper::remapAddr(Addr addr) const
{
for (int i = 0; i < originalRanges.size(); ++i) {
if (originalRanges[i].contains(addr)) {
Addr offset = addr - originalRanges[i].start();
return offset + remappedRanges[i].start();
}
}
return addr;
}
AddrRangeList
RangeAddrMapper::getAddrRanges() const
{
// Simply return the original ranges as given by the parameters
AddrRangeList ranges(originalRanges.begin(), originalRanges.end());
return ranges;
}
|