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
|
// Copyright 2013 The Chromium Authors
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "content/browser/startup_task_runner.h"
#include "base/functional/bind.h"
#include "base/location.h"
#include "base/task/single_thread_task_runner.h"
#include "base/timer/elapsed_timer.h"
namespace content {
StartupTaskRunner::StartupTaskRunner(
base::OnceCallback<void(int, base::TimeDelta)> startup_complete_callback,
scoped_refptr<base::SingleThreadTaskRunner> proxy)
: startup_complete_callback_(std::move(startup_complete_callback)),
proxy_(proxy) {}
StartupTaskRunner::~StartupTaskRunner() {}
void StartupTaskRunner::AddTask(StartupTask callback) {
task_list_.push_back(std::move(callback));
}
void StartupTaskRunner::StartRunningTasksAsync() {
DCHECK(proxy_.get());
int result = 0;
if (task_list_.empty()) {
if (!startup_complete_callback_.is_null()) {
std::move(startup_complete_callback_)
.Run(result, longest_blocking_duration_);
}
} else {
base::OnceClosure next_task =
base::BindOnce(&StartupTaskRunner::WrappedTask, base::Unretained(this));
proxy_->PostNonNestableTask(FROM_HERE, std::move(next_task));
}
}
void StartupTaskRunner::RunAllTasksNow() {
int result = 0;
base::ElapsedTimer timer;
for (auto& it : task_list_) {
result = std::move(it).Run();
if (result > 0) break;
}
longest_blocking_duration_ =
std::max(longest_blocking_duration_, timer.Elapsed());
task_list_.clear();
if (!startup_complete_callback_.is_null()) {
std::move(startup_complete_callback_)
.Run(result, longest_blocking_duration_);
}
}
void StartupTaskRunner::WrappedTask() {
if (task_list_.empty()) {
// This will happen if the remaining tasks have been run synchronously since
// the WrappedTask was created. Any callback will already have been called,
// so there is nothing to do
return;
}
base::ElapsedTimer timer;
int result = std::move(task_list_.front()).Run();
longest_blocking_duration_ =
std::max(longest_blocking_duration_, timer.Elapsed());
task_list_.pop_front();
if (result > 0) {
// Stop now and throw away the remaining tasks
task_list_.clear();
}
if (task_list_.empty()) {
if (!startup_complete_callback_.is_null()) {
std::move(startup_complete_callback_)
.Run(result, longest_blocking_duration_);
}
} else {
base::OnceClosure next_task =
base::BindOnce(&StartupTaskRunner::WrappedTask, base::Unretained(this));
proxy_->PostNonNestableTask(FROM_HERE, std::move(next_task));
}
}
} // namespace content
|
