Home
last modified time | relevance | path

Searched refs:inputs_ (Results 1 – 18 of 18) sorted by relevance

/third_party/ninja/src/
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()
66 for (vector<Node*>::iterator in = edge->inputs_.begin(); in AddTarget()
67 in != edge->inputs_.end(); ++in) { in AddTarget()
69 if (edge->is_order_only(in - edge->inputs_.begin())) in AddTarget()
75 for (vector<Node*>::iterator in = edge->inputs_.begin(); in AddTarget()
76 in != edge->inputs_.end(); ++in) { in AddTarget()
Dgraph_test.cc441 EXPECT_EQ(1, edge->inputs_.size()); in TEST_F()
442 EXPECT_EQ("b", edge->inputs_[0]->path()); in TEST_F()
466 EXPECT_EQ(1, edge->inputs_.size()); in TEST_F()
467 EXPECT_EQ("c", edge->inputs_[0]->path()); in TEST_F()
493 EXPECT_EQ(1, edge->inputs_.size()); in TEST_F()
494 EXPECT_EQ("c", edge->inputs_[0]->path()); in TEST_F()
539 ASSERT_EQ(2u, edge->inputs_.size()); in TEST_F()
540 EXPECT_EQ("in", edge->inputs_[0]->path()); in TEST_F()
541 EXPECT_EQ("dd", edge->inputs_[1]->path()); in TEST_F()
569 ASSERT_EQ(3u, edge->inputs_.size()); in TEST_F()
[all …]
Dgraph.cc170 for (vector<Node*>::iterator i = edge->inputs_.begin(); in RecomputeNodeDirty()
171 i != edge->inputs_.end(); ++i) { in RecomputeNodeDirty()
182 if (!edge->is_order_only(i - edge->inputs_.begin())) { in RecomputeNodeDirty()
214 if (dirty && !(edge->is_phony() && edge->inputs_.empty())) in RecomputeNodeDirty()
285 if (edge->inputs_.empty() && !output->exists()) { in RecomputeOutputDirty()
375 for (vector<Node*>::const_iterator i = inputs_.begin(); in AllInputsReady()
376 i != inputs_.end(); ++i) { in AllInputsReady()
404 int explicit_deps_count = edge_->inputs_.size() - edge_->implicit_deps_ - in LookupVariable()
407 return MakePathList(edge_->inputs_.data(), explicit_deps_count, in LookupVariable()
409 return MakePathList(&edge_->inputs_[0], explicit_deps_count, in LookupVariable()
[all …]
Dmanifest_parser.cc363 edge->inputs_.reserve(ins.size()); in ParseEdge()
394 remove(edge->inputs_.begin(), edge->inputs_.end(), out); in ParseEdge()
395 if (new_end != edge->inputs_.end()) { in ParseEdge()
396 edge->inputs_.erase(new_end, edge->inputs_.end()); in ParseEdge()
415 std::find(edge->inputs_.begin(), edge->inputs_.end(), edge->dyndep_); in ParseEdge()
416 if (dgi == edge->inputs_.end()) { in ParseEdge()
Dmissing_deps.cc87 for (std::vector<Node*>::iterator in = edge->inputs_.begin(); in ProcessNode()
88 in != edge->inputs_.end(); ++in) { in ProcessNode()
183 for (size_t i = 0; i < to->inputs_.size(); ++i) { in PathExistsBetween()
184 Edge* e = to->inputs_[i]->in_edge(); in PathExistsBetween()
Dbuild_test.cc69 ASSERT_EQ("in", edge->inputs_[0]->path()); in TEST_F()
79 ASSERT_EQ("mid", edge->inputs_[0]->path()); in TEST_F()
216 ASSERT_EQ("in", edge->inputs_[0]->path()); in TestPoolWithDepthOne()
227 ASSERT_EQ("in", edge->inputs_[0]->path()); in TestPoolWithDepthOne()
297 ASSERT_EQ("in", edge->inputs_[0]->path()); in TEST_F()
305 ASSERT_EQ("in", edge->inputs_[0]->path()); in TEST_F()
316 ASSERT_EQ("in", out3->inputs_[0]->path()); in TEST_F()
384 ASSERT_EQ("foo.cpp", edge->inputs_[0]->path()); in TEST_F()
385 ASSERT_EQ("foo.cpp", edge->inputs_[1]->path()); in TEST_F()
398 ASSERT_EQ("bar.cpp", edge->inputs_[0]->path()); in TEST_F()
[all …]
Dninja.cc402 for (int in = 0; in < (int)edge->inputs_.size(); in++) { in ToolQuery()
408 printf(" %s%s\n", label, edge->inputs_[in]->path().c_str()); in ToolQuery()
474 ToolTargetsList((*n)->in_edge()->inputs_, depth - 1, indent + 1); in ToolTargetsList()
485 for (vector<Node*>::iterator inps = (*e)->inputs_.begin(); in ToolTargetsSourceList()
486 inps != (*e)->inputs_.end(); ++inps) { in ToolTargetsSourceList()
698 for (vector<Node*>::iterator in = edge->inputs_.begin(); in PrintCommands()
699 in != edge->inputs_.end(); ++in) in PrintCommands()
756 for (vector<Node*>::iterator in = edge->inputs_.begin(); in CollectInputs()
757 in != edge->inputs_.end(); ++in) in CollectInputs()
905 PrintJSONString(edge->inputs_[0]->path()); in printCompdb()
[all …]
Dgraph.h203 std::vector<Node*> inputs_; member
231 return index >= inputs_.size() - order_only_deps_ - implicit_deps_ && in is_implicit()
235 return index >= inputs_.size() - order_only_deps_; in is_order_only()
Ddyndep.cc114 edge->inputs_.insert(edge->inputs_.end() - edge->order_only_deps_, in UpdateEdge()
Dbuild.cc136 for (vector<Node*>::iterator i = edge->inputs_.begin(); in AddSubTarget()
137 i != edge->inputs_.end(); ++i) { in AddSubTarget()
265 begin = (*oe)->inputs_.begin(), in CleanNode()
266 end = (*oe)->inputs_.end() - (*oe)->order_only_deps_; in CleanNode()
799 for (vector<Node*>::iterator i = edge->inputs_.begin(); in FinishCommand()
800 i != edge->inputs_.end() - edge->order_only_deps_; ++i) { in FinishCommand()
Dtest.cc119 for (vector<Node*>::const_iterator in_node = (*e)->inputs_.begin(); in VerifyGraph()
120 in_node != (*e)->inputs_.end(); ++in_node) { in VerifyGraph()
Dmanifest_parser_test.cc243 EXPECT_EQ(state.edges_[0]->inputs_[0]->path(), "$one"); in TEST_F()
244 EXPECT_EQ(state.edges_[0]->inputs_[1]->path(), "two$ three"); in TEST_F()
395 ASSERT_TRUE(edge->inputs_.empty()); in TEST_F()
410 ASSERT_EQ(edge->inputs_.size(), 1); in TEST_F()
411 ASSERT_EQ(edge->inputs_[0], node); in TEST_F()
Dclean.cc156 for (vector<Node*>::iterator n = e->inputs_.begin(); n != e->inputs_.end(); in DoCleanTarget()
Dstate.cc131 edge->inputs_.push_back(node); in AddIn()
Ddyndep_parser_test.cc491 EXPECT_EQ(0u, state_.edges_[0]->inputs_.size()); in TEST_F()
/third_party/gn/src/gn/
Dconfig_values.h61 const std::vector<SourceFile>& inputs() const { return inputs_; } in STRING_VALUES_ACCESSOR()
62 std::vector<SourceFile>& inputs() { return inputs_; } in inputs()
93 std::vector<SourceFile> inputs_; variable
Dconfig_values.cc36 VectorAppend(&inputs_, append.inputs_); in AppendValues()
/third_party/mindspore/patches/
D0036-new-dynamic-quant-algorigthm-and-init-packed.patch3561 …Scheduler scheduler(context_, ms_context_, model, &tensors_, &inputs_, &outputs_, is_train_session…