36373fa465
dev/pktfifo.hh:
we can't modify i because it's used further down to remove
the packet from the fifo. Instead, copy the iterator and
modify that to get the previous packet.
dev/sinic.cc:
- don't change the transmit state and kick the machine unless
we're at the head of the txList.
- add a couple of debugging statements to figure out how far
along we've gotten in processing a packet.
- assert that the current tx vnic has something to do when
we start processing the state machine.
--HG--
extra : convert_revision : 588fe2c7d810be0e3d8d39c5cc0ec8a72119517e
139 lines
4 KiB
C++
139 lines
4 KiB
C++
/*
|
|
* Copyright (c) 2004-2005 The Regents of The University of Michigan
|
|
* All rights reserved.
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted provided that the following conditions are
|
|
* met: redistributions of source code must retain the above copyright
|
|
* notice, this list of conditions and the following disclaimer;
|
|
* redistributions in binary form must reproduce the above copyright
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
* documentation and/or other materials provided with the distribution;
|
|
* neither the name of the copyright holders nor the names of its
|
|
* contributors may be used to endorse or promote products derived from
|
|
* this software without specific prior written permission.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
|
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
|
|
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
|
|
* A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
|
|
* OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
|
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
|
* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
|
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
|
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
|
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
|
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
*/
|
|
|
|
#ifndef __DEV_PKTFIFO_HH__
|
|
#define __DEV_PKTFIFO_HH__
|
|
|
|
#include <iosfwd>
|
|
#include <list>
|
|
#include <string>
|
|
|
|
#include "dev/etherpkt.hh"
|
|
#include "sim/serialize.hh"
|
|
|
|
class Checkpoint;
|
|
class PacketFifo
|
|
{
|
|
public:
|
|
typedef std::list<PacketPtr> fifo_list;
|
|
typedef fifo_list::iterator iterator;
|
|
|
|
protected:
|
|
std::list<PacketPtr> fifo;
|
|
int _maxsize;
|
|
int _size;
|
|
int _reserved;
|
|
|
|
public:
|
|
explicit PacketFifo(int max) : _maxsize(max), _size(0), _reserved(0) {}
|
|
virtual ~PacketFifo() {}
|
|
|
|
int packets() const { return fifo.size(); }
|
|
int maxsize() const { return _maxsize; }
|
|
int size() const { return _size; }
|
|
int reserved() const { return _reserved; }
|
|
int avail() const { return _maxsize - _size - _reserved; }
|
|
bool empty() const { return size() <= 0; }
|
|
bool full() const { return avail() <= 0; }
|
|
|
|
int reserve(int len = 0)
|
|
{
|
|
_reserved += len;
|
|
assert(avail() >= 0);
|
|
return _reserved;
|
|
}
|
|
|
|
iterator begin() { return fifo.begin(); }
|
|
iterator end() { return fifo.end(); }
|
|
|
|
PacketPtr front() { return fifo.front(); }
|
|
|
|
bool push(PacketPtr ptr)
|
|
{
|
|
assert(ptr->length);
|
|
assert(_reserved <= ptr->length);
|
|
assert(ptr->slack == 0);
|
|
if (avail() < ptr->length - _reserved)
|
|
return false;
|
|
|
|
_size += ptr->length;
|
|
fifo.push_back(ptr);
|
|
_reserved = 0;
|
|
return true;
|
|
}
|
|
|
|
void pop()
|
|
{
|
|
if (empty())
|
|
return;
|
|
|
|
PacketPtr &packet = fifo.front();
|
|
_size -= packet->length;
|
|
_size -= packet->slack;
|
|
packet->slack = 0;
|
|
packet = NULL;
|
|
fifo.pop_front();
|
|
}
|
|
|
|
void clear()
|
|
{
|
|
for (iterator i = begin(); i != end(); ++i)
|
|
(*i)->slack = 0;
|
|
fifo.clear();
|
|
_size = 0;
|
|
_reserved = 0;
|
|
}
|
|
|
|
void remove(iterator i)
|
|
{
|
|
PacketPtr &packet = *i;
|
|
if (i != fifo.begin()) {
|
|
iterator prev = i;
|
|
--prev;
|
|
assert(prev != fifo.end());
|
|
(*prev)->slack += packet->length;
|
|
} else {
|
|
_size -= packet->length;
|
|
_size -= packet->slack;
|
|
}
|
|
|
|
packet->slack = 0;
|
|
packet = NULL;
|
|
fifo.erase(i);
|
|
}
|
|
|
|
/**
|
|
* Serialization stuff
|
|
*/
|
|
public:
|
|
void serialize(const std::string &base, std::ostream &os);
|
|
void unserialize(const std::string &base,
|
|
Checkpoint *cp, const std::string §ion);
|
|
};
|
|
|
|
#endif // __DEV_PKTFIFO_HH__
|