Searched refs:most_recent_input (Results 1 – 3 of 3) sorted by relevance
| /third_party/ninja/src/ |
| D | graph.cc | 117 Node* most_recent_input = NULL; in RecomputeDirty() local
137 if (!most_recent_input || (*i)->mtime() > most_recent_input->mtime()) { in RecomputeDirty()
138 most_recent_input = *i; in RecomputeDirty()
147 if (!RecomputeOutputsDirty(edge, most_recent_input, &dirty, err)) in RecomputeDirty()
213 bool DependencyScan::RecomputeOutputsDirty(Edge* edge, Node* most_recent_input, in RecomputeOutputsDirty() argument
218 if (RecomputeOutputDirty(edge, most_recent_input, command, *o)) { in RecomputeOutputsDirty()
227 const Node* most_recent_input, in RecomputeOutputDirty() argument
250 if (most_recent_input && output->mtime() < most_recent_input->mtime()) { in RecomputeOutputDirty()
264 if (output_mtime < most_recent_input->mtime()) { in RecomputeOutputDirty()
268 most_recent_input->path().c_str(), in RecomputeOutputDirty()
[all …]
|
| D | graph.h | 286 bool RecomputeOutputsDirty(Edge* edge, Node* most_recent_input,
313 bool RecomputeOutputDirty(const Edge* edge, const Node* most_recent_input,
|
| D | build.cc | 505 Node* most_recent_input = NULL; in CleanNode() local
507 if (!most_recent_input || (*i)->mtime() > most_recent_input->mtime()) in CleanNode()
508 most_recent_input = *i; in CleanNode()
515 if (!scan->RecomputeOutputsDirty(*oe, most_recent_input, in CleanNode()
|