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
|
#ifndef FWCore_Concurrency_SerialTaskQueue_h
#define FWCore_Concurrency_SerialTaskQueue_h
// -*- C++ -*-
//
// Package: Concurrency
// Class : SerialTaskQueue
//
/**\class SerialTaskQueue SerialTaskQueue.h "FWCore/Concurrency/interface/SerialTaskQueue.h"
Description: Runs only one task from the queue at a time
Usage:
A SerialTaskQueue is used to provide thread-safe access to a resource. You create a SerialTaskQueue
for the resource. When every you need to perform an operation on the resource, you push a 'task' that
does that operation onto the queue. The queue then makes sure to run one and only one task at a time.
This guarantees serial access to the resource and therefore thread-safety.
The 'tasks' managed by the SerialTaskQueue are just functor objects who which take no arguments and
return no values. The simplest way to create a task is to use a C++11 lambda.
Example: Imagine we have the following data structures.
\code
std::vector<int> values;
edm::SerialTaskQueue queue;
\endcode
On thread 1 we can fill the vector
\code
for(int i=0; i<1000;++i) {
queue.pushAndWait( [&values,i]{ values.push_back(i);} );
}
\endcode
While on thread 2 we periodically print and stop when the vector is filled
\code
bool stop = false;
while(not stop) {
queue.pushAndWait([&false,&values] {
if( 0 == (values.size() % 100) ) {
std::cout <<values.size()<<std::endl;
}
if(values.size()>999) {
stop = true;
}
});
}
\endcode
*/
//
// Original Author: Chris Jones
// Created: Thu Feb 21 11:14:39 CST 2013
// $Id$
//
// system include files
#include <atomic>
#include <cassert>
#include "oneapi/tbb/task_group.h"
#include "oneapi/tbb/concurrent_queue.h"
#include "FWCore/Utilities/interface/thread_safety_macros.h"
// user include files
// forward declarations
namespace edm {
class SerialTaskQueue {
public:
SerialTaskQueue() : m_taskChosen(false), m_pauseCount{0} {}
SerialTaskQueue(SerialTaskQueue&& iOther)
: m_tasks(std::move(iOther.m_tasks)),
m_taskChosen(iOther.m_taskChosen.exchange(false)),
m_pauseCount(iOther.m_pauseCount.exchange(0)) {
assert(m_tasks.empty() and m_taskChosen == false);
}
SerialTaskQueue(const SerialTaskQueue&) = delete;
const SerialTaskQueue& operator=(const SerialTaskQueue&) = delete;
~SerialTaskQueue();
// ---------- const member functions ---------------------
/// Checks to see if the queue has been paused.
/**\return true if the queue is paused
* \sa pause(), resume()
*/
bool isPaused() const { return m_pauseCount.load() != 0; }
// ---------- member functions ---------------------------
/// Pauses processing of additional tasks from the queue.
/**
* Any task already running will not be paused however once that
* running task finishes no further tasks will be started.
* Multiple calls to pause() are allowed, however each call to
* pause() must be balanced by a call to resume().
* \return false if queue was already paused.
* \sa resume(), isPaused()
*/
bool pause() { return 1 == ++m_pauseCount; }
/// Resumes processing if the queue was paused.
/**
* Multiple calls to resume() are allowed if there
* were multiple calls to pause(). Only when we reach as
* many resume() calls as pause() calls will the queue restart.
* \return true if the call really restarts the queue
* \sa pause(), isPaused()
*/
bool resume();
/// asynchronously pushes functor iAction into queue
/**
* The function will return immediately and iAction will either
* process concurrently with the calling thread or wait until the
* protected resource becomes available or until a CPU becomes available.
* \param[in] iAction Must be a functor that takes no arguments and return no values.
*/
template <typename T>
void push(oneapi::tbb::task_group&, const T& iAction);
private:
/** Base class for all tasks held by the SerialTaskQueue */
class TaskBase {
friend class SerialTaskQueue;
oneapi::tbb::task_group* group() { return m_group; }
virtual void execute() = 0;
public:
virtual ~TaskBase() = default;
protected:
explicit TaskBase(oneapi::tbb::task_group* iGroup) : m_group(iGroup) {}
private:
oneapi::tbb::task_group* m_group;
};
template <typename T>
class QueuedTask : public TaskBase {
public:
QueuedTask(oneapi::tbb::task_group& iGroup, const T& iAction) : TaskBase(&iGroup), m_action(iAction) {}
private:
void execute() final;
T m_action;
};
friend class TaskBase;
void pushTask(TaskBase*);
TaskBase* pushAndGetNextTask(TaskBase*);
TaskBase* finishedTask();
//returns nullptr if a task is already being processed
TaskBase* pickNextTask();
void spawn(TaskBase&);
// ---------- member data --------------------------------
oneapi::tbb::concurrent_queue<TaskBase*> m_tasks;
std::atomic<bool> m_taskChosen;
std::atomic<unsigned long> m_pauseCount;
};
template <typename T>
void SerialTaskQueue::push(oneapi::tbb::task_group& iGroup, const T& iAction) {
QueuedTask<T>* pTask{new QueuedTask<T>{iGroup, iAction}};
pushTask(pTask);
}
template <typename T>
void SerialTaskQueue::QueuedTask<T>::execute() {
// Exception has to swallowed in order to avoid throwing from execute(). The user of SerialTaskQueue should handle exceptions within m_action().
CMS_SA_ALLOW try { this->m_action(); } catch (...) {
}
}
} // namespace edm
#endif
|