Home
last modified time | relevance | path

Searched refs:dyndep_ (Results 1 – 8 of 8) sorted by relevance

/third_party/ninja/src/
Dgraphviz.cc44 if (edge->dyndep_ && edge->dyndep_->dyndep_pending()) { in AddTarget()
46 if (!dyndep_loader_.LoadDyndeps(edge->dyndep_, &err)) { in AddTarget()
Dmanifest_parser_test.cc1094 ASSERT_FALSE(edge->dyndep_); in TEST_F()
1117 ASSERT_TRUE(edge->dyndep_); in TEST_F()
1118 EXPECT_TRUE(edge->dyndep_->dyndep_pending()); in TEST_F()
1119 EXPECT_EQ(edge->dyndep_->path(), "in"); in TEST_F()
1129 ASSERT_TRUE(edge->dyndep_); in TEST_F()
1130 EXPECT_TRUE(edge->dyndep_->dyndep_pending()); in TEST_F()
1131 EXPECT_EQ(edge->dyndep_->path(), "dd"); in TEST_F()
1141 ASSERT_TRUE(edge->dyndep_); in TEST_F()
1142 EXPECT_TRUE(edge->dyndep_->dyndep_pending()); in TEST_F()
1143 EXPECT_EQ(edge->dyndep_->path(), "dd"); in TEST_F()
[all …]
Dgraph.cc84 if (edge->dyndep_ && edge->dyndep_->dyndep_pending()) { in RecomputeDirty()
85 if (!RecomputeDirty(edge->dyndep_, stack, err)) in RecomputeDirty()
88 if (!edge->dyndep_->in_edge() || in RecomputeDirty()
89 edge->dyndep_->in_edge()->outputs_ready()) { in RecomputeDirty()
91 if (!LoadDyndeps(edge->dyndep_, err)) in RecomputeDirty()
Dmanifest_parser.cc390 edge->dyndep_ = state_->GetNode(dyndep, slash_bits); in ParseEdge()
391 edge->dyndep_->set_dyndep_pending(true); in ParseEdge()
393 std::find(edge->inputs_.begin(), edge->inputs_.end(), edge->dyndep_); in ParseEdge()
Dgraph.h147 Edge() : rule_(NULL), pool_(NULL), dyndep_(NULL), env_(NULL), in Edge()
177 Node* dyndep_; member
Ddyndep.cc47 if (edge->dyndep_ != node) in LoadDyndeps()
Dclean.cc286 if (Node* dyndep = (*e)->dyndep_) { in LoadDyndeps()
Dninja.cc368 if (edge->dyndep_ && edge->dyndep_->dyndep_pending()) { in ToolQuery()
369 if (!dyndep_loader.LoadDyndeps(edge->dyndep_, &err)) { in ToolQuery()