File: task.cc

package info (click to toggle)
golang-github-google-certificate-transparency 0.0~git20160709.0.0f6e3d1~ds1-3
  • links: PTS, VCS
  • area: main
  • in suites: bullseye, buster
  • size: 5,676 kB
  • sloc: cpp: 35,278; python: 11,838; java: 1,911; sh: 1,885; makefile: 950; xml: 520; ansic: 225
file content (280 lines) | stat: -rw-r--r-- 6,499 bytes parent folder | download
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
#include "util/task.h"

#include <glog/logging.h>

using std::bind;
using std::function;
using std::lock_guard;
using std::make_shared;
using std::mutex;
using std::ostream;
using std::placeholders::_1;
using std::shared_ptr;
using std::unique_lock;
using std::vector;

namespace util {


Task::Task(const function<void(Task*)>& done_callback, Executor* executor)
    : done_callback_(done_callback),
      executor_(CHECK_NOTNULL(executor)),
      state_(ACTIVE),
      cancelled_(false),
      holds_(0) {
}


Task::~Task() {
  CHECK_EQ(state_, DONE);
  CHECK(cancel_callbacks_.empty());
}


void Task::Cancel() {
  unique_lock<mutex> lock(lock_);

  if (state_ == DONE || cancelled_) {
    return;
  }

  cancelled_ = true;

  vector<function<void()>> cancel_callbacks;
  cancel_callbacks_.swap(cancel_callbacks);

  // Add a hold for each cancellation callback, so that we do not go
  // into the DONE state until they all have completed.
  holds_ += cancel_callbacks.size();

  // Take a copy of the child tasks before giving back the lock. Since
  // these are shared_ptrs, having a copy will protect us in case some
  // of them complete and get removed (which will free them). Any
  // child tasks created after giving back the lock will be already
  // cancelled, so no need to cancel them here.
  const vector<shared_ptr<Task>> child_tasks(child_tasks_);

  // Give up the lock, in case the executor is synchronous.
  lock.unlock();

  for (const auto& child_task : child_tasks) {
    child_task->Cancel();
  }

  for (const auto& cb : cancel_callbacks) {
    executor_->Add(bind(&Task::RunCancelCallback, this, cb));
  }
}


Status Task::status() const {
  lock_guard<mutex> lock(lock_);
  CHECK_NE(state_, ACTIVE);
  return status_;
}


bool Task::Return(const Status& status) {
  unique_lock<mutex> lock(lock_);

  if (state_ != ACTIVE) {
    return false;
  }

  status_ = status;
  state_ = PREPARED;
  cancel_callbacks_.clear();

  // Take a copy of the child tasks, so we can still access it after
  // calling TryDoneTransition(). See Task::Cancel() for more
  // explanation.
  const vector<shared_ptr<Task>> child_tasks(child_tasks_);

  // Do not touch any members after this, as the task object might be
  // deleted by the time this method returns.
  TryDoneTransition(&lock);

  // If we still have the lock (we are not in the DONE state yet),
  // give it up.
  if (lock.owns_lock()) {
    lock.unlock();
  }

  for (const auto& child_task : child_tasks) {
    child_task->Cancel();
  }

  return true;
}


void Task::AddHold() {
  lock_guard<mutex> lock(lock_);
  CHECK_NE(state_, DONE);
  ++holds_;
}


void Task::RemoveHold() {
  unique_lock<mutex> lock(lock_);

  CHECK_GT(holds_, 0);
  CHECK_NE(state_, DONE);
  --holds_;

  // Do not touch any members after this, as the task object might be
  // deleted by the time this method returns.
  TryDoneTransition(&lock);
}


bool Task::IsActive() const {
  lock_guard<mutex> lock(lock_);
  return state_ == ACTIVE;
}


bool Task::IsDone() const {
  lock_guard<mutex> lock(lock_);
  return state_ == DONE;
}


bool Task::CancelRequested() const {
  lock_guard<mutex> lock(lock_);
  return cancelled_;
}


void Task::WhenCancelled(const std::function<void()>& cancel_cb) {
  unique_lock<mutex> lock(lock_);

  if (state_ != ACTIVE) {
    return;
  }

  if (!cancelled_) {
    cancel_callbacks_.emplace_back(cancel_cb);
  } else {
    ++holds_;

    // Give up the lock, in case the executor is synchronous.
    lock.unlock();
    executor_->Add(bind(&Task::RunCancelCallback, this, cancel_cb));
  }
}


Task* Task::AddChildWithExecutor(const function<void(Task*)>& done_callback,
                                 Executor* executor) {
  const shared_ptr<Task> child_task(make_shared<Task>(
      bind(&Task::RunChildDoneCallback, this, done_callback, _1),
      CHECK_NOTNULL(executor)));
  bool cancel;

  {
    lock_guard<mutex> lock(lock_);
    CHECK_NE(state_, DONE);

    child_tasks_.emplace_back(child_task);
    ++holds_;

    cancel = state_ != ACTIVE || cancelled_;
  }

  if (cancel) {
    child_task->Cancel();
  }

  return child_task.get();
}


void Task::CleanupWhenDone(const function<void()>& cleanup_cb) {
  lock_guard<mutex> lock(lock_);
  CHECK_NE(state_, DONE);

  cleanup_callbacks_.emplace_back(cleanup_cb);
}


// After calling this method, the task object might have become
// invalid, if the transition to DONE worked, as the done callback is
// allowed to delete it. So make sure not to use any more member
// variables after calling this.
//
// It will also release "*lock", if that transition succeeds.
void Task::TryDoneTransition(unique_lock<mutex>* lock) {
  CHECK(lock->owns_lock());
  CHECK_NE(state_, DONE);

  if (state_ != PREPARED || holds_ > 0) {
    return;
  }

  state_ = DONE;

  // Give up the lock, as the callback is allowed to delete us. We
  // also do not want to cause a deadlock, in the possibility that the
  // executor is synchronous.
  lock->unlock();

  // Once this is called, the task might get deleted.
  executor_->Add(bind(&Task::RunCleanupAndDoneCallbacks, this));
}


void Task::RunCancelCallback(const std::function<void()>& cb) {
  cb();
  RemoveHold();
}


void Task::RunCleanupAndDoneCallbacks() {
  vector<function<void()>> cleanup_callbacks;

  {
    lock_guard<mutex> lock(lock_);
    cleanup_callbacks_.swap(cleanup_callbacks);
  }

  // We call the cleanup callbacks (and thus, any deleters) before
  // calling the done callback, which adds a little bit of latency,
  // but it exposes any misuse of CleanupWhenDone/DeleteWhenDone, and
  // is simpler to implement (no need to make the list of callbacks
  // last longer than the task object, for example).
  for (const auto& cb : cleanup_callbacks) {
    cb();
  }

  // Once this is called, the task might get deleted.
  done_callback_(this);
}


void Task::RunChildDoneCallback(const function<void(Task*)>& done_callback,
                                Task* child_task) {
  done_callback(child_task);

  unique_lock<mutex> lock(lock_);
  vector<shared_ptr<Task>>::iterator it;
  for (it = child_tasks_.begin(); it != child_tasks_.end(); ++it) {
    if (it->get() == child_task) {
      break;
    }
  }

  CHECK(it != child_tasks_.end());
  CHECK_GT(holds_, 0);
  CHECK_NE(state_, DONE);

  child_tasks_.erase(it);
  --holds_;

  // Do not touch any members after this, as the task object might be
  // deleted by the time this method returns.
  TryDoneTransition(&lock);
}


}  // namespace util