mirror of
https://github.com/ntop/ntopng.git
synced 2026-05-02 08:50:12 +00:00
49 lines
1.3 KiB
C++
49 lines
1.3 KiB
C++
/*
|
|
*
|
|
* (C) 2014-20 - ntop.org
|
|
*
|
|
*
|
|
* This program is free software; you can redistribute it and/or modify
|
|
* it under the terms of the GNU General Public License as published by
|
|
* the Free Software Foundation; either version 3 of the License, or
|
|
* (at your option) any later version.
|
|
*
|
|
* 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. See the
|
|
* GNU General Public License for more details.
|
|
*
|
|
* You should have received a copy of the GNU General Public License
|
|
* along with this program; if not, write to the Free Software Foundation,
|
|
* Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
|
|
*
|
|
*/
|
|
|
|
|
|
#ifndef _FIFO_QUEUE_H
|
|
#define _FIFO_QUEUE_H
|
|
|
|
#include "ntop_includes.h"
|
|
|
|
/* A simple thread safe FIFO non-blocking bounded queue */
|
|
class FifoQueue {
|
|
private:
|
|
Mutex *m;
|
|
void **items;
|
|
u_int32_t size;
|
|
u_int32_t cur_items;
|
|
u_int32_t head;
|
|
u_int32_t tail;
|
|
|
|
public:
|
|
FifoQueue(u_int32_t queue_size);
|
|
virtual ~FifoQueue();
|
|
|
|
bool enqueue(void *item);
|
|
void* dequeue();
|
|
inline bool canEnqueue() { return(cur_items < size); }
|
|
inline u_int32_t getLength() { return(cur_items); }
|
|
inline u_int32_t getSize() { return(size); }
|
|
};
|
|
|
|
#endif /* _FIFO_QUEUE_H */
|