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
70
71
72
73
74
75
76
|
/*
*
* (C) 2017-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 _THREAD_POOL_H_
#define _THREAD_POOL_H_
#include "ntop_includes.h"
class QueuedThreadData {
public:
ThreadedActivity *j;
char *script_path;
NetworkInterface *iface;
bool adaptive_pool_size;
time_t deadline;
QueuedThreadData(ThreadedActivity *_j, char *_path, NetworkInterface *_iface, time_t _deadline) {
j = _j, script_path = strdup(_path), iface = _iface;
deadline = _deadline;
}
~QueuedThreadData() { if(script_path) free(script_path); }
};
class ThreadPool {
private:
u_int16_t num_threads;
bool terminating;
pthread_cond_t condvar;
Mutex *m;
#ifdef __linux__
cpu_set_t affinity_mask;
#endif
std::vector <pthread_t> threadsState;
std::queue <QueuedThreadData*> threads;
QueuedThreadData* dequeueJob(bool waitIfEmpty);
/*
Creates and starts a new pool thread
*/
bool spawn();
bool isQueueable(ThreadedActivityState cur_state);
public:
ThreadPool(char *comma_separated_affinity_mask = NULL);
virtual ~ThreadPool();
void shutdown();
inline bool isTerminating() { return terminating; };
void run();
bool queueJob(ThreadedActivity *ta, char *path, NetworkInterface *iface, time_t scheduled_time, time_t deadline);
};
#endif /* _THREAD_POOL_H_ */
|
