packet.cc (5650:d2782c951841) packet.cc (5735:a88e8e7dec75)
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;

--- 28 unchanged lines hidden (view full) ---

37
38#include <iostream>
39#include <cstring>
40#include "base/cprintf.hh"
41#include "base/misc.hh"
42#include "base/trace.hh"
43#include "mem/packet.hh"
44
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;

--- 28 unchanged lines hidden (view full) ---

37
38#include <iostream>
39#include <cstring>
40#include "base/cprintf.hh"
41#include "base/misc.hh"
42#include "base/trace.hh"
43#include "mem/packet.hh"
44
45using namespace std;
46
45// The one downside to bitsets is that static initializers can get ugly.
46#define SET1(a1) (1 << (a1))
47#define SET2(a1, a2) (SET1(a1) | SET1(a2))
48#define SET3(a1, a2, a3) (SET2(a1, a2) | SET1(a3))
49#define SET4(a1, a2, a3, a4) (SET3(a1, a2, a3) | SET1(a4))
50#define SET5(a1, a2, a3, a4, a5) (SET4(a1, a2, a3, a4) | SET1(a5))
51#define SET6(a1, a2, a3, a4, a5, a6) (SET5(a1, a2, a3, a4, a5) | SET1(a6))
52

--- 75 unchanged lines hidden (view full) ---

128 /* InvalidDestError -- packet dest field invalid */
129 { SET2(IsResponse, IsError), InvalidCmd, "InvalidDestError" },
130 /* BadAddressError -- memory address invalid */
131 { SET2(IsResponse, IsError), InvalidCmd, "BadAddressError" },
132 /* PrintReq */
133 { SET2(IsRequest, IsPrint), InvalidCmd, "PrintReq" }
134};
135
47// The one downside to bitsets is that static initializers can get ugly.
48#define SET1(a1) (1 << (a1))
49#define SET2(a1, a2) (SET1(a1) | SET1(a2))
50#define SET3(a1, a2, a3) (SET2(a1, a2) | SET1(a3))
51#define SET4(a1, a2, a3, a4) (SET3(a1, a2, a3) | SET1(a4))
52#define SET5(a1, a2, a3, a4, a5) (SET4(a1, a2, a3, a4) | SET1(a5))
53#define SET6(a1, a2, a3, a4, a5, a6) (SET5(a1, a2, a3, a4, a5) | SET1(a6))
54

--- 75 unchanged lines hidden (view full) ---

