Home
last modified time | relevance | path

Searched refs:outputs_ (Results 1 - 22 of 22) sorted by relevance

/third_party/ninja/src/
H A Dgraph.cc141 for (vector<Node*>::iterator o = edge->outputs_.begin(); in RecomputeNodeDirty()
142 o != edge->outputs_.end(); ++o) { in RecomputeNodeDirty()
202 for (vector<Node*>::iterator o = edge->outputs_.begin(); in RecomputeNodeDirty()
203 o != edge->outputs_.end(); ++o) { in RecomputeNodeDirty()
267 for (vector<Node*>::iterator o = edge->outputs_.begin(); in RecomputeOutputsDirty()
268 o != edge->outputs_.end(); ++o) { in RecomputeOutputsDirty()
407 int explicit_outs_count = edge_->outputs_.size() - edge_->implicit_outs_; in LookupVariable()
408 return MakePathList(&edge_->outputs_[0], explicit_outs_count, ' '); in LookupVariable()
553 for (vector<Node*>::const_iterator i = outputs_.begin(); in Dump()
554 i != outputs_ in Dump()
[all...]
H A Dgraphviz.cc53 if (edge->inputs_.size() == 1 && edge->outputs_.size() == 1) { in AddTarget()
58 edge->inputs_[0], edge->outputs_[0], edge->rule_->name().c_str()); in AddTarget()
62 for (vector<Node*>::iterator out = edge->outputs_.begin(); in AddTarget()
63 out != edge->outputs_.end(); ++out) { in AddTarget()
H A Ddyndep.cc54 *err = ("'" + edge->outputs_[0]->path() + "' " in LoadDyndeps()
73 "'" + edge->outputs_[0]->path() + "' whose build statement " in LoadDyndeps()
91 edge->outputs_.insert(edge->outputs_.end(), in UpdateEdge()
H A Dgraph_test.cc111 EXPECT_EQ(2, edge->outputs_.size()); in TEST_F()
112 EXPECT_EQ("out", edge->outputs_[0]->path()); in TEST_F()
113 EXPECT_EQ("out.imp", edge->outputs_[1]->path()); in TEST_F()
153 EXPECT_EQ(1, edge->outputs_.size()); in TEST_F()
154 EXPECT_EQ("out.imp", edge->outputs_[0]->path()); in TEST_F()
537 ASSERT_EQ(1u, edge->outputs_.size()); in TEST_F()
538 EXPECT_EQ("out", edge->outputs_[0]->path()); in TEST_F()
567 ASSERT_EQ(1u, edge->outputs_.size()); in TEST_F()
568 EXPECT_EQ("out1", edge->outputs_[0]->path()); in TEST_F()
700 ASSERT_EQ(2u, edge1->outputs_ in TEST_F()
[all...]
H A Dbuild.cc213 for (vector<Node*>::iterator o = edge->outputs_.begin(); in EdgeFinished()
214 o != edge->outputs_.end(); ++o) { in EdgeFinished()
300 for (vector<Node*>::iterator o = (*oe)->outputs_.begin(); in CleanNode()
301 o != (*oe)->outputs_.end(); ++o) { in CleanNode()
358 if (!AddSubTarget(*i, oe->first->outputs_[0], err, &dyndep_walk) && in DyndepsLoaded()
445 for (vector<Node*>::iterator o = edge->outputs_.begin(); in UnmarkDependents()
446 o != edge->outputs_.end(); ++o) { in UnmarkDependents()
567 for (vector<Node*>::iterator o = (*e)->outputs_.begin(); in Cleanup()
568 o != (*e)->outputs_.end(); ++o) { in Cleanup()
838 for (vector<Node*>::iterator o = edge->outputs_ in StartEdge()
[all...]
H A Dclean.cc116 for (vector<Node*>::iterator out_node = (*e)->outputs_.begin(); in CleanAll()
117 out_node != (*e)->outputs_.end(); ++out_node) { in CleanAll()
229 for (vector<Node*>::iterator out_node = (*e)->outputs_.begin(); in DoCleanRule()
230 out_node != (*e)->outputs_.end(); ++out_node) { in DoCleanRule()
H A Dninja.cc298 for (Node* out : edge->outputs_) { in ParsePreviousElapsedTimes()
337 if (edge->outputs_.empty()) { in CollectTarget()
341 node = edge->outputs_[0]; in CollectTarget()
438 for (vector<Node*>::iterator out = (*edge)->outputs_.begin(); in ToolQuery()
439 out != (*edge)->outputs_.end(); ++out) { in ToolQuery()
448 for (vector<Node*>::iterator out = (*edge)->outputs_.begin(); in ToolQuery()
449 out != (*edge)->outputs_.end(); ++out) { in ToolQuery()
518 for (vector<Node*>::iterator out_node = (*e)->outputs_.begin(); in ToolTargetsList()
519 out_node != (*e)->outputs_.end(); ++out_node) { in ToolTargetsList()
537 for (vector<Node*>::iterator out_node = (*e)->outputs_ in ToolTargetsList()
[all...]
H A Dtest.cc117 EXPECT_FALSE((*e)->outputs_.empty()); in VerifyGraph()
126 for (vector<Node*>::const_iterator out_node = (*e)->outputs_.begin(); in VerifyGraph()
127 out_node != (*e)->outputs_.end(); ++out_node) { in VerifyGraph()
H A Dstate.cc141 edge->outputs_.push_back(node); in AddOut()
169 for (vector<Node*>::const_iterator out = (*e)->outputs_.begin(); in RootNodes()
170 out != (*e)->outputs_.end(); ++out) { in RootNodes()
H A Dbuild_test.cc31 return a->outputs_[0]->path() < b->outputs_[0]->path(); in cmp()
73 ASSERT_EQ("mid", edge->outputs_[0]->path()); in TEST_F()
83 ASSERT_EQ("out", edge->outputs_[0]->path()); in TEST_F()
219 ASSERT_EQ("out1", edge->outputs_[0]->path()); in TestPoolWithDepthOne()
230 ASSERT_EQ("out2", edge->outputs_[0]->path()); in TestPoolWithDepthOne()
300 ASSERT_EQ(base_name + string(1, '1' + (i % 2)), edge->outputs_[0]->path()); in TEST_F()
307 ASSERT_EQ("outb3", edge->outputs_[0]->path()); in TEST_F()
318 ASSERT_EQ("out3", out3->outputs_[0]->path()); in TEST_F()
334 ASSERT_EQ("allTheThings", last->outputs_[ in TEST_F()
[all...]
H A Dmanifest_parser_test.cc242 EXPECT_EQ(state.edges_[0]->outputs_[0]->path(), "foo bar"); in TEST_F()
985 ASSERT_EQ(edge->outputs_.size(), 2); in TEST_F()
996 ASSERT_EQ(edge->outputs_.size(), 1); in TEST_F()
1007 ASSERT_EQ(edge->outputs_.size(), 3); in TEST_F()
1020 ASSERT_EQ(edge->outputs_.size(), 1); in TEST_F()
H A Dmanifest_parser.cc332 edge->outputs_.reserve(outs.size()); in ParseEdge()
356 if (edge->outputs_.empty()) { in ParseEdge()
394 Node* out = edge->outputs_[0]; in ParseEdge()
H A Dgraph.h213 std::vector<Node*> outputs_; member
251 // These are stored in outputs_ in that order, and we keep a count of
255 return index >= outputs_.size() - implicit_outs_; in is_implicit_out()
H A Dstatus.cc202 for (vector<Node*>::const_iterator o = edge->outputs_.begin();
203 o != edge->outputs_.end(); ++o)
H A Ddyndep_parser_test.cc489 ASSERT_EQ(1u, state_.edges_[1]->outputs_.size()); in TEST_F()
490 EXPECT_EQ("out2", state_.edges_[1]->outputs_[0]->path()); in TEST_F()
H A Dbuild_log.cc148 for (vector<Node*>::iterator out = edge->outputs_.begin(); in RecordCommand()
149 out != edge->outputs_.end(); ++out) { in RecordCommand()
/third_party/gn/src/gn/
H A Daction_values.h35 SubstitutionList& outputs() { return outputs_; } in outputs()
36 const SubstitutionList& outputs() const { return outputs_; } in outputs()
61 SubstitutionList outputs_; member in ActionValues
H A Daction_values.cc24 SubstitutionWriter::ApplyListToSources(target, target->settings(), outputs_, in GetOutputsAsSourceFiles()
29 SubstitutionWriter::GetListAsSourceFiles(outputs_, result); in GetOutputsAsSourceFiles()
H A Dtool.h172 const SubstitutionList& outputs() const { return outputs_; } in outputs()
175 outputs_ = std::move(out); in set_outputs()
289 SubstitutionList outputs_; member in Tool
H A Drust_tool.cc112 if (!ReadOutputsPatternList(scope, "outputs", &outputs_, err)) { in InitTool()
H A Dc_tool.cc190 if (!ReadOutputsPatternList(scope, "outputs", /*required=*/true, &outputs_, in InitTool()
H A Dtool.cc27 outputs_.FillRequiredTypes(&substitution_bits_); in SetToolComplete()

Completed in 16 milliseconds