src/mem/packet.cc

   1 /*
   2  * Copyright (c) 2006 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  * Authors: Ali Saidi
  29  *          Steve Reinhardt
  30  */
  31
  32 /**
  33  * @file
  34  * Definition of the Packet Class, a packet is a transaction occuring
  35  * between a single level of the memory heirarchy (ie L1->L2).
  36  */
  37 #include "base/misc.hh"
  38 #include "mem/packet.hh"
  39
  40 static const std::string ReadReqString("ReadReq");
  41 static const std::string WriteReqString("WriteReq");
  42 static const std::string WriteReqNoAckString("WriteReqNoAck");
  43 static const std::string ReadRespString("ReadResp");
  44 static const std::string WriteRespString("WriteResp");
  45 static const std::string OtherCmdString("<other>");
  46
  47 const std::string &
  48 Packet::cmdString() const
  49 {
  50     switch (cmd) {
  51       case ReadReq:         return ReadReqString;
  52       case WriteReq:        return WriteReqString;
  53       case WriteReqNoAck:   return WriteReqNoAckString;
  54       case ReadResp:        return ReadRespString;
  55       case WriteResp:       return WriteRespString;
  56       default:              return OtherCmdString;
  57     }
  58 }
  59
  60 const std::string &
  61 Packet::cmdIdxToString(Packet::Command idx)
  62 {
  63     switch (idx) {
  64       case ReadReq:         return ReadReqString;
  65       case WriteReq:        return WriteReqString;
  66       case WriteReqNoAck:   return WriteReqNoAckString;
  67       case ReadResp:        return ReadRespString;
  68       case WriteResp:       return WriteRespString;
  69       default:              return OtherCmdString;
  70     }
  71 }
  72
  73 /** delete the data pointed to in the data pointer. Ok to call to matter how
  74  * data was allocted. */
  75 void
  76 Packet::deleteData()
  77 {
  78     assert(staticData || dynamicData);
  79     if (staticData)
  80         return;
  81
  82     if (arrayData)
  83         delete [] data;
  84     else
  85         delete data;
  86 }
  87
  88 /** If there isn't data in the packet, allocate some. */
  89 void
  90 Packet::allocate()
  91 {
  92     if (data)
  93         return;
  94     assert(!staticData);
  95     dynamicData = true;
  96     arrayData = true;
  97     data = new uint8_t[getSize()];
  98 }
  99
 100 /** Do the packet modify the same addresses. */
 101 bool
 102 Packet::intersect(Packet *p)
 103 {
 104     Addr s1 = getAddr();
 105     Addr e1 = getAddr() + getSize();
 106     Addr s2 = p->getAddr();
 107     Addr e2 = p->getAddr() + p->getSize();
 108
 109     if (s1 >= s2 && s1 < e2)
 110         return true;
 111     if (e1 >= s2 && e1 < e2)
 112         return true;
 113     return false;
 114 }
 115
 116 bool
 117 fixPacket(Packet *func, Packet *timing)
 118 {
 119     panic("Need to implement!");
 120 }