blob: 445979e70c67b16f31cd981f524075d307609c4e (
plain)
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
|
#include "build.h"
#include <future>
#include <vector>
#include <iostream>
#include <chrono>
#include <set>
#include <thread>
#include "tasks.h"
using namespace std::chrono_literals;
int build(const Settings& settings,
const std::string& name,
const std::list<std::shared_ptr<Task>>& tasks,
const std::list<std::shared_ptr<Task>>& all_tasks)
{
if(settings.verbose > 1)
{
std::cout << "Building '" << name << "'\n";
}
std::list<std::shared_ptr<Task>> dirtyTasks;
for(auto task : tasks)
{
if(task->dirty())
{
dirtyTasks.push_back(task);
}
}
if(dirtyTasks.empty())
{
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;
std::this_thread::sleep_for(2ms);
}
for(auto process = processes.begin();
process != processes.end();
++process)
{
if(process->valid())
{
if(process->get() != 0)
{
// TODO: Wait for other processes to finish before returning
return 1;
}
processes.erase(process);
break;
}
}
if(started_one)
{
std::this_thread::sleep_for(2ms);
}
else
{
std::this_thread::sleep_for(200ms);
}
}
for(auto process = processes.begin();
process != processes.end();
++process)
{
process->wait();
auto ret = process->get();
if(ret != 0)
{
return 1;
}
}
return 0;
}
namespace
{
std::set<std::shared_ptr<Task>> getDepTasks(std::shared_ptr<Task> task)
{
std::set<std::shared_ptr<Task>> tasks;
tasks.insert(task);
auto deps = task->getDependsTasks();
for(const auto& dep : deps)
{
auto depSet = getDepTasks(dep);
for(const auto& dep : depSet)
{
tasks.insert(dep);
}
}
return tasks;
}
}
int build(const Settings& settings,
const std::string& name,
const std::list<std::shared_ptr<Task>>& all_tasks)
{
bool task_found{false};
for(auto task : all_tasks)
{
if(task->name() == name || task->target() == name)
{
std::cout << name << "\n";
task_found = true;
auto depSet = getDepTasks(task);
std::list<std::shared_ptr<Task>> ts;
for(const auto& task : depSet)
{
ts.push_back(task);
}
auto ret = build(settings, name, ts, all_tasks);
if(ret != 0)
{
return ret;
}
break;
}
}
if(!task_found)
{
std::cerr << "*** No rule to make target '" << name << "'. Stop.\n";
return 1;
}
return 0;
}
|
