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
|
#include "build_log.h"
#include <errno.h>
#include <stdio.h>
#include <string.h>
#include "build.h"
#include "graph.h"
#include "ninja.h"
// Implementation details:
// Each run's log appends to the log file.
// To load, we run through all log entries in series, throwing away
// older runs.
// Once the number of redundant entries exceeds a threshold, we write
// out a new file and replace the existing one with it.
BuildLog::BuildLog()
: log_file_(NULL), config_(NULL), needs_recompaction_(false) {}
bool BuildLog::OpenForWrite(const string& path, string* err) {
if (config_ && config_->dry_run)
return true; // Do nothing, report success.
if (needs_recompaction_) {
if (!Recompact(path, err))
return false;
}
log_file_ = fopen(path.c_str(), "ab");
if (!log_file_) {
*err = strerror(errno);
return false;
}
setlinebuf(log_file_);
return true;
}
void BuildLog::RecordCommand(Edge* edge, int time_ms) {
if (!log_file_)
return;
const string command = edge->EvaluateCommand();
for (vector<Node*>::iterator out = edge->outputs_.begin();
out != edge->outputs_.end(); ++out) {
const string& path = (*out)->file_->path_;
Log::iterator i = log_.find(path);
LogEntry* log_entry;
if (i != log_.end()) {
log_entry = i->second;
} else {
log_entry = new LogEntry;
log_.insert(make_pair(path, log_entry));
}
log_entry->output = path;
log_entry->command = command;
log_entry->time_ms = time_ms;
WriteEntry(log_file_, *log_entry);
}
}
void BuildLog::Close() {
fclose(log_file_);
log_file_ = NULL;
}
bool BuildLog::Load(const string& path, string* err) {
FILE* file = fopen(path.c_str(), "r");
if (!file) {
if (errno == ENOENT)
return true;
*err = strerror(errno);
return false;
}
int unique_entry_count = 0;
int total_entry_count = 0;
char buf[256 << 10];
while (fgets(buf, sizeof(buf), file)) {
char* start = buf;
char* end = strchr(start, ' ');
if (!end)
continue;
*end = 0;
int time_ms = atoi(start);
start = end + 1;
end = strchr(start, ' ');
string output = string(start, end - start);
LogEntry* entry;
Log::iterator i = log_.find(output);
if (i != log_.end()) {
entry = i->second;
} else {
entry = new LogEntry;
log_.insert(make_pair(output, entry));
++unique_entry_count;
}
++total_entry_count;
entry->time_ms = time_ms;
entry->output = output;
start = end + 1;
end = strchr(start, '\n');
entry->command = string(start, end - start);
}
// Mark the log as "needs rebuiding" if it has kCompactionRatio times
// too many log entries.
int kCompactionRatio = 3;
if (total_entry_count > unique_entry_count * kCompactionRatio)
needs_recompaction_ = true;
return true;
}
BuildLog::LogEntry* BuildLog::LookupByOutput(const string& path) {
Log::iterator i = log_.find(path);
if (i != log_.end())
return i->second;
return NULL;
}
void BuildLog::WriteEntry(FILE* f, const LogEntry& entry) {
fprintf(f, "%d %s %s\n",
entry.time_ms, entry.output.c_str(), entry.command.c_str());
}
bool BuildLog::Recompact(const string& path, string* err) {
printf("Recompacting log...\n");
string temp_path = path + ".recompact";
FILE* f = fopen(temp_path.c_str(), "wb");
if (!f) {
*err = strerror(errno);
return false;
}
for (Log::iterator i = log_.begin(); i != log_.end(); ++i) {
WriteEntry(f, *i->second);
}
fclose(f);
if (rename(temp_path.c_str(), path.c_str()) < 0) {
*err = strerror(errno);
return false;
}
return true;
}
|
