Home
last modified time | relevance | path

Searched refs:most_recent_input (Results 1 – 3 of 3) sorted by relevance

/third_party/ninja/src/
Dgraph.cc169 Node* most_recent_input = NULL; in RecomputeNodeDirty() local
189 if (!most_recent_input || (*i)->mtime() > most_recent_input->mtime()) { in RecomputeNodeDirty()
190 most_recent_input = *i; in RecomputeNodeDirty()
199 if (!RecomputeOutputsDirty(edge, most_recent_input, &dirty, err)) in RecomputeNodeDirty()
265 bool DependencyScan::RecomputeOutputsDirty(Edge* edge, Node* most_recent_input, in RecomputeOutputsDirty() argument
270 if (RecomputeOutputDirty(edge, most_recent_input, command, *o)) { in RecomputeOutputsDirty()
279 const Node* most_recent_input, in RecomputeOutputDirty() argument
293 if (most_recent_input) { in RecomputeOutputDirty()
294 output->UpdatePhonyMtime(most_recent_input->mtime()); in RecomputeOutputDirty()
310 if (most_recent_input && output->mtime() < most_recent_input->mtime()) { in RecomputeOutputDirty()
[all …]
Dgraph.h332 bool RecomputeOutputsDirty(Edge* edge, Node* most_recent_input,
360 bool RecomputeOutputDirty(const Edge* edge, const Node* most_recent_input,
Dbuild.cc274 Node* most_recent_input = NULL; in CleanNode() local
276 if (!most_recent_input || (*i)->mtime() > most_recent_input->mtime()) in CleanNode()
277 most_recent_input = *i; in CleanNode()
284 if (!scan->RecomputeOutputsDirty(*oe, most_recent_input, in CleanNode()