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
|
/*
* 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 "api/test/time_controller.h"
#include <memory>
#include "absl/strings/string_view.h"
#include "api/function_view.h"
#include "api/task_queue/task_queue_base.h"
#include "api/task_queue/task_queue_factory.h"
#include "api/units/time_delta.h"
namespace webrtc {
std::unique_ptr<TaskQueueFactory> TimeController::CreateTaskQueueFactory() {
class FactoryWrapper final : public TaskQueueFactory {
public:
explicit FactoryWrapper(TaskQueueFactory* inner_factory)
: inner_(inner_factory) {}
std::unique_ptr<TaskQueueBase, TaskQueueDeleter> CreateTaskQueue(
absl::string_view name,
Priority priority) const override {
return inner_->CreateTaskQueue(name, priority);
}
private:
TaskQueueFactory* const inner_;
};
return std::make_unique<FactoryWrapper>(GetTaskQueueFactory());
}
bool TimeController::Wait(FunctionView<bool()> condition,
TimeDelta max_duration) {
if (condition()) {
return true;
}
// Run pending tasks first as they might change result of the `condition` and
// thus avoid unnecessary advancing time.
AdvanceTime(TimeDelta::Zero());
// Step size is chosen to be short enough to not significantly affect latency
// in real time tests while being long enough to avoid adding too much load to
// the system.
const auto kStep = TimeDelta::Millis(5);
for (auto elapsed = TimeDelta::Zero(); elapsed < max_duration;
elapsed += kStep) {
if (condition())
return true;
AdvanceTime(kStep);
}
return condition();
}
} // namespace webrtc
|
