Home
last modified time | relevance | path

Searched refs:graph_ (Results 1 – 25 of 89) sorted by relevance

1234

/external/tensorflow/tensorflow/core/graph/
Dgraph_test.cc55 GraphTest() : graph_(OpRegistry::Global()) {} in GraphTest()
75 for (const Node* n : graph_.nodes()) { in VerifyGraphStats()
79 EXPECT_EQ(nodes, graph_.num_nodes()); in VerifyGraphStats()
81 for (const Edge* e : graph_.edges()) { in VerifyGraphStats()
85 EXPECT_EQ(edges, graph_.num_edges()); in VerifyGraphStats()
90 TF_CHECK_OK(NodeBuilder(name, "NoOp").Finalize(&graph_, &node)); in AddNodeWithName()
105 Node* node = graph_.AddNode(node_def, &s); in FromNodeDef()
114 TF_CHECK_OK(ConvertGraphDefToGraph(opts, gdef, &graph_)); in FromGraphDef()
118 for (Node* node : graph_.nodes()) { in FindNode()
141 Graph graph_; member in tensorflow::__anon87142b3f0111::GraphTest
[all …]
Dgraph_def_builder.h123 return graph_->op_registry(); in op_registry()
138 Graph* const graph_; variable
149 : graph_(op_registry), flib_def_(op_registry), opts_(&graph_, &status_) {} in graph_() function
157 : graph_(op_registry), flib_def_(op_registry), opts_(&graph_, nullptr) {} in graph_() function
181 Graph graph_;
/external/tensorflow/tensorflow/lite/delegates/gpu/common/
Dmodel_test.cc143 node_ = graph_.NewNode(); in SetUp()
144 Value* graph_input = graph_.NewValue(); in SetUp()
145 Value* graph_output = graph_.NewValue(); in SetUp()
146 ASSERT_TRUE(graph_.AddConsumer(node_->id, graph_input->id).ok()); in SetUp()
147 ASSERT_TRUE(graph_.SetProducer(node_->id, graph_output->id).ok()); in SetUp()
148 EXPECT_THAT(graph_.inputs(), UnorderedElementsAre(graph_input)); in SetUp()
149 EXPECT_THAT(graph_.outputs(), UnorderedElementsAre(graph_output)); in SetUp()
150 EXPECT_THAT(graph_.nodes(), ElementsAre(node_)); in SetUp()
152 GraphFloat32 graph_; member in tflite::gpu::__anon6220ced20111::OneNodeModel
157 ASSERT_TRUE(RemoveSimpleNodeKeepInput(&graph_, node_).ok()); in TEST_F()
[all …]
Dmodel_transformer.cc33 for (auto input : graph_->inputs()) { in Apply()
34 for (auto node : graph_->FindConsumers(input->id)) { in Apply()
39 auto node = graph_->GetNode(to_process_.front()); in Apply()
56 for (auto node : graph_->nodes()) { in Apply()
60 auto node = graph_->GetNode(node_id); in Apply()
64 auto result = transformation->ApplyToNode(node, graph_); in Apply()
96 Node* node = graph_->GetNode(id); in ApplyStartingWithNode()
105 graph_->FindProducer(graph_->FindInputs(first_in_sequence)[0]->id); in ApplyStartingWithNode()
106 auto result = transformation->ApplyToNodesSequence(nodes, graph_); in ApplyStartingWithNode()
126 for (auto input : graph_->inputs()) { in ApplyStartingWithNode()
[all …]
/external/tensorflow/tensorflow/core/tpu/graph_rewrite/
Dcond_builder.cc27 : graph_(graph), name_(std::move(name)), device_(std::move(device)) { in CondBuilder()
34 .Build(graph_, &pred_)); in CondBuilder()
39 .Build(graph_, &switch_pred)); in CondBuilder()
40 graph_->AddEdge(pred(), 0, switch_pred, 0); in CondBuilder()
41 graph_->AddEdge(pred(), 0, switch_pred, 1); in CondBuilder()
45 .Build(graph_, &switch_f_)); in CondBuilder()
49 .Build(graph_, &switch_t_)); in CondBuilder()
50 graph_->AddEdge(switch_pred, kElseBranch, switch_f_, 0); in CondBuilder()
51 graph_->AddEdge(switch_pred, kThenBranch, switch_t_, 0); in CondBuilder()
56 .Build(graph_, &merge_pred)); in CondBuilder()
[all …]
/external/tensorflow/tensorflow/core/common_runtime/
Dlower_if_op.cc104 Graph* graph_; member in tensorflow::__anon49cebf3d0111::CondBuilder
118 graph_(graph), in CondBuilder()
154 graph_->op_registry(), &debug_info_) in CreatePivotNodes()
158 graph_, &switch_pred)); in CreatePivotNodes()
162 graph_->op_registry(), &debug_info_) in CreatePivotNodes()
165 graph_, &pivot_f_)); in CreatePivotNodes()
168 graph_->op_registry(), &debug_info_) in CreatePivotNodes()
171 graph_, &pivot_t_)); in CreatePivotNodes()
176 return graph_->NewName(strings::StrCat(name_, "/", infix)); in NewName()
195 NodeBuilder(NewName(src->name()), "Switch", graph_->op_registry(), in AddInput()
[all …]
Dlower_case_op.cc90 Graph* graph_; member in tensorflow::__anonea22fb6a0111::CaseBuilder
103 graph_(graph), in CaseBuilder()
123 graph_->op_registry(), &debug_info_) in CreatePivotNodes()
128 .Finalize(graph_, &branch_index)); in CreatePivotNodes()
133 "Identity", graph_->op_registry(), in CreatePivotNodes()
137 .Finalize(graph_, &pivots_[b])); in CreatePivotNodes()
143 return graph_->NewName(strings::StrCat(name_, "/", infix)); in NewName()
159 graph_->op_registry(), &debug_info) in AddInput()
165 .Finalize(graph_, &input)); in AddInput()
184 graph_->AddControlEdge(e->src(), control_predecessor_); in AddInputs()
[all …]
Dgraph_constructor_test.cc48 GraphConstructorTest() : graph_(OpRegistry::Global()) {} in GraphConstructorTest()
62 Status status = ConvertGraphDefToGraph(opts, gdef_, &graph_); in ExpectError()
88 Status status = ImportGraphDef(opts, gdef_, &graph_, refiner, results); in ExpectError()
102 TF_CHECK_OK(ConvertGraphDefToGraph(opts, gdef_, &graph_)); in ExpectOK()
109 Status s = ImportGraphDef(opts, gdef_, &graph_, refiner, results); in ExpectOK()
114 EXPECT_EQ(min_consumer, graph_.versions().min_consumer()) in ExpectVersions()
116 << graph_.versions().min_consumer(); in ExpectVersions()
117 EXPECT_EQ(producer, graph_.versions().producer()) in ExpectVersions()
119 << graph_.versions().producer(); in ExpectVersions()
123 for (Node* n : graph_.nodes()) { in FindNode()
[all …]
Dlower_while_op.cc149 Graph* graph_; member in tensorflow::__anon47970ba70111::LowerWhileHelper
186 graph_(graph), in LowerWhileHelper()
256 TF_RETURN_IF_ERROR(builder.Finalize(graph_, &enter_node)); in CreateEnterNodes()
273 .Finalize(graph_, &incoming_control_node)); in CreateEnterNodes()
275 graph_->AddControlEdge(incoming_control_node, n); in CreateEnterNodes()
292 .Finalize(graph_, &merge_node)); in CreateMergeNodes()
308 TF_RETURN_IF_ERROR(cond_call_builder_.Finalize(graph_, &cond_call_node_)); in CreateCondFuncCallNode()
312 graph_->AddControlEdge(merge_nodes_[0], cond_call_node_); in CreateCondFuncCallNode()
317 .Finalize(graph_, &loop_cond_node_)); in CreateCondFuncCallNode()
344 .Finalize(graph_, &switch_node)); in CreateSwitchNodes()
[all …]
Dmkl_tfconversion_pass_test.cc43 MklToTfConversionPass() : graph_(OpRegistry::Global()) {} in MklToTfConversionPass()
55 InitGraph(s, &graph_); in InitGraph()
56 original_ = CanonicalGraphString(&graph_); in InitGraph()
93 string before = CanonicalGraphString(&graph_); in DoRunMklToTfConversionPass()
96 std::unique_ptr<Graph>* ug = new std::unique_ptr<Graph>(&graph_); in DoRunMklToTfConversionPass()
99 string result = CanonicalGraphString(&graph_); in DoRunMklToTfConversionPass()
106 Graph graph_; member in tensorflow::__anon25146b200111::MklToTfConversionPass
Dplacer.cc138 : graph_(graph), in Placer()
164 DumpGraphToFile("placer_input", *graph_, nullptr); in Run()
167 for (const Node* node : graph_->op_nodes()) { in Run()
175 ColocationGraph colocation_graph(graph_, stack, flib_def_, devices_, in Run()
184 for (Node* node : graph_->op_nodes()) { in Run()
243 assigned_device = graph_->InternDeviceName((*devices)[0]->name()); in Run()
283 assigned_device = graph_->InternDeviceName((*devices)[0]->name()); in Run()
291 DumpGraphToFile("placer_output", *graph_, nullptr); in Run()
/external/tensorflow/tensorflow/core/distributed_runtime/
Dscheduler.cc75 : graph_(g), cost_model_(cost_model) {} in SlackAnalysis()
78 asap_times->resize(graph_->num_node_ids()); in ComputeAsap()
80 std::vector<int> pending_count(graph_->num_node_ids()); in ComputeAsap()
81 InitializePending(graph_, &pending_count); in ComputeAsap()
84 Node* srcNode = graph_->source_node(); in ComputeAsap()
116 return (*asap_times)[graph_->sink_node()->id()]; in ComputeAsap()
120 alap_times->resize(graph_->num_node_ids()); in ComputeAlap()
123 pending_count.resize(graph_->num_node_ids()); in ComputeAlap()
124 for (const Node* n : graph_->nodes()) { in ComputeAlap()
141 Node* sinkNode = graph_->sink_node(); in ComputeAlap()
[all …]
/external/openscreen/discovery/dnssd/impl/
Ddns_data_graph_unittest.cc51 DnsDataGraphTests() : graph_(DnsDataGraph::Create(network_interface_)) { in DnsDataGraphTests()
55 EXPECT_EQ(graph_->GetTrackedDomainCount(), size_t{1}); in DnsDataGraphTests()
61 size_t size = graph_->GetTrackedDomainCount(); in TriggerRecordCreation()
66 size_t new_size = graph_->GetTrackedDomainCount(); in TriggerRecordCreation()
73 size_t size = graph_->GetTrackedDomainCount(); in TriggerRecordCreationWithCallback()
77 size_t new_size = graph_->GetTrackedDomainCount(); in TriggerRecordCreationWithCallback()
90 return graph_->ApplyDataRecordChange( in ApplyDataRecordChange()
101 graph_->StartTracking(domain, [this](const DomainName& domain) { in StartTracking()
107 graph_->StopTracking(domain, [this](const DomainName& domain) { in StopTracking()
114 std::unique_ptr<DnsDataGraph> graph_; member in openscreen::discovery::DnsDataGraphTests
[all …]
/external/tensorflow/tensorflow/compiler/jit/
Dshape_inference_helpers.cc27 if (graph_ != nullptr) { in Remove()
30 graph_ = graph; in Remove()
31 for (Node* n : graph_->nodes()) { in Remove()
42 graph_->RemoveEdge(be.edge); in Remove()
53 if (graph_ == nullptr) { in Replace()
61 graph_->AddEdge(be.src, be.src_output, be.dst, be.dst_input); in Replace()
Dmark_for_compilation_pass.cc114 graph_(graph), in MarkForCompilationPassImpl()
351 if (node_id >= graph_->num_node_ids() || in GetClusterForCyclesGraphNode()
352 graph_->FindNodeId(node_id) == nullptr) { in GetClusterForCyclesGraphNode()
398 VLOG(3) << "Could not contract " << cluster_from->DebugString(*graph_) in MergeClusters()
399 << " -> " << cluster_to->DebugString(*graph_) in MergeClusters()
418 return absl::StrCat("Could not contract ", from->DebugString(*graph_), in EdgeContractionFailureMsg()
419 " -> ", to->DebugString(*graph_), " because ", reason, in EdgeContractionFailureMsg()
424 Graph* graph_; member in tensorflow::__anone7654d5a0111::MarkForCompilationPassImpl
504 return cluster->DebugString(*graph_); in DebugStringForCyclesGraphNode()
508 if (cycles_graph_node_id >= graph_->num_node_ids()) { in DebugStringForCyclesGraphNode()
[all …]
Dcluster_scoping_pass.cc33 : graph_(graph), in ClusterScopingPassImpl()
49 Graph* graph_; member in tensorflow::__anon86d5c97f0111::ClusterScopingPassImpl
104 ReverseDFSFrom(*graph_, starts, enter, /*leave=*/nullptr, in AddScopeToAllTransitivePredecessors()
114 DFSFrom(*graph_, starts, enter, /*leave=*/nullptr, in AddScopeToAllTransitiveSuccessors()
135 for (Node* n : graph_->nodes()) { in ScopingForPipelineStages()
/external/tensorflow/tensorflow/lite/delegates/gpu/gl/kernels/
Dtest_util.cc42 auto node = graph_.NewNode(); in SingleOpModel()
46 auto input = graph_.NewValue(); in SingleOpModel()
48 graph_.AddConsumer(node->id, input->id).IgnoreError(); in SingleOpModel()
56 auto output = graph_.NewValue(); in SingleOpModel()
58 graph_.SetProducer(node->id, output->id).IgnoreError(); in SingleOpModel()
82 for (const auto* input : graph_.inputs()) { in Invoke()
94 for (const auto* output : graph_.outputs()) { in Invoke()
104 RETURN_IF_ERROR(Compile(compile_options, graph_, /*tflite_graph_io=*/{}, in Invoke()
119 for (const auto* output : graph_.outputs()) { in Invoke()
/external/tensorflow/tensorflow/lite/
Dsimple_planner_test.cc132 explicit TestGraphInfo(TestGraph* graph) : graph_(graph) {} in TestGraphInfo()
134 size_t num_tensors() const override { return graph_->tensors()->size(); } in num_tensors()
136 return &graph_->tensors()->at(index); in tensor()
138 size_t num_execution_nodes() const override { return graph_->nodes().size(); } in num_execution_nodes()
139 size_t num_total_nodes() const override { return graph_->nodes().size(); } in num_total_nodes()
141 return graph_->nodes()[index]; in node()
144 const std::vector<int>& inputs() const override { return graph_->inputs(); } in inputs()
145 const std::vector<int>& outputs() const override { return graph_->outputs(); } in outputs()
147 return graph_->variables(); in variables()
151 TestGraph* graph_; member in tflite::__anondad1de0a0111::TestGraphInfo
[all …]
Darena_planner_test.cc141 explicit TestGraphInfo(TestGraph* graph) : graph_(graph) {} in TestGraphInfo()
143 size_t num_tensors() const override { return graph_->tensors()->size(); } in num_tensors()
145 return &graph_->tensors()->at(index); in tensor()
147 size_t num_execution_nodes() const override { return graph_->nodes().size(); } in num_execution_nodes()
148 size_t num_total_nodes() const override { return graph_->nodes().size(); } in num_total_nodes()
150 return graph_->nodes()[index]; in node()
153 const std::vector<int>& inputs() const override { return graph_->inputs(); } in inputs()
154 const std::vector<int>& outputs() const override { return graph_->outputs(); } in outputs()
156 return graph_->variables(); in variables()
160 TestGraph* graph_; member in tflite::__anon0e1f23470111::TestGraphInfo
[all …]
/external/tensorflow/tensorflow/compiler/mlir/
Dmlir_graph_optimization_pass_test.cc96 graph_ = std::make_unique<Graph>(OpRegistry::Global()); in Init()
111 flib_.reset(new FunctionLibraryDefinition(graph_->flib_def())); in Init()
133 graph_->ToGraphDef(&resulted_graph_def); in verifyGraph()
149 std::unique_ptr<Graph> graph_; member in tensorflow::MlirGraphOptimizationPassTest
160 graph_->ToGraphDef(&original_graph_def); in TEST_F()
163 device_set_, config_proto_, &graph_, flib_.get(), in TEST_F()
175 graph_->ToGraphDef(&original_graph_def); in TEST_F()
180 device_set_, config_proto_, &graph_, flib_.get(), in TEST_F()
190 graph_->ToGraphDef(&original_graph_def); in TEST_F()
195 device_set_, config_proto_, &graph_, flib_.get(), in TEST_F()
/external/tensorflow/tensorflow/core/grappler/optimizers/
Dauto_parallel.cc36 NodeDef* node = graph_.add_node(); in AddNodeDivConst()
54 NodeDef* node = graph_.add_node(); in AddNodeDiv()
81 graph_ = item.graph; in Initialize()
82 LOG(INFO) << "Original graph size: " << graph_.node_size(); in Initialize()
114 for (int i = 0; i < graph_.node_size(); i++) { in Initialize()
116 std::make_pair(graph_.node(i).name(), graph_.mutable_node(i))); in Initialize()
117 if (apply_gradients_ops.find(graph_.node(i).op()) != in Initialize()
119 apply_gradients_nodes_.insert(graph_.node(i).name()); in Initialize()
120 VLOG(2) << "Apply gradients node: " << graph_.node(i).name(); in Initialize()
152 TF_RETURN_IF_ERROR(ComputeTransitiveFanin(graph_, item.fetch, &train_nodes)); in Initialize()
[all …]
/external/tensorflow/tensorflow/core/grappler/verifiers/
Dstructure_verifier_test.cc39 CHECK(protobuf::TextFormat::ParseFromString(gdef_ascii, &graph_)); in SetGraph()
41 GraphDef graph_; member in tensorflow::grappler::__anonfc82dc620111::StructureVerifierTest
79 TF_EXPECT_OK(verifier_->Verify(graph_)); in TEST_F()
87 Status status = verifier_->Verify(graph_); in TEST_F()
97 Status status = verifier_->Verify(graph_); in TEST_F()
108 Status status = verifier_->Verify(graph_); in TEST_F()
/external/tensorflow/tensorflow/cc/framework/
Dscope.cc46 : graph_(graph), in Impl()
58 : graph_(graph), in Impl()
84 : graph_(other.impl()->graph_), in Impl()
103 : graph_(other.impl()->graph_), in Impl()
121 : graph_(other.impl()->graph_), in Impl()
144 : graph_(other.impl()->graph_), in Impl()
162 : graph_(other.impl()->graph_), in Impl()
179 : graph_(other.impl()->graph_), in Impl()
197 : graph_(other.impl()->graph_), in Impl()
215 : graph_(other.impl()->graph_), in Impl()
[all …]
/external/tensorflow/tensorflow/c/
Dwhile_loop_test.cc28 CApiWhileLoopTest() : s_(TF_NewStatus()), graph_(TF_NewGraph()) {} in CApiWhileLoopTest()
31 TF_DeleteGraph(graph_); in ~CApiWhileLoopTest()
41 graph_, s_, ::tensorflow::strings::StrCat("p", i).c_str()); in Init()
49 TF_NewWhile(graph_, &inputs_[0], inputs_.size(), s_))); in Init()
88 csession_.reset(new CSession(graph_, s_)); in Run()
116 TF_GraphToGraphDef(graph_, buf, s_); in GraphDebugString()
126 TF_Graph* graph_; member in __anone3cab3980111::CApiWhileLoopTest
188 EXPECT_TRUE(TF_GraphOperationByName(graph_, cond_name.c_str()) == nullptr); in TEST_F()
189 EXPECT_TRUE(TF_GraphOperationByName(graph_, body_name.c_str()) == nullptr); in TEST_F()
282 EXPECT_TRUE(TF_GraphOperationByName(graph_, node_name) != nullptr); in TEST_F()
[all …]
/external/tensorflow/tensorflow/compiler/tf2xla/
Dfunctionalize_cond_test.cc40 graph_.reset(new Graph(OpRegistry::Global())); in FunctionalizeCondTest()
44 graph_.get(), flib_def_.get(), NodeFilter{})); in FunctionalizeCondTest()
68 std::unique_ptr<Graph> graph_; member in tensorflow::functionalize_cond::FunctionalizeCondTest
76 Node* pred = test::graph::Constant(graph_.get(), pred_tensor, "pred"); in TEST_F()
79 Node* val = test::graph::Constant(graph_.get(), val_tensor, "val"); in TEST_F()
80 Node* m = test::graph::Merge(graph_.get(), val, val); in TEST_F()
113 Node* val = test::graph::Constant(graph_.get(), val_tensor, "val"); in TEST_F()
114 Node* m = test::graph::Merge(graph_.get(), val, val); in TEST_F()

1234