-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathBuildGraph.cpp
More file actions
1666 lines (1313 loc) · 38.5 KB
/
Copy pathBuildGraph.cpp
File metadata and controls
1666 lines (1313 loc) · 38.5 KB
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
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
/**
*
* @file BuildGraph.cpp
* @author Gaspard Kirira
*
* Copyright 2026, Gaspard Kirira. All rights reserved.
* https://github.com/vixcpp/vix
* Use of this source code is governed by a MIT license
* that can be found in the License file.
*
* Vix.cpp
*
* Incremental build graph
*
*/
#include <vix/engine/BuildGraph.hpp>
#include <vix/engine/CompileCommands.hpp>
#include <vix/engine/BuildNinja.hpp>
#include <algorithm>
#include <cstdint>
#include <fstream>
#include <set>
#include <sstream>
#include <system_error>
namespace vix::engine
{
namespace
{
static constexpr std::uint64_t FNV_OFFSET = 1469598103934665603ull;
static constexpr std::uint64_t FNV_PRIME = 1099511628211ull;
static constexpr const char *BUILD_GRAPH_MAGIC = "vix-build-graph";
static std::uint64_t fnv_mix(
std::uint64_t h,
const void *data,
std::size_t len)
{
const auto *p = static_cast<const unsigned char *>(data);
for (std::size_t i = 0; i < len; ++i)
{
h ^= static_cast<std::uint64_t>(p[i]);
h *= FNV_PRIME;
}
return h;
}
static std::uint64_t fnv_mix_string(
std::uint64_t h,
const std::string &value)
{
return fnv_mix(h, value.data(), value.size());
}
static std::string hex64(std::uint64_t value)
{
static constexpr char digits[] = "0123456789abcdef";
std::string out(16, '0');
for (int i = 15; i >= 0; --i)
{
out[static_cast<std::size_t>(i)] = digits[value & 0x0f];
value >>= 4;
}
return out;
}
static bool is_source_extension(const std::string &ext)
{
return ext == ".cpp" ||
ext == ".cc" ||
ext == ".cxx" ||
ext == ".c";
}
static bool is_header_extension(const std::string &ext)
{
return ext == ".hpp" ||
ext == ".hh" ||
ext == ".hxx" ||
ext == ".h" ||
ext == ".ipp";
}
static bool is_config_file(const fs::path &path)
{
const std::string name = path.filename().string();
const std::string ext = path.extension().string();
return name == "CMakeLists.txt" ||
name == "CMakePresets.json" ||
name == "vix.json" ||
name == "vix.toml" ||
name == "vix.lock" ||
ext == ".cmake";
}
static BuildNodeKind kind_for_project_input_path(const fs::path &path)
{
const std::string ext = path.extension().string();
if (is_source_extension(ext))
return BuildNodeKind::Source;
if (is_header_extension(ext))
return BuildNodeKind::Header;
if (is_config_file(path))
return BuildNodeKind::Config;
return BuildNodeKind::Unknown;
}
static bool should_skip_dir(const fs::path &path)
{
const std::string name = path.filename().string();
if (name == ".git" ||
name == ".hg" ||
name == ".svn" ||
name == ".vix" ||
name == "node_modules" ||
name == ".cache" ||
name == ".idea" ||
name == ".vscode")
{
return true;
}
if (name.rfind("build", 0) == 0)
return true;
return false;
}
static std::string normalize_path_string(const fs::path &path)
{
return path.lexically_normal().generic_string();
}
static std::string sanitize_object_component(std::string value)
{
for (char &c : value)
{
const unsigned char uc = static_cast<unsigned char>(c);
if (!(std::isalnum(uc) || c == '.' || c == '_' || c == '-'))
c = '_';
}
if (value.empty())
return "unknown";
return value;
}
static std::uint64_t hash_file_content_u64(const fs::path &path)
{
std::ifstream in(path, std::ios::binary);
if (!in)
return 0;
std::uint64_t h = FNV_OFFSET;
char buffer[64 * 1024];
while (in)
{
in.read(buffer, sizeof(buffer));
const std::streamsize n = in.gcount();
if (n > 0)
{
h = fnv_mix(
h,
buffer,
static_cast<std::size_t>(n));
}
}
return h;
}
static std::string hash_file_content(const fs::path &path)
{
return hex64(hash_file_content_u64(path));
}
static bool write_text_file_atomic(
const fs::path &path,
const std::string &content)
{
const fs::path parent = path.parent_path();
if (!parent.empty())
{
std::error_code ec;
fs::create_directories(parent, ec);
}
const fs::path tmp = path.string() + ".tmp";
{
std::ofstream out(tmp, std::ios::binary | std::ios::trunc);
if (!out)
return false;
out << content;
if (!out)
return false;
}
std::error_code ec;
fs::rename(tmp, path, ec);
if (!ec)
return true;
fs::remove(path, ec);
ec.clear();
fs::rename(tmp, path, ec);
return !ec;
}
static std::string escape_field(const std::string &value)
{
std::string out;
out.reserve(value.size() + 8);
for (char c : value)
{
switch (c)
{
case '\\':
out += "\\\\";
break;
case '\n':
out += "\\n";
break;
case '\r':
out += "\\r";
break;
case '\t':
out += "\\t";
break;
case '|':
out += "\\p";
break;
default:
out.push_back(c);
break;
}
}
return out;
}
static std::string unescape_field(const std::string &value)
{
std::string out;
out.reserve(value.size());
bool escaped = false;
for (char c : value)
{
if (!escaped)
{
if (c == '\\')
{
escaped = true;
continue;
}
out.push_back(c);
continue;
}
switch (c)
{
case 'n':
out.push_back('\n');
break;
case 'r':
out.push_back('\r');
break;
case 't':
out.push_back('\t');
break;
case 'p':
out.push_back('|');
break;
case '\\':
out.push_back('\\');
break;
default:
out.push_back(c);
break;
}
escaped = false;
}
if (escaped)
out.push_back('\\');
return out;
}
static std::vector<std::string> split_fields(const std::string &line)
{
std::vector<std::string> fields;
std::string current;
bool escaped = false;
for (char c : line)
{
if (escaped)
{
current.push_back('\\');
current.push_back(c);
escaped = false;
continue;
}
if (c == '\\')
{
escaped = true;
continue;
}
if (c == '|')
{
fields.push_back(unescape_field(current));
current.clear();
continue;
}
current.push_back(c);
}
if (escaped)
current.push_back('\\');
fields.push_back(unescape_field(current));
return fields;
}
static std::vector<std::string> split_list(const std::string &value)
{
std::vector<std::string> out;
std::string current;
for (char c : value)
{
if (c == ';')
{
if (!current.empty())
out.push_back(current);
current.clear();
continue;
}
current.push_back(c);
}
if (!current.empty())
out.push_back(current);
return out;
}
static std::string join_list(const std::vector<std::string> &items)
{
std::ostringstream out;
for (std::size_t i = 0; i < items.size(); ++i)
{
if (i > 0)
out << ";";
out << items[i];
}
return out.str();
}
static std::uint64_t parse_u64_or_zero(const std::string &value)
{
try
{
std::size_t pos = 0;
const auto parsed = std::stoull(value, &pos, 10);
if (pos != value.size())
return 0;
return static_cast<std::uint64_t>(parsed);
}
catch (...)
{
return 0;
}
}
static std::string compile_task_id_for_source(const fs::path &source)
{
std::uint64_t h = FNV_OFFSET;
const std::string normalized = normalize_path_string(source);
h = fnv_mix_string(h, "compile:");
h = fnv_mix_string(h, normalized);
return "compile:" + hex64(h);
}
static std::vector<std::string> make_dependency_enabled_command(
const std::vector<std::string> &arguments,
const fs::path &dependencyFile)
{
std::vector<std::string> out;
out.reserve(arguments.size() + 6);
bool hasMMD = false;
bool hasMP = false;
bool hasMF = false;
bool hasDependencyMode = false;
for (std::size_t i = 0; i < arguments.size(); ++i)
{
const std::string &arg = arguments[i];
if (arg == "-MMD")
hasMMD = true;
if (arg == "-MP")
hasMP = true;
if (arg == "-MF")
{
hasMF = true;
out.push_back(arg);
if (i + 1 < arguments.size())
{
out.push_back(dependencyFile.string());
++i;
}
else
{
out.push_back(dependencyFile.string());
}
continue;
}
if (arg.rfind("-MF", 0) == 0 && arg.size() > 3)
{
hasMF = true;
out.push_back("-MF");
out.push_back(dependencyFile.string());
continue;
}
if (arg == "-MD" ||
arg == "-MMD" ||
arg == "-M" ||
arg == "-MM")
{
hasDependencyMode = true;
}
out.push_back(arg);
}
if (!hasDependencyMode && !hasMMD)
out.push_back("-MMD");
if (!hasMP)
out.push_back("-MP");
if (!hasMF)
{
out.push_back("-MF");
out.push_back(dependencyFile.string());
}
return out;
}
static BuildNodeKind node_kind_from_ninja_edge_output(
const NinjaEdge &edge,
const fs::path &path)
{
const std::string ext = path.extension().string();
if (edge.kind == NinjaEdgeKind::Archive)
return BuildNodeKind::Library;
if (edge.kind == NinjaEdgeKind::Link)
{
if (ext == ".a" ||
ext == ".so" ||
ext == ".dylib" ||
ext == ".dll" ||
ext == ".lib")
{
return BuildNodeKind::Library;
}
return BuildNodeKind::Executable;
}
if (edge.kind == NinjaEdgeKind::Copy ||
edge.kind == NinjaEdgeKind::Install)
{
return BuildNodeKind::Config;
}
/*
* Utility/phony/generated outputs are intentionally imported as Config.
*
* They are useful as graph dependencies, but they are not safe direct
* Graph Executor targets yet. BuildGraphExecutor will reject them and
* fallback to CMake/Ninja.
*/
if (edge.kind == NinjaEdgeKind::Utility)
return BuildNodeKind::Config;
return BuildNodeKind::Unknown;
}
static BuildNodeKind node_kind_from_ninja_input(const fs::path &path)
{
const std::string ext = path.extension().string();
if (ext == ".o" || ext == ".obj")
return BuildNodeKind::Object;
if (ext == ".a" ||
ext == ".so" ||
ext == ".dylib" ||
ext == ".dll" ||
ext == ".lib")
{
return BuildNodeKind::Library;
}
if (is_source_extension(ext))
return BuildNodeKind::Source;
if (is_header_extension(ext))
return BuildNodeKind::Header;
return BuildNodeKind::Config;
}
static BuildTaskKind build_task_kind_from_ninja_edge_kind(NinjaEdgeKind kind)
{
switch (kind)
{
case NinjaEdgeKind::Archive:
return BuildTaskKind::Archive;
case NinjaEdgeKind::Link:
return BuildTaskKind::Link;
case NinjaEdgeKind::Copy:
return BuildTaskKind::Copy;
case NinjaEdgeKind::Install:
return BuildTaskKind::Copy;
case NinjaEdgeKind::Utility:
return BuildTaskKind::Generate;
case NinjaEdgeKind::Compile:
return BuildTaskKind::Compile;
case NinjaEdgeKind::Unknown:
default:
return BuildTaskKind::Unknown;
}
}
static std::string ninja_task_id_for_edge(const NinjaEdge &edge)
{
std::uint64_t h = FNV_OFFSET;
h = fnv_mix_string(h, "ninja:");
h = fnv_mix_string(h, to_string(edge.kind));
h = fnv_mix_string(h, edge.rule);
for (const fs::path &output : edge.outputs)
h = fnv_mix_string(h, normalize_path_string(output));
return "ninja:" + hex64(h);
}
static std::string command_hash_for_argv(
const std::vector<std::string> &command)
{
std::uint64_t h = FNV_OFFSET;
h = fnv_mix_string(h, "command:");
for (const std::string &arg : command)
{
h = fnv_mix_string(h, arg);
h = fnv_mix_string(h, "\0");
}
return hex64(h);
}
static bool should_import_ninja_edge(const NinjaEdge &edge)
{
if (!edge.valid())
return false;
/*
* Compile commands are imported from compile_commands.json because that
* gives Vix the exact compiler argv, working directory and object output.
*/
if (edge.kind == NinjaEdgeKind::Compile)
return false;
if (edge.kind == NinjaEdgeKind::Unknown)
return false;
/*
* Import Link/Archive/Copy/Install/Utility edges.
*
* The executor will decide later if a target is safe to execute through
* Graph Executor. Importing the DAG is useful even when execution falls
* back to CMake/Ninja.
*/
return true;
}
} // namespace
bool BuildGraphConfig::valid() const
{
return !projectDir.empty() && !buildDir.empty();
}
BuildGraph::BuildGraph(BuildGraphConfig config)
: config_(std::move(config))
{
if (config_.objectDir.empty() && !config_.buildDir.empty())
config_.objectDir = config_.buildDir / ".vix" / "obj";
}
const BuildGraphConfig &BuildGraph::config() const
{
return config_;
}
void BuildGraph::set_config(BuildGraphConfig config)
{
config_ = std::move(config);
if (config_.objectDir.empty() && !config_.buildDir.empty())
config_.objectDir = config_.buildDir / ".vix" / "obj";
}
void BuildGraph::clear()
{
nodes_.clear();
tasks_.clear();
}
bool BuildGraph::empty() const
{
return nodes_.empty() && tasks_.empty();
}
bool BuildGraph::add_node(const BuildNode &node)
{
if (!node.valid())
return false;
nodes_[node.id] = node;
return true;
}
bool BuildGraph::add_task(const BuildTask &task)
{
if (!task.valid())
return false;
tasks_[task.id] = task;
return true;
}
BuildNode *BuildGraph::find_node(const std::string &id)
{
const auto it = nodes_.find(id);
if (it == nodes_.end())
return nullptr;
return &it->second;
}
const BuildNode *BuildGraph::find_node(const std::string &id) const
{
const auto it = nodes_.find(id);
if (it == nodes_.end())
return nullptr;
return &it->second;
}
BuildTask *BuildGraph::find_task(const std::string &id)
{
const auto it = tasks_.find(id);
if (it == tasks_.end())
return nullptr;
return &it->second;
}
const BuildTask *BuildGraph::find_task(const std::string &id) const
{
const auto it = tasks_.find(id);
if (it == tasks_.end())
return nullptr;
return &it->second;
}
const std::unordered_map<std::string, BuildNode> &BuildGraph::nodes() const
{
return nodes_;
}
const std::unordered_map<std::string, BuildTask> &BuildGraph::tasks() const
{
return tasks_;
}
std::vector<std::string> BuildGraph::sorted_node_ids() const
{
std::vector<std::string> ids;
ids.reserve(nodes_.size());
for (const auto &kv : nodes_)
ids.push_back(kv.first);
std::sort(ids.begin(), ids.end());
return ids;
}
std::vector<std::string> BuildGraph::sorted_task_ids() const
{
std::vector<std::string> ids;
ids.reserve(tasks_.size());
for (const auto &kv : tasks_)
ids.push_back(kv.first);
std::sort(ids.begin(), ids.end());
return ids;
}
BuildGraphScanResult BuildGraph::scan_project()
{
BuildGraphScanResult result;
if (!config_.valid())
return result;
const fs::path root = fs::absolute(config_.projectDir).lexically_normal();
std::error_code ec;
fs::recursive_directory_iterator it(
root,
fs::directory_options::skip_permission_denied,
ec);
const fs::recursive_directory_iterator end;
while (!ec && it != end)
{
const fs::path current = it->path();
if (it->is_directory(ec))
{
if (should_skip_dir(current))
it.disable_recursion_pending();
++it;
continue;
}
if (!it->is_regular_file(ec))
{
++it;
continue;
}
const std::string ext = current.extension().string();
BuildNodeKind kind = BuildNodeKind::Unknown;
if (is_source_extension(ext))
kind = BuildNodeKind::Source;
else if (is_header_extension(ext))
kind = BuildNodeKind::Header;
else if (is_config_file(current))
kind = BuildNodeKind::Config;
else
{
++it;
continue;
}
BuildNode node = make_file_build_node(kind, current);
node.hash = hash_file_content(current);
add_node(node);
if (kind == BuildNodeKind::Source)
++result.sources;
else if (kind == BuildNodeKind::Header)
++result.headers;
else if (kind == BuildNodeKind::Config)
++result.configs;
++it;
}
result.tasks = tasks_.size();
return result;
}
std::size_t BuildGraph::load_compile_commands(const fs::path &path)
{
const auto compileCommands = read_compile_commands(path);
if (!compileCommands)
return 0;
std::size_t imported = 0;
for (const CompileCommandEntry &entry : *compileCommands)
{
if (!entry.valid() || !entry.has_output())
continue;
const fs::path sourcePath = entry.source.lexically_normal();
const fs::path objectPath = entry.output.lexically_normal();
const fs::path dependencyPath = dependency_file_for_object(objectPath);
BuildNode sourceNode =
make_file_build_node(BuildNodeKind::Source, sourcePath);
sourceNode.hash = hash_file_content(sourcePath);
add_node(sourceNode);
BuildNode objectNode =
make_file_build_node(BuildNodeKind::Object, objectPath);
objectNode.id = make_build_node_id(BuildNodeKind::Object, objectPath);
objectNode.hash = hash_file_content(objectPath);
objectNode.add_dependency(sourceNode.id);
add_node(objectNode);
std::vector<std::string> command =
make_dependency_enabled_command(
entry.arguments,
dependencyPath);
BuildTask task =
make_compile_task(
sourceNode.id,
objectNode.id,
command,
entry.directory);
task.id = compile_task_id_for_source(sourcePath);
task.workingDirectory = entry.directory;
task.logFile = dependencyPath;
task.commandHash = command_hash_for_argv(task.command);
add_task(task);
++imported;
}
return imported;
}
std::size_t BuildGraph::load_ninja_build(const fs::path &path)
{
const auto ninjaBuild = read_build_ninja(path);
if (!ninjaBuild)
return 0;
std::size_t imported = 0;
std::unordered_map<std::string, std::string> outputToTask;
for (const auto &kv : tasks_)
{
const BuildTask &task = kv.second;
for (const std::string &outputId : task.outputs)
outputToTask[outputId] = task.id;
}
for (const NinjaEdge &edge : ninjaBuild->edges)
{
if (!should_import_ninja_edge(edge))
continue;
const BuildTaskKind taskKind =
build_task_kind_from_ninja_edge_kind(edge.kind);
if (taskKind == BuildTaskKind::Unknown)
continue;
BuildTask task;
task.id = ninja_task_id_for_edge(edge);
task.kind = taskKind;
task.state = BuildTaskState::Pending;
task.workingDirectory = ninjaBuild->directory;
/*
* We intentionally delegate non-compile Ninja edges back to Ninja.
*
* Vix imports the DAG and target metadata here, but does not yet expand
* Ninja variables or reimplement every CMake-generated build rule.
*/
task.command = {
"ninja",
"-C",
ninjaBuild->directory.string(),
edge.primary_output().string()};
task.commandHash = command_hash_for_argv(task.command);
std::vector<std::string> inputNodeIds;
auto import_input = [&](const fs::path &input)
{
const BuildNodeKind inputKind = node_kind_from_ninja_input(input);
BuildNode inputNode = make_file_build_node(inputKind, input);
/*
* Keep Ninja import cheap.
* Real source/header hashes are provided by scan_project() and .d files.
* Ninja can reference many generated/internal files.
*/
inputNode.hash.clear();
add_node(inputNode);
task.add_input(inputNode.id);
inputNodeIds.push_back(inputNode.id);
const auto producerIt = outputToTask.find(inputNode.id);
if (producerIt != outputToTask.end())
task.add_dependency(producerIt->second);
};
for (const fs::path &input : edge.explicitInputs)
import_input(input);
for (const fs::path &input : edge.implicitInputs)
import_input(input);
for (const fs::path &input : edge.orderOnlyInputs)
import_input(input);
for (const fs::path &output : edge.outputs)
{
const BuildNodeKind outputKind =
node_kind_from_ninja_edge_output(edge, output);
if (outputKind == BuildNodeKind::Unknown)
continue;
BuildNode outputNode = make_file_build_node(outputKind, output);
outputNode.hash.clear();
for (const auto &inputId : inputNodeIds)
outputNode.add_dependency(inputId);
add_node(outputNode);
task.add_output(outputNode.id);
}
if (task.outputs.empty())
continue;