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
|
// Copyright (c) 2013 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "tools/gn/scheduler.h"
#include <algorithm>
#include "base/bind.h"
#include "base/command_line.h"
#include "base/strings/string_number_conversions.h"
#include "build/build_config.h"
#include "tools/gn/standard_out.h"
#include "tools/gn/switches.h"
#include "tools/gn/target.h"
#if defined(OS_WIN)
#include <windows.h>
#else
#include <unistd.h>
#endif
Scheduler* g_scheduler = nullptr;
namespace {
#if defined(OS_WIN)
int GetCPUCount() {
SYSTEM_INFO sysinfo;
::GetSystemInfo(&sysinfo);
return sysinfo.dwNumberOfProcessors;
}
#else
int GetCPUCount() {
return static_cast<int>(sysconf(_SC_NPROCESSORS_ONLN));
}
#endif
int GetThreadCount() {
std::string thread_count =
base::CommandLine::ForCurrentProcess()->GetSwitchValueASCII(
switches::kThreads);
// See if an override was specified on the command line.
int result;
if (!thread_count.empty() && base::StringToInt(thread_count, &result))
return result;
// Base the default number of worker threads on number of cores in the
// system. When building large projects, the speed can be limited by how fast
// the main thread can dispatch work and connect the dependency graph. If
// there are too many worker threads, the main thread can be starved and it
// will run slower overall.
//
// One less worker thread than the number of physical CPUs seems to be a
// good value, both theoretically and experimentally. But always use at
// least some workers to prevent us from being too sensitive to I/O latency
// on low-end systems.
//
// The minimum thread count is based on measuring the optimal threads for the
// Chrome build on a several-year-old 4-core MacBook.
int num_cores = GetCPUCount() / 2; // Almost all CPUs now are hyperthreaded.
return std::max(num_cores - 1, 8);
}
} // namespace
Scheduler::Scheduler()
: pool_(new base::SequencedWorkerPool(GetThreadCount(), "worker_")),
input_file_manager_(new InputFileManager),
verbose_logging_(false),
work_count_(0),
is_failed_(false),
has_been_shutdown_(false) {
g_scheduler = this;
}
Scheduler::~Scheduler() {
if (!has_been_shutdown_)
pool_->Shutdown();
g_scheduler = nullptr;
}
bool Scheduler::Run() {
runner_.Run();
bool local_is_failed;
{
base::AutoLock lock(lock_);
local_is_failed = is_failed();
has_been_shutdown_ = true;
}
// Don't do this inside the lock since it will block on the workers, which
// may be in turn waiting on the lock.
pool_->Shutdown();
return !local_is_failed;
}
void Scheduler::Log(const std::string& verb, const std::string& msg) {
if (base::MessageLoop::current() == &main_loop_) {
LogOnMainThread(verb, msg);
} else {
// The run loop always joins on the sub threads, so the lifetime of this
// object outlives the invocations of this function, hence "unretained".
main_loop_.PostTask(FROM_HERE,
base::Bind(&Scheduler::LogOnMainThread,
base::Unretained(this), verb, msg));
}
}
void Scheduler::FailWithError(const Err& err) {
DCHECK(err.has_error());
{
base::AutoLock lock(lock_);
if (is_failed_ || has_been_shutdown_)
return; // Ignore errors once we see one.
is_failed_ = true;
}
if (base::MessageLoop::current() == &main_loop_) {
FailWithErrorOnMainThread(err);
} else {
// The run loop always joins on the sub threads, so the lifetime of this
// object outlives the invocations of this function, hence "unretained".
main_loop_.PostTask(FROM_HERE,
base::Bind(&Scheduler::FailWithErrorOnMainThread,
base::Unretained(this), err));
}
}
void Scheduler::ScheduleWork(const base::Closure& work) {
IncrementWorkCount();
pool_->PostWorkerTaskWithShutdownBehavior(
FROM_HERE, base::Bind(&Scheduler::DoWork,
base::Unretained(this), work),
base::SequencedWorkerPool::BLOCK_SHUTDOWN);
}
void Scheduler::AddGenDependency(const base::FilePath& file) {
base::AutoLock lock(lock_);
gen_dependencies_.push_back(file);
}
std::vector<base::FilePath> Scheduler::GetGenDependencies() const {
base::AutoLock lock(lock_);
return gen_dependencies_;
}
void Scheduler::AddWrittenFile(const SourceFile& file) {
base::AutoLock lock(lock_);
written_files_.push_back(file);
}
void Scheduler::AddUnknownGeneratedInput(const Target* target,
const SourceFile& file) {
base::AutoLock lock(lock_);
unknown_generated_inputs_.insert(std::make_pair(file, target));
}
void Scheduler::AddWriteRuntimeDepsTarget(const Target* target) {
base::AutoLock lock(lock_);
write_runtime_deps_targets_.push_back(target);
}
std::vector<const Target*> Scheduler::GetWriteRuntimeDepsTargets() const {
base::AutoLock lock(lock_);
return write_runtime_deps_targets_;
}
bool Scheduler::IsFileGeneratedByWriteRuntimeDeps(
const OutputFile& file) const {
base::AutoLock lock(lock_);
// Number of targets should be quite small, so brute-force search is fine.
for (const Target* target : write_runtime_deps_targets_) {
if (file == target->write_runtime_deps_output()) {
return true;
}
}
return false;
}
std::multimap<SourceFile, const Target*>
Scheduler::GetUnknownGeneratedInputs() const {
base::AutoLock lock(lock_);
// Remove all unknown inputs that were written files. These are OK as inputs
// to build steps since they were written as a side-effect of running GN.
//
// It's assumed that this function is called once during cleanup to check for
// errors, so performing this work in the lock doesn't matter.
std::multimap<SourceFile, const Target*> filtered = unknown_generated_inputs_;
for (const SourceFile& file : written_files_)
filtered.erase(file);
return filtered;
}
void Scheduler::ClearUnknownGeneratedInputsAndWrittenFiles() {
base::AutoLock lock(lock_);
unknown_generated_inputs_.clear();
written_files_.clear();
}
void Scheduler::IncrementWorkCount() {
base::AtomicRefCountInc(&work_count_);
}
void Scheduler::DecrementWorkCount() {
if (!base::AtomicRefCountDec(&work_count_)) {
if (base::MessageLoop::current() == &main_loop_) {
OnComplete();
} else {
main_loop_.PostTask(FROM_HERE,
base::Bind(&Scheduler::OnComplete,
base::Unretained(this)));
}
}
}
void Scheduler::LogOnMainThread(const std::string& verb,
const std::string& msg) {
OutputString(verb, DECORATION_YELLOW);
OutputString(" " + msg + "\n");
}
void Scheduler::FailWithErrorOnMainThread(const Err& err) {
err.PrintToStdout();
runner_.Quit();
}
void Scheduler::DoWork(const base::Closure& closure) {
closure.Run();
DecrementWorkCount();
}
void Scheduler::OnComplete() {
// Should be called on the main thread.
DCHECK(base::MessageLoop::current() == main_loop());
runner_.Quit();
}
|