| /external/tensorflow/tensorflow/core/graph/ |
| D | graph_test.cc | 159 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 …]
|
| D | quantize_training_test.cc | 95 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 …]
|
| D | algorithm.cc | 116 ReverseDFSFrom(g, {g.sink_node()}, enter, leave, stable_comparator); in ReverseDFS()
259 g->AddControlEdge(n, g->sink_node(), true /* skip test for duplicates */); in FixupSourceAndSinkEdges()
|
| D | algorithm_test.cc | 175 g.sink_node(), g.FindNodeId(n3->id()), g.FindNodeId(n2->id()), in TEST()
|
| D | subgraph.cc | 169 g->AddControlEdge(fetch_node, g->sink_node(), true); in FetchOutputs()
|
| D | graph_constructor.cc | 1315 node_map[src.sink_node()] = dest->sink_node(); in CopyGraph()
|
| D | graph.h | 605 Node* sink_node() const { return FindNodeId(kSinkId); } in sink_node() function
|
| D | graph.cc | 465 if (source == source_node() || dest == sink_node() || x == kControlSlot || in AddEdge()
|
| /external/tensorflow/tensorflow/core/grappler/optimizers/data/ |
| D | graph_utils_test.cc | 281 NodeDef sink_node; in TEST() local
282 TF_EXPECT_OK(FindSinkNode(graph_def, &sink_node)); in TEST()
283 EXPECT_EQ(sink_node.name(), node3->name()); in TEST()
293 NodeDef sink_node; in TEST() local
294 Status s = FindSinkNode(graph_def, &sink_node); in TEST()
302 NodeDef sink_node; in TEST() local
303 Status s = FindSinkNode(graph_def, &sink_node); in TEST()
|
| D | rebatch.cc | 251 NodeDef sink_node; in OptimizeGraph() local
252 TF_RETURN_IF_ERROR(graph_utils::FindSinkNode(item.graph, &sink_node)); in OptimizeGraph()
254 RecursivelyHandleOp(sink_node, num_workers, &flib, &graph)); in OptimizeGraph()
|
| D | auto_shard.cc | 243 NodeDef sink_node; in OptimizeGraph() local
244 TF_RETURN_IF_ERROR(graph_utils::FindSinkNode(item.graph, &sink_node)); in OptimizeGraph()
245 TF_RETURN_IF_ERROR(RecursivelyHandleOp(sink_node, num_workers, index, &flib, in OptimizeGraph()
|
| D | graph_utils.h | 148 Status FindSinkNode(const GraphDef& graph_def, NodeDef* sink_node);
|
| D | graph_utils.cc | 310 Status FindSinkNode(const GraphDef& graph_def, NodeDef* sink_node) { in FindSinkNode() argument
330 *sink_node = sink_graph_node; in FindSinkNode()
|
| /external/tensorflow/tensorflow/compiler/jit/ |
| D | build_xla_ops_pass_test.cc | 246 Node* sink_node = graph->sink_node(); in TEST_F() local
247 EXPECT_THAT(sink_node, NodeWith(CtrlDeps(NodeWith(Op("_XlaRun")), in TEST_F()
|
| D | extract_outside_compilation_pass.cc | 384 if (!e->IsControlEdge() || e->dst() != g->sink_node()) { in ReplaceOrRemoveOutsideCompilationCallNode()
512 node_map[host_fbody->graph->sink_node()] = host_graph.sink_node(); in ConstructHostGraph()
574 host_graph.AddControlEdge(sequencer, host_graph.sink_node()); in ConstructHostGraph()
577 &host_graph, std::unordered_set<const Node*>{host_graph.sink_node()}); in ConstructHostGraph()
634 node_map[host_graph->sink_node()] = main_graph->sink_node(); in ExpandHostGraphIntoMainGraph()
1556 (*graph)->AddControlEdge(send_from_host_node, (*graph)->sink_node()); in operator ()()
1559 graph->get(), std::unordered_set<const Node*>{(*graph)->sink_node()}); in operator ()()
|
| D | encapsulate_util.cc | 346 for (const Edge* e : g->sink_node()->in_edges()) { in PreprocessEdgesBetweenOutsideCompilations()
|
| D | build_xla_ops_pass.cc | 124 s.graph()->AddControlEdge(new_node, s.graph()->sink_node()); in MergeOutgoingControlEdges()
|
| D | encapsulate_subgraphs_pass.cc | 1594 (*node_images)[graph_in_->sink_node()] = graph_out->sink_node(); in CopyNodesToOutputGraph()
|
| /external/tensorflow/tensorflow/core/distributed_runtime/ |
| D | scheduler.cc | 116 return (*asap_times)[graph_->sink_node()->id()]; in ComputeAsap()
141 Node* sinkNode = graph_->sink_node(); in ComputeAlap()
|
| /external/tensorflow/tensorflow/compiler/tf2tensorrt/segment/ |
| D | segment.cc | 130 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/ |
| D | constant_folding.cc | 427 node_map[orig_graph->sink_node()] = {constant_graph->sink_node()}; in GetConstantGraph()
|
| D | function.cc | 1985 node_map[src.sink_node()->id()] = dst->sink_node(); in Copy()
|
| /external/tensorflow/tensorflow/compiler/tf2xla/ |
| D | functionalize_control_flow_test.cc | 247 graph.AddControlEdge(n, graph.sink_node()); in TEST()
|