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
|
/*
* Copyright (c) 2020 The WebRTC project authors. All Rights Reserved.
*
* Use of this source code is governed by a BSD-style license
* that can be found in the LICENSE file in the root of the source
* tree. An additional intellectual property rights grant can be found
* in the file PATENTS. All contributing project authors may
* be found in the AUTHORS file in the root of the source tree.
*/
#include "test/time_controller/simulated_task_queue.h"
#include <algorithm>
#include <deque>
#include <map>
#include <utility>
#include <vector>
#include "absl/functional/any_invocable.h"
#include "absl/strings/string_view.h"
#include "api/location.h"
#include "api/units/time_delta.h"
#include "api/units/timestamp.h"
#include "rtc_base/synchronization/mutex.h"
#include "test/time_controller/simulated_time_controller.h"
namespace webrtc {
SimulatedTaskQueue::SimulatedTaskQueue(
sim_time_impl::SimulatedTimeControllerImpl* handler,
absl::string_view name)
: handler_(handler), name_(new char[name.size()]) {
std::copy_n(name.begin(), name.size(), name_);
}
SimulatedTaskQueue::~SimulatedTaskQueue() {
handler_->Unregister(this);
delete[] name_;
}
void SimulatedTaskQueue::Delete() {
// Need to destroy the tasks outside of the lock because task destruction
// can lead to re-entry in SimulatedTaskQueue via custom destructors.
std::deque<absl::AnyInvocable<void() &&>> ready_tasks;
std::map<Timestamp, std::vector<absl::AnyInvocable<void() &&>>> delayed_tasks;
{
MutexLock lock(&lock_);
ready_tasks_.swap(ready_tasks);
delayed_tasks_.swap(delayed_tasks);
}
ready_tasks.clear();
delayed_tasks.clear();
delete this;
}
void SimulatedTaskQueue::RunReady(Timestamp at_time) {
MutexLock lock(&lock_);
for (auto it = delayed_tasks_.begin();
it != delayed_tasks_.end() && it->first <= at_time;
it = delayed_tasks_.erase(it)) {
for (auto& task : it->second) {
ready_tasks_.push_back(std::move(task));
}
}
CurrentTaskQueueSetter set_current(this);
while (!ready_tasks_.empty()) {
absl::AnyInvocable<void() &&> ready = std::move(ready_tasks_.front());
ready_tasks_.pop_front();
lock_.Unlock();
std::move(ready)();
ready = nullptr;
lock_.Lock();
}
if (!delayed_tasks_.empty()) {
next_run_time_ = delayed_tasks_.begin()->first;
} else {
next_run_time_ = Timestamp::PlusInfinity();
}
}
void SimulatedTaskQueue::PostTaskImpl(absl::AnyInvocable<void() &&> task,
const PostTaskTraits& /*traits*/,
const Location& /*location*/) {
MutexLock lock(&lock_);
ready_tasks_.push_back(std::move(task));
next_run_time_ = Timestamp::MinusInfinity();
}
void SimulatedTaskQueue::PostDelayedTaskImpl(
absl::AnyInvocable<void() &&> task,
TimeDelta delay,
const PostDelayedTaskTraits& /*traits*/,
const Location& /*location*/) {
MutexLock lock(&lock_);
Timestamp target_time = handler_->CurrentTime() + delay;
delayed_tasks_[target_time].push_back(std::move(task));
next_run_time_ = std::min(next_run_time_, target_time);
}
} // namespace webrtc
|
