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
|
// 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.
// This file is all the code that used to be in one file.
// TODO: split into modules, delete this file.
#include "ninja.h"
#include <errno.h>
#include <sys/stat.h>
#include <stdio.h>
#include <string.h>
#include "build_log.h"
#include "graph.h"
#include "util.h"
int ReadFile(const string& path, string* contents, string* err) {
FILE* f = fopen(path.c_str(), "r");
if (!f) {
err->assign(strerror(errno));
return -errno;
}
char buf[64 << 10];
size_t len;
while ((len = fread(buf, 1, sizeof(buf), f)) > 0) {
contents->append(buf, len);
}
if (ferror(f)) {
err->assign(strerror(errno)); // XXX errno?
contents->clear();
fclose(f);
return -errno;
}
fclose(f);
return 0;
}
int RealDiskInterface::Stat(const string& path) {
struct stat st;
if (stat(path.c_str(), &st) < 0) {
if (errno == ENOENT) {
return 0;
} else {
Error("stat(%s): %s", path.c_str(), strerror(errno));
return -1;
}
}
return st.st_mtime;
return true;
}
string DirName(const string& path) {
string::size_type slash_pos = path.rfind('/');
if (slash_pos == string::npos)
return ""; // Nothing to do.
while (slash_pos > 0 && path[slash_pos - 1] == '/')
--slash_pos;
return path.substr(0, slash_pos);
}
bool DiskInterface::MakeDirs(const string& path) {
string dir = DirName(path);
if (dir.empty())
return true; // Reached root; assume it's there.
int mtime = Stat(dir);
if (mtime < 0)
return false; // Error.
if (mtime > 0)
return true; // Exists already; we're done.
// Directory doesn't exist. Try creating its parent first.
bool success = MakeDirs(dir);
if (!success)
return false;
return MakeDir(dir);
}
string RealDiskInterface::ReadFile(const string& path, string* err) {
string contents;
int ret = ::ReadFile(path, &contents, err);
if (ret == -ENOENT) {
// Swallow ENOENT.
err->clear();
}
return contents;
}
bool RealDiskInterface::MakeDir(const string& path) {
if (::MakeDir(path) < 0) {
Error("mkdir(%s): %s", path.c_str(), strerror(errno));
return false;
}
return true;
}
FileStat* StatCache::GetFile(const string& path) {
Paths::iterator i = paths_.find(path);
if (i != paths_.end())
return i->second;
FileStat* file = new FileStat(path);
paths_[path] = file;
return file;
}
void StatCache::Dump() {
for (Paths::iterator i = paths_.begin(); i != paths_.end(); ++i) {
FileStat* file = i->second;
printf("%s %s\n",
file->path_.c_str(),
file->status_known()
? (file->node_->dirty_ ? "dirty" : "clean")
: "unknown");
}
}
const Rule State::kPhonyRule("phony");
State::State() : build_log_(NULL) {
AddRule(&kPhonyRule);
}
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::AddRule(const Rule* rule) {
assert(LookupRule(rule->name_) == NULL);
rules_[rule->name_] = rule;
}
Edge* State::AddEdge(const Rule* rule) {
Edge* edge = new Edge();
edge->rule_ = rule;
edge->env_ = &bindings_;
edges_.push_back(edge);
return edge;
}
Node* State::LookupNode(const string& path) {
FileStat* file = stat_cache_.GetFile(path);
if (!file->node_)
return NULL;
return file->node_;
}
Node* State::GetNode(const string& path) {
FileStat* file = stat_cache_.GetFile(path);
if (!file->node_)
file->node_ = new Node(file);
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_) {
Error("WARNING: multiple rules generate %s. "
"build will not be correct; continuing anyway", path.c_str());
}
node->in_edge_ = edge;
}
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;
}
|
