2 * Copyright (c) 2004-2005 The Regents of The University of Michigan
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.
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.
29 #ifndef __DEV_PKTFIFO_HH__
30 #define __DEV_PKTFIFO_HH__
36 #include "dev/etherpkt.hh"
37 #include "sim/serialize.hh"
43 typedef std::list<PacketPtr> fifo_list;
44 typedef fifo_list::iterator iterator;
47 std::list<PacketPtr> fifo;
53 explicit PacketFifo(int max) : _maxsize(max), _size(0), _reserved(0) {}
54 virtual ~PacketFifo() {}
56 int packets() const { return fifo.size(); }
57 int maxsize() const { return _maxsize; }
58 int size() const { return _size; }
59 int reserved() const { return _reserved; }
60 int avail() const { return _maxsize - _size - _reserved; }
61 bool empty() const { return size() <= 0; }
62 bool full() const { return avail() <= 0; }
64 int reserve(int len = 0)
71 iterator begin() { return fifo.begin(); }
72 iterator end() { return fifo.end(); }
74 PacketPtr front() { return fifo.front(); }
76 bool push(PacketPtr ptr)
79 assert(_reserved <= ptr->length);
80 assert(ptr->slack == 0);
81 if (avail() < ptr->length - _reserved)
95 PacketPtr &packet = fifo.front();
96 _size -= packet->length;
97 _size -= packet->slack;
105 for (iterator i = begin(); i != end(); ++i)
112 void remove(iterator i)
114 PacketPtr &packet = *i;
115 if (i != fifo.begin()) {
118 assert(prev != fifo.end());
119 (*prev)->slack += packet->length;
121 _size -= packet->length;
122 _size -= packet->slack;
130 bool copyout(void *dest, int offset, int len);
132 int countPacketsBefore(iterator end)
134 iterator i = fifo.begin();
145 int countPacketsAfter(iterator i)
147 iterator end = fifo.end();
160 * Serialization stuff
163 void serialize(const std::string &base, std::ostream &os);
164 void unserialize(const std::string &base,
165 Checkpoint *cp, const std::string §ion);
168 #endif // __DEV_PKTFIFO_HH__