pktfifo.cc revision 5483 
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
34using namespace std;
35
36bool
37PacketFifo::copyout(void *dest, int offset, int len)
38{
39    char *data = (char *)dest;
40    if (offset + len >= size())
41        return false;
42
43    iterator i = fifo.begin();
44    iterator end = fifo.end();
45    while (len > 0) {
46        EthPacketPtr &pkt = i->packet;
47        while (offset >= pkt->length) {
48            offset -= pkt->length;
49            ++i;
50        }
51
52        if (i == end)
53            panic("invalid fifo");
54
55        int size = min(pkt->length - offset, len);
56        memcpy(data, pkt->data, size);
57        offset = 0;
58        len -= size;
59        data += size;
60        ++i;
61    }
62
63    return true;
64}
65
66
67void
68PacketFifoEntry::serialize(const string &base, ostream &os)
69{
70    packet->serialize(base + ".packet", os);
71    paramOut(os, base + ".slack", slack);
72    paramOut(os, base + ".number", number);
73    paramOut(os, base + ".priv", priv);
74}
75
76void
77PacketFifoEntry::unserialize(const string &base, Checkpoint *cp,
78                             const string &section)
79{
80    packet = new EthPacketData(16384);
81    packet->unserialize(base + ".packet", cp, section);
82    paramIn(cp, section, base + ".slack", slack);
83    paramIn(cp, section, base + ".number", number);
84    paramIn(cp, section, base + ".priv", priv);
85}
86
87void
88PacketFifo::serialize(const string &base, ostream &os)
89{
90    paramOut(os, base + ".size", _size);
91    paramOut(os, base + ".maxsize", _maxsize);
92    paramOut(os, base + ".reserved", _reserved);
93    paramOut(os, base + ".packets", fifo.size());
94
95    int i = 0;
96    iterator entry = fifo.begin();
97    iterator end = fifo.end();
98    while (entry != end) {
99        entry->serialize(csprintf("%s.entry%d", base, i), os);
100        ++entry;
101        ++i;
102    }
103}
104
105void
106PacketFifo::unserialize(const string &base, Checkpoint *cp,
107                        const string &section)
108{
109    paramIn(cp, section, base + ".size", _size);
110//  paramIn(cp, section, base + ".maxsize", _maxsize);
111    paramIn(cp, section, base + ".reserved", _reserved);
112    int fifosize;
113    paramIn(cp, section, base + ".packets", fifosize);
114
115    fifo.clear();
116
117    for (int i = 0; i < fifosize; ++i) {
118        PacketFifoEntry entry;
119        entry.unserialize(csprintf("%s.entry%d", base, i), cp, section);
120        fifo.push_back(entry);
121    }
122}
123