2006-01-31 18:12:49 +01:00
|
|
|
/*
|
MEM: Remove the Broadcast destination from the packet
This patch simplifies the packet by removing the broadcast flag and
instead more firmly relying on (and enforcing) the semantics of
transactions in the classic memory system, i.e. request packets are
routed from a master to a slave based on the address, and when they
are created they have neither a valid source, nor destination. On
their way to the slave, the request packet is updated with a source
field for all modules that multiplex packets from multiple master
(e.g. a bus). When a request packet is turned into a response packet
(at the final slave), it moves the potentially populated source field
to the destination field, and the response packet is routed through
any multiplexing components back to the master based on the
destination field.
Modules that connect multiplexing components, such as caches and
bridges store any existing source and destination field in the sender
state as a stack (just as before).
The packet constructor is simplified in that there is no longer a need
to pass the Packet::Broadcast as the destination (this was always the
case for the classic memory system). In the case of Ruby, rather than
using the parameter to the constructor we now rely on setDest, as
there is already another three-argument constructor in the packet
class.
In many places where the packet information was printed as part of
DPRINTFs, request packets would be printed with a numeric "dest" that
would always be -1 (Broadcast) and that field is now removed from the
printing.
2012-04-14 11:45:55 +02:00
|
|
|
* 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.
|
|
|
|
*
|
2006-05-02 00:53:28 +02:00
|
|
|
* Copyright (c) 2006 The Regents of The University of Michigan
|
2010-08-25 23:08:27 +02:00
|
|
|
* Copyright (c) 2010 Advanced Micro Devices, Inc.
|
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__
|
|
|
|
|
2011-04-15 19:44:06 +02:00
|
|
|
#include <bitset>
|
2006-10-20 08:38:45 +02:00
|
|
|
#include <cassert>
|
|
|
|
#include <list>
|
|
|
|
|
2008-11-10 20:51:17 +01:00
|
|
|
#include "base/cast.hh"
|
2007-02-07 07:31:15 +01:00
|
|
|
#include "base/compiler.hh"
|
2007-06-21 19:50:35 +02:00
|
|
|
#include "base/fast_alloc.hh"
|
2008-11-10 20:51:17 +01:00
|
|
|
#include "base/flags.hh"
|
2007-01-27 21:38:04 +01:00
|
|
|
#include "base/misc.hh"
|
2008-01-02 21:20:15 +01:00
|
|
|
#include "base/printable.hh"
|
2009-05-17 23:34:50 +02:00
|
|
|
#include "base/types.hh"
|
2009-05-17 23:34:52 +02:00
|
|
|
#include "mem/request.hh"
|
2007-03-06 20:13:43 +01:00
|
|
|
#include "sim/core.hh"
|
2006-02-15 20:21:09 +01:00
|
|
|
|
2012-01-31 18:05:52 +01:00
|
|
|
class 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;
|
|
|
|
|
2007-02-07 19:53:37 +01:00
|
|
|
class MemCmd
|
|
|
|
{
|
2008-11-10 20:51:17 +01:00
|
|
|
friend class Packet;
|
2007-02-07 19:53:37 +01:00
|
|
|
|
2008-11-10 20:51:17 +01:00
|
|
|
public:
|
|
|
|
/**
|
|
|
|
* List of all commands associated with a packet.
|
|
|
|
*/
|
2007-02-07 19:53:37 +01:00
|
|
|
enum Command
|
|
|
|
{
|
|
|
|
InvalidCmd,
|
|
|
|
ReadReq,
|
|
|
|
ReadResp,
|
2008-01-03 00:22:38 +01:00
|
|
|
ReadRespWithInvalidate,
|
2007-05-22 15:29:48 +02:00
|
|
|
WriteReq,
|
2007-02-07 19:53:37 +01:00
|
|
|
WriteResp,
|
|
|
|
Writeback,
|
|
|
|
SoftPFReq,
|
|
|
|
HardPFReq,
|
|
|
|
SoftPFResp,
|
|
|
|
HardPFResp,
|
2012-05-23 15:18:04 +02:00
|
|
|
// WriteInvalidateReq transactions used to be generated by the
|
|
|
|
// DMA ports when writing full blocks to memory, however, it
|
|
|
|
// is not used anymore since we put the I/O cache in place to
|
|
|
|
// deal with partial block writes. Hence, WriteInvalidateReq
|
|
|
|
// and WriteInvalidateResp are currently unused. The
|
|
|
|
// implication is that the I/O cache does read-exclusive
|
|
|
|
// operations on every full-cache-block DMA, and ultimately
|
|
|
|
// this needs to be fixed.
|
2007-02-07 19:53:37 +01:00
|
|
|
WriteInvalidateReq,
|
|
|
|
WriteInvalidateResp,
|
|
|
|
UpgradeReq,
|
2010-06-17 00:25:57 +02:00
|
|
|
SCUpgradeReq, // Special "weak" upgrade for StoreCond
|
2007-06-21 20:59:17 +02:00
|
|
|
UpgradeResp,
|
2010-06-17 00:25:57 +02:00
|
|
|
SCUpgradeFailReq, // Failed SCUpgradeReq in MSHR (never sent)
|
|
|
|
UpgradeFailResp, // Valid for SCUpgradeReq only
|
2007-02-07 19:53:37 +01:00
|
|
|
ReadExReq,
|
|
|
|
ReadExResp,
|
2007-06-18 02:27:53 +02:00
|
|
|
LoadLockedReq,
|
|
|
|
StoreCondReq,
|
2010-09-09 20:40:19 +02:00
|
|
|
StoreCondFailReq, // Failed StoreCondReq in MSHR (never sent)
|
2007-06-18 02:27:53 +02:00
|
|
|
StoreCondResp,
|
2007-02-12 19:06:30 +01:00
|
|
|
SwapReq,
|
|
|
|
SwapResp,
|
2008-10-12 21:08:51 +02:00
|
|
|
MessageReq,
|
|
|
|
MessageResp,
|
2007-06-30 19:16:18 +02:00
|
|
|
// Error responses
|
|
|
|
// @TODO these should be classified as responses rather than
|
|
|
|
// requests; coding them as requests initially for backwards
|
|
|
|
// compatibility
|
|
|
|
NetworkNackError, // nacked at network layer (not by protocol)
|
|
|
|
InvalidDestError, // packet dest field invalid
|
|
|
|
BadAddressError, // memory address invalid
|
2011-07-01 02:49:26 +02:00
|
|
|
FunctionalReadError, // unable to fulfill functional read
|
|
|
|
FunctionalWriteError, // unable to fulfill functional write
|
2008-01-02 21:20:15 +01:00
|
|
|
// Fake simulator-only commands
|
|
|
|
PrintReq, // Print state matching address
|
2011-03-28 17:49:45 +02:00
|
|
|
FlushReq, //request for a cache flush
|
2012-01-23 18:07:11 +01:00
|
|
|
InvalidationReq, // request for address to be invalidated from lsq
|
2007-02-07 19:53:37 +01:00
|
|
|
NUM_MEM_CMDS
|
|
|
|
};
|
|
|
|
|
|
|
|
private:
|
2008-11-10 20:51:17 +01:00
|
|
|
/**
|
|
|
|
* List of command attributes.
|
|
|
|
*/
|
2007-02-07 19:53:37 +01:00
|
|
|
enum Attribute
|
|
|
|
{
|
2007-06-18 02:27:53 +02:00
|
|
|
IsRead, //!< Data flows from responder to requester
|
|
|
|
IsWrite, //!< Data flows from requester to responder
|
2010-06-17 00:25:57 +02:00
|
|
|
IsUpgrade,
|
2007-02-07 19:53:37 +01:00
|
|
|
IsInvalidate,
|
2007-06-18 02:27:53 +02:00
|
|
|
NeedsExclusive, //!< Requires exclusive copy to complete in-cache
|
|
|
|
IsRequest, //!< Issued by requester
|
|
|
|
IsResponse, //!< Issue by responder
|
|
|
|
NeedsResponse, //!< Requester needs response from target
|
2007-02-07 19:53:37 +01:00
|
|
|
IsSWPrefetch,
|
|
|
|
IsHWPrefetch,
|
2009-04-19 13:25:01 +02:00
|
|
|
IsLlsc, //!< Alpha/MIPS LL or SC access
|
2007-06-18 02:27:53 +02:00
|
|
|
HasData, //!< There is an associated payload
|
2007-06-30 19:16:18 +02:00
|
|
|
IsError, //!< Error response
|
2008-01-02 21:20:15 +01:00
|
|
|
IsPrint, //!< Print state matching address (for debugging)
|
2011-03-28 17:49:45 +02:00
|
|
|
IsFlush, //!< Flush the address from caches
|
2007-02-07 19:53:37 +01:00
|
|
|
NUM_COMMAND_ATTRIBUTES
|
|
|
|
};
|
|
|
|
|
2008-11-10 20:51:17 +01:00
|
|
|
/**
|
|
|
|
* Structure that defines attributes and other data associated
|
|
|
|
* with a Command.
|
|
|
|
*/
|
|
|
|
struct CommandInfo
|
|
|
|
{
|
|
|
|
/// Set of attribute flags.
|
2007-02-07 19:53:37 +01:00
|
|
|
const std::bitset<NUM_COMMAND_ATTRIBUTES> attributes;
|
2008-11-10 20:51:17 +01:00
|
|
|
/// Corresponding response for requests; InvalidCmd if no
|
|
|
|
/// response is applicable.
|
2007-02-07 19:53:37 +01:00
|
|
|
const Command response;
|
2008-11-10 20:51:17 +01:00
|
|
|
/// String representation (for printing)
|
2007-02-07 19:53:37 +01:00
|
|
|
const std::string str;
|
|
|
|
};
|
|
|
|
|
2008-11-10 20:51:17 +01:00
|
|
|
/// Array to map Command enum to associated info.
|
2007-02-07 19:53:37 +01:00
|
|
|
static const CommandInfo commandInfo[];
|
|
|
|
|
|
|
|
private:
|
|
|
|
|
|
|
|
Command cmd;
|
|
|
|
|
2008-11-10 20:51:17 +01:00
|
|
|
bool
|
|
|
|
testCmdAttrib(MemCmd::Attribute attrib) const
|
|
|
|
{
|
2007-02-07 19:53:37 +01:00
|
|
|
return commandInfo[cmd].attributes[attrib] != 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
public:
|
|
|
|
|
|
|
|
bool isRead() const { return testCmdAttrib(IsRead); }
|
2010-06-17 00:25:57 +02:00
|
|
|
bool isWrite() const { return testCmdAttrib(IsWrite); }
|
|
|
|
bool isUpgrade() const { return testCmdAttrib(IsUpgrade); }
|
2007-02-07 19:53:37 +01:00
|
|
|
bool isRequest() const { return testCmdAttrib(IsRequest); }
|
|
|
|
bool isResponse() const { return testCmdAttrib(IsResponse); }
|
2007-06-30 19:16:18 +02:00
|
|
|
bool needsExclusive() const { return testCmdAttrib(NeedsExclusive); }
|
2007-02-07 19:53:37 +01:00
|
|
|
bool needsResponse() const { return testCmdAttrib(NeedsResponse); }
|
|
|
|
bool isInvalidate() const { return testCmdAttrib(IsInvalidate); }
|
|
|
|
bool hasData() const { return testCmdAttrib(HasData); }
|
2007-06-18 02:27:53 +02:00
|
|
|
bool isReadWrite() const { return isRead() && isWrite(); }
|
2009-04-20 06:44:15 +02:00
|
|
|
bool isLLSC() const { return testCmdAttrib(IsLlsc); }
|
2007-06-30 19:16:18 +02:00
|
|
|
bool isError() const { return testCmdAttrib(IsError); }
|
2008-01-02 21:20:15 +01:00
|
|
|
bool isPrint() const { return testCmdAttrib(IsPrint); }
|
2011-03-28 17:49:45 +02:00
|
|
|
bool isFlush() const { return testCmdAttrib(IsFlush); }
|
2007-02-07 19:53:37 +01:00
|
|
|
|
2008-11-10 20:51:17 +01:00
|
|
|
const Command
|
|
|
|
responseCommand() const
|
|
|
|
{
|
2007-02-07 19:53:37 +01:00
|
|
|
return commandInfo[cmd].response;
|
|
|
|
}
|
|
|
|
|
2008-11-10 20:51:17 +01:00
|
|
|
/// Return the string to a cmd given by idx.
|
|
|
|
const std::string &toString() const { return commandInfo[cmd].str; }
|
2007-02-07 19:53:37 +01:00
|
|
|
int toInt() const { return (int)cmd; }
|
|
|
|
|
2008-11-10 20:51:17 +01:00
|
|
|
MemCmd(Command _cmd) : cmd(_cmd) { }
|
|
|
|
MemCmd(int _cmd) : cmd((Command)_cmd) { }
|
|
|
|
MemCmd() : cmd(InvalidCmd) { }
|
2007-02-07 19:53:37 +01:00
|
|
|
|
2008-11-10 20:51:17 +01:00
|
|
|
bool operator==(MemCmd c2) const { return (cmd == c2.cmd); }
|
|
|
|
bool operator!=(MemCmd c2) const { return (cmd != c2.cmd); }
|
2007-02-07 19:53:37 +01:00
|
|
|
};
|
|
|
|
|
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
|
|
|
*/
|
2008-01-02 21:20:15 +01:00
|
|
|
class Packet : public FastAlloc, public Printable
|
2006-01-31 18:12:49 +01:00
|
|
|
{
|
2006-06-29 22:07:19 +02:00
|
|
|
public:
|
2008-11-10 20:51:17 +01:00
|
|
|
typedef uint32_t FlagsType;
|
|
|
|
typedef ::Flags<FlagsType> Flags;
|
|
|
|
typedef short NodeID;
|
|
|
|
|
|
|
|
private:
|
|
|
|
static const FlagsType PUBLIC_FLAGS = 0x00000000;
|
|
|
|
static const FlagsType PRIVATE_FLAGS = 0x00007F0F;
|
|
|
|
static const FlagsType COPY_FLAGS = 0x0000000F;
|
|
|
|
|
|
|
|
static const FlagsType SHARED = 0x00000001;
|
|
|
|
// Special control flags
|
|
|
|
/// Special timing-mode atomic snoop for multi-level coherence.
|
|
|
|
static const FlagsType EXPRESS_SNOOP = 0x00000002;
|
|
|
|
/// Does supplier have exclusive copy?
|
|
|
|
/// Useful for multi-level coherence.
|
|
|
|
static const FlagsType SUPPLY_EXCLUSIVE = 0x00000004;
|
|
|
|
// Snoop response flags
|
|
|
|
static const FlagsType MEM_INHIBIT = 0x00000008;
|
|
|
|
/// Are the 'addr' and 'size' fields valid?
|
|
|
|
static const FlagsType VALID_ADDR = 0x00000100;
|
|
|
|
static const FlagsType VALID_SIZE = 0x00000200;
|
|
|
|
/// Is the 'src' field valid?
|
|
|
|
static const FlagsType VALID_SRC = 0x00000400;
|
|
|
|
static const FlagsType VALID_DST = 0x00000800;
|
|
|
|
/// Is the data pointer set to a value that shouldn't be freed
|
|
|
|
/// when the packet is destroyed?
|
|
|
|
static const FlagsType STATIC_DATA = 0x00001000;
|
|
|
|
/// The data pointer points to a value that should be freed when
|
|
|
|
/// the packet is destroyed.
|
|
|
|
static const FlagsType DYNAMIC_DATA = 0x00002000;
|
|
|
|
/// the data pointer points to an array (thus delete []) needs to
|
|
|
|
/// be called on it rather than simply delete.
|
|
|
|
static const FlagsType ARRAY_DATA = 0x00004000;
|
2011-07-01 02:49:26 +02:00
|
|
|
/// suppress the error if this packet encounters a functional
|
|
|
|
/// access failure.
|
|
|
|
static const FlagsType SUPPRESS_FUNC_ERROR = 0x00008000;
|
2008-11-10 20:51:17 +01:00
|
|
|
|
|
|
|
Flags flags;
|
2007-02-07 19:53:37 +01:00
|
|
|
|
2008-11-10 20:51:17 +01:00
|
|
|
public:
|
2007-02-07 19:53:37 +01:00
|
|
|
typedef MemCmd::Command Command;
|
|
|
|
|
2008-11-10 20:51:17 +01:00
|
|
|
/// The command field of the packet.
|
2007-06-30 19:16:18 +02:00
|
|
|
MemCmd cmd;
|
|
|
|
|
2008-11-10 20:51:17 +01:00
|
|
|
/// A pointer to the original request.
|
2007-06-30 19:16:18 +02:00
|
|
|
RequestPtr req;
|
|
|
|
|
2006-04-25 01:31:50 +02:00
|
|
|
private:
|
2008-11-10 20:51:17 +01: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;
|
|
|
|
|
2008-11-10 20:51:17 +01: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;
|
|
|
|
|
2008-11-10 20:51:17 +01:00
|
|
|
/// The size of the request or transfer.
|
2009-06-05 08:21:12 +02:00
|
|
|
unsigned size;
|
2006-05-26 20:17:33 +02:00
|
|
|
|
2008-11-10 20:51:17 +01: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 packet
|
|
|
|
* is first sent.
|
|
|
|
*/
|
|
|
|
NodeID src;
|
2006-05-26 20:17:33 +02:00
|
|
|
|
2008-11-10 20:51:17 +01: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).
|
|
|
|
*/
|
|
|
|
NodeID dest;
|
2006-05-26 20:17:33 +02:00
|
|
|
|
2008-11-10 20:51:17 +01:00
|
|
|
/**
|
|
|
|
* The original value of the command field. Only valid when the
|
2007-06-30 19:16:18 +02:00
|
|
|
* current command field is an error condition; in that case, the
|
|
|
|
* previous contents of the command field are copied here. This
|
|
|
|
* field is *not* set on non-error responses.
|
|
|
|
*/
|
|
|
|
MemCmd origCmd;
|
|
|
|
|
2012-01-10 01:10:05 +01:00
|
|
|
/**
|
|
|
|
* These values specify the range of bytes found that satisfy a
|
|
|
|
* functional read.
|
|
|
|
*/
|
|
|
|
uint16_t bytesValidStart;
|
|
|
|
uint16_t bytesValidEnd;
|
|
|
|
|
2006-05-26 20:17:33 +02:00
|
|
|
public:
|
2008-11-10 20:51:17 +01:00
|
|
|
/// Used to calculate latencies for each packet.
|
2006-06-28 20:35:00 +02:00
|
|
|
Tick time;
|
|
|
|
|
2008-11-10 20:51:17 +01:00
|
|
|
/// The time at which the packet will be fully transmitted
|
2006-10-10 05:24:21 +02:00
|
|
|
Tick finishTime;
|
|
|
|
|
2008-11-10 20:51:17 +01:00
|
|
|
/// The time at which the first chunk of the packet will be transmitted
|
2006-10-10 05:24:21 +02:00
|
|
|
Tick firstWordTime;
|
|
|
|
|
2008-11-10 20:51:17 +01:00
|
|
|
/**
|
|
|
|
* 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.
|
|
|
|
*/
|
|
|
|
struct SenderState
|
|
|
|
{
|
2006-05-26 20:17:33 +02:00
|
|
|
virtual ~SenderState() {}
|
|
|
|
};
|
2006-01-31 18:12:49 +01:00
|
|
|
|
2008-01-02 22:46:22 +01:00
|
|
|
/**
|
|
|
|
* Object used to maintain state of a PrintReq. The senderState
|
|
|
|
* field of a PrintReq should always be of this type.
|
|
|
|
*/
|
2008-11-10 20:51:17 +01:00
|
|
|
class PrintReqState : public SenderState, public FastAlloc
|
|
|
|
{
|
|
|
|
private:
|
|
|
|
/**
|
|
|
|
* An entry in the label stack.
|
|
|
|
*/
|
|
|
|
struct LabelStackEntry
|
|
|
|
{
|
2008-01-02 21:20:15 +01:00
|
|
|
const std::string label;
|
|
|
|
std::string *prefix;
|
|
|
|
bool labelPrinted;
|
2008-11-10 20:51:17 +01:00
|
|
|
LabelStackEntry(const std::string &_label, std::string *_prefix);
|
2008-01-02 21:20:15 +01:00
|
|
|
};
|
|
|
|
|
|
|
|
typedef std::list<LabelStackEntry> LabelStack;
|
|
|
|
LabelStack labelStack;
|
|
|
|
|
|
|
|
std::string *curPrefixPtr;
|
|
|
|
|
|
|
|
public:
|
|
|
|
std::ostream &os;
|
|
|
|
const int verbosity;
|
|
|
|
|
|
|
|
PrintReqState(std::ostream &os, int verbosity = 0);
|
|
|
|
~PrintReqState();
|
|
|
|
|
2008-11-10 20:51:17 +01:00
|
|
|
/**
|
|
|
|
* Returns the current line prefix.
|
|
|
|
*/
|
2008-01-02 21:20:15 +01:00
|
|
|
const std::string &curPrefix() { return *curPrefixPtr; }
|
2008-01-02 22:46:22 +01:00
|
|
|
|
2008-11-10 20:51:17 +01:00
|
|
|
/**
|
|
|
|
* Push a label onto the label stack, and prepend the given
|
2008-01-02 22:46:22 +01:00
|
|
|
* prefix string onto the current prefix. Labels will only be
|
2008-11-10 20:51:17 +01:00
|
|
|
* printed if an object within the label's scope is printed.
|
|
|
|
*/
|
2008-01-02 21:20:15 +01:00
|
|
|
void pushLabel(const std::string &lbl,
|
|
|
|
const std::string &prefix = " ");
|
2008-11-10 20:51:17 +01:00
|
|
|
|
|
|
|
/**
|
|
|
|
* Pop a label off the label stack.
|
|
|
|
*/
|
2008-01-02 21:20:15 +01:00
|
|
|
void popLabel();
|
2008-11-10 20:51:17 +01:00
|
|
|
|
|
|
|
/**
|
|
|
|
* Print all of the pending unprinted labels on the
|
2008-01-02 22:46:22 +01:00
|
|
|
* stack. Called by printObj(), so normally not called by
|
2008-11-10 20:51:17 +01:00
|
|
|
* users unless bypassing printObj().
|
|
|
|
*/
|
2008-01-02 21:20:15 +01:00
|
|
|
void printLabels();
|
2008-11-10 20:51:17 +01:00
|
|
|
|
|
|
|
/**
|
|
|
|
* Print a Printable object to os, because it matched the
|
|
|
|
* address on a PrintReq.
|
|
|
|
*/
|
2008-01-02 21:20:15 +01:00
|
|
|
void printObj(Printable *obj);
|
|
|
|
};
|
|
|
|
|
2008-11-10 20:51:17 +01:00
|
|
|
/**
|
|
|
|
* This packet's sender state. Devices should use dynamic_cast<>
|
|
|
|
* to cast to the state appropriate to the sender. The intent of
|
|
|
|
* this variable is to allow a device to attach extra information
|
|
|
|
* to a request. A response packet must return the sender state
|
|
|
|
* that was attached to the original request (even if a new packet
|
|
|
|
* is created).
|
|
|
|
*/
|
2006-05-31 04:30:42 +02:00
|
|
|
SenderState *senderState;
|
2006-01-31 18:12:49 +01:00
|
|
|
|
2008-11-10 20:51:17 +01: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
|
|
|
|
2008-11-10 20:51:17 +01: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
|
|
|
bool isRead() const { return cmd.isRead(); }
|
2010-06-17 00:25:57 +02:00
|
|
|
bool isWrite() const { return cmd.isWrite(); }
|
|
|
|
bool isUpgrade() const { return cmd.isUpgrade(); }
|
2007-02-07 19:53:37 +01:00
|
|
|
bool isRequest() const { return cmd.isRequest(); }
|
|
|
|
bool isResponse() const { return cmd.isResponse(); }
|
2007-06-30 19:16:18 +02:00
|
|
|
bool needsExclusive() const { return cmd.needsExclusive(); }
|
2007-02-07 19:53:37 +01:00
|
|
|
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(); }
|
2009-04-20 06:44:15 +02:00
|
|
|
bool isLLSC() const { return cmd.isLLSC(); }
|
2007-06-30 19:16:18 +02:00
|
|
|
bool isError() const { return cmd.isError(); }
|
2008-01-02 21:20:15 +01:00
|
|
|
bool isPrint() const { return cmd.isPrint(); }
|
2011-03-28 17:49:45 +02:00
|
|
|
bool isFlush() const { return cmd.isFlush(); }
|
2007-06-30 19:16:18 +02:00
|
|
|
|
|
|
|
// Snoop flags
|
2008-11-10 20:51:17 +01:00
|
|
|
void assertMemInhibit() { flags.set(MEM_INHIBIT); }
|
2008-12-06 23:18:18 +01:00
|
|
|
bool memInhibitAsserted() { return flags.isSet(MEM_INHIBIT); }
|
2008-11-10 20:51:17 +01:00
|
|
|
void assertShared() { flags.set(SHARED); }
|
2008-12-06 23:18:18 +01:00
|
|
|
bool sharedAsserted() { return flags.isSet(SHARED); }
|
2007-06-30 19:16:18 +02:00
|
|
|
|
2007-07-16 05:11:06 +02:00
|
|
|
// Special control flags
|
2008-11-10 20:51:17 +01:00
|
|
|
void setExpressSnoop() { flags.set(EXPRESS_SNOOP); }
|
2008-12-06 23:18:18 +01:00
|
|
|
bool isExpressSnoop() { return flags.isSet(EXPRESS_SNOOP); }
|
2008-11-10 20:51:17 +01:00
|
|
|
void setSupplyExclusive() { flags.set(SUPPLY_EXCLUSIVE); }
|
2010-09-22 08:07:34 +02:00
|
|
|
void clearSupplyExclusive() { flags.clear(SUPPLY_EXCLUSIVE); }
|
2008-12-06 23:18:18 +01:00
|
|
|
bool isSupplyExclusive() { return flags.isSet(SUPPLY_EXCLUSIVE); }
|
2011-07-01 02:49:26 +02:00
|
|
|
void setSuppressFuncError() { flags.set(SUPPRESS_FUNC_ERROR); }
|
|
|
|
bool suppressFuncError() { return flags.isSet(SUPPRESS_FUNC_ERROR); }
|
2007-07-16 05:11:06 +02:00
|
|
|
|
2007-06-30 19:16:18 +02:00
|
|
|
// Network error conditions... encapsulate them as methods since
|
|
|
|
// their encoding keeps changing (from result field to command
|
|
|
|
// field, etc.)
|
2008-11-10 20:51:17 +01:00
|
|
|
void
|
|
|
|
setNacked()
|
|
|
|
{
|
|
|
|
assert(isResponse());
|
|
|
|
cmd = MemCmd::NetworkNackError;
|
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
setBadAddress()
|
|
|
|
{
|
|
|
|
assert(isResponse());
|
|
|
|
cmd = MemCmd::BadAddressError;
|
|
|
|
}
|
|
|
|
|
|
|
|
bool wasNacked() const { return cmd == MemCmd::NetworkNackError; }
|
|
|
|
bool hadBadAddress() const { return cmd == MemCmd::BadAddressError; }
|
2007-08-27 06:45:40 +02:00
|
|
|
void copyError(Packet *pkt) { assert(pkt->isError()); cmd = pkt->cmd; }
|
2006-06-30 16:25:25 +02:00
|
|
|
|
2009-11-18 22:55:58 +01:00
|
|
|
bool isSrcValid() { return flags.isSet(VALID_SRC); }
|
2008-11-10 20:51:17 +01:00
|
|
|
/// Accessor function to get the source index of the packet.
|
2008-12-06 23:18:18 +01:00
|
|
|
NodeID getSrc() const { assert(flags.isSet(VALID_SRC)); return src; }
|
2008-11-10 20:51:17 +01:00
|
|
|
/// Accessor function to set the source index of the packet.
|
|
|
|
void setSrc(NodeID _src) { src = _src; flags.set(VALID_SRC); }
|
|
|
|
/// Reset source field, e.g. to retransmit packet on different bus.
|
|
|
|
void clearSrc() { flags.clear(VALID_SRC); }
|
|
|
|
|
2009-11-18 22:55:58 +01:00
|
|
|
bool isDestValid() { return flags.isSet(VALID_DST); }
|
2008-11-10 20:51:17 +01:00
|
|
|
/// Accessor function for the destination index of the packet.
|
2008-12-06 23:18:18 +01:00
|
|
|
NodeID getDest() const { assert(flags.isSet(VALID_DST)); return dest; }
|
2008-11-10 20:51:17 +01:00
|
|
|
/// Accessor function to set the destination index of the packet.
|
|
|
|
void setDest(NodeID _dest) { dest = _dest; flags.set(VALID_DST); }
|
MEM: Remove the Broadcast destination from the packet
This patch simplifies the packet by removing the broadcast flag and
instead more firmly relying on (and enforcing) the semantics of
transactions in the classic memory system, i.e. request packets are
routed from a master to a slave based on the address, and when they
are created they have neither a valid source, nor destination. On
their way to the slave, the request packet is updated with a source
field for all modules that multiplex packets from multiple master
(e.g. a bus). When a request packet is turned into a response packet
(at the final slave), it moves the potentially populated source field
to the destination field, and the response packet is routed through
any multiplexing components back to the master based on the
destination field.
Modules that connect multiplexing components, such as caches and
bridges store any existing source and destination field in the sender
state as a stack (just as before).
The packet constructor is simplified in that there is no longer a need
to pass the Packet::Broadcast as the destination (this was always the
case for the classic memory system). In the case of Ruby, rather than
using the parameter to the constructor we now rely on setDest, as
there is already another three-argument constructor in the packet
class.
In many places where the packet information was printed as part of
DPRINTFs, request packets would be printed with a numeric "dest" that
would always be -1 (Broadcast) and that field is now removed from the
printing.
2012-04-14 11:45:55 +02:00
|
|
|
/// Reset destination field, e.g. to turn a response into a request again.
|
|
|
|
void clearDest() { flags.clear(VALID_DST); }
|
2008-11-10 20:51:17 +01:00
|
|
|
|
2008-12-06 23:18:18 +01:00
|
|
|
Addr getAddr() const { assert(flags.isSet(VALID_ADDR)); return addr; }
|
2009-06-05 08:21:12 +02:00
|
|
|
unsigned getSize() const { assert(flags.isSet(VALID_SIZE)); return size; }
|
2008-11-10 20:51:17 +01:00
|
|
|
Addr getOffset(int blkSize) const { return getAddr() & (Addr)(blkSize - 1); }
|
|
|
|
|
2010-08-20 20:46:12 +02:00
|
|
|
/**
|
|
|
|
* It has been determined that the SC packet should successfully update
|
|
|
|
* memory. Therefore, convert this SC packet to a normal write.
|
|
|
|
*/
|
|
|
|
void
|
|
|
|
convertScToWrite()
|
|
|
|
{
|
|
|
|
assert(isLLSC());
|
|
|
|
assert(isWrite());
|
|
|
|
cmd = MemCmd::WriteReq;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* When ruby is in use, Ruby will monitor the cache line and thus M5
|
|
|
|
* phys memory should treat LL ops as normal reads.
|
|
|
|
*/
|
|
|
|
void
|
|
|
|
convertLlToRead()
|
|
|
|
{
|
|
|
|
assert(isLLSC());
|
|
|
|
assert(isRead());
|
|
|
|
cmd = MemCmd::ReadReq;
|
|
|
|
}
|
|
|
|
|
2008-11-10 20:51:17 +01: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.
|
|
|
|
*/
|
MEM: Remove the Broadcast destination from the packet
This patch simplifies the packet by removing the broadcast flag and
instead more firmly relying on (and enforcing) the semantics of
transactions in the classic memory system, i.e. request packets are
routed from a master to a slave based on the address, and when they
are created they have neither a valid source, nor destination. On
their way to the slave, the request packet is updated with a source
field for all modules that multiplex packets from multiple master
(e.g. a bus). When a request packet is turned into a response packet
(at the final slave), it moves the potentially populated source field
to the destination field, and the response packet is routed through
any multiplexing components back to the master based on the
destination field.
Modules that connect multiplexing components, such as caches and
bridges store any existing source and destination field in the sender
state as a stack (just as before).
The packet constructor is simplified in that there is no longer a need
to pass the Packet::Broadcast as the destination (this was always the
case for the classic memory system). In the case of Ruby, rather than
using the parameter to the constructor we now rely on setDest, as
there is already another three-argument constructor in the packet
class.
In many places where the packet information was printed as part of
DPRINTFs, request packets would be printed with a numeric "dest" that
would always be -1 (Broadcast) and that field is now removed from the
printing.
2012-04-14 11:45:55 +02:00
|
|
|
Packet(Request *_req, MemCmd _cmd)
|
|
|
|
: cmd(_cmd), req(_req), data(NULL),
|
|
|
|
bytesValidStart(0), bytesValidEnd(0),
|
2012-01-10 01:10:05 +01:00
|
|
|
time(curTick()), senderState(NULL)
|
2006-06-29 22:07:19 +02:00
|
|
|
{
|
2009-04-21 03:40:00 +02:00
|
|
|
if (req->hasPaddr()) {
|
|
|
|
addr = req->getPaddr();
|
|
|
|
flags.set(VALID_ADDR);
|
|
|
|
}
|
|
|
|
if (req->hasSize()) {
|
|
|
|
size = req->getSize();
|
|
|
|
flags.set(VALID_SIZE);
|
|
|
|
}
|
2006-06-29 22:07:19 +02:00
|
|
|
}
|
|
|
|
|
2008-11-10 20:51:17 +01: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.
|
|
|
|
*/
|
MEM: Remove the Broadcast destination from the packet
This patch simplifies the packet by removing the broadcast flag and
instead more firmly relying on (and enforcing) the semantics of
transactions in the classic memory system, i.e. request packets are
routed from a master to a slave based on the address, and when they
are created they have neither a valid source, nor destination. On
their way to the slave, the request packet is updated with a source
field for all modules that multiplex packets from multiple master
(e.g. a bus). When a request packet is turned into a response packet
(at the final slave), it moves the potentially populated source field
to the destination field, and the response packet is routed through
any multiplexing components back to the master based on the
destination field.
Modules that connect multiplexing components, such as caches and
bridges store any existing source and destination field in the sender
state as a stack (just as before).
The packet constructor is simplified in that there is no longer a need
to pass the Packet::Broadcast as the destination (this was always the
case for the classic memory system). In the case of Ruby, rather than
using the parameter to the constructor we now rely on setDest, as
there is already another three-argument constructor in the packet
class.
In many places where the packet information was printed as part of
DPRINTFs, request packets would be printed with a numeric "dest" that
would always be -1 (Broadcast) and that field is now removed from the
printing.
2012-04-14 11:45:55 +02:00
|
|
|
Packet(Request *_req, MemCmd _cmd, int _blkSize)
|
|
|
|
: cmd(_cmd), req(_req), data(NULL),
|
|
|
|
bytesValidStart(0), bytesValidEnd(0),
|
2012-01-10 01:10:05 +01:00
|
|
|
time(curTick()), senderState(NULL)
|
2006-05-26 20:17:33 +02:00
|
|
|
{
|
2009-04-21 03:40:00 +02:00
|
|
|
if (req->hasPaddr()) {
|
|
|
|
addr = req->getPaddr() & ~(_blkSize - 1);
|
|
|
|
flags.set(VALID_ADDR);
|
|
|
|
}
|
|
|
|
size = _blkSize;
|
|
|
|
flags.set(VALID_SIZE);
|
2007-06-18 02:27:53 +02:00
|
|
|
}
|
|
|
|
|
2008-11-10 20:51:17 +01:00
|
|
|
/**
|
|
|
|
* Alternate constructor for copying a packet. Copy all fields
|
2007-07-14 22:14:53 +02:00
|
|
|
* *except* if the original packet's data was dynamic, don't copy
|
|
|
|
* that, as we can't guarantee that the new packet's lifetime is
|
|
|
|
* less than that of the original packet. In this case the new
|
2008-11-10 20:51:17 +01:00
|
|
|
* packet should allocate its own data.
|
|
|
|
*/
|
|
|
|
Packet(Packet *pkt, bool clearFlags = false)
|
|
|
|
: cmd(pkt->cmd), req(pkt->req),
|
2008-12-06 23:18:18 +01:00
|
|
|
data(pkt->flags.isSet(STATIC_DATA) ? pkt->data : NULL),
|
2008-11-10 20:51:17 +01:00
|
|
|
addr(pkt->addr), size(pkt->size), src(pkt->src), dest(pkt->dest),
|
2012-01-10 01:10:05 +01:00
|
|
|
bytesValidStart(pkt->bytesValidStart), bytesValidEnd(pkt->bytesValidEnd),
|
2011-01-08 06:50:29 +01:00
|
|
|
time(curTick()), senderState(pkt->senderState)
|
2007-06-18 02:27:53 +02:00
|
|
|
{
|
2008-11-10 20:51:17 +01:00
|
|
|
if (!clearFlags)
|
|
|
|
flags.set(pkt->flags & COPY_FLAGS);
|
|
|
|
|
|
|
|
flags.set(pkt->flags & (VALID_ADDR|VALID_SIZE|VALID_SRC|VALID_DST));
|
|
|
|
flags.set(pkt->flags & STATIC_DATA);
|
2012-01-10 01:10:05 +01:00
|
|
|
|
2006-05-26 20:17:33 +02:00
|
|
|
}
|
2006-04-12 23:46:25 +02:00
|
|
|
|
2008-11-10 20:51:17 +01:00
|
|
|
/**
|
|
|
|
* clean up packet variables
|
|
|
|
*/
|
2006-04-25 01:31:50 +02:00
|
|
|
~Packet()
|
2008-03-24 06:08:02 +01:00
|
|
|
{
|
|
|
|
// If this is a request packet for which there's no response,
|
|
|
|
// delete the request object here, since the requester will
|
|
|
|
// never get the chance.
|
|
|
|
if (req && isRequest() && !needsResponse())
|
|
|
|
delete req;
|
2008-11-10 20:51:17 +01:00
|
|
|
deleteData();
|
2008-03-24 06:08:02 +01:00
|
|
|
}
|
2006-04-25 01:31:50 +02:00
|
|
|
|
2008-11-10 20:51:17 +01: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.
|
|
|
|
*/
|
|
|
|
void
|
|
|
|
reinitFromRequest()
|
|
|
|
{
|
2009-04-21 03:40:00 +02:00
|
|
|
assert(req->hasPaddr());
|
2007-06-30 19:16:18 +02:00
|
|
|
flags = 0;
|
2009-04-21 03:40:00 +02:00
|
|
|
addr = req->getPaddr();
|
|
|
|
size = req->getSize();
|
2009-05-30 00:30:16 +02:00
|
|
|
time = req->time();
|
2008-11-10 20:51:17 +01:00
|
|
|
|
|
|
|
flags.set(VALID_ADDR|VALID_SIZE);
|
|
|
|
deleteData();
|
2006-05-31 04:30:42 +02:00
|
|
|
}
|
|
|
|
|
2007-06-18 02:27:53 +02:00
|
|
|
/**
|
|
|
|
* Take a request packet and modify it in place to be suitable for
|
|
|
|
* returning as a response to that request. The source and
|
|
|
|
* destination fields are *not* modified, as is appropriate for
|
|
|
|
* atomic accesses.
|
|
|
|
*/
|
2008-11-10 20:51:17 +01:00
|
|
|
void
|
|
|
|
makeResponse()
|
2007-06-18 02:27:53 +02:00
|
|
|
{
|
2006-05-31 04:30:42 +02:00
|
|
|
assert(needsResponse());
|
2006-07-06 22:52:05 +02:00
|
|
|
assert(isRequest());
|
2007-08-27 06:45:40 +02:00
|
|
|
origCmd = cmd;
|
2007-02-07 19:53:37 +01:00
|
|
|
cmd = cmd.responseCommand();
|
2008-11-14 13:55:30 +01:00
|
|
|
|
2010-06-17 00:25:57 +02:00
|
|
|
// responses are never express, even if the snoop that
|
|
|
|
// triggered them was
|
|
|
|
flags.clear(EXPRESS_SNOOP);
|
|
|
|
|
2008-11-14 13:55:30 +01:00
|
|
|
dest = src;
|
2008-12-06 23:18:18 +01:00
|
|
|
flags.set(VALID_DST, flags.isSet(VALID_SRC));
|
2008-11-14 13:55:30 +01:00
|
|
|
flags.clear(VALID_SRC);
|
2007-06-18 02:27:53 +02:00
|
|
|
}
|
|
|
|
|
2008-11-10 20:51:17 +01:00
|
|
|
void
|
|
|
|
makeAtomicResponse()
|
2007-06-18 02:27:53 +02:00
|
|
|
{
|
2007-06-30 19:16:18 +02:00
|
|
|
makeResponse();
|
2006-05-26 20:17:33 +02:00
|
|
|
}
|
|
|
|
|
2008-11-10 20:51:17 +01:00
|
|
|
void
|
|
|
|
makeTimingResponse()
|
2006-10-20 08:38:45 +02:00
|
|
|
{
|
2007-06-30 19:16:18 +02:00
|
|
|
makeResponse();
|
2006-10-06 05:28:03 +02:00
|
|
|
}
|
|
|
|
|
2011-07-01 02:49:26 +02:00
|
|
|
void
|
|
|
|
setFunctionalResponseStatus(bool success)
|
|
|
|
{
|
|
|
|
if (!success) {
|
|
|
|
if (isWrite()) {
|
|
|
|
cmd = MemCmd::FunctionalWriteError;
|
|
|
|
} else {
|
|
|
|
cmd = MemCmd::FunctionalReadError;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
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()
|
|
|
|
{
|
2007-06-30 19:16:18 +02:00
|
|
|
assert(wasNacked());
|
|
|
|
cmd = origCmd;
|
|
|
|
assert(needsResponse());
|
MEM: Remove the Broadcast destination from the packet
This patch simplifies the packet by removing the broadcast flag and
instead more firmly relying on (and enforcing) the semantics of
transactions in the classic memory system, i.e. request packets are
routed from a master to a slave based on the address, and when they
are created they have neither a valid source, nor destination. On
their way to the slave, the request packet is updated with a source
field for all modules that multiplex packets from multiple master
(e.g. a bus). When a request packet is turned into a response packet
(at the final slave), it moves the potentially populated source field
to the destination field, and the response packet is routed through
any multiplexing components back to the master based on the
destination field.
Modules that connect multiplexing components, such as caches and
bridges store any existing source and destination field in the sender
state as a stack (just as before).
The packet constructor is simplified in that there is no longer a need
to pass the Packet::Broadcast as the destination (this was always the
case for the classic memory system). In the case of Ruby, rather than
using the parameter to the constructor we now rely on setDest, as
there is already another three-argument constructor in the packet
class.
In many places where the packet information was printed as part of
DPRINTFs, request packets would be printed with a numeric "dest" that
would always be -1 (Broadcast) and that field is now removed from the
printing.
2012-04-14 11:45:55 +02:00
|
|
|
clearDest();
|
2006-06-09 01:43:50 +02:00
|
|
|
}
|
|
|
|
|
2010-03-13 02:31:08 +01:00
|
|
|
void
|
|
|
|
setSize(unsigned size)
|
|
|
|
{
|
|
|
|
assert(!flags.isSet(VALID_SIZE));
|
|
|
|
|
|
|
|
this->size = size;
|
|
|
|
flags.set(VALID_SIZE);
|
|
|
|
}
|
|
|
|
|
2006-06-09 01:43:50 +02:00
|
|
|
|
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)
|
|
|
|
{
|
2008-12-06 23:18:18 +01:00
|
|
|
assert(flags.noneSet(STATIC_DATA|DYNAMIC_DATA|ARRAY_DATA));
|
2006-10-20 08:38:45 +02:00
|
|
|
data = (PacketDataPtr)p;
|
2008-11-10 20:51:17 +01:00
|
|
|
flags.set(STATIC_DATA);
|
2006-10-20 08:38:45 +02:00
|
|
|
}
|
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)
|
|
|
|
{
|
2008-12-06 23:18:18 +01:00
|
|
|
assert(flags.noneSet(STATIC_DATA|DYNAMIC_DATA|ARRAY_DATA));
|
2006-10-20 08:38:45 +02:00
|
|
|
data = (PacketDataPtr)p;
|
2008-11-10 20:51:17 +01:00
|
|
|
flags.set(DYNAMIC_DATA|ARRAY_DATA);
|
2006-10-20 08:38:45 +02:00
|
|
|
}
|
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)
|
|
|
|
{
|
2008-12-06 23:18:18 +01:00
|
|
|
assert(flags.noneSet(STATIC_DATA|DYNAMIC_DATA|ARRAY_DATA));
|
2006-10-20 08:38:45 +02:00
|
|
|
data = (PacketDataPtr)p;
|
2008-11-10 20:51:17 +01:00
|
|
|
flags.set(DYNAMIC_DATA);
|
2006-10-20 08:38:45 +02:00
|
|
|
}
|
2006-04-25 01:31:50 +02:00
|
|
|
|
2008-11-10 20:51:17 +01: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*
|
2011-02-07 07:14:19 +01:00
|
|
|
getPtr(bool null_ok = false)
|
2006-10-20 08:38:45 +02:00
|
|
|
{
|
2011-02-07 07:14:19 +01:00
|
|
|
assert(null_ok || flags.isSet(STATIC_DATA|DYNAMIC_DATA));
|
2006-10-20 08:38:45 +02:00
|
|
|
return (T*)data;
|
|
|
|
}
|
2006-04-25 01:31:50 +02:00
|
|
|
|
2008-11-10 20:51:17 +01: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
|
|
|
|
2008-11-10 20:51:17 +01:00
|
|
|
/**
|
|
|
|
* set the value in the data pointer to v.
|
|
|
|
*/
|
2006-04-25 01:31:50 +02:00
|
|
|
template <typename T>
|
2006-05-02 00:53:28 +02:00
|
|
|
void set(T v);
|
2006-04-25 01:31:50 +02:00
|
|
|
|
2007-06-18 02:27:53 +02:00
|
|
|
/**
|
|
|
|
* Copy data into the packet from the provided pointer.
|
|
|
|
*/
|
2008-11-10 20:51:17 +01:00
|
|
|
void
|
|
|
|
setData(uint8_t *p)
|
2007-06-18 02:27:53 +02:00
|
|
|
{
|
2010-09-30 16:35:19 +02:00
|
|
|
if (p != getPtr<uint8_t>())
|
|
|
|
std::memcpy(getPtr<uint8_t>(), p, getSize());
|
2007-06-18 02:27:53 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Copy data into the packet from the provided block pointer,
|
|
|
|
* which is aligned to the given block size.
|
|
|
|
*/
|
2008-11-10 20:51:17 +01:00
|
|
|
void
|
|
|
|
setDataFromBlock(uint8_t *blk_data, int blkSize)
|
2007-06-18 02:27:53 +02:00
|
|
|
{
|
|
|
|
setData(blk_data + getOffset(blkSize));
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Copy data from the packet to the provided block pointer, which
|
|
|
|
* is aligned to the given block size.
|
|
|
|
*/
|
2008-11-10 20:51:17 +01:00
|
|
|
void
|
|
|
|
writeData(uint8_t *p)
|
2007-06-18 02:27:53 +02:00
|
|
|
{
|
|
|
|
std::memcpy(p, getPtr<uint8_t>(), getSize());
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Copy data from the packet to the memory at the provided pointer.
|
|
|
|
*/
|
2008-11-10 20:51:17 +01:00
|
|
|
void
|
|
|
|
writeDataToBlock(uint8_t *blk_data, int blkSize)
|
2007-06-18 02:27:53 +02:00
|
|
|
{
|
|
|
|
writeData(blk_data + getOffset(blkSize));
|
|
|
|
}
|
|
|
|
|
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.
|
|
|
|
*/
|
2008-11-10 20:51:17 +01:00
|
|
|
void
|
|
|
|
deleteData()
|
|
|
|
{
|
2008-12-06 23:18:18 +01:00
|
|
|
if (flags.isSet(ARRAY_DATA))
|
2008-11-10 20:51:17 +01:00
|
|
|
delete [] data;
|
2008-12-06 23:18:18 +01:00
|
|
|
else if (flags.isSet(DYNAMIC_DATA))
|
2008-11-10 20:51:17 +01:00
|
|
|
delete data;
|
|
|
|
|
|
|
|
flags.clear(STATIC_DATA|DYNAMIC_DATA|ARRAY_DATA);
|
|
|
|
data = NULL;
|
|
|
|
}
|
2006-04-25 01:31:50 +02:00
|
|
|
|
|
|
|
/** If there isn't data in the packet, allocate some. */
|
2008-11-10 20:51:17 +01:00
|
|
|
void
|
|
|
|
allocate()
|
|
|
|
{
|
|
|
|
if (data) {
|
2008-12-06 23:18:18 +01:00
|
|
|
assert(flags.isSet(STATIC_DATA|DYNAMIC_DATA));
|
2008-11-14 13:55:30 +01:00
|
|
|
return;
|
2008-11-10 20:51:17 +01:00
|
|
|
}
|
2008-11-14 13:55:30 +01:00
|
|
|
|
2008-12-06 23:18:18 +01:00
|
|
|
assert(flags.noneSet(STATIC_DATA|DYNAMIC_DATA));
|
2008-11-14 13:55:30 +01:00
|
|
|
flags.set(DYNAMIC_DATA|ARRAY_DATA);
|
|
|
|
data = new uint8_t[getSize()];
|
2008-11-10 20:51:17 +01:00
|
|
|
}
|
|
|
|
|
2007-06-18 02:27:53 +02:00
|
|
|
/**
|
|
|
|
* Check a functional request against a memory value represented
|
|
|
|
* by a base/size pair and an associated data array. If the
|
|
|
|
* functional request is a read, it may be satisfied by the memory
|
|
|
|
* value. If the functional request is a write, it may update the
|
|
|
|
* memory value.
|
|
|
|
*/
|
2008-01-02 21:20:15 +01:00
|
|
|
bool checkFunctional(Printable *obj, Addr base, int size, uint8_t *data);
|
2007-06-18 02:27:53 +02:00
|
|
|
|
|
|
|
/**
|
|
|
|
* Check a functional request against a memory value stored in
|
2008-01-02 22:46:22 +01:00
|
|
|
* another packet (i.e. an in-transit request or response).
|
2007-06-18 02:27:53 +02:00
|
|
|
*/
|
2008-11-10 20:51:17 +01:00
|
|
|
bool
|
|
|
|
checkFunctional(PacketPtr other)
|
|
|
|
{
|
|
|
|
uint8_t *data = other->hasData() ? other->getPtr<uint8_t>() : NULL;
|
|
|
|
return checkFunctional(other, other->getAddr(), other->getSize(),
|
|
|
|
data);
|
2007-06-18 02:27:53 +02:00
|
|
|
}
|
2006-01-31 18:12:49 +01:00
|
|
|
|
2008-01-02 22:46:22 +01:00
|
|
|
/**
|
|
|
|
* Push label for PrintReq (safe to call unconditionally).
|
|
|
|
*/
|
2008-11-10 20:51:17 +01:00
|
|
|
void
|
|
|
|
pushLabel(const std::string &lbl)
|
|
|
|
{
|
|
|
|
if (isPrint())
|
|
|
|
safe_cast<PrintReqState*>(senderState)->pushLabel(lbl);
|
2008-01-02 21:20:15 +01:00
|
|
|
}
|
|
|
|
|
2008-01-02 22:46:22 +01:00
|
|
|
/**
|
|
|
|
* Pop label for PrintReq (safe to call unconditionally).
|
|
|
|
*/
|
2008-11-10 20:51:17 +01:00
|
|
|
void
|
|
|
|
popLabel()
|
|
|
|
{
|
|
|
|
if (isPrint())
|
|
|
|
safe_cast<PrintReqState*>(senderState)->popLabel();
|
2008-01-02 21:20:15 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
void print(std::ostream &o, int verbosity = 0,
|
|
|
|
const std::string &prefix = "") const;
|
|
|
|
};
|
2006-10-12 20:15:09 +02:00
|
|
|
|
2006-01-31 18:12:49 +01:00
|
|
|
#endif //__MEM_PACKET_HH
|