2006-04-28 21:37:48 +02:00
|
|
|
/*
|
|
|
|
* Copyright (c) 2006 The Regents of The University of Michigan
|
|
|
|
* All rights reserved.
|
|
|
|
*
|
|
|
|
* 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.
|
2006-06-01 01:26:56 +02:00
|
|
|
*
|
|
|
|
* Authors: Ali Saidi
|
|
|
|
* Steve Reinhardt
|
2006-04-28 21:37:48 +02:00
|
|
|
*/
|
|
|
|
|
|
|
|
/**
|
|
|
|
* @file
|
|
|
|
* Definition of the Packet Class, a packet is a transaction occuring
|
|
|
|
* between a single level of the memory heirarchy (ie L1->L2).
|
|
|
|
*/
|
2006-04-29 23:37:25 +02:00
|
|
|
#include "base/misc.hh"
|
2006-04-28 21:37:48 +02:00
|
|
|
#include "mem/packet.hh"
|
|
|
|
|
2006-05-26 20:17:33 +02:00
|
|
|
static const std::string ReadReqString("ReadReq");
|
|
|
|
static const std::string WriteReqString("WriteReq");
|
|
|
|
static const std::string WriteReqNoAckString("WriteReqNoAck");
|
|
|
|
static const std::string ReadRespString("ReadResp");
|
|
|
|
static const std::string WriteRespString("WriteResp");
|
|
|
|
static const std::string OtherCmdString("<other>");
|
|
|
|
|
|
|
|
const std::string &
|
|
|
|
Packet::cmdString() const
|
|
|
|
{
|
|
|
|
switch (cmd) {
|
|
|
|
case ReadReq: return ReadReqString;
|
|
|
|
case WriteReq: return WriteReqString;
|
|
|
|
case WriteReqNoAck: return WriteReqNoAckString;
|
|
|
|
case ReadResp: return ReadRespString;
|
|
|
|
case WriteResp: return WriteRespString;
|
|
|
|
default: return OtherCmdString;
|
|
|
|
}
|
|
|
|
}
|
2006-05-02 00:53:28 +02:00
|
|
|
|
|
|
|
/** delete the data pointed to in the data pointer. Ok to call to matter how
|
|
|
|
* data was allocted. */
|
|
|
|
void
|
2006-05-26 20:17:33 +02:00
|
|
|
Packet::deleteData()
|
|
|
|
{
|
2006-05-02 00:53:28 +02:00
|
|
|
assert(staticData || dynamicData);
|
|
|
|
if (staticData)
|
|
|
|
return;
|
|
|
|
|
|
|
|
if (arrayData)
|
|
|
|
delete [] data;
|
|
|
|
else
|
|
|
|
delete data;
|
|
|
|
}
|
|
|
|
|
|
|
|
/** If there isn't data in the packet, allocate some. */
|
|
|
|
void
|
2006-05-26 20:17:33 +02:00
|
|
|
Packet::allocate()
|
|
|
|
{
|
2006-05-02 00:53:28 +02:00
|
|
|
if (data)
|
|
|
|
return;
|
|
|
|
assert(!staticData);
|
|
|
|
dynamicData = true;
|
|
|
|
arrayData = true;
|
2006-05-26 20:17:33 +02:00
|
|
|
data = new uint8_t[getSize()];
|
2006-05-02 00:53:28 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
/** Do the packet modify the same addresses. */
|
|
|
|
bool
|
2006-05-26 20:17:33 +02:00
|
|
|
Packet::intersect(Packet *p)
|
|
|
|
{
|
|
|
|
Addr s1 = getAddr();
|
|
|
|
Addr e1 = getAddr() + getSize();
|
|
|
|
Addr s2 = p->getAddr();
|
|
|
|
Addr e2 = p->getAddr() + p->getSize();
|
2006-05-02 00:53:28 +02:00
|
|
|
|
|
|
|
if (s1 >= s2 && s1 < e2)
|
|
|
|
return true;
|
|
|
|
if (e1 >= s2 && e1 < e2)
|
|
|
|
return true;
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
2006-05-26 20:17:33 +02:00
|
|
|
bool
|
|
|
|
fixPacket(Packet *func, Packet *timing)
|
|
|
|
{
|
|
|
|
panic("Need to implement!");
|
|
|
|
}
|