blob: 330983775b1bd67cb80c4025ab9e5e6a57f3b3c7 (
plain)
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
|
// 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 "stat_cache.h"
#include <stdio.h>
#include "graph.h"
FileStat* StatCache::GetFile(const std::string& path) {
Paths::iterator i = paths_.find(path.c_str());
if (i != paths_.end())
return i->second;
FileStat* file = new FileStat(path);
paths_[file->path_.c_str()] = 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");
}
}
void StatCache::Invalidate() {
for (Paths::iterator i = paths_.begin(); i != paths_.end(); ++i) {
i->second->mtime_ = -1;
i->second->node_->dirty_ = false;
}
}
|
