Searched refs:validation_nodes (Results 1 – 4 of 4) sorted by relevance
| /third_party/ninja/src/ |
| D | graph.cc | 51 std::vector<Node*>* validation_nodes, in RecomputeDirty() argument
72 assert(validation_nodes && in RecomputeDirty()
74 validation_nodes->insert(validation_nodes->end(), in RecomputeDirty()
84 std::vector<Node*>* validation_nodes, in RecomputeNodeDirty() argument
129 if (!RecomputeNodeDirty(edge->dyndep_, stack, validation_nodes, err)) in RecomputeNodeDirty()
165 validation_nodes->insert(validation_nodes->end(), in RecomputeNodeDirty()
173 if (!RecomputeNodeDirty(*i, stack, validation_nodes, err)) in RecomputeNodeDirty()
|
| D | build.cc | 387 std::vector<Node*> validation_nodes; in RefreshDyndepDependents() local
388 if (!scan->RecomputeDirty(n, &validation_nodes, err)) in RefreshDyndepDependents()
393 for (std::vector<Node*>::iterator v = validation_nodes.begin(); in RefreshDyndepDependents()
394 v != validation_nodes.end(); ++v) { in RefreshDyndepDependents()
569 std::vector<Node*> validation_nodes; in AddTarget() local
570 if (!scan_.RecomputeDirty(target, &validation_nodes, err)) in AddTarget()
582 for (std::vector<Node*>::iterator n = validation_nodes.begin(); in AddTarget()
583 n != validation_nodes.end(); ++n) { in AddTarget()
|
| D | graph.h | 328 bool RecomputeDirty(Node* node, std::vector<Node*>* validation_nodes, std::string* err);
355 std::vector<Node*>* validation_nodes, std::string* err);
|
| D | graph_test.cc | 933 std::vector<Node*> validation_nodes; in TEST_F() local
934 EXPECT_TRUE(scan_.RecomputeDirty(GetNode("out"), &validation_nodes, &err)); in TEST_F()
937 ASSERT_EQ(validation_nodes.size(), 1); in TEST_F()
938 EXPECT_EQ(validation_nodes[0]->path(), "validate"); in TEST_F()
|