src/dev/pktfifo.cc

   1 /*
   2  * Copyright (c) 2004-2005 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: Nathan Binkert
  29  */
  30
  31 #include "base/misc.hh"
  32 #include "dev/pktfifo.hh"
  33
  34 using namespace std;
  35
  36 bool
  37 PacketFifo::copyout(void *dest, int offset, int len)
  38 {
  39     char *data = (char *)dest;
  40     if (offset + len >= size())
  41         return false;
  42
  43     list<EthPacketPtr>::iterator p = fifo.begin();
  44     list<EthPacketPtr>::iterator end = fifo.end();
  45     while (len > 0) {
  46         while (offset >= (*p)->length) {
  47             offset -= (*p)->length;
  48             ++p;
  49         }
  50
  51         if (p == end)
  52             panic("invalid fifo");
  53
  54         int size = min((*p)->length - offset, len);
  55         memcpy(data, (*p)->data, size);
  56         offset = 0;
  57         len -= size;
  58         data += size;
  59         ++p;
  60     }
  61
  62     return true;
  63 }
  64
  65
  66 void
  67 PacketFifo::serialize(const string &base, ostream &os)
  68 {
  69     paramOut(os, base + ".size", _size);
  70     paramOut(os, base + ".maxsize", _maxsize);
  71     paramOut(os, base + ".reserved", _reserved);
  72     paramOut(os, base + ".packets", fifo.size());
  73
  74     int i = 0;
  75     list<EthPacketPtr>::iterator p = fifo.begin();
  76     list<EthPacketPtr>::iterator end = fifo.end();
  77     while (p != end) {
  78         (*p)->serialize(csprintf("%s.packet%d", base, i), os);
  79         ++p;
  80         ++i;
  81     }
  82 }
  83
  84 void
  85 PacketFifo::unserialize(const string &base, Checkpoint *cp,
  86                         const string &section)
  87 {
  88     paramIn(cp, section, base + ".size", _size);
  89 //  paramIn(cp, section, base + ".maxsize", _maxsize);
  90     paramIn(cp, section, base + ".reserved", _reserved);
  91     int fifosize;
  92     paramIn(cp, section, base + ".packets", fifosize);
  93
  94     fifo.clear();
  95
  96     for (int i = 0; i < fifosize; ++i) {
  97         EthPacketPtr p = new EthPacketData(16384);
  98         p->unserialize(csprintf("%s.packet%d", base, i), cp, section);
  99         fifo.push_back(p);
 100     }
 101 }