packet_queue.hh

// -*- c-basic-offset: 4; tab-width: 8; indent-tabs-mode: t -*-

// Copyright (c) 2001-2011 XORP, Inc and Others
//
// This program is free software; you can redistribute it and/or modify
// it under the terms of the GNU General Public License, Version 2, June
// 1991 as published by the Free Software Foundation. Redistribution
// and/or modification of this program under the terms of any other
// version of the GNU General Public License is not permitted.
// 
// This program is distributed in the hope that it will be useful, but
// WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. For more details,
// see the GNU General Public License, Version 2, a copy of which can be
// found in the XORP LICENSE.gpl file.
// 
// XORP Inc, 2953 Bunker Hill Lane, Suite 204, Santa Clara, CA 95054, USA;
// http://xorp.net

// $XORP: xorp/rip/packet_queue.hh,v 1.13 2008/10/02 21:58:16 bms Exp $

#ifndef __RIP_PACKET_QUEUE_HH__
#define __RIP_PACKET_QUEUE_HH__

#include "libxorp/xorp.h"




#include "packets.hh"


template <typename A>
class PacketQueue
{
public:
    typedef list<const RipPacket<A>*> QueueRep;

public:
    PacketQueue();
    ~PacketQueue();

    void enqueue_packet(const RipPacket<A>* pkt);

    bool empty() const;

    const RipPacket<A>* head() const;

    void pop_head();

    bool drop_old();

    void flush_packets();

    void set_max_buffered_bytes(uint32_t mb);

    uint32_t max_buffered_bytes() const;

    uint32_t buffered_bytes() const;

    uint32_t drop_count() const;

    void reset_drop_count();

protected:
    QueueRep    _ready_packets;
    uint32_t    _buffered_bytes;
    uint32_t    _max_buffered_bytes;
    uint32_t    _drops;
};

#endif // __RIP_PACKET_QUEUE_HH__