Home
last modified time | relevance | path

Searched refs:sink_node (Results 1 – 20 of 20) sorted by relevance

/external/tensorflow/tensorflow/core/graph/
Dquantize_training_test.cc95 g->AddControlEdge(m1, g->sink_node()); in TEST_F()
146 g->AddControlEdge(m1, g->sink_node()); in TEST_F()
196 g->AddControlEdge(m1, g->sink_node()); in TEST_F()
197 g->AddControlEdge(m2, g->sink_node()); in TEST_F()
208 g->AddControlEdge(backward_m, g->sink_node()); in TEST_F()
250 g->AddControlEdge(m1, g->sink_node()); in TEST_F()
251 g->AddControlEdge(m2, g->sink_node()); in TEST_F()
262 g->AddControlEdge(backward_m, g->sink_node()); in TEST_F()
297 graph->AddControlEdge(matmul, graph->sink_node()); in TEST_F()
334 graph->AddControlEdge(matmul, graph->sink_node()); in TEST_F()
[all …]
Dgraph_test.cc159 Node* sink = graph_.sink_node(); in TEST_F()
189 graph_.AddControlEdge(a, graph_.sink_node()); in TEST_F()
191 graph_.AddControlEdge(c, graph_.sink_node()); in TEST_F()
194 VerifyNodes(a, {graph_.source_node()}, {c, graph_.sink_node()}); in TEST_F()
197 VerifyNodes(c, {a}, {graph_.sink_node()}); in TEST_F()
202 VerifyNodes(graph_.source_node(), {}, {a, graph_.sink_node()}); in TEST_F()
203 VerifyNodes(graph_.sink_node(), {a, c, graph_.source_node()}, {}); in TEST_F()
206 VerifyNodes(a, {}, {c, graph_.sink_node()}); in TEST_F()
207 VerifyNodes(graph_.source_node(), {}, {graph_.sink_node()}); // no more a in TEST_F()
210 VerifyNodes(a, {}, {graph_.sink_node()}); // no more c in TEST_F()
[all …]
Dalgorithm.cc116 ReverseDFSFrom(g, {g.sink_node()}, enter, leave, stable_comparator); in ReverseDFS()
256 g->AddControlEdge(n, g->sink_node(), true /* skip test for duplicates */); in FixupSourceAndSinkEdges()
Dalgorithm_test.cc178 g.sink_node(), g.FindNodeId(n3->id()), g.FindNodeId(n2->id()), in TEST()
Dsubgraph.cc169 g->AddControlEdge(fetch_node, g->sink_node(), true); in FetchOutputs()
Dgraph.h631 Node* sink_node() const { return FindNodeId(kSinkId); } in sink_node() function
Dgraph_constructor.cc1571 node_map[src.sink_node()] = dest->sink_node(); in CopyGraph()
Dgraph.cc497 if (source == source_node() || dest == sink_node() || x == kControlSlot || in AddEdge()
/external/tensorflow/tensorflow/core/grappler/optimizers/data/
Dgraph_utils_test.cc340 NodeDef* sink_node; in TEST() local
341 TF_EXPECT_OK(GetFetchNode(graph, item, &sink_node)); in TEST()
342 EXPECT_EQ(sink_node->name(), node3->name()); in TEST()
355 NodeDef* sink_node; in TEST() local
356 Status s = GetFetchNode(graph, item, &sink_node); in TEST()
368 NodeDef* sink_node; in TEST() local
369 Status s = GetFetchNode(graph, item, &sink_node); in TEST()
Dauto_shard.cc402 NodeDef* sink_node; in OptimizeGraph() local
403 TF_RETURN_IF_ERROR(graph_utils::GetFetchNode(graph, item, &sink_node)); in OptimizeGraph()
416 TF_RETURN_IF_ERROR(RecursivelyHandleOp(*sink_node, num_workers, index, in OptimizeGraph()
422 return AddShardNode(&graph, *sink_node, num_workers, index); in OptimizeGraph()
427 Status s = RecursivelyHandleOp(*sink_node, num_workers, index, &flib, in OptimizeGraph()
435 AddShardNode(&graph, *sink_node, num_workers, index)); in OptimizeGraph()
/external/tensorflow/tensorflow/compiler/jit/
Dbuild_xla_ops_pass_test.cc265 Node* sink_node = graph->sink_node(); in TEST_F() local
266 EXPECT_THAT(sink_node, NodeWith(CtrlDeps(NodeWith(Op("_XlaRun")), in TEST_F()
Dextract_outside_compilation_pass.cc997 node_map[host_fbody->graph->sink_node()] = (*host_graph)->sink_node(); in ConstructHostGraph()
1060 (*host_graph)->AddControlEdge(sequencer, (*host_graph)->sink_node()); in ConstructHostGraph()
1064 std::unordered_set<const Node*>{(*host_graph)->sink_node()}); in ConstructHostGraph()
1116 node_map[host_graph->sink_node()] = main_graph->sink_node(); in ExpandHostGraphIntoMainGraph()
2225 (*graph)->AddControlEdge(send_from_host_node, (*graph)->sink_node()); in operator ()()
2228 graph->get(), std::unordered_set<const Node*>{(*graph)->sink_node()}); in operator ()()
Dencapsulate_util.cc393 for (const Edge* e : g->sink_node()->in_edges()) { in PreprocessEdgesBetweenOutsideCompilations()
Dencapsulate_subgraphs_pass.cc838 (*node_images)[graph_in_->sink_node()] = graph_out->sink_node(); in CopyNodesToOutputGraph()
Dbuild_xla_ops_pass.cc192 s.graph()->AddControlEdge(new_node, s.graph()->sink_node()); in MergeOutgoingControlEdges()
/external/tensorflow/tensorflow/core/distributed_runtime/
Dscheduler.cc116 return (*asap_times)[graph_->sink_node()->id()]; in ComputeAsap()
141 Node* sinkNode = graph_->sink_node(); in ComputeAlap()
/external/tensorflow/tensorflow/compiler/tf2tensorrt/segment/
Dsegment.cc130 const SimpleNode* sink_node() const { return nodes_[Graph::kSinkId]; } in sink_node() function in tensorflow::tensorrt::segment::SimpleGraph
152 nodes_[g->kSinkId] = new SimpleNode(g->sink_node(), g->kSinkId); in SimpleGraph()
383 if (e->dst() == graph->sink_node()) { in ContractEdge()
/external/tensorflow/tensorflow/core/common_runtime/
Dconstant_folding.cc427 node_map[orig_graph->sink_node()] = {constant_graph->sink_node()}; in GetConstantGraph()
Dfunction.cc2412 node_map[src.sink_node()->id()] = dst->sink_node(); in Copy()
/external/tensorflow/tensorflow/compiler/tf2xla/
Dfunctionalize_control_flow_test.cc248 graph.AddControlEdge(n, graph.sink_node()); in TEST()