-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathFutureTasks.cpp
315 lines (237 loc) · 6.61 KB
/
FutureTasks.cpp
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
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
#include"RxConcurrent/FutureTasks.h"
namespace BaseLib { namespace Concurrent {
FutureTasks::FutureTasks()
: isDone_(false)
, isCancelled_(false)
{ }
FutureTasks::~FutureTasks()
{ }
FutureTasks::Ptr FutureTasks::GetPtr()
{
return this->shared_from_this();
}
/**
* @brief run
*
* TODO: Refactor to computation strategy!
*
* Use FutureTask in GuardCondition?
* Investigate the DDS policies to be used in subjects.
*/
void FutureTasks::run()
{
InstanceHandle iterator;
for( ; iterator < currentHandle_; ++iterator)
{
if(IsCancelled()) break;
Templates::RunnableFuture::Ptr future;
{
MutexLocker lock(&mutex_);
future = this->getRunnableFuture(iterator);
}
if(!future) continue;
else if(future->IsCancelled() || future->IsDone()) continue;
future->run();
}
if(!IsCancelled())
{
isDone_ = true;
}
wakeupWaiters();
}
void FutureTasks::RunTasks(const InstanceHandleSet &handles)
{
for(InstanceHandleSet::const_iterator it = handles.begin(), it_end = handles.end(); it != it_end; ++it)
{
if(IsCancelled()) break;
Templates::RunnableFuture::Ptr future;
{
MutexLocker lock(&mutex_);
future = getRunnableFuture(*it);
}
if(!future) continue;
future->run();
}
}
bool FutureTasks::Interrupt()
{
// TODO: Implement function
return false;
}
bool FutureTasks::IsInterrupted() const
{
// TODO: Implement function
return false;
}
bool FutureTasks::Cancel()
{
if(IsDone()) return false;
isCancelled_ = true;
return true;
}
bool FutureTasks::IsCancelled() const
{
return isCancelled_.get();
}
bool FutureTasks::IsDone() const
{
return isDone_.get();
}
bool FutureTasks::WaitFor(int64 msecs) const
{
MutexLocker lock(&mutex_);
if(IsDone() || IsCancelled())
return true;
waitCondition_.wait(&mutex_, msecs);
return IsDone() || IsCancelled();
}
bool FutureTasks::IsSuccess() const
{
return isDone_.get();
}
const Status::ExecutionStatus &FutureTasks::StatusConst() const
{
return status_;
}
Status::ExecutionStatus &FutureTasks::Status()
{
return status_;
}
void FutureTasks::Clear()
{
MutexLocker lock(&mutex_);
isCancelled_= true;
isDone_ = true;
futureTasks_.clear();
currentHandle_ = 0;
}
bool FutureTasks::Cancel(InstanceHandle handle)
{
Templates::RunnableFuture::Ptr future = getRunnableFuture(handle);
if(!future) return false;
return future->Cancel();
}
bool FutureTasks::IsDone(InstanceHandle handle) const
{
Templates::RunnableFuture::Ptr future = getRunnableFuture(handle);
if(!future) return false;
return future->IsDone();
}
InstanceHandleSet FutureTasks::GetHandles() const
{
return futureTasks_.keySet();
}
InstanceHandleSet FutureTasks::GetNHandlesFIFO(unsigned int number) const
{
InstanceHandleSet handleSet;
for(ListFutureTasks::const_iterator it = futureTasks_.begin(), it_end = futureTasks_.end(); it != it_end && number > 0; ++it, --number)
{
handleSet.insert(it->first);
}
return handleSet;
}
InstanceHandleSet FutureTasks::Merge(FutureTasks::Ptr futureTasks)
{
InstanceHandleSet newHandles;
for(ListFutureTasks::iterator it = futureTasks->futureTasks_.begin(), it_end = futureTasks->futureTasks_.end(); it != it_end; ++it)
{
InstanceHandle handle = currentHandle_;
newHandles.insert(handle);
futureTasks_.insert(std::pair<InstanceHandle, Templates::RunnableFuture::Ptr>(handle, it->second));
++currentHandle_;
}
return newHandles;
}
InstanceHandleSet FutureTasks::Merge(FutureTasks::Ptr futureTasks, const InstanceHandleSet &handles)
{
InstanceHandleSet newHandles;
for(InstanceHandleSet::const_iterator it = handles.begin(), it_end = handles.end(); it != it_end; ++it)
{
Templates::RunnableFuture::Ptr future = futureTasks->getRunnableFuture(*it);
if(future)
{
InstanceHandle handle = currentHandle_;
newHandles.insert(handle);
futureTasks_.insert(std::pair<InstanceHandle, Templates::RunnableFuture::Ptr>(handle, future));
++currentHandle_;
}
}
return newHandles;
}
InstanceHandle FutureTasks::AddTask(Templates::RunnableFuture::Ptr futureTask)
{
MutexLocker lock(&mutex_);
return insertFutureTask(futureTask);
}
bool FutureTasks::RemoveTask(InstanceHandle handle)
{
MutexLocker lock(&mutex_);
return removeFutureTask(handle);
}
size_t FutureTasks::RemoveTasks(InstanceHandleSet handles)
{
MutexLocker lock(&mutex_);
return removeFutureTasks(handles);
}
bool FutureTasks::RemoveFinishedTasks()
{
MutexLocker lock(&mutex_);
return removeFinishedTasks();
}
Templates::RunnableFuture::Ptr FutureTasks::GetTaskBase(InstanceHandle handle) const
{
return getRunnableFuture(handle);
}
InstanceHandle FutureTasks::insertFutureTask(Templates::RunnableFuture::Ptr futureTask)
{
InstanceHandle handle = currentHandle_;
futureTasks_.insert(std::pair<InstanceHandle, Templates::RunnableFuture::Ptr>(handle, futureTask));
++currentHandle_;
return handle;
}
bool FutureTasks::removeFutureTask(InstanceHandle handle)
{
ListFutureTasks::iterator pos = futureTasks_.find(handle);
if(pos == futureTasks_.end())
return false;
futureTasks_.erase(pos);
return true;
}
bool FutureTasks::removeFinishedTasks()
{
InstanceHandleSet finishedTasks;
for(ListFutureTasks::iterator it = futureTasks_.begin(), it_end = futureTasks_.end(); it != it_end; ++it)
{
Templates::RunnableFuture::Ptr future = it->second;
if(!future)
finishedTasks.insert(it->first);
else if(future->IsDone() || future->IsCancelled())
finishedTasks.insert(it->first);
}
this->removeFutureTasks(finishedTasks);
return !finishedTasks.empty();
}
size_t FutureTasks::removeFutureTasks(const InstanceHandleSet &tasks)
{
size_t numRemoved = 0;
for(InstanceHandleSet::const_iterator it = tasks.begin(), it_end = tasks.end(); it != it_end; ++it)
{
bool isRemoved = this->removeFutureTask(*it);
ASSERT(isRemoved);
if(isRemoved) ++numRemoved;
}
return numRemoved;
}
Templates::RunnableFuture::Ptr FutureTasks::getRunnableFuture(InstanceHandle handle) const
{
ListFutureTasks::const_iterator it = futureTasks_.find(handle);
if(it == futureTasks_.end())
return Templates::RunnableFuture::Ptr();
return it->second;
}
void FutureTasks::wakeupWaiters() const
{
MutexLocker lock(&mutex_);
waitCondition_.wakeAll();
}
}}