Home
last modified time | relevance | path

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

1234

/external/tensorflow/tensorflow/core/graph/
Dgraph_test.cc54 GraphTest() : graph_(OpRegistry::Global()) {} in GraphTest()
74 for (const Node* n : graph_.nodes()) { in VerifyGraphStats()
78 EXPECT_EQ(nodes, graph_.num_nodes()); in VerifyGraphStats()
80 for (const Edge* e : graph_.edges()) { in VerifyGraphStats()
84 EXPECT_EQ(edges, graph_.num_edges()); in VerifyGraphStats()
89 TF_CHECK_OK(NodeBuilder(name, "NoOp").Finalize(&graph_, &node)); in AddNodeWithName()
104 Node* node = graph_.AddNode(node_def, &s); in FromNodeDef()
113 TF_CHECK_OK(ConvertGraphDefToGraph(opts, gdef, &graph_)); in FromGraphDef()
117 for (Node* node : graph_.nodes()) { in FindNode()
140 Graph graph_; member in tensorflow::__anon465791930111::GraphTest
[all …]
Dgraph_constructor_test.cc47 GraphConstructorTest() : graph_(OpRegistry::Global()) {} in GraphConstructorTest()
60 Status status = ConvertGraphDefToGraph(opts, gdef_, &graph_); in ExpectError()
79 Status status = ImportGraphDef(opts, gdef_, &graph_, refiner, results); in ExpectError()
93 TF_CHECK_OK(ConvertGraphDefToGraph(opts, gdef_, &graph_)); in ExpectOK()
100 Status s = ImportGraphDef(opts, gdef_, &graph_, refiner, results); in ExpectOK()
105 EXPECT_EQ(min_consumer, graph_.versions().min_consumer()) in ExpectVersions()
107 << graph_.versions().min_consumer(); in ExpectVersions()
108 EXPECT_EQ(producer, graph_.versions().producer()) in ExpectVersions()
110 << graph_.versions().producer(); in ExpectVersions()
114 for (Node* n : graph_.nodes()) { in FindNode()
[all …]
Dgraph_def_builder.h121 return graph_->op_registry(); in op_registry()
136 Graph* const graph_; variable
147 : graph_(op_registry), opts_(&graph_, &status_) {} in graph_() function
155 : graph_(op_registry), opts_(&graph_, nullptr) {} in graph_() function
169 return graph_.AddFunctionLibrary(fdef_lib); in AddFunctionLibrary()
175 return graph_.flib_def().Find(name) != nullptr; in HasFunction()
179 Graph graph_;
Dmkl_layout_pass_test.cc67 MklLayoutPassTest() : graph_(OpRegistry::Global()) {} in MklLayoutPassTest()
70 for (Node* node : graph_.nodes()) { in FindNode()
77 ::tensorflow::InitGraph(s, &graph_, device); in InitGraph()
78 original_ = CanonicalGraphString(&graph_); in InitGraph()
115 string before = CanonicalGraphString(&graph_); in DoMklLayoutOptimizationPass()
118 std::unique_ptr<Graph>* ug = new std::unique_ptr<Graph>(&graph_); in DoMklLayoutOptimizationPass()
121 string result = CanonicalGraphString(&graph_); in DoMklLayoutOptimizationPass()
132 for (const Node* n : graph_.nodes()) { in DoMklLayoutOptimizationPassGetAttrVal()
143 Graph graph_; member in tensorflow::__anon793bf7b80111::MklLayoutPassTest
559 const Edge* edge = graph_.AddControlEdge(a1, c); in TEST_F()
[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::__anon5402f3fa0111::MklToTfConversionPass
Doptimizer_cse_test.cc49 OptimizerCSETest() : graph_(OpRegistry::Global()) {} in OptimizerCSETest()
52 ::tensorflow::InitGraph(s, &graph_); in InitGraph()
53 original_ = CanonicalGraphString(&graph_); in InitGraph()
90 string before = CanonicalGraphString(&graph_); in DoCSE()
93 OptimizeCSE(&graph_, consider_fn); in DoCSE()
95 string result = CanonicalGraphString(&graph_); in DoCSE()
102 Graph graph_; member in tensorflow::__anonbaccd05e0111::OptimizerCSETest
Dgraph.h293 Graph* graph_; variable
780 const Graph* graph_;
802 : graph_(graph), id_(id) {} in NodeIter()
805 DCHECK(graph_ == rhs.graph_);
815 DCHECK_LE(id_, graph_->num_node_ids());
817 if (id_ >= graph_->num_node_ids() || graph_->FindNodeId(id_) != nullptr) {
823 inline Node* NodeIter::operator*() { return graph_->FindNodeId(id_); }
825 inline Node* NodeIter::operator->() { return graph_->FindNodeId(id_); }
881 graph_->CheckDeviceNameIndex(index); in set_assigned_device_name_index()
886 graph_->set_assigned_device_name(this, device_name); in set_assigned_device_name()
[all …]
/external/tensorflow/tensorflow/core/common_runtime/
Dlower_if_op.cc93 Graph* graph_; member in tensorflow::__anoneb751e910111::CondBuilder
106 graph_(graph), in CondBuilder()
124 graph_->op_registry(), &debug_info_) in CreatePivotNodes()
128 .Finalize(graph_, &switch_pred)); in CreatePivotNodes()
131 graph_->op_registry(), &debug_info_) in CreatePivotNodes()
134 .Finalize(graph_, &pivot_f_)); in CreatePivotNodes()
136 graph_->op_registry(), &debug_info_) in CreatePivotNodes()
139 .Finalize(graph_, &pivot_t_)); in CreatePivotNodes()
144 return graph_->NewName(strings::StrCat(name_, "/", infix)); in NewName()
160 graph_->op_registry(), &debug_info) in AddInput()
[all …]
Dlower_while_op.cc132 Graph* graph_; member in tensorflow::__anon83c31a7b0111::LowerWhileHelper
157 graph_(graph), in LowerWhileHelper()
199 graph_->op_registry(), &debug_info_) in CreateEnterNodes()
204 .Finalize(graph_, &enter_node)); in CreateEnterNodes()
218 graph_->op_registry(), &debug_info_) in CreateEnterNodes()
221 .Finalize(graph_, &incoming_control_node)); in CreateEnterNodes()
223 graph_->AddControlEdge(incoming_control_node, n); in CreateEnterNodes()
233 NodeBuilder(NewName("merge"), "Merge", graph_->op_registry(), in CreateMergeNodes()
237 .Finalize(graph_, &merge_node)); in CreateMergeNodes()
248 TF_RETURN_IF_ERROR(cond_call_builder_.Finalize(graph_, &cond_call_node_)); in CreateCondFuncCallNode()
[all …]
Dplacer.cc84 : graph_(graph), in Placer()
105 DumpGraphToFile("placer_input", *graph_, nullptr); in Run()
106 for (const Node* node : graph_->op_nodes()) { in Run()
113 ColocationGraph colocation_graph(graph_, devices_, default_device_, in Run()
122 for (Node* node : graph_->op_nodes()) { in Run()
181 assigned_device = graph_->InternDeviceName((*devices)[0]->name()); in Run()
221 assigned_device = graph_->InternDeviceName((*devices)[0]->name()); in Run()
229 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/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()
/external/tensorflow/tensorflow/compiler/tf2xla/
Dfunctionalize_cond_test.cc33 graph_.reset(new Graph(OpRegistry::Global())); in FunctionalizeCondTest()
36 fc_.reset(new functionalize_cond::FunctionalizeCond(graph_.get(), in FunctionalizeCondTest()
62 std::unique_ptr<Graph> graph_; member in tensorflow::functionalize_cond::FunctionalizeCondTest
70 Node* pred = test::graph::Constant(graph_.get(), pred_tensor, "pred"); in TEST_F()
73 Node* val = test::graph::Constant(graph_.get(), val_tensor, "val"); in TEST_F()
74 Node* m = test::graph::Merge(graph_.get(), val, val); in TEST_F()
107 Node* val = test::graph::Constant(graph_.get(), val_tensor, "val"); in TEST_F()
108 Node* m = test::graph::Merge(graph_.get(), val, val); in TEST_F()
/external/tensorflow/tensorflow/core/grappler/optimizers/
Dauto_parallel.cc35 NodeDef* node = graph_.add_node(); in AddNodeDivConst()
53 NodeDef* node = graph_.add_node(); in AddNodeDiv()
80 graph_ = item.graph; in Initialize()
81 LOG(INFO) << "Original graph size: " << graph_.node_size(); in Initialize()
113 for (int i = 0; i < graph_.node_size(); i++) { in Initialize()
115 std::make_pair(graph_.node(i).name(), graph_.mutable_node(i))); in Initialize()
116 if (apply_gradients_ops.find(graph_.node(i).op()) != in Initialize()
118 apply_gradients_nodes_.insert(graph_.node(i).name()); in Initialize()
119 VLOG(2) << "Apply gradients node: " << graph_.node(i).name(); in Initialize()
150 auto train_nodes = ComputeTransitiveFanin(graph_, item.fetch); in Initialize()
[all …]
/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/core/grappler/verifiers/
Dstructure_verifier_test.cc38 CHECK(protobuf::TextFormat::ParseFromString(gdef_ascii, &graph_)); in SetGraph()
40 GraphDef graph_; member in tensorflow::grappler::__anon348563b60111::StructureVerifierTest
78 TF_EXPECT_OK(verifier_->Verify(graph_)); in TEST_F()
86 Status status = verifier_->Verify(graph_); in TEST_F()
96 Status status = verifier_->Verify(graph_); in TEST_F()
107 Status status = verifier_->Verify(graph_); in TEST_F()
/external/tensorflow/tensorflow/lite/
Darena_planner_test.cc130 explicit TestGraphInfo(TestGraph* graph) : graph_(graph) {} in TestGraphInfo()
132 size_t num_tensors() const override { return graph_->tensors()->size(); } in num_tensors()
134 return &graph_->tensors()->at(index); in tensor()
136 size_t num_nodes() const override { return graph_->nodes().size(); } in num_nodes()
138 return graph_->nodes()[index]; in node()
140 const std::vector<int>& inputs() const override { return graph_->inputs(); } in inputs()
141 const std::vector<int>& outputs() const override { return graph_->outputs(); } in outputs()
143 return graph_->variables(); in variables()
147 TestGraph* graph_; member in tflite::__anonabd56e9b0111::TestGraphInfo
165 graph_ = graph; in SetGraph()
[all …]
/external/tensorflow/tensorflow/c/
Dwhile_loop_test.cc29 CApiWhileLoopTest() : s_(TF_NewStatus()), graph_(TF_NewGraph()) {} in CApiWhileLoopTest()
32 TF_DeleteGraph(graph_); in ~CApiWhileLoopTest()
42 graph_, s_, ::tensorflow::strings::StrCat("p", i).c_str()); in Init()
50 TF_NewWhile(graph_, &inputs_[0], inputs_.size(), s_))); in Init()
89 csession_.reset(new CSession(graph_, s_)); in Run()
117 TF_GraphToGraphDef(graph_, buf, s_); in GraphDebugString()
127 TF_Graph* graph_; member in __anona1d00fec0111::CApiWhileLoopTest
189 EXPECT_TRUE(TF_GraphOperationByName(graph_, cond_name.c_str()) == nullptr); in TEST_F()
190 EXPECT_TRUE(TF_GraphOperationByName(graph_, body_name.c_str()) == nullptr); in TEST_F()
283 EXPECT_TRUE(TF_GraphOperationByName(graph_, node_name) != nullptr); in TEST_F()
[all …]
/external/v8/src/compiler/
Dcompiler-source-position-table.cc28 : graph_(graph), in SourcePositionTable()
35 decorator_ = new (graph_->zone()) Decorator(this); in AddDecorator()
36 graph_->AddDecorator(decorator_); in AddDecorator()
41 graph_->RemoveDecorator(decorator_); in RemoveDecorator()
Dinstruction-scheduler.cc85 graph_(zone), in InstructionScheduler()
93 DCHECK(graph_.empty()); in StartBlock()
110 graph_.clear(); in EndBlock()
122 for (ScheduleGraphNode* node : graph_) { in AddTerminator()
125 graph_.push_back(new_node); in AddTerminator()
203 graph_.push_back(new_node); in AddInstruction()
215 for (ScheduleGraphNode* node : graph_) { in ScheduleBlock()
376 for (ScheduleGraphNode* node : base::Reversed(graph_)) { in ComputeTotalLatencies()
Dnode-origin-table.cc42 : graph_(graph), in NodeOriginTable()
50 decorator_ = new (graph_->zone()) Decorator(this); in AddDecorator()
51 graph_->AddDecorator(decorator_); in AddDecorator()
56 graph_->RemoveDecorator(decorator_); in RemoveDecorator()
Dmachine-graph.h27 : graph_(graph), common_(common), machine_(machine), cache_(zone()) {} in NON_EXPORTED_BASE()
70 return Dead_ ? Dead_ : Dead_ = graph_->NewNode(common_->Dead()); in NON_EXPORTED_BASE()
75 Graph* graph() const { return graph_; } in NON_EXPORTED_BASE()
79 Graph* graph_; in NON_EXPORTED_BASE()
/external/googletest/googlemock/src/
Dgmock-matchers.cc125 : graph_(&graph), in MaxBipartiteMatchState()
126 left_(graph_->LhsSize(), kUnused), in MaxBipartiteMatchState()
127 right_(graph_->RhsSize(), kUnused) {} in MaxBipartiteMatchState()
145 for (size_t ilhs = 0; ilhs < graph_->LhsSize(); ++ilhs) { in Compute()
151 seen.assign(graph_->RhsSize(), 0); in Compute()
183 for (size_t irhs = 0; irhs < graph_->RhsSize(); ++irhs) { in TryAugment()
185 if (!graph_->HasEdge(ilhs, irhs)) continue; in TryAugment()
208 const MatchMatrix* graph_; // not owned member in testing::internal::MaxBipartiteMatchState
/external/tensorflow/tensorflow/lite/toco/tensorflow_graph_matching/
Dresolve_svdf_test.cc82 NodeDef* node = graph_.add_node(); in AddNewNode()
95 NodeDef* node = graph_.add_node(); in AddNewNode()
118 NodeDef* node = graph_.add_node(); in AddShapeNode()
136 GraphDef graph_; member in toco::ResolveSvdfTest
161 for (const NodeDef& node : graph_.node()) { in TEST_F()
166 CHECK(FindCluster(svdf_cluster_factory_, graph_, &is_node_in_cluster, in TEST_F()
/external/swiftshader/third_party/llvm-7.0/llvm/utils/unittest/googlemock/src/
Dgmock-matchers.cc201 : graph_(&graph), in MaxBipartiteMatchState()
202 left_(graph_->LhsSize(), kUnused), in MaxBipartiteMatchState()
203 right_(graph_->RhsSize(), kUnused) { in MaxBipartiteMatchState()
222 for (size_t ilhs = 0; ilhs < graph_->LhsSize(); ++ilhs) { in Compute()
228 seen.assign(graph_->RhsSize(), 0); in Compute()
260 for (size_t irhs = 0; irhs < graph_->RhsSize(); ++irhs) { in TryAugment()
263 if (!graph_->HasEdge(ilhs, irhs)) in TryAugment()
287 const MatchMatrix* graph_; // not owned member in testing::internal::MaxBipartiteMatchState

1234