Home
last modified time | relevance | path

Searched refs:source_node (Results 1 – 25 of 31) sorted by relevance

12

/external/tensorflow/tensorflow/core/graph/
Dnode_builder_test.cc32 Node* source_node; in TEST() local
35 .Finalize(&graph, &source_node)); in TEST()
36 ASSERT_TRUE(source_node != nullptr); in TEST()
40 .Input(source_node) in TEST()
43 .Input(source_node, 1) in TEST()
48 .Input(source_node, 2) in TEST()
52 .Input(source_node, -1) in TEST()
56 .Input({source_node, -1}) in TEST()
Dquantize_training_test.cc90 g->AddControlEdge(g->source_node(), a); in TEST_F()
91 g->AddControlEdge(g->source_node(), b); in TEST_F()
141 g->AddControlEdge(g->source_node(), a); in TEST_F()
142 g->AddControlEdge(g->source_node(), b); in TEST_F()
188 g->AddControlEdge(g->source_node(), a); in TEST_F()
189 g->AddControlEdge(g->source_node(), b); in TEST_F()
190 g->AddControlEdge(g->source_node(), c); in TEST_F()
191 g->AddControlEdge(g->source_node(), d); in TEST_F()
242 g->AddControlEdge(g->source_node(), a); in TEST_F()
243 g->AddControlEdge(g->source_node(), b); in TEST_F()
[all …]
Dgraph_test.cc157 Node* source = graph_.source_node(); in TEST_F()
188 const Edge* source_to_a = graph_.AddControlEdge(graph_.source_node(), a); in TEST_F()
194 VerifyNodes(a, {graph_.source_node()}, {c, 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()
207 VerifyNodes(graph_.source_node(), {}, {graph_.sink_node()}); // no more a in TEST_F()
211 VerifyNodes(graph_.sink_node(), {a, graph_.source_node()}, {}); // no more c in TEST_F()
299 const Edge* source_to_a = graph_.AddControlEdge(graph_.source_node(), a); in TEST_F()
308 expected.insert(graph_.source_node()->DebugString()); in TEST_F()
344 CheckType(graph_.source_node(), graph_.source_node()->IsSource()); in TEST_F()
[all …]
Dalgorithm.cc93 DFSFromHelper(g, {g.source_node()}, enter, leave, stable_comparator, in DFS()
254 g->AddControlEdge(g->source_node(), n, in FixupSourceAndSinkEdges()
Dcontrol_flow.cc94 const Node* src_node = g->source_node(); in BuildControlFlowInfo()
Dalgorithm_test.cc176 g.FindNodeId(n1->id()), g.FindNodeId(n0->id()), g.source_node()}; in TEST()
Dsubgraph.cc86 g->AddControlEdge(g->source_node(), feed_node, true); in FeedInputs()
Dgraph_constructor.cc1314 node_map[src.source_node()] = dest->source_node(); in CopyGraph()
Dgraph.h604 Node* source_node() const { return FindNodeId(kSourceId); } in source_node() function
/external/tensorflow/tensorflow/compiler/jit/graphcycles/
Dgraphcycles.h74 bool InsertEdge(int32 source_node, int32 dest_node);
77 void RemoveEdge(int32 source_node, int32 dest_node);
80 bool HasEdge(int32 source_node, int32 dest_node) const;
93 bool IsReachable(int32 source_node, int32 dest_node) const;
96 bool IsReachableNonConst(int32 source_node, int32 dest_node);
/external/deqp-deps/SPIRV-Tools/source/opt/
Dloop_dependence.cpp277 SENode* source_node = scalar_evolution_.SimplifyExpression( in GetDependence() local
283 auto subscript_pair = std::make_pair(source_node, destination_node); in GetDependence()
302 if (source_node->GetType() == SENode::CanNotCompute || in GetDependence()
339 auto current_loops = CollectLoops(source_node, destination_node); in GetDependence()
359 SENode* source_node = scalar_evolution_.SimplifyExpression( in GetDependence() local
364 coupled_subscripts.push_back({source_node, destination_node}); in GetDependence()
421 SENode* source_node = std::get<0>(subscript_pair); in SIVTest() local
424 int64_t source_induction_count = CountInductionVariables(source_node); in SIVTest()
433 source_node, destination_node->AsSERecurrentNode(), in SIVTest()
449 source_node->AsSERecurrentNode(), destination_node, in SIVTest()
[all …]
Dloop_dependence_helpers.cpp427 SENode* source_node = scalar_evolution_.SimplifyExpression( in MarkUnsusedDistanceEntriesAsIrrelevant() local
430 source_node->CollectRecurrentNodes(); in MarkUnsusedDistanceEntriesAsIrrelevant()
/external/swiftshader/third_party/SPIRV-Tools/source/opt/
Dloop_dependence.cpp277 SENode* source_node = scalar_evolution_.SimplifyExpression( in GetDependence() local
283 auto subscript_pair = std::make_pair(source_node, destination_node); in GetDependence()
302 if (source_node->GetType() == SENode::CanNotCompute || in GetDependence()
339 auto current_loops = CollectLoops(source_node, destination_node); in GetDependence()
359 SENode* source_node = scalar_evolution_.SimplifyExpression( in GetDependence() local
364 coupled_subscripts.push_back({source_node, destination_node}); in GetDependence()
421 SENode* source_node = std::get<0>(subscript_pair); in SIVTest() local
424 int64_t source_induction_count = CountInductionVariables(source_node); in SIVTest()
433 source_node, destination_node->AsSERecurrentNode(), in SIVTest()
449 source_node->AsSERecurrentNode(), destination_node, in SIVTest()
[all …]
Dloop_dependence_helpers.cpp427 SENode* source_node = scalar_evolution_.SimplifyExpression( in MarkUnsusedDistanceEntriesAsIrrelevant() local
430 source_node->CollectRecurrentNodes(); in MarkUnsusedDistanceEntriesAsIrrelevant()
/external/tensorflow/tensorflow/core/distributed_runtime/
Dscheduler.cc84 Node* srcNode = graph_->source_node(); in ComputeAsap()
172 return (*alap_times)[graph_->source_node()->id()]; in ComputeAlap()
181 Node* srcNode = graph_->source_node(); in ComputeSlack()
220 src_event.node = graph_->source_node(); in ComputeSchedule()
/external/tensorflow/tensorflow/compiler/tf2tensorrt/segment/
Dsegment.cc129 const SimpleNode* source_node() const { return nodes_[Graph::kSourceId]; } in source_node() function in tensorflow::tensorrt::segment::SimpleGraph
151 nodes_[g->kSourceId] = new SimpleNode(g->source_node(), g->kSourceId); in SimpleGraph()
366 if (e->src() == graph->source_node()) { in ContractEdge()
475 StableDFS(*graph, /*reverse=*/false, {graph->source_node()}, in SegmentGraph()
/external/libchrome/mojo/core/
Dnode_controller.h130 void NotifyBadMessageFrom(const ports::NodeName& source_node,
222 const ports::NodeName& source_node,
Duser_message_impl.h118 const ports::NodeName& source_node() const { return source_node_; } in source_node() function
Dnode_controller.cc314 void NodeController::NotifyBadMessageFrom(const ports::NodeName& source_node, in NotifyBadMessageFrom() argument
316 scoped_refptr<NodeChannel> peer = GetPeerChannel(source_node); in NotifyBadMessageFrom()
1128 const ports::NodeName& source_node, in OnEventMessageFromRelay() argument
1136 OnEventMessage(source_node, std::move(message)); in OnEventMessageFromRelay()
Dnode_channel.h68 const ports::NodeName& source_node,
Dcore.cc642 if (message->source_node() == ports::kInvalidNodeName) { in NotifyBadMessage()
650 message->source_node(), std::string(error, error_num_bytes)); in NotifyBadMessage()
/external/tensorflow/tensorflow/core/common_runtime/
Dconstant_folding.cc426 node_map[orig_graph->source_node()] = {constant_graph->source_node()}; in GetConstantGraph()
549 graph->AddControlEdge(graph->source_node(), constant_node); in ReplaceTensorWithConstant()
/external/tensorflow/tensorflow/compiler/jit/
Dextract_outside_compilation_pass.cc378 if (!e->IsControlEdge() || e->src() != g->source_node()) { in ReplaceOrRemoveOutsideCompilationCallNode()
511 node_map[host_fbody->graph->source_node()] = host_graph.source_node(); in ConstructHostGraph()
633 node_map[host_graph->source_node()] = main_graph->source_node(); in ExpandHostGraphIntoMainGraph()
737 node_map[host_graph->source_node()] = g->source_node(); in RewriteShapeInferenceGraph()
Dencapsulate_util.cc341 for (const Edge* e : g->source_node()->out_edges()) { in PreprocessEdgesBetweenOutsideCompilations()
/external/tensorflow/tensorflow/core/grappler/optimizers/
Ddependency_optimizer.cc566 const NodeDef& source_node = optimized_graph_->node(source); in TransitiveReduction() local
570 node_map_->RemoveOutput(source_node.name(), target_node->name()); in TransitiveReduction()

12