130 /* InvalidDestError -- packet dest field invalid */
131 { SET2(IsResponse, IsError), InvalidCmd, "InvalidDestError" },
132 /* BadAddressError -- memory address invalid */
133 { SET2(IsResponse, IsError), InvalidCmd, "BadAddressError" },
134 /* PrintReq */
135 { SET2(IsRequest, IsPrint), InvalidCmd, "PrintReq" }
136};
137
136
137/** delete the data pointed to in the data pointer. Ok to call to matter how
138 * data was allocted. */
139void
140Packet::deleteData()
141{
142 assert(staticData || dynamicData);
143 if (staticData)
144 return;
145
146 if (arrayData)
147 delete [] data;
148 else
149 delete data;
150}
151
152/** If there isn't data in the packet, allocate some. */
153void
154Packet::allocate()
155{
156 if (data)
157 return;
158 assert(!staticData);
159 dynamicData = true;
160 arrayData = true;
161 data = new uint8_t[getSize()];
162}
163
164
165bool
166Packet::checkFunctional(Printable *obj, Addr addr, int size, uint8_t *data)
167{
168 Addr func_start = getAddr();
169 Addr func_end = getAddr() + getSize() - 1;
170 Addr val_start = addr;
171 Addr val_end = val_start + size - 1;
172

--- 15 unchanged lines hidden (view full) ---

188
189 // offset of functional request into supplied value (could be
190 // negative if partial overlap)
191 int offset = func_start - val_start;
192
193 if (isRead()) {
194 if (func_start >= val_start && func_end <= val_end) {
195 allocate();
138bool
139Packet::checkFunctional(Printable *obj, Addr addr, int size, uint8_t *data)
140{
141 Addr func_start = getAddr();
142 Addr func_end = getAddr() + getSize() - 1;
143 Addr val_start = addr;
144 Addr val_end = val_start + size - 1;
145

--- 15 unchanged lines hidden (view full) ---

161
162 // offset of functional request into supplied value (could be
163 // negative if partial overlap)
164 int offset = func_start - val_start;
165
166 if (isRead()) {
167 if (func_start >= val_start && func_end <= val_end) {
168 allocate();
196 std::memcpy(getPtr<uint8_t>(), data + offset, getSize());
169 memcpy(getPtr(), data + offset, getSize());
197 makeResponse();
198 return true;
199 } else {
200 // In this case the timing packet only partially satisfies
201 // the request, so we would need more information to make
202 // this work. Like bytes valid in the packet or
203 // something, so the request could continue and get this
204 // bit of possibly newer data along with the older data
205 // not written to yet.
206 panic("Memory value only partially satisfies the functional "
207 "request. Now what?");
208 }
209 } else if (isWrite()) {
210 if (offset >= 0) {
170 makeResponse();
171 return true;
172 } else {
173 // In this case the timing packet only partially satisfies
174 // the request, so we would need more information to make
175 // this work. Like bytes valid in the packet or
176 // something, so the request could continue and get this
177 // bit of possibly newer data along with the older data
178 // not written to yet.
179 panic("Memory value only partially satisfies the functional "
180 "request. Now what?");
181 }
182 } else if (isWrite()) {
183 if (offset >= 0) {
211 std::memcpy(data + offset, getPtr<uint8_t>(),
212 (std::min(func_end, val_end) - func_start) + 1);
213 } else { // val_start > func_start
214 std::memcpy(data, getPtr<uint8_t>() - offset,
215 (std::min(func_end, val_end) - val_start) + 1);
184 memcpy(data + offset, getPtr(),
185 (min(func_end, val_end) - func_start) + 1);
186 } else {
187 // val_start > func_start
188 memcpy(data, getPtr<uint8_t>() - offset,
189 (min(func_end, val_end) - val_start) + 1);
216 }
217 } else {
218 panic("Don't know how to handle command %s\n", cmdString());
219 }
220
221 // keep going with request by default
222 return false;
223}
224
190 }
191 } else {
192 panic("Don't know how to handle command %s\n", cmdString());
193 }
194
195 // keep going with request by default
196 return false;
197}
198
225
226void
199void
227Packet::print(std::ostream &o, const int verbosity,
228 const std::string &prefix) const
200Packet::print(ostream &o, const int verbosity, const string &prefix) const
229{
230 ccprintf(o, "%s[%x:%x] %s\n", prefix,
231 getAddr(), getAddr() + getSize() - 1, cmdString());
232}
233
201{
202 ccprintf(o, "%s[%x:%x] %s\n", prefix,
203 getAddr(), getAddr() + getSize() - 1, cmdString());
204}
205
234
235Packet::PrintReqState::PrintReqState(std::ostream &_os, int _verbosity)
236 : curPrefixPtr(new std::string("")), os(_os), verbosity(_verbosity)
206Packet::PrintReqState::PrintReqState(ostream &_os, int _verbosity)
207 : curPrefixPtr(new string("")), os(_os), verbosity(_verbosity)
237{
238 labelStack.push_back(LabelStackEntry("", curPrefixPtr));
239}
240
208{
209 labelStack.push_back(LabelStackEntry("", curPrefixPtr));
210}
211
241
242Packet::PrintReqState::~PrintReqState()
243{
244 labelStack.pop_back();
245 assert(labelStack.empty());
246 delete curPrefixPtr;
247}
248
212Packet::PrintReqState::~PrintReqState()
213{
214 labelStack.pop_back();
215 assert(labelStack.empty());
216 delete curPrefixPtr;
217}
218
249
250Packet::PrintReqState::
219Packet::PrintReqState::
251LabelStackEntry::LabelStackEntry(const std::string &_label,
252 std::string *_prefix)
220LabelStackEntry::LabelStackEntry(const string &_label, string *_prefix)
253 : label(_label), prefix(_prefix), labelPrinted(false)
254{
255}
256
221 : label(_label), prefix(_prefix), labelPrinted(false)
222{
223}
224
257
258void
225void
259Packet::PrintReqState::pushLabel(const std::string &lbl,
260 const std::string &prefix)
226Packet::PrintReqState::pushLabel(const string &lbl, const string &prefix)
261{
262 labelStack.push_back(LabelStackEntry(lbl, curPrefixPtr));
227{
228 labelStack.push_back(LabelStackEntry(lbl, curPrefixPtr));
263 curPrefixPtr = new std::string(*curPrefixPtr);
229 curPrefixPtr = new string(*curPrefixPtr);
264 *curPrefixPtr += prefix;
265}
266
267void
268Packet::PrintReqState::popLabel()
269{
270 delete curPrefixPtr;
271 curPrefixPtr = labelStack.back().prefix;

--- 27 unchanged lines hidden --- 		230 *curPrefixPtr += prefix;
231}
232
233void
234Packet::PrintReqState::popLabel()
235{
236 delete curPrefixPtr;
237 curPrefixPtr = labelStack.back().prefix;

--- 27 unchanged lines hidden ---