Home
last modified time | relevance | path

Searched refs:input_edges (Results 1 – 10 of 10) sorted by relevance

/external/v8/src/compiler/
Dcontrol-equivalence.cc102 if (entry.input != node->input_edges().end()) { in RunUndirectedDFS()
153 if (entry.input != node->input_edges().end()) { in RunUndirectedDFS()
162 DCHECK(entry.input == node->input_edges().end()); in RunUndirectedDFS()
197 Node::InputEdges::iterator input = node->input_edges().begin(); in DFSPush()
Dnode.h113 inline InputEdges input_edges();
410 Node::InputEdges Node::input_edges() { in input_edges() function
Dscheduler.cc142 for (Edge const edge : node->input_edges()) { in UpdatePlacement()
1202 stack.push(node->input_edges().begin()); in PrepareUses()
1208 if (++stack.top() == edge.from()->input_edges().end()) stack.pop(); in PrepareUses()
1212 if (node->InputCount() > 0) stack.push(node->input_edges().begin()); in PrepareUses()
Descape-analysis.cc657 for (Edge edge : node->input_edges()) { in RevisitInputs()
726 for (Edge edge : node->input_edges()) { in IsAllocationPhi()
974 for (Edge edge : node->input_edges()) { in AssignAliases()
1148 for (Edge edge : node->input_edges()) { in ProcessAllocationUsers()
Dnode.cc401 for (Edge edge : this->input_edges()) { in Verify()
/external/tensorflow/tensorflow/core/graph/
Dgraph.cc222 Status Node::input_edges(std::vector<const Edge*>* input_edges) const { in input_edges() function in tensorflow::Node
223 input_edges->clear(); in input_edges()
224 input_edges->resize(num_inputs(), nullptr); in input_edges()
231 if ((*input_edges)[edge->dst_input()] != nullptr) { in input_edges()
235 (*input_edges)[edge->dst_input()] = edge; in input_edges()
239 if ((*input_edges)[i] == nullptr) { in input_edges()
Dgraph_test.cc249 TF_ASSERT_OK(t->input_edges(&t_input_edges)); in TEST_F()
285 TF_ASSERT_OK(c->input_edges(&c_input_edges)); in TEST_F()
586 EXPECT_EQ(error::INVALID_ARGUMENT, b->input_edges(&edges).code()); in TEST_F()
588 TF_EXPECT_OK(b->input_edges(&edges)); in TEST_F()
Dmkl_tfconversion_pass.cc210 TF_CHECK_OK(n->input_edges(&edges)); in InsertInputConversionNode()
Dgraph.h179 Status input_edges(std::vector<const Edge*>* edges) const;
Dquantize_training.cc150 TF_RETURN_IF_ERROR(node->input_edges(in_edges)); in FindSaveOp()