packet.hh revision 2381
1/* 2 * Copyright (c) 2003 The Regents of The University of Michigan 3 * All rights reserved. 4 * 5 * Redistribution and use in source and binary forms, with or without 6 * modification, are permitted provided that the following conditions are 7 * met: redistributions of source code must retain the above copyright 8 * notice, this list of conditions and the following disclaimer; 9 * redistributions in binary form must reproduce the above copyright 10 * notice, this list of conditions and the following disclaimer in the 11 * documentation and/or other materials provided with the distribution; 12 * neither the name of the copyright holders nor the names of its 13 * contributors may be used to endorse or promote products derived from 14 * this software without specific prior written permission. 15 * 16 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS 17 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT 18 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR 19 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT 20 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, 21 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT 22 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 23 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 24 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 25 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE 26 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 27 */ 28 29/** 30 * @file 31 * Declaration of the Packet Class, a packet is a transaction occuring 32 * between a single level of the memory heirarchy (ie L1->L2). 33 */ 34 35#ifndef __MEM_PACKET_HH__ 36#define __MEM_PACKET_HH__ 37 38/** 39 * A Packet is the structure to handle requests between two levels 40 * of the memory system. The Request is a global object that trancends 41 * all of the memory heirarchy, but at each levels interface a packet 42 * is created to transfer data/requests. For example, a request would 43 * be used to initiate a request to go to memory/IOdevices, as the request 44 * passes through the memory system several packets will be created. One 45 * will be created to go between the L1 and L2 caches and another to go to 46 * the next level and so forth. 47 * 48 * Packets are assumed to be returned in the case of a single response. If 49 * the transaction has no response, then the consumer will delete the packet. 50 */ 51struct Packet 52{ 53 /** The address of the request, could be virtual or physical (depending on 54 cache configurations). */ 55 Addr addr; 56 57 /** Flag structure to hold flags for this particular packet */ 58 uint64_t flags; 59 60 /** A pointer to the overall request. */ 61 RequestPtr req; 62 63 /** A virtual base opaque structure used to hold 64 coherence status messages. */ 65 Coherence *coherence; // virtual base opaque, 66 // assert(dynamic_cast<Foo>) etc. 67 68 /** A virtual base opaque structure used to hold the senders state. */ 69 SenderState *senderState; // virtual base opaque, 70 // assert(dynamic_cast<Foo>) etc. 71 72 /** A pointer to the data being transfered. It can be differnt sizes 73 at each level of the heirarchy so it belongs in the packet, 74 not request*/ 75 PacketDataPtr data; 76 77 /** Indicates the size of the request. */ 78 int size; 79 80 /** A index of the source of the transaction. */ 81 short src; 82 83 /** A index to the destination of the transaction. */ 84 short dest; 85 86 /** The command of the transaction. */ 87 Command cmd; 88 89 /** The result of the packet transaction. */ 90 PacketResult result; 91 92 /** Accessor function that returns the source index of the packet. */ 93 short getSrc() const { return src; } 94 95 /** Accessor function that returns the destination index of 96 the packet. */ 97 short getDest() const { return dest; } 98}; 99 100#endif //__MEM_PACKET_HH 101