Lines Matching +full:log +full:-
7 // http://www.apache.org/licenses/LICENSE-2.0
30 const char kTestFilename[] = "DepsLogTest-tempfile";
62 ASSERT_EQ(1, log_deps->mtime); in TEST_F()
63 ASSERT_EQ(2, log_deps->node_count); in TEST_F()
64 ASSERT_EQ("foo.h", log_deps->nodes[0]->path()); in TEST_F()
65 ASSERT_EQ("bar.h", log_deps->nodes[1]->path()); in TEST_F()
79 ASSERT_EQ(i, node1->id()); in TEST_F()
80 ASSERT_EQ(node1->id(), node2->id()); in TEST_F()
83 // Spot-check the entries in log2. in TEST_F()
86 ASSERT_EQ(2, log_deps->mtime); in TEST_F()
87 ASSERT_EQ(2, log_deps->node_count); in TEST_F()
88 ASSERT_EQ("foo.h", log_deps->nodes[0]->path()); in TEST_F()
89 ASSERT_EQ("bar2.h", log_deps->nodes[1]->path()); in TEST_F()
111 ASSERT_EQ(kNumDeps, log_deps->node_count); in TEST_F()
122 ASSERT_EQ(kNumDeps, log_deps->node_count); in TEST_F()
131 DepsLog log; in TEST_F() local
133 EXPECT_TRUE(log.OpenForWrite(kTestFilename, &err)); in TEST_F()
139 log.RecordDeps(state.GetNode("out.o", 0), 1, deps); in TEST_F()
140 log.Close(); in TEST_F()
155 DepsLog log; in TEST_F() local
157 EXPECT_TRUE(log.Load(kTestFilename, &state, &err)); in TEST_F()
159 EXPECT_TRUE(log.OpenForWrite(kTestFilename, &err)); in TEST_F()
165 log.RecordDeps(state.GetNode("out.o", 0), 1, deps); in TEST_F()
166 log.Close(); in TEST_F()
193 DepsLog log; in TEST_F() local
195 ASSERT_TRUE(log.OpenForWrite(kTestFilename, &err)); in TEST_F()
201 log.RecordDeps(state.GetNode("out.o", 0), 1, deps); in TEST_F()
206 log.RecordDeps(state.GetNode("other_out.o", 0), 1, deps); in TEST_F()
208 log.Close(); in TEST_F()
225 DepsLog log; in TEST_F() local
227 ASSERT_TRUE(log.Load(kTestFilename, &state, &err)); in TEST_F()
229 ASSERT_TRUE(log.OpenForWrite(kTestFilename, &err)); in TEST_F()
234 log.RecordDeps(state.GetNode("out.o", 0), 1, deps); in TEST_F()
235 log.Close(); in TEST_F()
255 DepsLog log; in TEST_F() local
257 ASSERT_TRUE(log.Load(kTestFilename, &state, &err)); in TEST_F()
260 DepsLog::Deps* deps = log.GetDeps(out); in TEST_F()
262 ASSERT_EQ(1, deps->mtime); in TEST_F()
263 ASSERT_EQ(1, deps->node_count); in TEST_F()
264 ASSERT_EQ("foo.h", deps->nodes[0]->path()); in TEST_F()
267 deps = log.GetDeps(other_out); in TEST_F()
269 ASSERT_EQ(1, deps->mtime); in TEST_F()
270 ASSERT_EQ(2, deps->node_count); in TEST_F()
271 ASSERT_EQ("foo.h", deps->nodes[0]->path()); in TEST_F()
272 ASSERT_EQ("baz.h", deps->nodes[1]->path()); in TEST_F()
274 ASSERT_TRUE(log.Recompact(kTestFilename, &err)); in TEST_F()
276 // The in-memory deps graph should still be valid after recompaction. in TEST_F()
277 deps = log.GetDeps(out); in TEST_F()
279 ASSERT_EQ(1, deps->mtime); in TEST_F()
280 ASSERT_EQ(1, deps->node_count); in TEST_F()
281 ASSERT_EQ("foo.h", deps->nodes[0]->path()); in TEST_F()
282 ASSERT_EQ(out, log.nodes()[out->id()]); in TEST_F()
284 deps = log.GetDeps(other_out); in TEST_F()
286 ASSERT_EQ(1, deps->mtime); in TEST_F()
287 ASSERT_EQ(2, deps->node_count); in TEST_F()
288 ASSERT_EQ("foo.h", deps->nodes[0]->path()); in TEST_F()
289 ASSERT_EQ("baz.h", deps->nodes[1]->path()); in TEST_F()
290 ASSERT_EQ(other_out, log.nodes()[other_out->id()]); in TEST_F()
309 DepsLog log; in TEST_F() local
311 ASSERT_TRUE(log.Load(kTestFilename, &state, &err)); in TEST_F()
314 DepsLog::Deps* deps = log.GetDeps(out); in TEST_F()
316 ASSERT_EQ(1, deps->mtime); in TEST_F()
317 ASSERT_EQ(1, deps->node_count); in TEST_F()
318 ASSERT_EQ("foo.h", deps->nodes[0]->path()); in TEST_F()
321 deps = log.GetDeps(other_out); in TEST_F()
323 ASSERT_EQ(1, deps->mtime); in TEST_F()
324 ASSERT_EQ(2, deps->node_count); in TEST_F()
325 ASSERT_EQ("foo.h", deps->nodes[0]->path()); in TEST_F()
326 ASSERT_EQ("baz.h", deps->nodes[1]->path()); in TEST_F()
328 ASSERT_TRUE(log.Recompact(kTestFilename, &err)); in TEST_F()
331 deps = log.GetDeps(out); in TEST_F()
334 deps = log.GetDeps(other_out); in TEST_F()
338 ASSERT_EQ(-1, state.LookupNode("foo.h")->id()); in TEST_F()
339 ASSERT_EQ(-1, state.LookupNode("baz.h")->id()); in TEST_F()
373 DepsLog log; in TEST_F() local
375 ASSERT_TRUE(log.Load(kTestFilename, &state, &err)); in TEST_F()
376 EXPECT_EQ("bad deps log signature or version; starting over", err); in TEST_F()
380 // Simulate what happens when loading a truncated log file.
385 DepsLog log; in TEST_F() local
387 EXPECT_TRUE(log.OpenForWrite(kTestFilename, &err)); in TEST_F()
393 log.RecordDeps(state.GetNode("out.o", 0), 1, deps); in TEST_F()
398 log.RecordDeps(state.GetNode("out2.o", 0), 2, deps); in TEST_F()
400 log.Close(); in TEST_F()
417 for (int size = (int)st.st_size; size > 0; --size) { in TEST_F()
422 DepsLog log; in TEST_F() local
423 EXPECT_TRUE(log.Load(kTestFilename, &state, &err)); in TEST_F()
425 // At some point the log will be so short as to be unparsable. in TEST_F()
429 ASSERT_GE(node_count, (int)log.nodes().size()); in TEST_F()
430 node_count = log.nodes().size(); in TEST_F()
432 // Count how many non-NULL deps entries there are. in TEST_F()
434 for (vector<DepsLog::Deps*>::const_iterator i = log.deps().begin(); in TEST_F()
435 i != log.deps().end(); ++i) { in TEST_F()
444 // Run the truncation-recovery logic.
449 DepsLog log; in TEST_F() local
451 EXPECT_TRUE(log.OpenForWrite(kTestFilename, &err)); in TEST_F()
457 log.RecordDeps(state.GetNode("out.o", 0), 1, deps); in TEST_F()
462 log.RecordDeps(state.GetNode("out2.o", 0), 2, deps); in TEST_F()
464 log.Close(); in TEST_F()
477 ASSERT_TRUE(Truncate(kTestFilename, st.st_size - 2, &err)); in TEST_F()
483 DepsLog log; in TEST_F() local
485 EXPECT_TRUE(log.Load(kTestFilename, &state, &err)); in TEST_F()
490 EXPECT_EQ(NULL, log.GetDeps(state.GetNode("out2.o", 0))); in TEST_F()
492 EXPECT_TRUE(log.OpenForWrite(kTestFilename, &err)); in TEST_F()
499 log.RecordDeps(state.GetNode("out2.o", 0), 3, deps); in TEST_F()
501 log.Close(); in TEST_F()
508 DepsLog log; in TEST_F() local
510 EXPECT_TRUE(log.Load(kTestFilename, &state, &err)); in TEST_F()
513 DepsLog::Deps* deps = log.GetDeps(state.GetNode("out2.o", 0)); in TEST_F()
520 DepsLog log; in TEST_F() local
522 EXPECT_TRUE(log.OpenForWrite(kTestFilename, &err)); in TEST_F()
528 log.RecordDeps(state.GetNode("out.o", 0), 1, deps); in TEST_F()
533 log.RecordDeps(state.GetNode("out2.o", 0), 2, deps); in TEST_F()
535 log.Close(); in TEST_F()
537 Node* rev_deps = log.GetFirstReverseDepsNode(state.GetNode("foo.h", 0)); in TEST_F()
541 rev_deps = log.GetFirstReverseDepsNode(state.GetNode("bar.h", 0)); in TEST_F()