|
1679
|
1 /**
|
|
|
2 * Orthanc - A Lightweight, RESTful DICOM Store
|
|
|
3 * Copyright (C) 2012-2015 Sebastien Jodogne, Medical Physics
|
|
|
4 * Department, University Hospital of Liege, Belgium
|
|
|
5 *
|
|
|
6 * This program is free software: you can redistribute it and/or
|
|
|
7 * modify it under the terms of the GNU General Public License as
|
|
|
8 * published by the Free Software Foundation, either version 3 of the
|
|
|
9 * License, or (at your option) any later version.
|
|
|
10 *
|
|
|
11 * In addition, as a special exception, the copyright holders of this
|
|
|
12 * program give permission to link the code of its release with the
|
|
|
13 * OpenSSL project's "OpenSSL" library (or with modified versions of it
|
|
|
14 * that use the same license as the "OpenSSL" library), and distribute
|
|
|
15 * the linked executables. You must obey the GNU General Public License
|
|
|
16 * in all respects for all of the code used other than "OpenSSL". If you
|
|
|
17 * modify file(s) with this exception, you may extend this exception to
|
|
|
18 * your version of the file(s), but you are not obligated to do so. If
|
|
|
19 * you do not wish to do so, delete this exception statement from your
|
|
|
20 * version. If you delete this exception statement from all source files
|
|
|
21 * in the program, then also delete it here.
|
|
|
22 *
|
|
|
23 * This program is distributed in the hope that it will be useful, but
|
|
|
24 * WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
|
25 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
|
|
26 * General Public License for more details.
|
|
|
27 *
|
|
|
28 * You should have received a copy of the GNU General Public License
|
|
|
29 * along with this program. If not, see <http://www.gnu.org/licenses/>.
|
|
|
30 **/
|
|
|
31
|
|
|
32
|
|
|
33 #include "../PrecompiledHeaders.h"
|
|
|
34 #include "RunnableWorkersPool.h"
|
|
|
35
|
|
|
36 #include "SharedMessageQueue.h"
|
|
|
37 #include "../OrthancException.h"
|
|
|
38 #include "../Logging.h"
|
|
|
39
|
|
|
40 namespace Orthanc
|
|
|
41 {
|
|
|
42 struct RunnableWorkersPool::PImpl
|
|
|
43 {
|
|
|
44 class Worker
|
|
|
45 {
|
|
|
46 private:
|
|
|
47 const bool& continue_;
|
|
|
48 SharedMessageQueue& queue_;
|
|
|
49 boost::thread thread_;
|
|
|
50
|
|
|
51 static void WorkerThread(Worker* that)
|
|
|
52 {
|
|
|
53 while (that->continue_)
|
|
|
54 {
|
|
|
55 std::auto_ptr<IDynamicObject> obj(that->queue_.Dequeue(100));
|
|
|
56 if (obj.get() != NULL)
|
|
|
57 {
|
|
|
58 try
|
|
|
59 {
|
|
|
60 IRunnableBySteps& runnable = *dynamic_cast<IRunnableBySteps*>(obj.get());
|
|
|
61
|
|
|
62 bool wishToContinue = runnable.Step();
|
|
|
63
|
|
|
64 if (wishToContinue)
|
|
|
65 {
|
|
|
66 // The runnable wishes to continue, reinsert it at the beginning of the queue
|
|
|
67 that->queue_.Enqueue(obj.release());
|
|
|
68 }
|
|
|
69 }
|
|
|
70 catch (OrthancException& e)
|
|
|
71 {
|
|
|
72 LOG(ERROR) << "Exception in a pool of working threads: " << e.What();
|
|
|
73 }
|
|
|
74 }
|
|
|
75 }
|
|
|
76 }
|
|
|
77
|
|
|
78 public:
|
|
|
79 Worker(const bool& globalContinue,
|
|
|
80 SharedMessageQueue& queue) :
|
|
|
81 continue_(globalContinue),
|
|
|
82 queue_(queue)
|
|
|
83 {
|
|
|
84 thread_ = boost::thread(WorkerThread, this);
|
|
|
85 }
|
|
|
86
|
|
|
87 void Join()
|
|
|
88 {
|
|
|
89 if (thread_.joinable())
|
|
|
90 {
|
|
|
91 thread_.join();
|
|
|
92 }
|
|
|
93 }
|
|
|
94 };
|
|
|
95
|
|
|
96
|
|
|
97 bool continue_;
|
|
|
98 std::vector<Worker*> workers_;
|
|
|
99 SharedMessageQueue queue_;
|
|
|
100 };
|
|
|
101
|
|
|
102
|
|
|
103
|
|
|
104 RunnableWorkersPool::RunnableWorkersPool(size_t countWorkers) : pimpl_(new PImpl)
|
|
|
105 {
|
|
|
106 pimpl_->continue_ = true;
|
|
|
107
|
|
|
108 if (countWorkers <= 0)
|
|
|
109 {
|
|
|
110 throw OrthancException(ErrorCode_ParameterOutOfRange);
|
|
|
111 }
|
|
|
112
|
|
|
113 pimpl_->workers_.resize(countWorkers);
|
|
|
114
|
|
|
115 for (size_t i = 0; i < countWorkers; i++)
|
|
|
116 {
|
|
|
117 pimpl_->workers_[i] = new PImpl::Worker(pimpl_->continue_, pimpl_->queue_);
|
|
|
118 }
|
|
|
119 }
|
|
|
120
|
|
|
121
|
|
|
122 RunnableWorkersPool::~RunnableWorkersPool()
|
|
|
123 {
|
|
|
124 pimpl_->continue_ = false;
|
|
|
125
|
|
|
126 for (size_t i = 0; i < pimpl_->workers_.size(); i++)
|
|
|
127 {
|
|
|
128 PImpl::Worker* worker = pimpl_->workers_[i];
|
|
|
129
|
|
|
130 if (worker != NULL)
|
|
|
131 {
|
|
|
132 worker->Join();
|
|
|
133 delete worker;
|
|
|
134 }
|
|
|
135 }
|
|
|
136 }
|
|
|
137
|
|
|
138
|
|
|
139 void RunnableWorkersPool::Add(IRunnableBySteps* runnable)
|
|
|
140 {
|
|
|
141 pimpl_->queue_.Enqueue(runnable);
|
|
|
142 }
|
|
|
143
|
|
|
144
|
|
|
145 void RunnableWorkersPool::WaitDone()
|
|
|
146 {
|
|
|
147 pimpl_->queue_.WaitEmpty(0);
|
|
|
148 }
|
|
|
149 }
|
