1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
|
/*
*
* (C) 2014-22 - 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 _STRING_FIFO_QUEUE_H
#define _STRING_FIFO_QUEUE_H
#include "ntop_includes.h"
class StringFifoQueue : public FifoQueue<char*> {
public:
StringFifoQueue(u_int32_t queue_size) : FifoQueue<char*>(queue_size) {}
~StringFifoQueue() {
while(!q.empty()) {
char *s = q.front();
q.pop();
free(s);
}
}
bool enqueue(char* item) {
bool rv;
m.lock(__FILE__, __LINE__);
if(canEnqueue()) {
char *d = strdup(item);
if(d) {
q.push(d);
rv = true;
} else {
rv = false;
}
} else
rv = false;
if(rv)
num_enqueued++;
else
num_not_enqueued++;
m.unlock(__FILE__, __LINE__);
return(rv);
}
};
#endif /* _STRING_FIFO_QUEUE_H */
|
