Home
last modified time | relevance | path

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

/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.cc89 g->AddControlEdge(g->source_node(), a); in TEST_F()
90 g->AddControlEdge(g->source_node(), b); in TEST_F()
140 g->AddControlEdge(g->source_node(), a); in TEST_F()
141 g->AddControlEdge(g->source_node(), b); in TEST_F()
187 g->AddControlEdge(g->source_node(), a); in TEST_F()
188 g->AddControlEdge(g->source_node(), b); in TEST_F()
189 g->AddControlEdge(g->source_node(), c); in TEST_F()
190 g->AddControlEdge(g->source_node(), d); in TEST_F()
241 g->AddControlEdge(g->source_node(), a); in TEST_F()
242 g->AddControlEdge(g->source_node(), b); in TEST_F()
[all …]
Dgraph_test.cc155 Node* source = graph_.source_node(); in TEST_F()
186 const Edge* source_to_a = graph_.AddControlEdge(graph_.source_node(), a); in TEST_F()
192 VerifyNodes(a, {graph_.source_node()}, {c, graph_.sink_node()}); in TEST_F()
200 VerifyNodes(graph_.source_node(), {}, {a, graph_.sink_node()}); in TEST_F()
201 VerifyNodes(graph_.sink_node(), {a, c, graph_.source_node()}, {}); in TEST_F()
205 VerifyNodes(graph_.source_node(), {}, {graph_.sink_node()}); // no more a in TEST_F()
209 VerifyNodes(graph_.sink_node(), {a, graph_.source_node()}, {}); // no more c in TEST_F()
297 const Edge* source_to_a = graph_.AddControlEdge(graph_.source_node(), a); in TEST_F()
306 expected.insert(graph_.source_node()->DebugString()); in TEST_F()
342 CheckType(graph_.source_node(), graph_.source_node()->IsSource()); in TEST_F()
[all …]
Dalgorithm.cc35 stack.push_back(Work{g.source_node(), false}); in DFS()
220 g->AddControlEdge(g->source_node(), n); in FixupSourceAndSinkEdges()
Dcontrol_flow.cc34 Node* src_node = g->source_node(); in BuildControlFlowInfo()
Dsubgraph.cc108 g->AddControlEdge(g->source_node(), recv_node); in FeedInputs()
Dgraph_constructor.cc1276 node_map[src.source_node()] = dest->source_node(); in CopyGraph()
Dgraph.h539 Node* source_node() const { return FindNodeId(kSourceId); } in source_node() function
Dgraph.cc382 if (source == source_node() || dest == sink_node() || x == kControlSlot || in AddEdge()
/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;
90 bool IsReachable(int32 source_node, int32 dest_node) const;
93 bool IsReachableNonConst(int32 source_node, int32 dest_node);
/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/libmojo/mojo/edk/system/
Dports_message.h45 const ports::NodeName& source_node() const { return source_node_; } in source_node() function
Dnode_controller.h136 void NotifyBadMessageFrom(const ports::NodeName& source_node,
239 const ports::NodeName& source_node,
Dnode_controller.cc386 void NodeController::NotifyBadMessageFrom(const ports::NodeName& source_node, in NotifyBadMessageFrom() argument
388 scoped_refptr<NodeChannel> peer = GetPeerChannel(source_node); in NotifyBadMessageFrom()
1309 const ports::NodeName& source_node, in OnPortsMessageFromRelay() argument
1317 OnPortsMessage(source_node, std::move(message)); in OnPortsMessageFromRelay()
Dnode_channel.h77 const ports::NodeName& source_node,
Dcore.cc769 if (ports_message.source_node() == ports::kInvalidNodeName) { in NotifyBadMessage()
777 ports_message.source_node(), std::string(error, error_num_bytes)); in NotifyBadMessage()
/external/tensorflow/tensorflow/core/common_runtime/
Dconstant_folding.cc420 node_map[orig_graph->source_node()] = {constant_graph->source_node()}; in GetConstantGraph()
539 graph->AddControlEdge(graph->source_node(), constant_node); in ReplaceTensorWithConstant()
Dfunction.cc1467 node_map[src.source_node()->id()] = dst->source_node(); in Copy()
/external/tensorflow/tensorflow/core/grappler/optimizers/
Ddependency_optimizer.cc525 const NodeDef& source_node = optimized_graph_->node(source); in TransitiveReduction() local
529 node_map_->RemoveOutput(source_node.name(), target_node->name()); in TransitiveReduction()
/external/tensorflow/tensorflow/contrib/tensorrt/segment/
Dsegment.cc85 if (e->src() == graph->source_node()) { in ContractEdge()
/external/tensorflow/tensorflow/compiler/jit/
Dencapsulate_subgraphs_pass.cc1383 (*node_images)[graph_in_->source_node()] = graph_out->source_node(); in CopyNodesToOutputGraph()
/external/selinux/libsepol/cil/src/
Dcil_binary.c4501 struct cil_tree_node *source_node; in __cil_init_sepol_avrule() local
4515 source_node = cil_tree_get_next_path(node, &source_path, &is_cil); in __cil_init_sepol_avrule()
4516 if (source_node) { in __cil_init_sepol_avrule()