169   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()
324     if (output_mtime < most_recent_input->mtime()) {  in RecomputeOutputDirty()
328               most_recent_input->path().c_str(),  in RecomputeOutputDirty()
329               output_mtime, most_recent_input->mtime());  in RecomputeOutputDirty()
345       if (most_recent_input && entry->mtime < most_recent_input->mtime()) {  in RecomputeOutputDirty()
351                 output->path().c_str(), most_recent_input->path().c_str(),  in RecomputeOutputDirty()
352                 entry->mtime, most_recent_input->mtime());  in RecomputeOutputDirty()