packet.hh revision 12823
11689SN/A/* 22329SN/A * Copyright (c) 2012-2018 ARM Limited 31689SN/A * All rights reserved 41689SN/A * 51689SN/A * The license below extends only to copyright in the software and shall 61689SN/A * not be construed as granting a license to any other intellectual 71689SN/A * property including but not limited to intellectual property relating 81689SN/A * to a hardware implementation of the functionality of the software 91689SN/A * licensed hereunder. You may use the software subject to the license 101689SN/A * terms below provided that you ensure that this notice is replicated 111689SN/A * unmodified and in its entirety in all distributions of the software, 121689SN/A * modified or unmodified, in source code or in binary form. 131689SN/A * 141689SN/A * Copyright (c) 2006 The Regents of The University of Michigan 151689SN/A * Copyright (c) 2010,2015 Advanced Micro Devices, Inc. 161689SN/A * All rights reserved. 171689SN/A * 181689SN/A * Redistribution and use in source and binary forms, with or without 191689SN/A * modification, are permitted provided that the following conditions are 201689SN/A * met: redistributions of source code must retain the above copyright 211689SN/A * notice, this list of conditions and the following disclaimer; 221689SN/A * redistributions in binary form must reproduce the above copyright 231689SN/A * notice, this list of conditions and the following disclaimer in the 241689SN/A * documentation and/or other materials provided with the distribution; 251689SN/A * neither the name of the copyright holders nor the names of its 261689SN/A * contributors may be used to endorse or promote products derived from 272665Ssaidi@eecs.umich.edu * this software without specific prior written permission. 282665Ssaidi@eecs.umich.edu * 292756Sksewell@umich.edu * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS 301689SN/A * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT 311689SN/A * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR 322292SN/A * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT 332292SN/A * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, 341060SN/A * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT 352669Sktlim@umich.edu * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 364182Sgblack@eecs.umich.edu * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 371461SN/A * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 381060SN/A * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE 391060SN/A * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 403348Sbinkertn@umich.edu * 412669Sktlim@umich.edu * Authors: Ron Dreslinski 421461SN/A * Steve Reinhardt 431060SN/A * Ali Saidi 445529Snate@binkert.org * Andreas Hansson 455529Snate@binkert.org * Nikos Nikoleris 461060SN/A */ 472329SN/A 482329SN/A/** 492329SN/A * @file 502329SN/A * Declaration of the Packet class. 512348SN/A */ 522329SN/A 531060SN/A#ifndef __MEM_PACKET_HH__ 541060SN/A#define __MEM_PACKET_HH__ 552292SN/A 561060SN/A#include <bitset> 571060SN/A#include <cassert> 581060SN/A#include <list> 591061SN/A 601060SN/A#include "base/cast.hh" 611061SN/A#include "base/compiler.hh" 622733Sktlim@umich.edu#include "base/flags.hh" 631060SN/A#include "base/logging.hh" 642292SN/A#include "base/printable.hh" 651061SN/A#include "base/types.hh" 661061SN/A#include "mem/request.hh" 671061SN/A#include "sim/core.hh" 681060SN/A 691060SN/Aclass Packet; 702107SN/Atypedef Packet *PacketPtr; 712292SN/Atypedef uint8_t* PacketDataPtr; 722632Sstever@eecs.umich.edutypedef std::list<PacketPtr> PacketList; 732698Sktlim@umich.edutypedef uint64_t PacketId; 742698Sktlim@umich.edu 752698Sktlim@umich.educlass MemCmd 762669Sktlim@umich.edu{ 772669Sktlim@umich.edu friend class Packet; 782669Sktlim@umich.edu 792698Sktlim@umich.edu public: 802669Sktlim@umich.edu /** 812669Sktlim@umich.edu * List of all commands associated with a packet. 822669Sktlim@umich.edu */ 832698Sktlim@umich.edu enum Command 845494Sstever@gmail.com { 855606Snate@binkert.org InvalidCmd, 862669Sktlim@umich.edu ReadReq, 872669Sktlim@umich.edu ReadResp, 883647Srdreslin@umich.edu ReadRespWithInvalidate, 893647Srdreslin@umich.edu WriteReq, 904302Sktlim@umich.edu WriteResp, 914302Sktlim@umich.edu WritebackDirty, 922669Sktlim@umich.edu WritebackClean, 932698Sktlim@umich.edu WriteClean, // writes dirty data below without evicting 942669Sktlim@umich.edu CleanEvict, 952669Sktlim@umich.edu SoftPFReq, 962698Sktlim@umich.edu HardPFReq, 972669Sktlim@umich.edu SoftPFResp, 982669Sktlim@umich.edu HardPFResp, 992698Sktlim@umich.edu WriteLineReq, 1002669Sktlim@umich.edu UpgradeReq, 1012669Sktlim@umich.edu SCUpgradeReq, // Special "weak" upgrade for StoreCond 1022698Sktlim@umich.edu UpgradeResp, 1032669Sktlim@umich.edu SCUpgradeFailReq, // Failed SCUpgradeReq in MSHR (never sent) 1044475Sstever@eecs.umich.edu UpgradeFailResp, // Valid for SCUpgradeReq only 1054475Sstever@eecs.umich.edu ReadExReq, 1062669Sktlim@umich.edu ReadExResp, 1072698Sktlim@umich.edu ReadCleanReq, 1082698Sktlim@umich.edu ReadSharedReq, 1092669Sktlim@umich.edu LoadLockedReq, 1102669Sktlim@umich.edu StoreCondReq, 1112698Sktlim@umich.edu StoreCondFailReq, // Failed StoreCondReq in MSHR (never sent) 1122669Sktlim@umich.edu StoreCondResp, 1132669Sktlim@umich.edu SwapReq, 1141060SN/A SwapResp, 1152935Sksewell@umich.edu MessageReq, 1161060SN/A MessageResp, 1172329SN/A MemFenceReq, 1182329SN/A MemFenceResp, 1192292SN/A CleanSharedReq, 1202292SN/A CleanSharedResp, 1212292SN/A CleanInvalidReq, 1222292SN/A CleanInvalidResp, 1232292SN/A // Error responses 1242292SN/A // @TODO these should be classified as responses rather than 1252292SN/A // requests; coding them as requests initially for backwards 1262292SN/A // compatibility 1271060SN/A InvalidDestError, // packet dest field invalid 1281060SN/A BadAddressError, // memory address invalid 1291060SN/A FunctionalReadError, // unable to fulfill functional read 1301060SN/A FunctionalWriteError, // unable to fulfill functional write 1312292SN/A // Fake simulator-only commands 1322292SN/A PrintReq, // Print state matching address 1332292SN/A FlushReq, //request for a cache flush 1342307SN/A InvalidateReq, // request for address to be invalidated 1352669Sktlim@umich.edu InvalidateResp, 1362696Sktlim@umich.edu NUM_MEM_CMDS 1372669Sktlim@umich.edu }; 1381060SN/A 1391060SN/A private: 1402292SN/A /** 1412292SN/A * List of command attributes. 1422292SN/A */ 1432292SN/A enum Attribute 1442292SN/A { 1452292SN/A IsRead, //!< Data flows from responder to requester 1462292SN/A IsWrite, //!< Data flows from requester to responder 1472292SN/A IsUpgrade, 1481060SN/A IsInvalidate, 1492292SN/A IsClean, //!< Cleans any existing dirty blocks 1502292SN/A NeedsWritable, //!< Requires writable copy to complete in-cache 1512292SN/A IsRequest, //!< Issued by requester 1522292SN/A IsResponse, //!< Issue by responder 1532292SN/A NeedsResponse, //!< Requester needs response from target 1542292SN/A IsEviction, 1552292SN/A IsSWPrefetch, 1562292SN/A IsHWPrefetch, 1572292SN/A IsLlsc, //!< Alpha/MIPS LL or SC access 1582292SN/A HasData, //!< There is an associated payload 1592292SN/A IsError, //!< Error response 1606221Snate@binkert.org IsPrint, //!< Print state matching address (for debugging) 1611060SN/A IsFlush, //!< Flush the address from caches 1621060SN/A FromCache, //!< Request originated from a caching agent 1632292SN/A NUM_COMMAND_ATTRIBUTES 1645529Snate@binkert.org }; 1651684SN/A 1662292SN/A /** 1672292SN/A * Structure that defines attributes and other data associated 1681684SN/A * with a Command. 1692292SN/A */ 1701062SN/A struct CommandInfo 1711062SN/A { 1722871Sktlim@umich.edu /// Set of attribute flags. 1732871Sktlim@umich.edu const std::bitset<NUM_COMMAND_ATTRIBUTES> attributes; 1742871Sktlim@umich.edu /// Corresponding response for requests; InvalidCmd if no 1752292SN/A /// response is applicable. 1761060SN/A const Command response; 1771060SN/A /// String representation (for printing) 1782292SN/A const std::string str; 1796221Snate@binkert.org }; 1802292SN/A 1812292SN/A /// Array to map Command enum to associated info. 1821060SN/A static const CommandInfo commandInfo[]; 1831060SN/A 1842292SN/A private: 1852292SN/A 1862292SN/A Command cmd; 1874302Sktlim@umich.edu 1884302Sktlim@umich.edu bool 1894302Sktlim@umich.edu testCmdAttrib(MemCmd::Attribute attrib) const 1902292SN/A { 1912669Sktlim@umich.edu return commandInfo[cmd].attributes[attrib] != 0; 1922292SN/A } 1932843Sktlim@umich.edu 1942863Sktlim@umich.edu public: 1952843Sktlim@umich.edu 1962843Sktlim@umich.edu bool isRead() const { return testCmdAttrib(IsRead); } 1972843Sktlim@umich.edu bool isWrite() const { return testCmdAttrib(IsWrite); } 1982843Sktlim@umich.edu bool isUpgrade() const { return testCmdAttrib(IsUpgrade); } 1992843Sktlim@umich.edu bool isRequest() const { return testCmdAttrib(IsRequest); } 2002307SN/A bool isResponse() const { return testCmdAttrib(IsResponse); } 2012307SN/A bool needsWritable() const { return testCmdAttrib(NeedsWritable); } 2022348SN/A bool needsResponse() const { return testCmdAttrib(NeedsResponse); } 2032307SN/A bool isInvalidate() const { return testCmdAttrib(IsInvalidate); } 2042307SN/A bool isEviction() const { return testCmdAttrib(IsEviction); } 2052348SN/A bool isClean() const { return testCmdAttrib(IsClean); } 2062307SN/A bool fromCache() const { return testCmdAttrib(FromCache); } 2072307SN/A 2082348SN/A /** 2092292SN/A * A writeback is an eviction that carries data. 2101060SN/A */ 2111061SN/A bool isWriteback() const { return testCmdAttrib(IsEviction) && 2122329SN/A testCmdAttrib(HasData); } 2132329SN/A 2142292SN/A /** 2152292SN/A * Check if this particular packet type carries payload data. Note 2162292SN/A * that this does not reflect if the data pointer of the packet is 2172329SN/A * valid or not. 2182329SN/A */ 2192292SN/A bool hasData() const { return testCmdAttrib(HasData); } 2202292SN/A bool isLLSC() const { return testCmdAttrib(IsLlsc); } 2212292SN/A bool isSWPrefetch() const { return testCmdAttrib(IsSWPrefetch); } 2221061SN/A bool isHWPrefetch() const { return testCmdAttrib(IsHWPrefetch); } 2231061SN/A bool isPrefetch() const { return testCmdAttrib(IsSWPrefetch) || 2241061SN/A testCmdAttrib(IsHWPrefetch); } 2251763SN/A bool isError() const { return testCmdAttrib(IsError); } 2261061SN/A bool isPrint() const { return testCmdAttrib(IsPrint); } 2271061SN/A bool isFlush() const { return testCmdAttrib(IsFlush); } 2282935Sksewell@umich.edu 2291061SN/A Command 2301061SN/A responseCommand() const 2314636Sgblack@eecs.umich.edu { 2321062SN/A return commandInfo[cmd].response; 2331062SN/A } 2341062SN/A 2351062SN/A /// Return the string to a cmd given by idx. 2361062SN/A const std::string &toString() const { return commandInfo[cmd].str; } 2371763SN/A int toInt() const { return (int)cmd; } 2382292SN/A 2392292SN/A MemCmd(Command _cmd) : cmd(_cmd) { } 2402292SN/A MemCmd(int _cmd) : cmd((Command)_cmd) { } 2411062SN/A MemCmd() : cmd(InvalidCmd) { } 2421062SN/A 2436221Snate@binkert.org bool operator==(MemCmd c2) const { return (cmd == c2.cmd); } 2441062SN/A bool operator!=(MemCmd c2) const { return (cmd != c2.cmd); } 2452292SN/A}; 2464636Sgblack@eecs.umich.edu 2476221Snate@binkert.org/** 2481684SN/A * A Packet is used to encapsulate a transfer between two objects in 2492292SN/A * the memory system (e.g., the L1 and L2 cache). (In contrast, a 2502292SN/A * single Request travels all the way from the requester to the 2512292SN/A * ultimate destination and back, possibly being conveyed by several 2523795Sgblack@eecs.umich.edu * different Packets along the way.) 2534636Sgblack@eecs.umich.edu */ 2546221Snate@binkert.orgclass Packet : public Printable 2552292SN/A{ 2562292SN/A public: 2576221Snate@binkert.org typedef uint32_t FlagsType; 2582292SN/A typedef ::Flags<FlagsType> Flags; 2592292SN/A 2602292SN/A private: 2612292SN/A 2621684SN/A enum : FlagsType { 2631684SN/A // Flags to transfer across when copying a packet 2642292SN/A COPY_FLAGS = 0x0000003F, 2652292SN/A 2662292SN/A // Does this packet have sharers (which means it should not be 2672292SN/A // considered writable) or not. See setHasSharers below. 2683795Sgblack@eecs.umich.edu HAS_SHARERS = 0x00000001, 2694636Sgblack@eecs.umich.edu 2706221Snate@binkert.org // Special control flags 2711684SN/A /// Special timing-mode atomic snoop for multi-level coherence. 2722292SN/A EXPRESS_SNOOP = 0x00000002, 2732292SN/A 2742292SN/A /// Allow a responding cache to inform the cache hierarchy 2751684SN/A /// that it had a writable copy before responding. See 2761684SN/A /// setResponderHadWritable below. 2772292SN/A RESPONDER_HAD_WRITABLE = 0x00000004, 2782292SN/A 2792292SN/A // Snoop co-ordination flag to indicate that a cache is 2806221Snate@binkert.org // responding to a snoop. See setCacheResponding below. 2811684SN/A CACHE_RESPONDING = 0x00000008, 2822292SN/A 2832292SN/A // The writeback/writeclean should be propagated further 2842292SN/A // downstream by the receiver 2852292SN/A WRITE_THROUGH = 0x00000010, 2862292SN/A 2872292SN/A // Response co-ordination flag for cache maintenance 2882292SN/A // operations 2892292SN/A SATISFIED = 0x00000020, 2901062SN/A 2911062SN/A /// Are the 'addr' and 'size' fields valid? 2922107SN/A VALID_ADDR = 0x00000100, 2931062SN/A VALID_SIZE = 0x00000200, 2941062SN/A 2951061SN/A /// Is the data pointer set to a value that shouldn't be freed 2961060SN/A /// when the packet is destroyed? 2972698Sktlim@umich.edu STATIC_DATA = 0x00001000, 2982696Sktlim@umich.edu /// The data pointer points to a value that should be freed when 2992696Sktlim@umich.edu /// the packet is destroyed. The pointer is assumed to be pointing 3002292SN/A /// to an array, and delete [] is consequently called 3016221Snate@binkert.org DYNAMIC_DATA = 0x00002000, 3022292SN/A 3032292SN/A /// suppress the error if this packet encounters a functional 3046221Snate@binkert.org /// access failure. 3052292SN/A SUPPRESS_FUNC_ERROR = 0x00008000, 3062292SN/A 3076221Snate@binkert.org // Signal block present to squash prefetch and cache evict packets 3082292SN/A // through express snoop flag 3092292SN/A BLOCK_CACHED = 0x00010000 3106221Snate@binkert.org }; 3112292SN/A 3126221Snate@binkert.org Flags flags; 3136221Snate@binkert.org 3146221Snate@binkert.org public: 3152292SN/A typedef MemCmd::Command Command; 3162292SN/A 3172733Sktlim@umich.edu /// The command field of the packet. 3182733Sktlim@umich.edu MemCmd cmd; 3191060SN/A 3201060SN/A const PacketId id; 3211060SN/A 3221060SN/A /// A pointer to the original request. 3231060SN/A RequestPtr req; 3241060SN/A 3251060SN/A private: 3261060SN/A /** 3271060SN/A * A pointer to the data being transferred. It can be different 3281060SN/A * sizes at each level of the hierarchy so it belongs to the 3291060SN/A * packet, not request. This may or may not be populated when a 3301060SN/A * responder receives the packet. If not populated memory should 3311060SN/A * be allocated. 3321060SN/A */ 3331060SN/A PacketDataPtr data; 3341060SN/A 3351060SN/A /// The address of the request. This address could be virtual or 3361060SN/A /// physical, depending on the system configuration. 3371060SN/A Addr addr; 3381060SN/A 3391060SN/A /// True if the request targets the secure memory space. 3401060SN/A bool _isSecure; 3411060SN/A 3421060SN/A /// The size of the request or transfer. 3432669Sktlim@umich.edu unsigned size; 3441060SN/A 3451061SN/A /** 3461061SN/A * Track the bytes found that satisfy a functional read. 3471061SN/A */ 3484182Sgblack@eecs.umich.edu std::vector<bool> bytesValid; 3494182Sgblack@eecs.umich.edu 3504182Sgblack@eecs.umich.edu public: 3512348SN/A 3522292SN/A /** 3532292SN/A * The extra delay from seeing the packet until the header is 3544636Sgblack@eecs.umich.edu * transmitted. This delay is used to communicate the crossbar 3554636Sgblack@eecs.umich.edu * forwarding latency to the neighbouring object (e.g. a cache) 3564636Sgblack@eecs.umich.edu * that actually makes the packet wait. As the delay is relative, 3572348SN/A * a 32-bit unsigned should be sufficient. 3582292SN/A */ 3592292SN/A uint32_t headerDelay; 3602678Sktlim@umich.edu 3612678Sktlim@umich.edu /** 3622292SN/A * Keep track of the extra delay incurred by snooping upwards 3632292SN/A * before sending a request down the memory system. This is used 3642292SN/A * by the coherent crossbar to account for the additional request 3652292SN/A * delay. 3662292SN/A */ 3672292SN/A uint32_t snoopDelay; 3682292SN/A 3692292SN/A /** 3702292SN/A * The extra pipelining delay from seeing the packet until the end of 3712292SN/A * payload is transmitted by the component that provided it (if 3722292SN/A * any). This includes the header delay. Similar to the header 3732292SN/A * delay, this is used to make up for the fact that the 3742292SN/A * crossbar does not make the packet wait. As the delay is 3752292SN/A * relative, a 32-bit unsigned should be sufficient. 3762292SN/A */ 3772292SN/A uint32_t payloadDelay; 3782292SN/A 3792292SN/A /** 3802292SN/A * A virtual base opaque structure used to hold state associated 3811060SN/A * with the packet (e.g., an MSHR), specific to a MemObject that 3821060SN/A * sees the packet. A pointer to this state is returned in the 3831060SN/A * packet's response so that the MemObject in question can quickly 3841060SN/A * look up the state needed to process it. A specific subclass 3851060SN/A * would be derived from this to carry state specific to a 3861060SN/A * particular sending device. 3871060SN/A * 3881060SN/A * As multiple MemObjects may add their SenderState throughout the 3891060SN/A * memory system, the SenderStates create a stack, where a 3901060SN/A * MemObject can add a new Senderstate, as long as the 3911060SN/A * predecessing SenderState is restored when the response comes 3921060SN/A * back. For this reason, the predecessor should always be 3931060SN/A * populated with the current SenderState of a packet before 3941060SN/A * modifying the senderState field in the request packet. 3951060SN/A */ 3961060SN/A struct SenderState 3972696Sktlim@umich.edu { 3982696Sktlim@umich.edu SenderState* predecessor; 3992696Sktlim@umich.edu SenderState() : predecessor(NULL) {} 4002696Sktlim@umich.edu virtual ~SenderState() {} 4012696Sktlim@umich.edu }; 4022696Sktlim@umich.edu 4032696Sktlim@umich.edu /** 4046221Snate@binkert.org * Object used to maintain state of a PrintReq. The senderState 4052696Sktlim@umich.edu * field of a PrintReq should always be of this type. 4061060SN/A */ 4071062SN/A class PrintReqState : public SenderState 4081060SN/A { 4091060SN/A private: 4101062SN/A /** 4111060SN/A * An entry in the label stack. 4121062SN/A */ 4132292SN/A struct LabelStackEntry 4141060SN/A { 4152893Sktlim@umich.edu const std::string label; 4162893Sktlim@umich.edu std::string *prefix; 4172893Sktlim@umich.edu bool labelPrinted; 4182906Sktlim@umich.edu LabelStackEntry(const std::string &_label, std::string *_prefix); 4192906Sktlim@umich.edu }; 4202906Sktlim@umich.edu 4211060SN/A typedef std::list<LabelStackEntry> LabelStack; 4221060SN/A LabelStack labelStack; 4231060SN/A 4241060SN/A std::string *curPrefixPtr; 4252292SN/A 4261062SN/A public: 4272292SN/A std::ostream &os; 4286221Snate@binkert.org const int verbosity; 4292292SN/A 4302292SN/A PrintReqState(std::ostream &os, int verbosity = 0); 4316221Snate@binkert.org ~PrintReqState(); 4322292SN/A 4332292SN/A /** 4346221Snate@binkert.org * Returns the current line prefix. 4352292SN/A */ 4362292SN/A const std::string &curPrefix() { return *curPrefixPtr; } 4376221Snate@binkert.org 4382292SN/A /** 4392348SN/A * Push a label onto the label stack, and prepend the given 4402348SN/A * prefix string onto the current prefix. Labels will only be 4412348SN/A * printed if an object within the label's scope is printed. 4422292SN/A */ 4432292SN/A void pushLabel(const std::string &lbl, 4442843Sktlim@umich.edu const std::string &prefix = " "); 4452843Sktlim@umich.edu 4462843Sktlim@umich.edu /** 4472348SN/A * Pop a label off the label stack. 4482307SN/A */ 4492307SN/A void popLabel(); 4502292SN/A 4512292SN/A /** 4525999Snate@binkert.org * Print all of the pending unprinted labels on the 4532292SN/A * stack. Called by printObj(), so normally not called by 4545999Snate@binkert.org * users unless bypassing printObj(). 4552727Sktlim@umich.edu */ 4565999Snate@binkert.org void printLabels(); 4572292SN/A 4585999Snate@binkert.org /** 4592292SN/A * Print a Printable object to os, because it matched the 4605999Snate@binkert.org * address on a PrintReq. 4612292SN/A */ 4625999Snate@binkert.org void printObj(Printable *obj); 4632292SN/A }; 4642292SN/A 4652292SN/A /** 4665999Snate@binkert.org * This packet's sender state. Devices should use dynamic_cast<> 4672348SN/A * to cast to the state appropriate to the sender. The intent of 4685999Snate@binkert.org * this variable is to allow a device to attach extra information 4692348SN/A * to a request. A response packet must return the sender state 4705999Snate@binkert.org * that was attached to the original request (even if a new packet 4712292SN/A * is created). 4725999Snate@binkert.org */ 4732348SN/A SenderState *senderState; 4742348SN/A 4752348SN/A /** 4765999Snate@binkert.org * Push a new sender state to the packet and make the current 4772292SN/A * sender state the predecessor of the new one. This should be 4785999Snate@binkert.org * prefered over direct manipulation of the senderState member 4792348SN/A * variable. 4802292SN/A * 4812348SN/A * @param sender_state SenderState to push at the top of the stack 4822292SN/A */ 4832348SN/A void pushSenderState(SenderState *sender_state); 4842292SN/A 4851060SN/A /** 4861060SN/A * Pop the top of the state stack and return a pointer to it. This 4872292SN/A * assumes the current sender state is not NULL. This should be 488 * preferred over direct manipulation of the senderState member 489 * variable. 490 * 491 * @return The current top of the stack 492 */ 493 SenderState *popSenderState(); 494 495 /** 496 * Go through the sender state stack and return the first instance 497 * that is of type T (as determined by a dynamic_cast). If there 498 * is no sender state of type T, NULL is returned. 499 * 500 * @return The topmost state of type T 501 */ 502 template <typename T> 503 T * findNextSenderState() const 504 { 505 T *t = NULL; 506 SenderState* sender_state = senderState; 507 while (t == NULL && sender_state != NULL) { 508 t = dynamic_cast<T*>(sender_state); 509 sender_state = sender_state->predecessor; 510 } 511 return t; 512 } 513 514 /// Return the string name of the cmd field (for debugging and 515 /// tracing). 516 const std::string &cmdString() const { return cmd.toString(); } 517 518 /// Return the index of this command. 519 inline int cmdToIndex() const { return cmd.toInt(); } 520 521 bool isRead() const { return cmd.isRead(); } 522 bool isWrite() const { return cmd.isWrite(); } 523 bool isUpgrade() const { return cmd.isUpgrade(); } 524 bool isRequest() const { return cmd.isRequest(); } 525 bool isResponse() const { return cmd.isResponse(); } 526 bool needsWritable() const 527 { 528 // we should never check if a response needsWritable, the 529 // request has this flag, and for a response we should rather 530 // look at the hasSharers flag (if not set, the response is to 531 // be considered writable) 532 assert(isRequest()); 533 return cmd.needsWritable(); 534 } 535 bool needsResponse() const { return cmd.needsResponse(); } 536 bool isInvalidate() const { return cmd.isInvalidate(); } 537 bool isEviction() const { return cmd.isEviction(); } 538 bool isClean() const { return cmd.isClean(); } 539 bool fromCache() const { return cmd.fromCache(); } 540 bool isWriteback() const { return cmd.isWriteback(); } 541 bool hasData() const { return cmd.hasData(); } 542 bool hasRespData() const 543 { 544 MemCmd resp_cmd = cmd.responseCommand(); 545 return resp_cmd.hasData(); 546 } 547 bool isLLSC() const { return cmd.isLLSC(); } 548 bool isError() const { return cmd.isError(); } 549 bool isPrint() const { return cmd.isPrint(); } 550 bool isFlush() const { return cmd.isFlush(); } 551 552 //@{ 553 /// Snoop flags 554 /** 555 * Set the cacheResponding flag. This is used by the caches to 556 * signal another cache that they are responding to a request. A 557 * cache will only respond to snoops if it has the line in either 558 * Modified or Owned state. Note that on snoop hits we always pass 559 * the line as Modified and never Owned. In the case of an Owned 560 * line we proceed to invalidate all other copies. 561 * 562 * On a cache fill (see Cache::handleFill), we check hasSharers 563 * first, ignoring the cacheResponding flag if hasSharers is set. 564 * A line is consequently allocated as: 565 * 566 * hasSharers cacheResponding state 567 * true false Shared 568 * true true Shared 569 * false false Exclusive 570 * false true Modified 571 */ 572 void setCacheResponding() 573 { 574 assert(isRequest()); 575 assert(!flags.isSet(CACHE_RESPONDING)); 576 flags.set(CACHE_RESPONDING); 577 } 578 bool cacheResponding() const { return flags.isSet(CACHE_RESPONDING); } 579 /** 580 * On fills, the hasSharers flag is used by the caches in 581 * combination with the cacheResponding flag, as clarified 582 * above. If the hasSharers flag is not set, the packet is passing 583 * writable. Thus, a response from a memory passes the line as 584 * writable by default. 585 * 586 * The hasSharers flag is also used by upstream caches to inform a 587 * downstream cache that they have the block (by calling 588 * setHasSharers on snoop request packets that hit in upstream 589 * cachs tags or MSHRs). If the snoop packet has sharers, a 590 * downstream cache is prevented from passing a dirty line upwards 591 * if it was not explicitly asked for a writable copy. See 592 * Cache::satisfyCpuSideRequest. 593 * 594 * The hasSharers flag is also used on writebacks, in 595 * combination with the WritbackClean or WritebackDirty commands, 596 * to allocate the block downstream either as: 597 * 598 * command hasSharers state 599 * WritebackDirty false Modified 600 * WritebackDirty true Owned 601 * WritebackClean false Exclusive 602 * WritebackClean true Shared 603 */ 604 void setHasSharers() { flags.set(HAS_SHARERS); } 605 bool hasSharers() const { return flags.isSet(HAS_SHARERS); } 606 //@} 607 608 /** 609 * The express snoop flag is used for two purposes. Firstly, it is 610 * used to bypass flow control for normal (non-snoop) requests 611 * going downstream in the memory system. In cases where a cache 612 * is responding to a snoop from another cache (it had a dirty 613 * line), but the line is not writable (and there are possibly 614 * other copies), the express snoop flag is set by the downstream 615 * cache to invalidate all other copies in zero time. Secondly, 616 * the express snoop flag is also set to be able to distinguish 617 * snoop packets that came from a downstream cache, rather than 618 * snoop packets from neighbouring caches. 619 */ 620 void setExpressSnoop() { flags.set(EXPRESS_SNOOP); } 621 bool isExpressSnoop() const { return flags.isSet(EXPRESS_SNOOP); } 622 623 /** 624 * On responding to a snoop request (which only happens for 625 * Modified or Owned lines), make sure that we can transform an 626 * Owned response to a Modified one. If this flag is not set, the 627 * responding cache had the line in the Owned state, and there are 628 * possibly other Shared copies in the memory system. A downstream 629 * cache helps in orchestrating the invalidation of these copies 630 * by sending out the appropriate express snoops. 631 */ 632 void setResponderHadWritable() 633 { 634 assert(cacheResponding()); 635 assert(!responderHadWritable()); 636 flags.set(RESPONDER_HAD_WRITABLE); 637 } 638 bool responderHadWritable() const 639 { return flags.isSet(RESPONDER_HAD_WRITABLE); } 640 641 /** 642 * A writeback/writeclean cmd gets propagated further downstream 643 * by the receiver when the flag is set. 644 */ 645 void setWriteThrough() 646 { 647 assert(cmd.isWrite() && 648 (cmd.isEviction() || cmd == MemCmd::WriteClean)); 649 flags.set(WRITE_THROUGH); 650 } 651 void clearWriteThrough() { flags.clear(WRITE_THROUGH); } 652 bool writeThrough() const { return flags.isSet(WRITE_THROUGH); } 653 654 /** 655 * Set when a request hits in a cache and the cache is not going 656 * to respond. This is used by the crossbar to coordinate 657 * responses for cache maintenance operations. 658 */ 659 void setSatisfied() 660 { 661 assert(cmd.isClean()); 662 assert(!flags.isSet(SATISFIED)); 663 flags.set(SATISFIED); 664 } 665 bool satisfied() const { return flags.isSet(SATISFIED); } 666 667 void setSuppressFuncError() { flags.set(SUPPRESS_FUNC_ERROR); } 668 bool suppressFuncError() const { return flags.isSet(SUPPRESS_FUNC_ERROR); } 669 void setBlockCached() { flags.set(BLOCK_CACHED); } 670 bool isBlockCached() const { return flags.isSet(BLOCK_CACHED); } 671 void clearBlockCached() { flags.clear(BLOCK_CACHED); } 672 673 // Network error conditions... encapsulate them as methods since 674 // their encoding keeps changing (from result field to command 675 // field, etc.) 676 void 677 setBadAddress() 678 { 679 assert(isResponse()); 680 cmd = MemCmd::BadAddressError; 681 } 682 683 void copyError(Packet *pkt) { assert(pkt->isError()); cmd = pkt->cmd; } 684 685 Addr getAddr() const { assert(flags.isSet(VALID_ADDR)); return addr; } 686 /** 687 * Update the address of this packet mid-transaction. This is used 688 * by the address mapper to change an already set address to a new 689 * one based on the system configuration. It is intended to remap 690 * an existing address, so it asserts that the current address is 691 * valid. 692 */ 693 void setAddr(Addr _addr) { assert(flags.isSet(VALID_ADDR)); addr = _addr; } 694 695 unsigned getSize() const { assert(flags.isSet(VALID_SIZE)); return size; } 696 697 Addr getOffset(unsigned int blk_size) const 698 { 699 return getAddr() & Addr(blk_size - 1); 700 } 701 702 Addr getBlockAddr(unsigned int blk_size) const 703 { 704 return getAddr() & ~(Addr(blk_size - 1)); 705 } 706 707 bool isSecure() const 708 { 709 assert(flags.isSet(VALID_ADDR)); 710 return _isSecure; 711 } 712 713 /** 714 * Accessor function to atomic op. 715 */ 716 AtomicOpFunctor *getAtomicOp() const { return req->getAtomicOpFunctor(); } 717 bool isAtomicOp() const { return req->isAtomic(); } 718 719 /** 720 * It has been determined that the SC packet should successfully update 721 * memory. Therefore, convert this SC packet to a normal write. 722 */ 723 void 724 convertScToWrite() 725 { 726 assert(isLLSC()); 727 assert(isWrite()); 728 cmd = MemCmd::WriteReq; 729 } 730 731 /** 732 * When ruby is in use, Ruby will monitor the cache line and the 733 * phys memory should treat LL ops as normal reads. 734 */ 735 void 736 convertLlToRead() 737 { 738 assert(isLLSC()); 739 assert(isRead()); 740 cmd = MemCmd::ReadReq; 741 } 742 743 /** 744 * Constructor. Note that a Request object must be constructed 745 * first, but the Requests's physical address and size fields need 746 * not be valid. The command must be supplied. 747 */ 748 Packet(const RequestPtr &_req, MemCmd _cmd) 749 : cmd(_cmd), id((PacketId)_req.get()), req(_req), data(nullptr), 750 addr(0), _isSecure(false), size(0), headerDelay(0), snoopDelay(0), 751 payloadDelay(0), senderState(NULL) 752 { 753 if (req->hasPaddr()) { 754 addr = req->getPaddr(); 755 flags.set(VALID_ADDR); 756 _isSecure = req->isSecure(); 757 } 758 if (req->hasSize()) { 759 size = req->getSize(); 760 flags.set(VALID_SIZE); 761 } 762 } 763 764 /** 765 * Alternate constructor if you are trying to create a packet with 766 * a request that is for a whole block, not the address from the 767 * req. this allows for overriding the size/addr of the req. 768 */ 769 Packet(const RequestPtr &_req, MemCmd _cmd, int _blkSize, PacketId _id = 0) 770 : cmd(_cmd), id(_id ? _id : (PacketId)_req.get()), req(_req), 771 data(nullptr), addr(0), _isSecure(false), headerDelay(0), 772 snoopDelay(0), payloadDelay(0), senderState(NULL) 773 { 774 if (req->hasPaddr()) { 775 addr = req->getPaddr() & ~(_blkSize - 1); 776 flags.set(VALID_ADDR); 777 _isSecure = req->isSecure(); 778 } 779 size = _blkSize; 780 flags.set(VALID_SIZE); 781 } 782 783 /** 784 * Alternate constructor for copying a packet. Copy all fields 785 * *except* if the original packet's data was dynamic, don't copy 786 * that, as we can't guarantee that the new packet's lifetime is 787 * less than that of the original packet. In this case the new 788 * packet should allocate its own data. 789 */ 790 Packet(const PacketPtr pkt, bool clear_flags, bool alloc_data) 791 : cmd(pkt->cmd), id(pkt->id), req(pkt->req), 792 data(nullptr), 793 addr(pkt->addr), _isSecure(pkt->_isSecure), size(pkt->size), 794 bytesValid(pkt->bytesValid), 795 headerDelay(pkt->headerDelay), 796 snoopDelay(0), 797 payloadDelay(pkt->payloadDelay), 798 senderState(pkt->senderState) 799 { 800 if (!clear_flags) 801 flags.set(pkt->flags & COPY_FLAGS); 802 803 flags.set(pkt->flags & (VALID_ADDR|VALID_SIZE)); 804 805 // should we allocate space for data, or not, the express 806 // snoops do not need to carry any data as they only serve to 807 // co-ordinate state changes 808 if (alloc_data) { 809 // even if asked to allocate data, if the original packet 810 // holds static data, then the sender will not be doing 811 // any memcpy on receiving the response, thus we simply 812 // carry the pointer forward 813 if (pkt->flags.isSet(STATIC_DATA)) { 814 data = pkt->data; 815 flags.set(STATIC_DATA); 816 } else { 817 allocate(); 818 } 819 } 820 } 821 822 /** 823 * Generate the appropriate read MemCmd based on the Request flags. 824 */ 825 static MemCmd 826 makeReadCmd(const RequestPtr &req) 827 { 828 if (req->isLLSC()) 829 return MemCmd::LoadLockedReq; 830 else if (req->isPrefetch()) 831 return MemCmd::SoftPFReq; 832 else 833 return MemCmd::ReadReq; 834 } 835 836 /** 837 * Generate the appropriate write MemCmd based on the Request flags. 838 */ 839 static MemCmd 840 makeWriteCmd(const RequestPtr &req) 841 { 842 if (req->isLLSC()) 843 return MemCmd::StoreCondReq; 844 else if (req->isSwap() || req->isAtomic()) 845 return MemCmd::SwapReq; 846 else if (req->isCacheInvalidate()) { 847 return req->isCacheClean() ? MemCmd::CleanInvalidReq : 848 MemCmd::InvalidateReq; 849 } else if (req->isCacheClean()) { 850 return MemCmd::CleanSharedReq; 851 } else 852 return MemCmd::WriteReq; 853 } 854 855 /** 856 * Constructor-like methods that return Packets based on Request objects. 857 * Fine-tune the MemCmd type if it's not a vanilla read or write. 858 */ 859 static PacketPtr 860 createRead(const RequestPtr &req) 861 { 862 return new Packet(req, makeReadCmd(req)); 863 } 864 865 static PacketPtr 866 createWrite(const RequestPtr &req) 867 { 868 return new Packet(req, makeWriteCmd(req)); 869 } 870 871 /** 872 * clean up packet variables 873 */ 874 ~Packet() 875 { 876 deleteData(); 877 } 878 879 /** 880 * Take a request packet and modify it in place to be suitable for 881 * returning as a response to that request. 882 */ 883 void 884 makeResponse() 885 { 886 assert(needsResponse()); 887 assert(isRequest()); 888 cmd = cmd.responseCommand(); 889 890 // responses are never express, even if the snoop that 891 // triggered them was 892 flags.clear(EXPRESS_SNOOP); 893 } 894 895 void 896 makeAtomicResponse() 897 { 898 makeResponse(); 899 } 900 901 void 902 makeTimingResponse() 903 { 904 makeResponse(); 905 } 906 907 void 908 setFunctionalResponseStatus(bool success) 909 { 910 if (!success) { 911 if (isWrite()) { 912 cmd = MemCmd::FunctionalWriteError; 913 } else { 914 cmd = MemCmd::FunctionalReadError; 915 } 916 } 917 } 918 919 void 920 setSize(unsigned size) 921 { 922 assert(!flags.isSet(VALID_SIZE)); 923 924 this->size = size; 925 flags.set(VALID_SIZE); 926 } 927 928 929 public: 930 /** 931 * @{ 932 * @name Data accessor mehtods 933 */ 934 935 /** 936 * Set the data pointer to the following value that should not be 937 * freed. Static data allows us to do a single memcpy even if 938 * multiple packets are required to get from source to destination 939 * and back. In essence the pointer is set calling dataStatic on 940 * the original packet, and whenever this packet is copied and 941 * forwarded the same pointer is passed on. When a packet 942 * eventually reaches the destination holding the data, it is 943 * copied once into the location originally set. On the way back 944 * to the source, no copies are necessary. 945 */ 946 template <typename T> 947 void 948 dataStatic(T *p) 949 { 950 assert(flags.noneSet(STATIC_DATA|DYNAMIC_DATA)); 951 data = (PacketDataPtr)p; 952 flags.set(STATIC_DATA); 953 } 954 955 /** 956 * Set the data pointer to the following value that should not be 957 * freed. This version of the function allows the pointer passed 958 * to us to be const. To avoid issues down the line we cast the 959 * constness away, the alternative would be to keep both a const 960 * and non-const data pointer and cleverly choose between 961 * them. Note that this is only allowed for static data. 962 */ 963 template <typename T> 964 void 965 dataStaticConst(const T *p) 966 { 967 assert(flags.noneSet(STATIC_DATA|DYNAMIC_DATA)); 968 data = const_cast<PacketDataPtr>(p); 969 flags.set(STATIC_DATA); 970 } 971 972 /** 973 * Set the data pointer to a value that should have delete [] 974 * called on it. Dynamic data is local to this packet, and as the 975 * packet travels from source to destination, forwarded packets 976 * will allocate their own data. When a packet reaches the final 977 * destination it will populate the dynamic data of that specific 978 * packet, and on the way back towards the source, memcpy will be 979 * invoked in every step where a new packet was created e.g. in 980 * the caches. Ultimately when the response reaches the source a 981 * final memcpy is needed to extract the data from the packet 982 * before it is deallocated. 983 */ 984 template <typename T> 985 void 986 dataDynamic(T *p) 987 { 988 assert(flags.noneSet(STATIC_DATA|DYNAMIC_DATA)); 989 data = (PacketDataPtr)p; 990 flags.set(DYNAMIC_DATA); 991 } 992 993 /** 994 * get a pointer to the data ptr. 995 */ 996 template <typename T> 997 T* 998 getPtr() 999 { 1000 assert(flags.isSet(STATIC_DATA|DYNAMIC_DATA)); 1001 return (T*)data; 1002 } 1003 1004 template <typename T> 1005 const T* 1006 getConstPtr() const 1007 { 1008 assert(flags.isSet(STATIC_DATA|DYNAMIC_DATA)); 1009 return (const T*)data; 1010 } 1011 1012 /** 1013 * Get the data in the packet byte swapped from big endian to 1014 * host endian. 1015 */ 1016 template <typename T> 1017 T getBE() const; 1018 1019 /** 1020 * Get the data in the packet byte swapped from little endian to 1021 * host endian. 1022 */ 1023 template <typename T> 1024 T getLE() const; 1025 1026 /** 1027 * Get the data in the packet byte swapped from the specified 1028 * endianness. 1029 */ 1030 template <typename T> 1031 T get(ByteOrder endian) const; 1032 1033 /** 1034 * Get the data in the packet byte swapped from guest to host 1035 * endian. 1036 */ 1037 template <typename T> 1038 T get() const; 1039 1040 /** Set the value in the data pointer to v as big endian. */ 1041 template <typename T> 1042 void setBE(T v); 1043 1044 /** Set the value in the data pointer to v as little endian. */ 1045 template <typename T> 1046 void setLE(T v); 1047 1048 /** 1049 * Set the value in the data pointer to v using the specified 1050 * endianness. 1051 */ 1052 template <typename T> 1053 void set(T v, ByteOrder endian); 1054 1055 /** Set the value in the data pointer to v as guest endian. */ 1056 template <typename T> 1057 void set(T v); 1058 1059 1060 /** 1061 * Get the data in the packet byte swapped from the specified 1062 * endianness and zero-extended to 64 bits. 1063 */ 1064 uint64_t getUintX(ByteOrder endian) const; 1065 1066 /** 1067 * Set the value in the word w after truncating it to the length 1068 * of the packet and then byteswapping it to the desired 1069 * endianness. 1070 */ 1071 void setUintX(uint64_t w, ByteOrder endian); 1072 1073 /** 1074 * Copy data into the packet from the provided pointer. 1075 */ 1076 void 1077 setData(const uint8_t *p) 1078 { 1079 // we should never be copying data onto itself, which means we 1080 // must idenfity packets with static data, as they carry the 1081 // same pointer from source to destination and back 1082 assert(p != getPtr<uint8_t>() || flags.isSet(STATIC_DATA)); 1083 1084 if (p != getPtr<uint8_t>()) 1085 // for packet with allocated dynamic data, we copy data from 1086 // one to the other, e.g. a forwarded response to a response 1087 std::memcpy(getPtr<uint8_t>(), p, getSize()); 1088 } 1089 1090 /** 1091 * Copy data into the packet from the provided block pointer, 1092 * which is aligned to the given block size. 1093 */ 1094 void 1095 setDataFromBlock(const uint8_t *blk_data, int blkSize) 1096 { 1097 setData(blk_data + getOffset(blkSize)); 1098 } 1099 1100 /** 1101 * Copy data from the packet to the memory at the provided pointer. 1102 * @param p Pointer to which data will be copied. 1103 */ 1104 void 1105 writeData(uint8_t *p) const 1106 { 1107 std::memcpy(p, getConstPtr<uint8_t>(), getSize()); 1108 } 1109 1110 /** 1111 * Copy data from the packet to the provided block pointer, which 1112 * is aligned to the given block size. 1113 * @param blk_data Pointer to block to which data will be copied. 1114 * @param blkSize Block size in bytes. 1115 */ 1116 void 1117 writeDataToBlock(uint8_t *blk_data, int blkSize) const 1118 { 1119 writeData(blk_data + getOffset(blkSize)); 1120 } 1121 1122 /** 1123 * delete the data pointed to in the data pointer. Ok to call to 1124 * matter how data was allocted. 1125 */ 1126 void 1127 deleteData() 1128 { 1129 if (flags.isSet(DYNAMIC_DATA)) 1130 delete [] data; 1131 1132 flags.clear(STATIC_DATA|DYNAMIC_DATA); 1133 data = NULL; 1134 } 1135 1136 /** Allocate memory for the packet. */ 1137 void 1138 allocate() 1139 { 1140 // if either this command or the response command has a data 1141 // payload, actually allocate space 1142 if (hasData() || hasRespData()) { 1143 assert(flags.noneSet(STATIC_DATA|DYNAMIC_DATA)); 1144 flags.set(DYNAMIC_DATA); 1145 data = new uint8_t[getSize()]; 1146 } 1147 } 1148 1149 /** @} */ 1150 1151 private: // Private data accessor methods 1152 /** Get the data in the packet without byte swapping. */ 1153 template <typename T> 1154 T getRaw() const; 1155 1156 /** Set the value in the data pointer to v without byte swapping. */ 1157 template <typename T> 1158 void setRaw(T v); 1159 1160 public: 1161 /** 1162 * Check a functional request against a memory value stored in 1163 * another packet (i.e. an in-transit request or 1164 * response). Returns true if the current packet is a read, and 1165 * the other packet provides the data, which is then copied to the 1166 * current packet. If the current packet is a write, and the other 1167 * packet intersects this one, then we update the data 1168 * accordingly. 1169 */ 1170 bool 1171 trySatisfyFunctional(PacketPtr other) 1172 { 1173 // all packets that are carrying a payload should have a valid 1174 // data pointer 1175 return trySatisfyFunctional(other, other->getAddr(), other->isSecure(), 1176 other->getSize(), 1177 other->hasData() ? 1178 other->getPtr<uint8_t>() : NULL); 1179 } 1180 1181 /** 1182 * Does the request need to check for cached copies of the same block 1183 * in the memory hierarchy above. 1184 **/ 1185 bool 1186 mustCheckAbove() const 1187 { 1188 return cmd == MemCmd::HardPFReq || isEviction(); 1189 } 1190 1191 /** 1192 * Is this packet a clean eviction, including both actual clean 1193 * evict packets, but also clean writebacks. 1194 */ 1195 bool 1196 isCleanEviction() const 1197 { 1198 return cmd == MemCmd::CleanEvict || cmd == MemCmd::WritebackClean; 1199 } 1200 1201 /** 1202 * Check a functional request against a memory value represented 1203 * by a base/size pair and an associated data array. If the 1204 * current packet is a read, it may be satisfied by the memory 1205 * value. If the current packet is a write, it may update the 1206 * memory value. 1207 */ 1208 bool 1209 trySatisfyFunctional(Printable *obj, Addr base, bool is_secure, int size, 1210 uint8_t *_data); 1211 1212 /** 1213 * Push label for PrintReq (safe to call unconditionally). 1214 */ 1215 void 1216 pushLabel(const std::string &lbl) 1217 { 1218 if (isPrint()) 1219 safe_cast<PrintReqState*>(senderState)->pushLabel(lbl); 1220 } 1221 1222 /** 1223 * Pop label for PrintReq (safe to call unconditionally). 1224 */ 1225 void 1226 popLabel() 1227 { 1228 if (isPrint()) 1229 safe_cast<PrintReqState*>(senderState)->popLabel(); 1230 } 1231 1232 void print(std::ostream &o, int verbosity = 0, 1233 const std::string &prefix = "") const; 1234 1235 /** 1236 * A no-args wrapper of print(std::ostream...) 1237 * meant to be invoked from DPRINTFs 1238 * avoiding string overheads in fast mode 1239 * @return string with the request's type and start<->end addresses 1240 */ 1241 std::string print() const; 1242}; 1243 1244#endif //__MEM_PACKET_HH 1245