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
|
// 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 "graph.h"
#include <stdio.h>
#include "build_log.h"
#include "disk_interface.h"
#include "ninja.h"
#include "parsers.h"
#include "util.h"
bool FileStat::Stat(DiskInterface* disk_interface) {
mtime_ = disk_interface->Stat(path_);
return mtime_ > 0;
}
bool Edge::RecomputeDirty(State* state, DiskInterface* disk_interface,
string* err) {
bool dirty = false;
if (!rule_->depfile_.empty()) {
if (!LoadDepFile(state, disk_interface, err))
return false;
}
time_t most_recent_input = 1;
for (vector<Node*>::iterator i = inputs_.begin(); i != inputs_.end(); ++i) {
if ((*i)->file_->StatIfNecessary(disk_interface)) {
if (Edge* edge = (*i)->in_edge_) {
if (!edge->RecomputeDirty(state, disk_interface, err))
return false;
} else {
// This input has no in-edge; it is dirty if it is missing.
(*i)->dirty_ = !(*i)->file_->exists();
}
}
if (is_order_only(i - inputs_.begin())) {
// Order-only deps only make us dirty if they're missing.
if (!(*i)->file_->exists())
dirty = true;
continue;
}
// If a regular input is dirty (or missing), we're dirty.
// Otherwise consider mtime.
if ((*i)->dirty_) {
dirty = true;
} else {
if ((*i)->file_->mtime_ > most_recent_input)
most_recent_input = (*i)->file_->mtime_;
}
}
string command = EvaluateCommand();
assert(!outputs_.empty());
for (vector<Node*>::iterator i = outputs_.begin(); i != outputs_.end(); ++i) {
// We may have other outputs, that our input-recursive traversal hasn't hit
// yet (or never will). Stat them if we haven't already.
(*i)->file_->StatIfNecessary(disk_interface);
// Output is dirty if we're dirty, we're missing the output,
// or if it's older than the most recent input mtime.
if (dirty || !(*i)->file_->exists() ||
(*i)->file_->mtime_ < most_recent_input) {
(*i)->dirty_ = true;
} else {
// May also be dirty due to the command changing since the last build.
BuildLog::LogEntry* entry;
if (state->build_log_ &&
(entry = state->build_log_->LookupByOutput((*i)->file_->path_))) {
if (command != entry->command)
(*i)->dirty_ = true;
}
}
}
return true;
}
/// An Env for an Edge, providing $in and $out.
struct EdgeEnv : public Env {
EdgeEnv(Edge* edge) : edge_(edge) {}
virtual string LookupVariable(const string& var) {
string result;
if (var == "in") {
int explicit_deps = edge_->inputs_.size() - edge_->implicit_deps_ -
edge_->order_only_deps_;
for (vector<Node*>::iterator i = edge_->inputs_.begin();
i != edge_->inputs_.end() && explicit_deps; ++i, --explicit_deps) {
if (!result.empty())
result.push_back(' ');
result.append((*i)->file_->path_);
}
} else if (var == "out") {
for (vector<Node*>::iterator i = edge_->outputs_.begin();
i != edge_->outputs_.end(); ++i) {
if (!result.empty())
result.push_back(' ');
result.append((*i)->file_->path_);
}
} else if (edge_->env_) {
return edge_->env_->LookupVariable(var);
}
return result;
}
Edge* edge_;
};
string Edge::EvaluateCommand() {
EdgeEnv env(this);
return rule_->command_.Evaluate(&env);
}
string Edge::GetDescription() {
EdgeEnv env(this);
return rule_->description_.Evaluate(&env);
}
bool Edge::LoadDepFile(State* state, DiskInterface* disk_interface,
string* err) {
EdgeEnv env(this);
string path = rule_->depfile_.Evaluate(&env);
string content = disk_interface->ReadFile(path, err);
if (!err->empty())
return false;
if (content.empty())
return true;
MakefileParser makefile;
string makefile_err;
if (!makefile.Parse(content, &makefile_err)) {
*err = path + ": " + makefile_err;
return false;
}
// Check that this depfile matches our output.
if (outputs_.size() != 1) {
*err = "expected only one output";
return false;
}
if (outputs_[0]->file_->path_ != makefile.out_) {
*err = "expected makefile to mention '" + outputs_[0]->file_->path_ + "', "
"got '" + makefile.out_ + "'";
return false;
}
// Add all its in-edges.
for (vector<string>::iterator i = makefile.ins_.begin();
i != makefile.ins_.end(); ++i) {
if (!CanonicalizePath(&*i, err))
return false;
Node* node = state->GetNode(*i);
inputs_.insert(inputs_.end() - order_only_deps_, node);
node->out_edges_.push_back(this);
++implicit_deps_;
// If we don't have a edge that generates this input already,
// create one; this makes us not abort if the input is missing,
// but instead will rebuild in that circumstance.
if (!node->in_edge_) {
Edge* phony_edge = state->AddEdge(&State::kPhonyRule);
phony_edge->order_only_deps_ = 1;
node->in_edge_ = phony_edge;
phony_edge->outputs_.push_back(node);
}
}
return true;
}
void Edge::Dump() {
printf("[ ");
for (vector<Node*>::iterator i = inputs_.begin(); i != inputs_.end(); ++i) {
printf("%s ", (*i)->file_->path_.c_str());
}
printf("--%s-> ", rule_->name_.c_str());
for (vector<Node*>::iterator i = outputs_.begin(); i != outputs_.end(); ++i) {
printf("%s ", (*i)->file_->path_.c_str());
}
printf("]\n");
}
bool Edge::is_phony() const {
return rule_ == &State::kPhonyRule;
}
|
