| // 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 "graph.h" |
| |
| #include "test.h" |
| |
| struct GraphTest : public StateTestWithBuiltinRules { |
| GraphTest() : scan_(&state_, NULL, &fs_) {} |
| |
| VirtualFileSystem fs_; |
| DependencyScan scan_; |
| }; |
| |
| TEST_F(GraphTest, MissingImplicit) { |
| ASSERT_NO_FATAL_FAILURE(AssertParse(&state_, |
| "build out: cat in | implicit\n")); |
| fs_.Create("in", 1, ""); |
| fs_.Create("out", 1, ""); |
| |
| Edge* edge = GetNode("out")->in_edge(); |
| string err; |
| EXPECT_TRUE(scan_.RecomputeDirty(edge, &err)); |
| ASSERT_EQ("", err); |
| |
| // A missing implicit dep *should* make the output dirty. |
| // (In fact, a build will fail.) |
| // This is a change from prior semantics of ninja. |
| EXPECT_TRUE(GetNode("out")->dirty()); |
| } |
| |
| TEST_F(GraphTest, ModifiedImplicit) { |
| ASSERT_NO_FATAL_FAILURE(AssertParse(&state_, |
| "build out: cat in | implicit\n")); |
| fs_.Create("in", 1, ""); |
| fs_.Create("out", 1, ""); |
| fs_.Create("implicit", 2, ""); |
| |
| Edge* edge = GetNode("out")->in_edge(); |
| string err; |
| EXPECT_TRUE(scan_.RecomputeDirty(edge, &err)); |
| ASSERT_EQ("", err); |
| |
| // A modified implicit dep should make the output dirty. |
| EXPECT_TRUE(GetNode("out")->dirty()); |
| } |
| |
| TEST_F(GraphTest, FunkyMakefilePath) { |
| ASSERT_NO_FATAL_FAILURE(AssertParse(&state_, |
| "rule catdep\n" |
| " depfile = $out.d\n" |
| " command = cat $in > $out\n" |
| "build out.o: catdep foo.cc\n")); |
| fs_.Create("implicit.h", 2, ""); |
| fs_.Create("foo.cc", 1, ""); |
| fs_.Create("out.o.d", 1, "out.o: ./foo/../implicit.h\n"); |
| fs_.Create("out.o", 1, ""); |
| |
| Edge* edge = GetNode("out.o")->in_edge(); |
| string err; |
| EXPECT_TRUE(scan_.RecomputeDirty(edge, &err)); |
| ASSERT_EQ("", err); |
| |
| // implicit.h has changed, though our depfile refers to it with a |
| // non-canonical path; we should still find it. |
| EXPECT_TRUE(GetNode("out.o")->dirty()); |
| } |
| |
| TEST_F(GraphTest, ExplicitImplicit) { |
| ASSERT_NO_FATAL_FAILURE(AssertParse(&state_, |
| "rule catdep\n" |
| " depfile = $out.d\n" |
| " command = cat $in > $out\n" |
| "build implicit.h: cat data\n" |
| "build out.o: catdep foo.cc || implicit.h\n")); |
| fs_.Create("data", 2, ""); |
| fs_.Create("implicit.h", 1, ""); |
| fs_.Create("foo.cc", 1, ""); |
| fs_.Create("out.o.d", 1, "out.o: implicit.h\n"); |
| fs_.Create("out.o", 1, ""); |
| |
| Edge* edge = GetNode("out.o")->in_edge(); |
| string err; |
| EXPECT_TRUE(scan_.RecomputeDirty(edge, &err)); |
| ASSERT_EQ("", err); |
| |
| // We have both an implicit and an explicit dep on implicit.h. |
| // The implicit dep should "win" (in the sense that it should cause |
| // the output to be dirty). |
| EXPECT_TRUE(GetNode("out.o")->dirty()); |
| } |
| |
| TEST_F(GraphTest, PathWithCurrentDirectory) { |
| ASSERT_NO_FATAL_FAILURE(AssertParse(&state_, |
| "rule catdep\n" |
| " depfile = $out.d\n" |
| " command = cat $in > $out\n" |
| "build ./out.o: catdep ./foo.cc\n")); |
| fs_.Create("foo.cc", 1, ""); |
| fs_.Create("out.o.d", 1, "out.o: foo.cc\n"); |
| fs_.Create("out.o", 1, ""); |
| |
| Edge* edge = GetNode("out.o")->in_edge(); |
| string err; |
| EXPECT_TRUE(scan_.RecomputeDirty(edge, &err)); |
| ASSERT_EQ("", err); |
| |
| EXPECT_FALSE(GetNode("out.o")->dirty()); |
| } |
| |
| TEST_F(GraphTest, RootNodes) { |
| ASSERT_NO_FATAL_FAILURE(AssertParse(&state_, |
| "build out1: cat in1\n" |
| "build mid1: cat in1\n" |
| "build out2: cat mid1\n" |
| "build out3 out4: cat mid1\n")); |
| |
| string err; |
| vector<Node*> root_nodes = state_.RootNodes(&err); |
| EXPECT_EQ(4u, root_nodes.size()); |
| for (size_t i = 0; i < root_nodes.size(); ++i) { |
| string name = root_nodes[i]->path(); |
| EXPECT_EQ("out", name.substr(0, 3)); |
| } |
| } |
| |
| TEST_F(GraphTest, VarInOutQuoteSpaces) { |
| ASSERT_NO_FATAL_FAILURE(AssertParse(&state_, |
| "build a$ b: cat nospace with$ space nospace2\n")); |
| |
| Edge* edge = GetNode("a b")->in_edge(); |
| EXPECT_EQ("cat nospace \"with space\" nospace2 > \"a b\"", |
| edge->EvaluateCommand()); |
| } |
| |
| // Regression test for https://github.com/martine/ninja/issues/380 |
| TEST_F(GraphTest, DepfileWithCanonicalizablePath) { |
| ASSERT_NO_FATAL_FAILURE(AssertParse(&state_, |
| "rule catdep\n" |
| " depfile = $out.d\n" |
| " command = cat $in > $out\n" |
| "build ./out.o: catdep ./foo.cc\n")); |
| fs_.Create("foo.cc", 1, ""); |
| fs_.Create("out.o.d", 1, "out.o: bar/../foo.cc\n"); |
| fs_.Create("out.o", 1, ""); |
| |
| Edge* edge = GetNode("out.o")->in_edge(); |
| string err; |
| EXPECT_TRUE(scan_.RecomputeDirty(edge, &err)); |
| ASSERT_EQ("", err); |
| |
| EXPECT_FALSE(GetNode("out.o")->dirty()); |
| } |
| |
| // Regression test for https://github.com/martine/ninja/issues/404 |
| TEST_F(GraphTest, DepfileRemoved) { |
| ASSERT_NO_FATAL_FAILURE(AssertParse(&state_, |
| "rule catdep\n" |
| " depfile = $out.d\n" |
| " command = cat $in > $out\n" |
| "build ./out.o: catdep ./foo.cc\n")); |
| fs_.Create("foo.h", 1, ""); |
| fs_.Create("foo.cc", 1, ""); |
| fs_.Create("out.o.d", 2, "out.o: foo.h\n"); |
| fs_.Create("out.o", 2, ""); |
| |
| Edge* edge = GetNode("out.o")->in_edge(); |
| string err; |
| EXPECT_TRUE(scan_.RecomputeDirty(edge, &err)); |
| ASSERT_EQ("", err); |
| EXPECT_FALSE(GetNode("out.o")->dirty()); |
| |
| state_.Reset(); |
| fs_.RemoveFile("out.o.d"); |
| EXPECT_TRUE(scan_.RecomputeDirty(edge, &err)); |
| ASSERT_EQ("", err); |
| EXPECT_TRUE(GetNode("out.o")->dirty()); |
| } |