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
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
|
//////////////////////////////////////////////////////////////////////////////
//////////////////////////////////////////////////////////////////////////////
//
// copyright : (C) 2008 by Eran Ifrah
// file name : jobqueue.cpp
//
// -------------------------------------------------------------------------
// A
// _____ _ _ _ _
// / __ \ | | | | (_) |
// | / \/ ___ __| | ___| | _| |_ ___
// | | / _ \ / _ |/ _ \ | | | __/ _ )
// | \__/\ (_) | (_| | __/ |___| | || __/
// \____/\___/ \__,_|\___\_____/_|\__\___|
//
// F i l e
//
// 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 2 of the License, or
// (at your option) any later version.
//
//////////////////////////////////////////////////////////////////////////////
//////////////////////////////////////////////////////////////////////////////
#include "jobqueue.h"
#include "job.h"
JobQueueWorker::JobQueueWorker(wxMessageQueue<Job*>* queue)
: wxThread(wxTHREAD_JOINABLE)
, m_queue( queue )
{
}
JobQueueWorker::~JobQueueWorker()
{
}
void JobQueueWorker::Stop()
{
if ( IsAlive() ) {
Delete(NULL, wxTHREAD_WAIT_BLOCK);
} else {
Wait(wxTHREAD_WAIT_BLOCK);
}
}
void JobQueueWorker::Start(int priority)
{
Create();
SetPriority(priority);
Run();
}
void* JobQueueWorker::Entry()
{
while ( !TestDestroy() ) {
Job *job (NULL);
if ( (m_queue->ReceiveTimeout(50, job) == wxMSGQUEUE_NO_ERROR) && job ) {
// Call user's implementation for processing request
ProcessJob( job );
wxThread::Sleep(10); // Allow other threads to work as well
delete job;
job = NULL;
continue; // to avoid the sleep
}
}
return NULL;
}
void JobQueueWorker::ProcessJob(Job *job)
{
if ( job ) {
job->Process(this);
}
}
//--------------------------------------------------------------
// JobQueue
//--------------------------------------------------------------
JobQueue::JobQueue()
{
}
JobQueue::~JobQueue()
{
// Clear the queue and release it memory
Job* pJob(NULL);
while ( m_queue.ReceiveTimeout(1, pJob) == wxMSGQUEUE_NO_ERROR ) {
wxDELETE( pJob );
}
}
void JobQueue::PushJob(Job *job)
{
m_queue.Post( job );
}
void JobQueue::Start(size_t poolSize, int priority)
{
size_t maxPoolSize = poolSize > 250 ? 250 : poolSize;
for(size_t i=0; i<maxPoolSize; i++) {
//create new thread
JobQueueWorker *worker = new JobQueueWorker( &m_queue );
worker->Start(priority);
m_threads.push_back(worker);
}
}
void JobQueue::Stop()
{
//first loop and stop all running threads
for(size_t i=0; i<m_threads.size(); i++) {
JobQueueWorker *worker = m_threads.at(i);
//stop it
worker->Stop();
//delete it
delete worker;
}
m_threads.clear();
}
//-----------------------------------------------------
// Job queue singleton
//-----------------------------------------------------
JobQueue* JobQueueSingleton::ms_instance = new JobQueue();
JobQueueSingleton::JobQueueSingleton()
{
}
JobQueueSingleton::~JobQueueSingleton()
{
}
JobQueue* JobQueueSingleton::Instance()
{
return ms_instance;
}
void JobQueueSingleton::Release()
{
if (ms_instance) {
delete ms_instance;
}
ms_instance = 0;
}
|
