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
|
// Copyright 2019 Google Inc. All Rights Reserved.
//
// 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.
#ifndef NINJA_MISSING_DEPS_H_
#define NINJA_MISSING_DEPS_H_
#include <map>
#include <set>
#include <string>
#if __cplusplus >= 201103L
#include <unordered_map>
#endif
struct DepsLog;
struct DiskInterface;
struct Edge;
struct Node;
struct Rule;
struct State;
class MissingDependencyScannerDelegate {
public:
virtual ~MissingDependencyScannerDelegate();
virtual void OnMissingDep(Node* node, const std::string& path,
const Rule& generator) = 0;
};
class MissingDependencyPrinter : public MissingDependencyScannerDelegate {
void OnMissingDep(Node* node, const std::string& path, const Rule& generator);
void OnStats(int nodes_processed, int nodes_missing_deps,
int missing_dep_path_count, int generated_nodes,
int generator_rules);
};
struct MissingDependencyScanner {
public:
MissingDependencyScanner(MissingDependencyScannerDelegate* delegate,
DepsLog* deps_log, State* state,
DiskInterface* disk_interface);
void ProcessNode(Node* node);
void PrintStats();
bool HadMissingDeps() { return !nodes_missing_deps_.empty(); }
void ProcessNodeDeps(Node* node, Node** dep_nodes, int dep_nodes_count);
bool PathExistsBetween(Edge* from, Edge* to);
MissingDependencyScannerDelegate* delegate_;
DepsLog* deps_log_;
State* state_;
DiskInterface* disk_interface_;
std::set<Node*> seen_;
std::set<Node*> nodes_missing_deps_;
std::set<Node*> generated_nodes_;
std::set<const Rule*> generator_rules_;
int missing_dep_path_count_;
private:
#if __cplusplus >= 201103L
using InnerAdjacencyMap = std::unordered_map<Edge*, bool>;
using AdjacencyMap = std::unordered_map<Edge*, InnerAdjacencyMap>;
#else
typedef std::map<Edge*, bool> InnerAdjacencyMap;
typedef std::map<Edge*, InnerAdjacencyMap> AdjacencyMap;
#endif
AdjacencyMap adjacency_map_;
};
#endif // NINJA_MISSING_DEPS_H_
|
