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
|
// 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 <stdio.h>
#include "edit_distance.h"
#include "graph.h"
#include "metrics.h"
#include "util.h"
void Pool::EdgeScheduled(const Edge& edge) {
if (depth_ != 0)
current_use_ += edge.weight();
}
void Pool::EdgeFinished(const Edge& edge) {
if (depth_ != 0)
current_use_ -= edge.weight();
}
void Pool::DelayEdge(Edge* edge) {
assert(depth_ != 0);
delayed_.insert(edge);
}
void Pool::RetrieveReadyEdges(set<Edge*>* ready_queue) {
DelayedEdges::iterator it = delayed_.begin();
while (it != delayed_.end()) {
Edge* edge = *it;
if (current_use_ + edge->weight() > depth_)
break;
ready_queue->insert(edge);
EdgeScheduled(*edge);
++it;
}
delayed_.erase(delayed_.begin(), it);
}
void Pool::Dump() const {
printf("%s (%d/%d) ->\n", name_.c_str(), current_use_, depth_);
for (DelayedEdges::const_iterator it = delayed_.begin();
it != delayed_.end(); ++it)
{
printf("\t");
(*it)->Dump();
}
}
bool Pool::WeightedEdgeCmp(const Edge* a, const Edge* b) {
if (!a) return b;
if (!b) return false;
int weight_diff = a->weight() - b->weight();
return ((weight_diff < 0) || (weight_diff == 0 && a < b));
}
Pool State::kDefaultPool("", 0);
const Rule State::kPhonyRule("phony");
State::State() {
AddRule(&kPhonyRule);
AddPool(&kDefaultPool);
}
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;
}
void State::AddPool(Pool* pool) {
assert(LookupPool(pool->name()) == NULL);
pools_[pool->name()] = pool;
}
Pool* State::LookupPool(const string& pool_name) {
map<string, Pool*>::iterator i = pools_.find(pool_name);
if (i == pools_.end())
return NULL;
return i->second;
}
Edge* State::AddEdge(const Rule* rule) {
Edge* edge = new Edge();
edge->rule_ = rule;
edge->pool_ = &State::kDefaultPool;
edge->env_ = &bindings_;
edges_.push_back(edge);
return edge;
}
Node* State::GetNode(StringPiece path) {
Node* node = LookupNode(path);
if (node)
return node;
node = new Node(path.AsString());
paths_[node->path()] = node;
return node;
}
Node* State::LookupNode(StringPiece path) {
METRIC_RECORD("lookup node");
Paths::iterator i = paths_.find(path);
if (i != paths_.end())
return i->second;
return NULL;
}
Node* State::SpellcheckNode(const string& path) {
const bool kAllowReplacements = true;
const int kMaxValidEditDistance = 3;
int min_distance = kMaxValidEditDistance + 1;
Node* result = NULL;
for (Paths::iterator i = paths_.begin(); i != paths_.end(); ++i) {
int distance = EditDistance(
i->first, path, kAllowReplacements, kMaxValidEditDistance);
if (distance < min_distance && i->second) {
min_distance = distance;
result = i->second;
}
}
return result;
}
void State::AddIn(Edge* edge, StringPiece path) {
Node* node = GetNode(path);
edge->inputs_.push_back(node);
node->AddOutEdge(edge);
}
void State::AddOut(Edge* edge, StringPiece path) {
Node* node = GetNode(path);
edge->outputs_.push_back(node);
if (node->in_edge()) {
Warning("multiple rules generate %s. "
"builds involving this target will not be correct; "
"continuing anyway",
path.AsString().c_str());
}
node->set_in_edge(edge);
}
bool State::AddDefault(StringPiece path, string* err) {
Node* node = LookupNode(path);
if (!node) {
*err = "unknown target '" + path.AsString() + "'";
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() {
for (Paths::iterator i = paths_.begin(); i != paths_.end(); ++i)
i->second->ResetState();
for (vector<Edge*>::iterator e = edges_.begin(); e != edges_.end(); ++e)
(*e)->outputs_ready_ = false;
}
void State::Dump() {
for (Paths::iterator i = paths_.begin(); i != paths_.end(); ++i) {
Node* node = i->second;
printf("%s %s [id:%d]\n",
node->path().c_str(),
node->status_known() ? (node->dirty() ? "dirty" : "clean")
: "unknown",
node->id());
}
if (!pools_.empty()) {
printf("resource_pools:\n");
for (map<string, Pool*>::const_iterator it = pools_.begin();
it != pools_.end(); ++it)
{
if (!it->second->name().empty()) {
it->second->Dump();
}
}
}
}
|
