blob: 9519856e8b219a373dfe033a83f754eeef7c9d79 (
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
|
// Copyright 2011 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.
#include "state.h"
#include <assert.h>
#include "graph.h"
#include "util.h"
const Rule State::kPhonyRule("phony");
State::State() : build_log_(NULL) {
AddRule(&kPhonyRule);
}
void State::AddRule(const Rule* rule) {
assert(LookupRule(rule->name_) == NULL);
rules_[rule->name_] = rule;
}
const Rule* State::LookupRule(const string& rule_name) {
map<string, const Rule*>::iterator i = rules_.find(rule_name);
if (i == rules_.end())
return NULL;
return i->second;
}
Edge* State::AddEdge(const Rule* rule) {
Edge* edge = new Edge();
edge->rule_ = rule;
edge->env_ = &bindings_;
edges_.push_back(edge);
return edge;
}
Node* State::GetNode(const string& path) {
FileStat* file = stat_cache_.GetFile(path);
if (!file->node_)
file->node_ = new Node(file);
return file->node_;
}
Node* State::LookupNode(const string& path) {
FileStat* file = stat_cache_.GetFile(path);
if (!file->node_)
return NULL;
return file->node_;
}
Node* State::SpellcheckNode(const string& path) {
FileStat* file = stat_cache_.SpellcheckFile(path);
if (!file || !file->node_)
return NULL;
return file->node_;
}
void State::AddIn(Edge* edge, const string& path) {
Node* node = GetNode(path);
edge->inputs_.push_back(node);
node->out_edges_.push_back(edge);
}
void State::AddOut(Edge* edge, const string& path) {
Node* node = GetNode(path);
edge->outputs_.push_back(node);
if (node->in_edge_) {
Warning("multiple rules generate %s. "
"build will not be correct; continuing anyway", path.c_str());
}
node->in_edge_ = edge;
}
bool State::AddDefault(const string& path, string* err) {
Node* node = LookupNode(path);
if (!node) {
*err = "unknown target '" + path + "'";
return false;
}
defaults_.push_back(node);
return true;
}
vector<Node*> State::RootNodes(string* err) {
vector<Node*> root_nodes;
// Search for nodes with no output.
for (vector<Edge*>::iterator e = edges_.begin(); e != edges_.end(); ++e) {
for (vector<Node*>::iterator out = (*e)->outputs_.begin();
out != (*e)->outputs_.end(); ++out) {
if ((*out)->out_edges_.empty())
root_nodes.push_back(*out);
}
}
if (!edges_.empty() && root_nodes.empty())
*err = "could not determine root nodes of build graph";
assert(edges_.empty() || !root_nodes.empty());
return root_nodes;
}
vector<Node*> State::DefaultNodes(string* err) {
return defaults_.empty() ? RootNodes(err) : defaults_;
}
void State::Reset() {
stat_cache_.Invalidate();
for (vector<Edge*>::iterator e = edges_.begin(); e != edges_.end(); ++e)
(*e)->outputs_ready_ = false;
}
|
