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
  29 /**
  30  * @file
  31  * Definition of the Packet Class, a packet is a transaction occuring
  32  * between a single level of the memory heirarchy (ie L1->L2).
  33  */
  34 #include "base/misc.hh"
  35 #include "mem/packet.hh"
  36
  37
  38 /** delete the data pointed to in the data pointer. Ok to call to matter how
  39  * data was allocted. */
  40 void
  41 Packet::deleteData() {
  42     assert(staticData || dynamicData);
  43     if (staticData)
  44         return;
  45
  46     if (arrayData)
  47         delete [] data;
  48     else
  49         delete data;
  50 }
  51
  52 /** If there isn't data in the packet, allocate some. */
  53 void
  54 Packet::allocate() {
  55     if (data)
  56         return;
  57     assert(!staticData);
  58     dynamicData = true;
  59     arrayData = true;
  60     data = new uint8_t[size];
  61 }
  62
  63 /** Do the packet modify the same addresses. */
  64 bool
  65 Packet::intersect(Packet *p) {
  66     Addr s1 = addr;
  67     Addr e1 = addr + size;
  68     Addr s2 = p->addr;
  69     Addr e2 = p->addr + p->size;
  70
  71     if (s1 >= s2 && s1 < e2)
  72         return true;
  73     if (e1 >= s2 && e1 < e2)
  74         return true;
  75     return false;
  76 }
  77
  78 /** Minimally reset a packet so something like simple cpu can reuse it. */
  79 void
  80 Packet::reset() {
  81     result = Unknown;
  82     if (dynamicData) {
  83        deleteData();
  84        dynamicData = false;
  85        arrayData = false;
  86        time = curTick;
  87     }
  88 }
  89
  90
  91
  92
  93 bool fixPacket(Packet *func, Packet *timing)
  94 { panic("Need to implement!"); }