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
|
// -*- c++ -*-
// Distributed under the BSD 2-Clause License.
// See accompanying file LICENSE for details.
#include "build.h"
#include <future>
#include <iostream>
#include <chrono>
#include <thread>
#include <list>
#include <algorithm>
#include "ctor.h"
using namespace std::chrono_literals;
int build(const ctor::settings& settings,
const std::string& name,
const std::vector<std::shared_ptr<Task>>& tasks,
const std::vector<std::shared_ptr<Task>>& all_tasks,
bool dryrun)
{
if(settings.verbose > 1)
{
std::cout << "Building '" << name << "'\n";
}
std::vector<std::shared_ptr<Task>> dirtyTasks;
for(auto task : tasks)
{
if(task->dirty() &&
std::find(dirtyTasks.begin(), dirtyTasks.end(), task) == dirtyTasks.end())
{
dirtyTasks.push_back(task);
}
}
// Dry-run returns number of dirty tasks but otherwise does nothing.
if(dryrun)
{
return static_cast<int>(dirtyTasks.size());
}
if(dirtyTasks.empty())
{
if(settings.verbose > -1)
{
std::cout << "Nothing to be done for '"<< name << "'\n";
}
return 0;
}
std::list<std::future<int>> processes;
// Start all tasks
bool done{false};
while(!done)
{
bool started_one{false};
while(processes.size() < settings.parallel_processes)
{
if(dirtyTasks.empty())
{
done = true;
break;
}
auto task = getNextTask(all_tasks, dirtyTasks);
if(task == nullptr)
{
if(processes.empty() && !dirtyTasks.empty())
{
// No running processes, yet no process to run. This is a dead-lock...
std::cout << "Dead-lock detected.\n";
return 1;
}
break;
}
processes.emplace_back(
std::async(std::launch::async,
[task]()
{
return task->run();
}));
started_one = true;
// Make sure we don't start tasks on top of each other to prevent
// straining the disk.
std::this_thread::sleep_for(50ms);
}
for(auto process = processes.begin();
process != processes.end();
++process)
{
if(process->valid() == false)
{
continue;
}
auto ret = process->get();
if(ret != 0)
{
// NOTE Wait for other processes to finish before returning
return ret;
}
processes.erase(process);
break;
}
if(!started_one) // prevent polling too fast if no task is yet ready
{
std::this_thread::sleep_for(10ms);
}
}
for(auto& process : processes)
{
if(process.valid() == false)
{
continue;
}
process.wait();
auto ret = process.get();
if (ret != 0)
{
return ret;
}
}
return 0;
}
namespace
{
std::vector<std::shared_ptr<Task>> getDepTasks(std::shared_ptr<Task> task)
{
std::vector<std::shared_ptr<Task>> tasks;
tasks.push_back(task);
auto deps = task->getDependsTasks();
for(const auto& dep : deps)
{
auto depSet = getDepTasks(dep);
for(const auto& dep_inner : depSet)
{
if(std::find(tasks.begin(), tasks.end(), dep_inner) == tasks.end())
{
tasks.push_back(dep_inner);
}
}
}
return tasks;
}
}
int build(const ctor::settings& settings,
const std::string& name,
const std::vector<std::shared_ptr<Task>>& all_tasks,
bool dryrun)
{
bool task_found{false};
for(auto task : all_tasks)
{
if(*task == name)
{
task_found = true;
auto depSet = getDepTasks(task);
std::vector<std::shared_ptr<Task>> ts;
for(const auto& task_inner : depSet)
{
if(std::find(ts.begin(), ts.end(), task_inner) == ts.end())
{
ts.push_back(task_inner);
}
}
auto ret = build(settings, name, ts, all_tasks, dryrun);
if(ret != 0)
{
return ret;
}
break;
}
}
if(!task_found)
{
std::cerr << "*** No rule to make target '" << name << "'. Stop.\n";
return 1;
}
return 0;
}
int build(const ctor::settings& settings,
const std::string& name,
const std::vector<Target>& targets,
const std::vector<std::shared_ptr<Task>>& all_tasks,
bool dryrun)
{
bool task_found{false};
std::vector<std::shared_ptr<Task>> ts;
for(const auto& target : targets)
{
for(auto task : all_tasks)
{
if(!task->derived() && // only consider non-derived tasks
task->buildConfig().target == target.config.target)
{
task_found = true;
auto depSet = getDepTasks(task);
for(const auto& task_inner : depSet)
{
if(std::find(ts.begin(), ts.end(), task_inner) == ts.end())
{
ts.push_back(task_inner);
}
}
}
}
}
if(!task_found)
{
std::cerr << "*** No rule to make target '" << name << "'. Stop.\n";
return 1;
}
return build(settings, name, ts, all_tasks, dryrun);
}
|
