2006-01-31 18:12:49 +01:00
|
|
|
/*
|
2006-05-02 00:53:28 +02:00
|
|
|
* Copyright (c) 2006 The Regents of The University of Michigan
|
2006-01-31 18:12:49 +01:00
|
|
|
* 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: Ron Dreslinski
|
|
|
|
* Steve Reinhardt
|
|
|
|
* Ali Saidi
|
2006-01-31 18:12:49 +01:00
|
|
|
*/
|
|
|
|
|
|
|
|
/**
|
|
|
|
* @file
|
2006-05-31 04:30:42 +02:00
|
|
|
* Declaration of the Packet class.
|
2006-01-31 18:12:49 +01:00
|
|
|
*/
|
|
|
|
|
|
|
|
#ifndef __MEM_PACKET_HH__
|
|
|
|
#define __MEM_PACKET_HH__
|
|
|
|
|
2006-10-20 08:38:45 +02:00
|
|
|
#include <cassert>
|
|
|
|
#include <list>
|
2007-02-07 19:53:37 +01:00
|
|
|
#include <bitset>
|
2006-10-20 08:38:45 +02:00
|
|
|
|
2007-02-07 07:31:15 +01:00
|
|
|
#include "base/compiler.hh"
|
2007-01-27 21:38:04 +01:00
|
|
|
#include "base/misc.hh"
|
2006-02-07 23:33:03 +01:00
|
|
|
#include "mem/request.hh"
|
2006-08-15 11:07:15 +02:00
|
|
|
#include "sim/host.hh"
|
2007-03-06 20:13:43 +01:00
|
|
|
#include "sim/core.hh"
|
2006-02-15 20:21:09 +01:00
|
|
|
|
2007-01-27 21:38:04 +01:00
|
|
|
|
2006-02-15 20:21:09 +01:00
|
|
|
struct Packet;
|
2006-10-20 09:10:12 +02:00
|
|
|
typedef Packet *PacketPtr;
|
2006-02-15 20:21:09 +01:00
|
|
|
typedef uint8_t* PacketDataPtr;
|
2006-06-28 23:28:33 +02:00
|
|
|
typedef std::list<PacketPtr> PacketList;
|
|
|
|
|
|
|
|
//Coherence Flags
|
2006-10-21 22:54:48 +02:00
|
|
|
#define NACKED_LINE (1 << 0)
|
|
|
|
#define SATISFIED (1 << 1)
|
|
|
|
#define SHARED_LINE (1 << 2)
|
|
|
|
#define CACHE_LINE_FILL (1 << 3)
|
|
|
|
#define COMPRESSED (1 << 4)
|
|
|
|
#define NO_ALLOCATE (1 << 5)
|
|
|
|
#define SNOOP_COMMIT (1 << 6)
|
2006-01-31 20:09:43 +01:00
|
|
|
|
2007-02-07 19:53:37 +01:00
|
|
|
|
|
|
|
class MemCmd
|
|
|
|
{
|
|
|
|
public:
|
|
|
|
|
|
|
|
/** List of all commands associated with a packet. */
|
|
|
|
enum Command
|
|
|
|
{
|
|
|
|
InvalidCmd,
|
|
|
|
ReadReq,
|
|
|
|
WriteReq,
|
|
|
|
WriteReqNoAck,
|
|
|
|
ReadResp,
|
|
|
|
WriteResp,
|
|
|
|
Writeback,
|
|
|
|
SoftPFReq,
|
|
|
|
HardPFReq,
|
|
|
|
SoftPFResp,
|
|
|
|
HardPFResp,
|
|
|
|
InvalidateReq,
|
|
|
|
WriteInvalidateReq,
|
|
|
|
WriteInvalidateResp,
|
|
|
|
UpgradeReq,
|
|
|
|
ReadExReq,
|
|
|
|
ReadExResp,
|
2007-02-12 19:06:30 +01:00
|
|
|
SwapReq,
|
|
|
|
SwapResp,
|
2007-02-07 19:53:37 +01:00
|
|
|
NUM_MEM_CMDS
|
|
|
|
};
|
|
|
|
|
|
|
|
private:
|
|
|
|
/** List of command attributes. */
|
|
|
|
enum Attribute
|
|
|
|
{
|
|
|
|
IsRead,
|
|
|
|
IsWrite,
|
|
|
|
IsPrefetch,
|
|
|
|
IsInvalidate,
|
|
|
|
IsRequest,
|
|
|
|
IsResponse,
|
|
|
|
NeedsResponse,
|
|
|
|
IsSWPrefetch,
|
|
|
|
IsHWPrefetch,
|
|
|
|
IsUpgrade,
|
|
|
|
HasData,
|
2007-02-12 19:06:30 +01:00
|
|
|
IsReadWrite,
|
2007-02-07 19:53:37 +01:00
|
|
|
NUM_COMMAND_ATTRIBUTES
|
|
|
|
};
|
|
|
|
|
|
|
|
/** Structure that defines attributes and other data associated
|
|
|
|
* with a Command. */
|
|
|
|
struct CommandInfo {
|
|
|
|
/** Set of attribute flags. */
|
|
|
|
const std::bitset<NUM_COMMAND_ATTRIBUTES> attributes;
|
|
|
|
/** Corresponding response for requests; InvalidCmd if no
|
|
|
|
* response is applicable. */
|
|
|
|
const Command response;
|
|
|
|
/** String representation (for printing) */
|
|
|
|
const std::string str;
|
|
|
|
};
|
|
|
|
|
|
|
|
/** Array to map Command enum to associated info. */
|
|
|
|
static const CommandInfo commandInfo[];
|
|
|
|
|
|
|
|
private:
|
|
|
|
|
|
|
|
Command cmd;
|
|
|
|
|
|
|
|
bool testCmdAttrib(MemCmd::Attribute attrib) const {
|
|
|
|
return commandInfo[cmd].attributes[attrib] != 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
public:
|
|
|
|
|
|
|
|
bool isRead() const { return testCmdAttrib(IsRead); }
|
|
|
|
bool isWrite() const { return testCmdAttrib(IsWrite); }
|
|
|
|
bool isRequest() const { return testCmdAttrib(IsRequest); }
|
|
|
|
bool isResponse() const { return testCmdAttrib(IsResponse); }
|
|
|
|
bool needsResponse() const { return testCmdAttrib(NeedsResponse); }
|
|
|
|
bool isInvalidate() const { return testCmdAttrib(IsInvalidate); }
|
|
|
|
bool hasData() const { return testCmdAttrib(HasData); }
|
2007-02-12 19:06:30 +01:00
|
|
|
bool isReadWrite() const { return testCmdAttrib(IsReadWrite); }
|
2007-02-07 19:53:37 +01:00
|
|
|
|
|
|
|
const Command responseCommand() const {
|
|
|
|
return commandInfo[cmd].response;
|
|
|
|
}
|
|
|
|
|
|
|
|
/** Return the string to a cmd given by idx. */
|
|
|
|
const std::string &toString() const {
|
|
|
|
return commandInfo[cmd].str;
|
|
|
|
}
|
|
|
|
|
|
|
|
int toInt() const { return (int)cmd; }
|
|
|
|
|
|
|
|
MemCmd(Command _cmd)
|
|
|
|
: cmd(_cmd)
|
|
|
|
{ }
|
|
|
|
|
|
|
|
MemCmd(int _cmd)
|
|
|
|
: cmd((Command)_cmd)
|
|
|
|
{ }
|
|
|
|
|
|
|
|
MemCmd()
|
|
|
|
: cmd(InvalidCmd)
|
|
|
|
{ }
|
|
|
|
|
|
|
|
bool operator==(MemCmd c2) { return (cmd == c2.cmd); }
|
|
|
|
bool operator!=(MemCmd c2) { return (cmd != c2.cmd); }
|
|
|
|
|
|
|
|
friend class Packet;
|
|
|
|
};
|
|
|
|
|
2006-01-31 18:12:49 +01:00
|
|
|
/**
|
2006-05-31 04:30:42 +02:00
|
|
|
* A Packet is used to encapsulate a transfer between two objects in
|
|
|
|
* the memory system (e.g., the L1 and L2 cache). (In contrast, a
|
|
|
|
* single Request travels all the way from the requester to the
|
|
|
|
* ultimate destination and back, possibly being conveyed by several
|
|
|
|
* different Packets along the way.)
|
2006-01-31 18:12:49 +01:00
|
|
|
*/
|
2006-05-26 20:17:33 +02:00
|
|
|
class Packet
|
2006-01-31 18:12:49 +01:00
|
|
|
{
|
2006-06-29 22:07:19 +02:00
|
|
|
public:
|
2007-02-07 19:53:37 +01:00
|
|
|
|
|
|
|
typedef MemCmd::Command Command;
|
|
|
|
|
2006-06-29 22:07:19 +02:00
|
|
|
/** Temporary FLAGS field until cache gets working, this should be in coherence/sender state. */
|
|
|
|
uint64_t flags;
|
|
|
|
|
2006-04-25 01:31:50 +02:00
|
|
|
private:
|
2006-05-31 04:30:42 +02:00
|
|
|
/** A pointer to the data being transfered. It can be differnt
|
|
|
|
* sizes at each level of the heirarchy so it belongs in the
|
|
|
|
* packet, not request. This may or may not be populated when a
|
|
|
|
* responder recieves the packet. If not populated it memory
|
|
|
|
* should be allocated.
|
2006-04-25 01:31:50 +02:00
|
|
|
*/
|
|
|
|
PacketDataPtr data;
|
|
|
|
|
2006-05-31 04:30:42 +02:00
|
|
|
/** Is the data pointer set to a value that shouldn't be freed
|
|
|
|
* when the packet is destroyed? */
|
2006-04-25 01:31:50 +02:00
|
|
|
bool staticData;
|
2006-05-31 04:30:42 +02:00
|
|
|
/** The data pointer points to a value that should be freed when
|
|
|
|
* the packet is destroyed. */
|
2006-04-25 01:31:50 +02:00
|
|
|
bool dynamicData;
|
2006-05-31 04:30:42 +02:00
|
|
|
/** the data pointer points to an array (thus delete [] ) needs to
|
|
|
|
* be called on it rather than simply delete.*/
|
2006-04-25 01:31:50 +02:00
|
|
|
bool arrayData;
|
|
|
|
|
2006-05-31 04:30:42 +02:00
|
|
|
/** The address of the request. This address could be virtual or
|
|
|
|
* physical, depending on the system configuration. */
|
2006-01-31 18:12:49 +01:00
|
|
|
Addr addr;
|
|
|
|
|
2006-05-31 04:30:42 +02:00
|
|
|
/** The size of the request or transfer. */
|
2006-05-26 20:17:33 +02:00
|
|
|
int size;
|
|
|
|
|
2006-05-31 04:30:42 +02:00
|
|
|
/** Device address (e.g., bus ID) of the source of the
|
|
|
|
* transaction. The source is not responsible for setting this
|
|
|
|
* field; it is set implicitly by the interconnect when the
|
2006-10-20 09:10:12 +02:00
|
|
|
* packet is first sent. */
|
2006-05-26 20:17:33 +02:00
|
|
|
short src;
|
|
|
|
|
2006-05-31 04:30:42 +02:00
|
|
|
/** Device address (e.g., bus ID) of the destination of the
|
|
|
|
* transaction. The special value Broadcast indicates that the
|
|
|
|
* packet should be routed based on its address. This field is
|
|
|
|
* initialized in the constructor and is thus always valid
|
|
|
|
* (unlike * addr, size, and src). */
|
2006-05-26 20:17:33 +02:00
|
|
|
short dest;
|
|
|
|
|
2006-05-31 06:12:29 +02:00
|
|
|
/** Are the 'addr' and 'size' fields valid? */
|
|
|
|
bool addrSizeValid;
|
2006-05-31 04:30:42 +02:00
|
|
|
/** Is the 'src' field valid? */
|
2006-05-26 20:17:33 +02:00
|
|
|
bool srcValid;
|
2006-06-29 22:07:19 +02:00
|
|
|
|
2006-05-26 20:17:33 +02:00
|
|
|
|
|
|
|
public:
|
|
|
|
|
2006-06-28 20:35:00 +02:00
|
|
|
/** Used to calculate latencies for each packet.*/
|
|
|
|
Tick time;
|
|
|
|
|
2006-10-10 05:24:21 +02:00
|
|
|
/** The time at which the packet will be fully transmitted */
|
|
|
|
Tick finishTime;
|
|
|
|
|
|
|
|
/** The time at which the first chunk of the packet will be transmitted */
|
|
|
|
Tick firstWordTime;
|
|
|
|
|
2006-05-31 04:30:42 +02:00
|
|
|
/** The special destination address indicating that the packet
|
|
|
|
* should be routed based on its address. */
|
2006-05-26 20:17:33 +02:00
|
|
|
static const short Broadcast = -1;
|
2006-01-31 18:12:49 +01:00
|
|
|
|
2006-05-31 04:30:42 +02:00
|
|
|
/** A pointer to the original request. */
|
2006-01-31 18:12:49 +01:00
|
|
|
RequestPtr req;
|
|
|
|
|
2006-05-31 04:30:42 +02:00
|
|
|
/** A virtual base opaque structure used to hold coherence-related
|
|
|
|
* state. A specific subclass would be derived from this to
|
|
|
|
* carry state specific to a particular coherence protocol. */
|
2006-05-26 20:17:33 +02:00
|
|
|
class CoherenceState {
|
|
|
|
public:
|
|
|
|
virtual ~CoherenceState() {}
|
|
|
|
};
|
|
|
|
|
2006-05-31 04:30:42 +02:00
|
|
|
/** This packet's coherence state. Caches should use
|
|
|
|
* dynamic_cast<> to cast to the state appropriate for the
|
|
|
|
* system's coherence protocol. */
|
|
|
|
CoherenceState *coherence;
|
|
|
|
|
|
|
|
/** A virtual base opaque structure used to hold state associated
|
|
|
|
* with the packet but specific to the sending device (e.g., an
|
|
|
|
* MSHR). A pointer to this state is returned in the packet's
|
|
|
|
* response so that the sender can quickly look up the state
|
|
|
|
* needed to process it. A specific subclass would be derived
|
|
|
|
* from this to carry state specific to a particular sending
|
|
|
|
* device. */
|
2006-05-26 20:17:33 +02:00
|
|
|
class SenderState {
|
|
|
|
public:
|
|
|
|
virtual ~SenderState() {}
|
|
|
|
};
|
2006-01-31 18:12:49 +01:00
|
|
|
|
2006-05-31 04:30:42 +02:00
|
|
|
/** This packet's sender state. Devices should use dynamic_cast<>
|
|
|
|
* to cast to the state appropriate to the sender. */
|
|
|
|
SenderState *senderState;
|
2006-01-31 18:12:49 +01:00
|
|
|
|
2006-05-26 20:17:33 +02:00
|
|
|
public:
|
2007-02-07 19:53:37 +01:00
|
|
|
|
|
|
|
/** The command field of the packet. */
|
|
|
|
MemCmd cmd;
|
2006-05-26 20:17:33 +02:00
|
|
|
|
2006-05-31 04:30:42 +02:00
|
|
|
/** Return the string name of the cmd field (for debugging and
|
|
|
|
* tracing). */
|
2007-02-07 19:53:37 +01:00
|
|
|
const std::string &cmdString() const { return cmd.toString(); }
|
2006-06-28 20:35:00 +02:00
|
|
|
|
|
|
|
/** Return the index of this command. */
|
2007-02-07 19:53:37 +01:00
|
|
|
inline int cmdToIndex() const { return cmd.toInt(); }
|
2006-06-28 20:35:00 +02:00
|
|
|
|
2007-02-07 19:53:37 +01:00
|
|
|
public:
|
2006-01-31 18:12:49 +01:00
|
|
|
|
2007-02-07 19:53:37 +01:00
|
|
|
bool isRead() const { return cmd.isRead(); }
|
|
|
|
bool isWrite() const { return cmd.isWrite(); }
|
|
|
|
bool isRequest() const { return cmd.isRequest(); }
|
|
|
|
bool isResponse() const { return cmd.isResponse(); }
|
|
|
|
bool needsResponse() const { return cmd.needsResponse(); }
|
|
|
|
bool isInvalidate() const { return cmd.isInvalidate(); }
|
|
|
|
bool hasData() const { return cmd.hasData(); }
|
2007-02-12 19:06:30 +01:00
|
|
|
bool isReadWrite() const { return cmd.isReadWrite(); }
|
2006-06-28 23:28:33 +02:00
|
|
|
|
2006-10-12 20:15:09 +02:00
|
|
|
bool isCacheFill() const { return (flags & CACHE_LINE_FILL) != 0; }
|
|
|
|
bool isNoAllocate() const { return (flags & NO_ALLOCATE) != 0; }
|
|
|
|
bool isCompressed() const { return (flags & COMPRESSED) != 0; }
|
2006-06-30 16:25:25 +02:00
|
|
|
|
2007-01-27 21:38:04 +01:00
|
|
|
bool nic_pkt() { panic("Unimplemented"); M5_DUMMY_RETURN }
|
2006-05-26 20:17:33 +02:00
|
|
|
|
2006-05-31 04:30:42 +02:00
|
|
|
/** Possible results of a packet's request. */
|
2006-05-26 20:17:33 +02:00
|
|
|
enum Result
|
|
|
|
{
|
|
|
|
Success,
|
|
|
|
BadAddress,
|
2006-06-09 01:43:50 +02:00
|
|
|
Nacked,
|
2006-05-26 20:17:33 +02:00
|
|
|
Unknown
|
|
|
|
};
|
|
|
|
|
2006-05-31 04:30:42 +02:00
|
|
|
/** The result of this packet's request. */
|
2006-05-26 20:17:33 +02:00
|
|
|
Result result;
|
2006-01-31 18:12:49 +01:00
|
|
|
|
|
|
|
/** Accessor function that returns the source index of the packet. */
|
2006-05-26 20:17:33 +02:00
|
|
|
short getSrc() const { assert(srcValid); return src; }
|
|
|
|
void setSrc(short _src) { src = _src; srcValid = true; }
|
2006-01-31 18:12:49 +01:00
|
|
|
|
|
|
|
/** Accessor function that returns the destination index of
|
|
|
|
the packet. */
|
|
|
|
short getDest() const { return dest; }
|
2006-05-26 20:17:33 +02:00
|
|
|
void setDest(short _dest) { dest = _dest; }
|
2006-04-12 23:46:25 +02:00
|
|
|
|
2006-05-31 06:12:29 +02:00
|
|
|
Addr getAddr() const { assert(addrSizeValid); return addr; }
|
|
|
|
int getSize() const { assert(addrSizeValid); return size; }
|
2006-07-10 18:35:18 +02:00
|
|
|
Addr getOffset(int blkSize) const { return addr & (Addr)(blkSize - 1); }
|
2006-06-29 22:07:19 +02:00
|
|
|
|
|
|
|
void addrOverride(Addr newAddr) { assert(addrSizeValid); addr = newAddr; }
|
2007-02-07 19:53:37 +01:00
|
|
|
void cmdOverride(MemCmd newCmd) { cmd = newCmd; }
|
2006-05-26 20:17:33 +02:00
|
|
|
|
2006-05-31 04:30:42 +02:00
|
|
|
/** Constructor. Note that a Request object must be constructed
|
|
|
|
* first, but the Requests's physical address and size fields
|
|
|
|
* need not be valid. The command and destination addresses
|
|
|
|
* must be supplied. */
|
2007-02-07 19:53:37 +01:00
|
|
|
Packet(Request *_req, MemCmd _cmd, short _dest)
|
2006-04-25 01:31:50 +02:00
|
|
|
: data(NULL), staticData(false), dynamicData(false), arrayData(false),
|
2006-05-26 20:17:33 +02:00
|
|
|
addr(_req->paddr), size(_req->size), dest(_dest),
|
2006-05-31 06:12:29 +02:00
|
|
|
addrSizeValid(_req->validPaddr),
|
2006-06-30 16:25:25 +02:00
|
|
|
srcValid(false),
|
2006-06-29 22:07:19 +02:00
|
|
|
req(_req), coherence(NULL), senderState(NULL), cmd(_cmd),
|
|
|
|
result(Unknown)
|
|
|
|
{
|
|
|
|
flags = 0;
|
2006-08-21 19:16:46 +02:00
|
|
|
time = curTick;
|
2006-06-29 22:07:19 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
/** Alternate constructor if you are trying to create a packet with
|
|
|
|
* a request that is for a whole block, not the address from the req.
|
|
|
|
* this allows for overriding the size/addr of the req.*/
|
2007-02-07 19:53:37 +01:00
|
|
|
Packet(Request *_req, MemCmd _cmd, short _dest, int _blkSize)
|
2006-06-29 22:07:19 +02:00
|
|
|
: data(NULL), staticData(false), dynamicData(false), arrayData(false),
|
|
|
|
addr(_req->paddr & ~(_blkSize - 1)), size(_blkSize),
|
2006-06-30 16:25:25 +02:00
|
|
|
dest(_dest),
|
|
|
|
addrSizeValid(_req->validPaddr), srcValid(false),
|
2006-05-26 20:17:33 +02:00
|
|
|
req(_req), coherence(NULL), senderState(NULL), cmd(_cmd),
|
2006-05-31 04:30:42 +02:00
|
|
|
result(Unknown)
|
2006-05-26 20:17:33 +02:00
|
|
|
{
|
2006-06-29 22:07:19 +02:00
|
|
|
flags = 0;
|
2006-08-21 19:16:46 +02:00
|
|
|
time = curTick;
|
2006-05-26 20:17:33 +02:00
|
|
|
}
|
2006-04-12 23:46:25 +02:00
|
|
|
|
2006-05-31 04:30:42 +02:00
|
|
|
/** Destructor. */
|
2006-04-25 01:31:50 +02:00
|
|
|
~Packet()
|
2006-11-14 23:15:05 +01:00
|
|
|
{ if (staticData || dynamicData) deleteData(); }
|
2006-04-25 01:31:50 +02:00
|
|
|
|
2006-05-31 04:30:42 +02:00
|
|
|
/** Reinitialize packet address and size from the associated
|
|
|
|
* Request object, and reset other fields that may have been
|
|
|
|
* modified by a previous transaction. Typically called when a
|
|
|
|
* statically allocated Request/Packet pair is reused for
|
|
|
|
* multiple transactions. */
|
2006-05-26 20:17:33 +02:00
|
|
|
void reinitFromRequest() {
|
2006-05-31 04:30:42 +02:00
|
|
|
assert(req->validPaddr);
|
2006-10-22 08:35:00 +02:00
|
|
|
flags = 0;
|
2006-05-31 06:12:29 +02:00
|
|
|
addr = req->paddr;
|
|
|
|
size = req->size;
|
2006-08-21 19:16:46 +02:00
|
|
|
time = req->time;
|
2006-05-31 06:12:29 +02:00
|
|
|
addrSizeValid = true;
|
2006-05-31 04:30:42 +02:00
|
|
|
result = Unknown;
|
|
|
|
if (dynamicData) {
|
|
|
|
deleteData();
|
|
|
|
dynamicData = false;
|
|
|
|
arrayData = false;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/** Take a request packet and modify it in place to be suitable
|
|
|
|
* for returning as a response to that request. Used for timing
|
|
|
|
* accesses only. For atomic and functional accesses, the
|
|
|
|
* request packet is always implicitly passed back *without*
|
2006-10-06 05:28:03 +02:00
|
|
|
* modifying the destination fields, so this function
|
2006-05-31 04:30:42 +02:00
|
|
|
* should not be called. */
|
|
|
|
void makeTimingResponse() {
|
|
|
|
assert(needsResponse());
|
2006-07-06 22:52:05 +02:00
|
|
|
assert(isRequest());
|
2007-02-07 19:53:37 +01:00
|
|
|
cmd = cmd.responseCommand();
|
2006-05-31 04:30:42 +02:00
|
|
|
dest = src;
|
|
|
|
srcValid = false;
|
2006-05-26 20:17:33 +02:00
|
|
|
}
|
|
|
|
|
2006-10-20 08:38:45 +02:00
|
|
|
/**
|
|
|
|
* Take a request packet and modify it in place to be suitable for
|
|
|
|
* returning as a response to that request.
|
2006-10-06 05:28:03 +02:00
|
|
|
*/
|
2006-10-20 08:38:45 +02:00
|
|
|
void makeAtomicResponse()
|
|
|
|
{
|
2006-10-06 05:28:03 +02:00
|
|
|
assert(needsResponse());
|
|
|
|
assert(isRequest());
|
2007-02-07 19:53:37 +01:00
|
|
|
cmd = cmd.responseCommand();
|
2006-10-06 05:28:03 +02:00
|
|
|
}
|
|
|
|
|
2006-10-20 08:38:45 +02:00
|
|
|
/**
|
|
|
|
* Take a request packet that has been returned as NACKED and
|
|
|
|
* modify it so that it can be sent out again. Only packets that
|
|
|
|
* need a response can be NACKED, so verify that that is true.
|
|
|
|
*/
|
|
|
|
void
|
|
|
|
reinitNacked()
|
|
|
|
{
|
2006-06-09 01:43:50 +02:00
|
|
|
assert(needsResponse() && result == Nacked);
|
|
|
|
dest = Broadcast;
|
|
|
|
result = Unknown;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2006-10-20 08:38:45 +02:00
|
|
|
/**
|
|
|
|
* Set the data pointer to the following value that should not be
|
|
|
|
* freed.
|
|
|
|
*/
|
2006-04-25 01:31:50 +02:00
|
|
|
template <typename T>
|
2006-10-20 08:38:45 +02:00
|
|
|
void
|
|
|
|
dataStatic(T *p)
|
|
|
|
{
|
|
|
|
if(dynamicData)
|
|
|
|
dynamicData = false;
|
|
|
|
data = (PacketDataPtr)p;
|
|
|
|
staticData = true;
|
|
|
|
}
|
2006-04-25 01:31:50 +02:00
|
|
|
|
2006-10-20 08:38:45 +02:00
|
|
|
/**
|
|
|
|
* Set the data pointer to a value that should have delete []
|
|
|
|
* called on it.
|
2006-04-25 01:31:50 +02:00
|
|
|
*/
|
|
|
|
template <typename T>
|
2006-10-20 08:38:45 +02:00
|
|
|
void
|
|
|
|
dataDynamicArray(T *p)
|
|
|
|
{
|
|
|
|
assert(!staticData && !dynamicData);
|
|
|
|
data = (PacketDataPtr)p;
|
|
|
|
dynamicData = true;
|
|
|
|
arrayData = true;
|
|
|
|
}
|
2006-04-25 01:31:50 +02:00
|
|
|
|
2006-10-20 08:38:45 +02:00
|
|
|
/**
|
|
|
|
* set the data pointer to a value that should have delete called
|
|
|
|
* on it.
|
|
|
|
*/
|
2006-04-25 01:31:50 +02:00
|
|
|
template <typename T>
|
2006-10-20 08:38:45 +02:00
|
|
|
void
|
|
|
|
dataDynamic(T *p)
|
|
|
|
{
|
|
|
|
assert(!staticData && !dynamicData);
|
|
|
|
data = (PacketDataPtr)p;
|
|
|
|
dynamicData = true;
|
|
|
|
arrayData = false;
|
|
|
|
}
|
2006-04-25 01:31:50 +02:00
|
|
|
|
2006-10-20 08:38:45 +02:00
|
|
|
/** get a pointer to the data ptr. */
|
2006-04-25 01:31:50 +02:00
|
|
|
template <typename T>
|
2006-10-20 08:38:45 +02:00
|
|
|
T*
|
|
|
|
getPtr()
|
|
|
|
{
|
|
|
|
assert(staticData || dynamicData);
|
|
|
|
return (T*)data;
|
|
|
|
}
|
2006-04-25 01:31:50 +02:00
|
|
|
|
2006-10-20 08:38:45 +02:00
|
|
|
/** return the value of what is pointed to in the packet. */
|
2006-04-25 01:31:50 +02:00
|
|
|
template <typename T>
|
2006-10-20 08:38:45 +02:00
|
|
|
T get();
|
2006-04-25 01:31:50 +02:00
|
|
|
|
|
|
|
/** set the value in the data pointer to v. */
|
|
|
|
template <typename T>
|
2006-05-02 00:53:28 +02:00
|
|
|
void set(T v);
|
2006-04-25 01:31:50 +02:00
|
|
|
|
2006-10-20 08:38:45 +02:00
|
|
|
/**
|
|
|
|
* delete the data pointed to in the data pointer. Ok to call to
|
|
|
|
* matter how data was allocted.
|
|
|
|
*/
|
2006-05-02 00:53:28 +02:00
|
|
|
void deleteData();
|
2006-04-25 01:31:50 +02:00
|
|
|
|
|
|
|
/** If there isn't data in the packet, allocate some. */
|
2006-05-02 00:53:28 +02:00
|
|
|
void allocate();
|
2006-04-28 21:37:48 +02:00
|
|
|
|
|
|
|
/** Do the packet modify the same addresses. */
|
2006-10-20 09:10:12 +02:00
|
|
|
bool intersect(PacketPtr p);
|
2006-01-31 18:12:49 +01:00
|
|
|
};
|
|
|
|
|
2006-10-12 20:15:09 +02:00
|
|
|
/** This function given a functional packet and a timing packet either satisfies
|
|
|
|
* the timing packet, or updates the timing packet to reflect the updated state
|
|
|
|
* in the timing packet. It returns if the functional packet should continue to
|
|
|
|
* traverse the memory hierarchy or not.
|
|
|
|
*/
|
2006-10-20 09:10:12 +02:00
|
|
|
bool fixPacket(PacketPtr func, PacketPtr timing);
|
2006-10-12 20:15:09 +02:00
|
|
|
|
2006-11-12 12:35:39 +01:00
|
|
|
/** This function is a wrapper for the fixPacket field that toggles the hasData bit
|
|
|
|
* it is used when a response is waiting in the caches, but hasn't been marked as a
|
|
|
|
* response yet (so the fixPacket needs to get the correct value for the hasData)
|
|
|
|
*/
|
|
|
|
bool fixDelayedResponsePacket(PacketPtr func, PacketPtr timing);
|
|
|
|
|
2006-10-12 20:15:09 +02:00
|
|
|
std::ostream & operator<<(std::ostream &o, const Packet &p);
|
|
|
|
|
2006-01-31 18:12:49 +01:00
|
|
|
#endif //__MEM_PACKET_HH
|