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
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
|
// Copyright 2022 Huawei Cloud Computing Technology Co., Ltd.
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
#include <cstddef>
#include <cstdint>
#include <map>
#include <string>
#include <unordered_set>
#include <vector>
#include "catch2/catch_test_macros.hpp"
#include "gsl/gsl"
#include "src/buildtool/common/action.hpp"
#include "src/buildtool/common/action_description.hpp"
#include "src/buildtool/common/artifact_description.hpp"
#include "src/buildtool/common/artifact_factory.hpp"
#include "src/buildtool/common/identifier.hpp"
#include "src/buildtool/execution_engine/dag/dag.hpp"
#include "test/utils/container_matchers.hpp"
namespace {
[[nodiscard]] auto IsValidGraph(DependencyGraph const& graph) noexcept -> bool;
[[nodiscard]] auto GetActionOfArtifact(
DependencyGraph const& g,
ActionIdentifier const& action_id) noexcept
-> DependencyGraph::ActionNode const*;
} // namespace
/// \brief Checks that each artifact with identifier in output_ids has been
/// added to the graph and that its builder action has id action_id, and that
/// all outputs of actions are those the ids of which are listed in output_ids
void CheckOutputNodesCorrectlyAdded(
DependencyGraph const& g,
ActionIdentifier const& action_id,
std::vector<std::string> const& output_paths) {
std::vector<ArtifactIdentifier> output_ids;
for (auto const& path : output_paths) {
auto const output_id =
ArtifactDescription::CreateAction(action_id, path).Id();
CHECK(g.ArtifactNodeWithId(output_id) != nullptr);
auto const* action = GetActionOfArtifact(g, output_id);
CHECK(action != nullptr);
CHECK(action->Content().Id() == action_id);
output_ids.push_back(output_id);
}
std::vector<ArtifactIdentifier> output_file_ids;
for (auto const& out_file : g.ActionNodeWithId(action_id)->OutputFiles()) {
output_file_ids.push_back(out_file.node->Content().Id());
}
CHECK_THAT(
output_file_ids,
HasSameUniqueElementsAs<std::vector<ArtifactIdentifier>>(output_ids));
}
/// \brief Checks that the artifacts with ids in inputs_ids are in the graph and
/// coincide with the action's dependencies
void CheckInputNodesCorrectlyAdded(
DependencyGraph const& g,
ActionIdentifier const& action_id,
std::vector<ArtifactIdentifier> const& input_ids) noexcept {
for (auto const& input_id : input_ids) {
CHECK(g.ArtifactNodeWithId(input_id) != nullptr);
}
std::vector<ArtifactIdentifier> dependency_ids;
for (auto const& dependency :
g.ActionNodeWithId(action_id)->Dependencies()) {
dependency_ids.push_back(dependency.node->Content().Id());
}
CHECK_THAT(
dependency_ids,
HasSameUniqueElementsAs<std::vector<ArtifactIdentifier>>(input_ids));
}
/// \brief Checks that the artifacts have been added as local artifact and their
/// local path is correct
void CheckLocalArtifactsCorrectlyAdded(
DependencyGraph const& g,
std::vector<ArtifactIdentifier> const& ids,
std::vector<std::string> const& paths) noexcept {
REQUIRE(ids.size() == paths.size());
for (std::size_t pos = 0; pos < ids.size(); ++pos) {
auto const* artifact_node = g.ArtifactNodeWithId(ids[pos]);
CHECK(artifact_node != nullptr);
CHECK(not artifact_node->HasBuilderAction());
CHECK(artifact_node->Content().FilePath() == paths[pos]);
}
}
TEST_CASE("Empty Dependency Graph", "[dag]") {
DependencyGraph g;
CHECK(IsValidGraph(g));
}
TEST_CASE("AddAction({single action, single output, no inputs})", "[dag]") {
std::string const action_id = "action_id";
auto const action_description = ActionDescription{
{"out"}, {}, Action{action_id, {"touch", "out"}, {}}, {}};
DependencyGraph g;
CHECK(g.AddAction(action_description));
CheckOutputNodesCorrectlyAdded(g, action_id, {"out"});
CHECK(IsValidGraph(g));
}
TEST_CASE("AddAction({single action, more outputs, no inputs})", "[dag]") {
std::string const action_id = "action_id";
std::vector<std::string> const output_files = {"out0", "out1", "out2"};
auto const action_description = ActionDescription{
output_files,
{},
Action{action_id, {"touch", "out0", "out1", "out2"}, {}},
{}};
DependencyGraph g;
CHECK(g.AddAction(action_description));
CheckOutputNodesCorrectlyAdded(g, action_id, output_files);
CHECK(IsValidGraph(g));
}
TEST_CASE("AddAction({single action, single output, source file})", "[dag]") {
using path = std::filesystem::path;
std::string const action_id = "action_id";
auto const src_description =
ArtifactDescription::CreateLocal(path{"main.cpp"}, "repo");
auto const& src_id = src_description.Id();
DependencyGraph g;
SECTION("Input file in the same path than it is locally") {
auto const action_description =
ActionDescription{{"executable"},
{},
Action{action_id, {"gcc", "main.cpp"}, {}},
{{"main.cpp", src_description}}};
CHECK(g.AddAction(action_description));
}
SECTION("Input file in different path from the local one") {
auto const action_description =
ActionDescription{{"executable"},
{},
Action{action_id, {"gcc", "src/a.cpp"}, {}},
{{"src/a.cpp", src_description}}};
CHECK(g.Add({action_description}));
}
CheckOutputNodesCorrectlyAdded(g, action_id, {"executable"});
CheckInputNodesCorrectlyAdded(g, action_id, {src_id});
// Now we check that the src file artifact was added with the correct path
CheckLocalArtifactsCorrectlyAdded(g, {src_id}, {"main.cpp"});
// All artifacts are the source file and the executable
CHECK_THAT(
g.ArtifactIdentifiers(),
HasSameUniqueElementsAs<std::unordered_set<ArtifactIdentifier>>(
{src_id,
ArtifactDescription::CreateAction(action_id, "executable").Id()}));
CHECK(IsValidGraph(g));
}
TEST_CASE("AddAction({single action, single output, no inputs, env_variables})",
"[dag]") {
std::string const action_id = "action_id";
std::string const name = "World";
DependencyGraph g;
std::vector<std::string> const command{
"/bin/sh", "-c", "set -e\necho 'Hello, ${NAME}' > greeting"};
std::map<std::string, std::string> const env_vars{{"NAME", name}};
auto const action_description = ActionDescription{
{"greeting"}, {}, Action{action_id, command, env_vars}, {}};
CHECK(g.AddAction(action_description));
CheckOutputNodesCorrectlyAdded(g, action_id, {"greeting"});
CheckInputNodesCorrectlyAdded(g, action_id, {});
auto const* const action_node = g.ActionNodeWithId(action_id);
CHECK(action_node != nullptr);
CHECK(action_node->Command() == command);
CHECK(action_node->Env() == env_vars);
// All artifacts are the output file
CHECK_THAT(
g.ArtifactIdentifiers(),
HasSameUniqueElementsAs<std::unordered_set<ArtifactIdentifier>>(
{ArtifactDescription::CreateAction(action_id, "greeting").Id()}));
CHECK(IsValidGraph(g));
}
TEST_CASE("Add executable and library", "[dag]") {
// Note: we don't use local bindings for members of pair as output of
// functions because it seems to be problematic with Catch2's macros inside
// lambdas and we want to use lambdas here to avoid repetition
using path = std::filesystem::path;
std::string const make_exec_id = "make_exe";
std::string const make_lib_id = "make_lib";
std::vector<std::string> const make_exec_cmd = {"build", "exec"};
std::vector<std::string> const make_lib_cmd = {"build", "lib.a"};
auto const main_desc =
ArtifactDescription::CreateLocal(path{"main.cpp"}, "");
auto const& main_id = main_desc.Id();
auto const lib_hpp_desc =
ArtifactDescription::CreateLocal(path{"lib/lib.hpp"}, "");
auto const& lib_hpp_id = lib_hpp_desc.Id();
auto const lib_cpp_desc =
ArtifactDescription::CreateLocal(path{"lib/lib.cpp"}, "");
auto const& lib_cpp_id = lib_cpp_desc.Id();
auto const lib_a_desc =
ArtifactDescription::CreateAction(make_lib_id, "lib.a");
auto const& lib_a_id = lib_a_desc.Id();
auto const make_exec_desc =
ActionDescription{{"exec"},
{},
Action{make_exec_id, make_exec_cmd, {}},
{{"main.cpp", main_desc}, {"lib.a", lib_a_desc}}};
auto const& exec_out_id =
ArtifactDescription::CreateAction(make_exec_id, "exec").Id();
auto const make_lib_desc = ActionDescription{
{"lib.a"},
{},
Action{make_lib_id, make_lib_cmd, {}},
{{"lib.hpp", lib_hpp_desc}, {"lib.cpp", lib_cpp_desc}}};
DependencyGraph g;
auto check_exec = [&]() {
CHECK(IsValidGraph(g));
CheckOutputNodesCorrectlyAdded(g, make_exec_id, {"exec"});
CheckInputNodesCorrectlyAdded(g, make_exec_id, {main_id, lib_a_id});
CheckLocalArtifactsCorrectlyAdded(g, {main_id}, {"main.cpp"});
CHECK_THAT(GetActionOfArtifact(g, exec_out_id)->Command(),
Catch::Matchers::Equals(make_exec_cmd));
};
auto check_lib = [&]() {
CHECK(IsValidGraph(g));
CheckOutputNodesCorrectlyAdded(g, make_lib_id, {"lib.a"});
CheckInputNodesCorrectlyAdded(g, make_lib_id, {lib_hpp_id, lib_cpp_id});
CheckLocalArtifactsCorrectlyAdded(
g, {lib_hpp_id, lib_cpp_id}, {"lib/lib.hpp", "lib/lib.cpp"});
CHECK_THAT(GetActionOfArtifact(g, lib_a_id)->Command(),
Catch::Matchers::Equals(make_lib_cmd));
};
SECTION("First exec, then lib") {
CHECK(g.AddAction(make_exec_desc));
check_exec();
CHECK(g.AddAction(make_lib_desc));
check_lib();
}
SECTION("First lib, then exec") {
CHECK(g.AddAction(make_lib_desc));
check_lib();
CHECK(g.AddAction(make_exec_desc));
check_exec();
}
SECTION("Add both with single call to `DependencyGraph::Add`") {
CHECK(g.Add({make_exec_desc, make_lib_desc}));
check_exec();
check_lib();
}
CHECK_THAT(g.ArtifactIdentifiers(),
HasSameUniqueElementsAs<std::unordered_set<ArtifactIdentifier>>(
{main_id, exec_out_id, lib_a_id, lib_hpp_id, lib_cpp_id}));
}
// Incorrect action description tests
TEST_CASE("AddAction(id, empty action description) fails", "[dag]") {
DependencyGraph g;
CHECK(not g.AddAction(ActionDescription{{}, {}, Action{"id", {}, {}}, {}}));
}
TEST_CASE("AddAction(Empty mandatory non-empty field in action description)",
"[dag]") {
DependencyGraph g;
CHECK(not g.AddAction(ActionDescription{
{"output0", "output1"}, {}, Action{"empty command", {}, {}}, {}}));
CHECK(not g.AddAction(ActionDescription{
{}, {}, Action{"empty output", {"echo", "hello"}, {}}, {}}));
}
// Collision between actions tests
TEST_CASE("Adding cyclic dependencies produces invalid graph", "[dag]") {
std::string const action1_id = "action1";
std::string const action2_id = "action2";
auto const out1_desc =
ArtifactDescription::CreateAction(action1_id, "out1");
auto const out2_desc =
ArtifactDescription::CreateAction(action2_id, "out2");
auto const action1_desc =
ActionDescription{{"out1"},
{},
Action{action1_id, {"touch", "out1"}, {}},
{{"dep", out2_desc}}};
auto const action2_desc =
ActionDescription{{"out2"},
{},
Action{action2_id, {"touch", "out2"}, {}},
{{"dep", out1_desc}}};
DependencyGraph g;
CHECK(g.Add({action1_desc, action2_desc}));
CHECK(not IsValidGraph(g));
}
TEST_CASE("Error when adding an action with an id already added", "[dag]") {
std::string const action_id = "id";
auto const action_desc =
ActionDescription{{"out"}, {}, Action{"id", {"touch", "out"}, {}}, {}};
DependencyGraph g;
CHECK(g.AddAction(action_desc));
CheckOutputNodesCorrectlyAdded(g, action_id, {"out"});
CHECK(IsValidGraph(g));
CHECK(not g.AddAction(action_desc));
}
TEST_CASE("Error when adding conflicting output files and directories",
"[dag]") {
auto const action_desc = ActionDescription{
{"out"}, {"out"}, Action{"id", {"touch", "out"}, {}}, {}};
DependencyGraph g;
CHECK_FALSE(g.AddAction(action_desc));
}
namespace {
[[nodiscard]] auto IsValidNode(
DependencyGraph::ArtifactNode const& node) noexcept -> bool {
return node.Children().size() <= 1;
}
[[nodiscard]] auto IsValidNode(DependencyGraph::ActionNode const& node) noexcept
-> bool {
return not node.Parents().empty();
}
template <typename TNode>
// NOLINTNEXTLINE(misc-no-recursion)
[[nodiscard]] auto IsValidNode(
TNode const& node,
gsl::not_null<std::unordered_set<std::uintptr_t>*> const& seen) -> bool {
// Check the node hasn't been met yet (cycles check):
// NOLINTNEXTLINE(cppcoreguidelines-pro-type-reinterpret-cast)
auto const node_id = reinterpret_cast<std::uintptr_t>(&node);
auto [it, inserted] = seen->insert(node_id);
if (not inserted) {
return false;
}
// Check the validity of the node and all children:
if (not IsValidNode(node)) {
return false;
}
for (auto const& child : node.Children()) {
if (not IsValidNode(*child, seen)) {
return false;
}
}
seen->erase(it);
return true;
}
[[nodiscard]] auto IsValidGraph(DependencyGraph const& graph) noexcept -> bool {
std::unordered_set<std::uintptr_t> seen{};
for (auto const& id : graph.ArtifactIdentifiers()) {
DependencyGraph::ArtifactNode const* node =
graph.ArtifactNodeWithId(id);
try {
// Check the node exists and is valid:
if (node == nullptr or not IsValidNode(*node, &seen)) {
return false;
}
} catch (...) {
return false;
}
// There must be no pending nodes:
if (not seen.empty()) {
return false;
}
}
return true;
}
[[nodiscard]] auto GetActionOfArtifact(
DependencyGraph const& g,
ActionIdentifier const& action_id) noexcept
-> DependencyGraph::ActionNode const* {
auto const* node = g.ArtifactNodeWithId(action_id);
if (node != nullptr) {
auto const& children = node->Children();
if (children.empty()) {
return nullptr;
}
return children[0];
}
return nullptr;
}
} // namespace
|