| /external/tensorflow/tensorflow/c/ |
| while_loop_test.cc | 29 CApiWhileLoopTest() : s_(TF_NewStatus()), graph_(TF_NewGraph()) {}
32 TF_DeleteGraph(graph_); variable
42 graph_, s_, ::tensorflow::strings::StrCat("p", i).c_str());
50 TF_NewWhile(graph_, &inputs_[0], inputs_.size(), s_)));
89 csession_.reset(new CSession(graph_, s_));
117 TF_GraphToGraphDef(graph_, buf, s_);
127 TF_Graph* graph_; member in class:__anon38659::CApiWhileLoopTest
134 // Used to verify that errors don't change graph_
189 EXPECT_TRUE(TF_GraphOperationByName(graph_, cond_name.c_str()) == nullptr);
190 EXPECT_TRUE(TF_GraphOperationByName(graph_, body_name.c_str()) == nullptr)
[all...] |
| c_api_test.cc | 1193 TF_DeleteGraph(graph_); variable
1254 TF_Graph* graph_; member in class:tensorflow::__anon38651::CApiColocationTest
1447 TF_DeleteGraph(graph_); variable
1685 TF_Graph* graph_; member in class:tensorflow::__anon38651::CApiGradientsTest
1729 TF_DeleteGraph(graph_); variable
1751 TF_Graph* graph_; member in class:tensorflow::__anon38651::CApiAttributesTest
[all...] |
| /external/tensorflow/tensorflow/core/graph/ |
| gradients.cc | 138 Graph* graph_; // Not owned. member in class:tensorflow::SymbolicGradientBuilder
187 graph_(graph) {
221 pending_.resize(graph_->num_node_ids(), 0);
273 Node* zero_like = AddZerosLike(graph_, src);
282 ndef.set_name(graph_->NewName(kNodeLabel));
290 Node* add = graph_->AddNode(ndef, &s);
294 graph_->AddEdge(nout.node, nout.index, add, i);
347 Node* grad = AddSymGrad(graph_, n, dy);
350 graph_->AddEdge(e->src(), e->src_output(), grad, e->dst_input());
353 graph_->AddEdge(dy[i].node, dy[i].index, grad, num_x + i)
[all...] |
| graph_constructor_test.cc | 47 GraphConstructorTest() : graph_(OpRegistry::Global()) {}
60 Status status = ConvertGraphDefToGraph(opts, gdef_, &graph_);
79 Status status = ImportGraphDef(opts, gdef_, &graph_, refiner, results);
93 TF_CHECK_OK(ConvertGraphDefToGraph(opts, gdef_, &graph_));
100 Status s = ImportGraphDef(opts, gdef_, &graph_, refiner, results);
105 EXPECT_EQ(min_consumer, graph_.versions().min_consumer())
107 << graph_.versions().min_consumer();
108 EXPECT_EQ(producer, graph_.versions().producer())
110 << graph_.versions().producer();
114 for (Node* n : graph_.nodes())
166 Graph graph_; member in class:tensorflow::__anon39619::GraphConstructorTest
[all...] |
| graph_test.cc | 52 GraphTest() : graph_(OpRegistry::Global()) {}
72 for (const Node* n : graph_.nodes()) {
76 EXPECT_EQ(nodes, graph_.num_nodes());
78 for (const Edge* e : graph_.edges()) {
82 EXPECT_EQ(edges, graph_.num_edges());
87 TF_CHECK_OK(NodeBuilder(name, "NoOp").Finalize(&graph_, &node));
102 Node* node = graph_.AddNode(node_def, &s);
111 TF_CHECK_OK(ConvertGraphDefToGraph(opts, gdef, &graph_));
115 for (Node* node : graph_.nodes()) {
138 Graph graph_; member in class:tensorflow::__anon39623::GraphTest
[all...] |
| graph.h | 263 Graph* graph_; member in class:tensorflow::Node
713 // Invariant: id_ == graph_->num_node_ids() || graph_->FindId(id_) != nullptr
714 const Graph* graph_; member in class:tensorflow::NodeIter
736 : graph_(graph), id_(id) {}
739 DCHECK(graph_ == rhs.graph_);
749 DCHECK_LE(id_, graph_->num_node_ids());
751 if (id_ >= graph_->num_node_ids() || graph_->FindNodeId(id_) != nullptr)
[all...] |
| /external/v8/src/compiler/ |
| control-equivalence.h | 38 graph_(graph),
168 Graph* const graph_; member in class:v8::internal::compiler::final
|
| instruction-scheduler.h | 203 ZoneVector<ScheduleGraphNode*> graph_; member in class:v8::internal::compiler::final
|
| js-graph.h | 34 graph_(graph),
152 Graph* graph() const { return graph_; }
189 Graph* graph_; member in class:v8::internal::compiler::JSGraph
|
| escape-analysis.cc | 81 Graph* graph() const { return graph_; }
112 Graph* const graph_; member in class:v8::internal::compiler::EscapeStatusAnalysis
584 graph_(graph),
[all...] |
| pipeline.cc | 102 graph_ = new (graph_zone_) Graph(graph_zone_);
103 source_positions_ = new (graph_zone_) SourcePositionTable(graph_);
112 JSGraph(isolate_, graph_, common_, javascript_, simplified_, machine_);
126 graph_(jsgraph->graph()),
149 graph_(graph),
202 Graph* graph() const { return graph_; }
258 graph_ = nullptr;
346 Graph* graph_ = nullptr; member in class:v8::internal::compiler::PipelineData
[all...] |
| /art/compiler/optimizing/ |
| gvn.cc | 346 : graph_(graph),
362 HGraph* graph_; member in class:art::GlobalValueNumberer
402 sets_[graph_->GetEntryBlock()->GetBlockId()] = new (&allocator_) ValueSet(&allocator_);
406 for (HBasicBlock* block : graph_->GetReversePostOrder()) {
561 GlobalValueNumberer gvn(graph_, side_effects_);
|
| induction_var_analysis_test.cc | 45 graph_ = CreateGraph();
53 loop_preheader_[d] = new (GetAllocator()) HBasicBlock(graph_);
54 graph_->AddBlock(loop_preheader_[d]);
55 loop_header_[d] = new (GetAllocator()) HBasicBlock(graph_);
56 graph_->AddBlock(loop_header_[d]);
61 loop_body_[d] = new (GetAllocator()) HBasicBlock(graph_);
62 graph_->AddBlock(loop_body_[d]);
77 graph_->SetNumberOfVRegs(n + 3);
80 entry_ = new (GetAllocator()) HBasicBlock(graph_);
81 graph_->AddBlock(entry_)
203 HGraph* graph_; member in class:art::InductionVarAnalysisTest
[all...] |
| induction_var_range_test.cc | 35 : graph_(CreateGraph()),
36 iva_(new (GetAllocator()) HInductionVarAnalysis(graph_)),
61 graph_->SetNumberOfVRegs(1);
62 entry_block_ = new (GetAllocator()) HBasicBlock(graph_);
63 exit_block_ = new (GetAllocator()) HBasicBlock(graph_);
64 graph_->AddBlock(entry_block_);
65 graph_->AddBlock(exit_block_);
66 graph_->SetEntryBlock(entry_block_);
67 graph_->SetExitBlock(exit_block_);
69 x_ = new (GetAllocator()) HParameterValue(graph_->GetDexFile()
305 HGraph* graph_; member in class:art::InductionVarRangeTest
[all...] |
| bounds_check_elimination_test.cc | 37 BoundsCheckEliminationTest() : graph_(CreateGraph()) {
38 graph_->SetHasBoundsChecks(true);
44 graph_->BuildDominatorTree();
46 InstructionSimplifier(graph_, /* codegen */ nullptr, /* driver */ nullptr).Run();
48 SideEffectsAnalysis side_effects(graph_);
51 GVNOptimization(graph_, side_effects).Run();
53 HInductionVarAnalysis induction(graph_);
56 BoundsCheckElimination(graph_, side_effects, &induction).Run();
59 HGraph* graph_; member in class:art::BoundsCheckEliminationTest
67 HBasicBlock* entry = new (GetAllocator()) HBasicBlock(graph_);
[all...] |
| load_store_analysis_test.cc | 27 LoadStoreAnalysisTest() : graph_(CreateGraph()) { }
29 HGraph* graph_; member in class:art::LoadStoreAnalysisTest
33 HBasicBlock* entry = new (GetAllocator()) HBasicBlock(graph_);
34 graph_->AddBlock(entry);
35 graph_->SetEntryBlock(entry);
48 graph_->GetDexFile(), dex::TypeIndex(0), 0, DataType::Type::kReference);
50 graph_->GetDexFile(), dex::TypeIndex(1), 1, DataType::Type::kInt32);
51 HInstruction* c1 = graph_->GetIntConstant(1);
52 HInstruction* c2 = graph_->GetIntConstant(2);
53 HInstruction* c3 = graph_->GetIntConstant(3)
[all...] |
| code_generator.h | 197 HGraph* GetGraph() const { return graph_; }
745 HGraph* const graph_; member in class:art::CodeGenerator
915 HGraph* const graph_; member in class:art::SlowPathGenerator
[all...] |
| optimizing_compiler.cc | 113 : graph_(graph),
155 cached_method_name_ = graph_->GetDexFile().PrettyMethod(graph_->GetMethodIdx());
194 GraphChecker checker(graph_);
220 HGraph* const graph_; member in class:art::PassObserver
[all...] |
| ssa_liveness_analysis.h | 1290 HGraph* const graph_; member in class:art::SsaLivenessAnalysis
[all...] |
| /external/tensorflow/tensorflow/core/common_runtime/ |
| placer.cc | 104 : graph_(graph),
135 for (Node* node : graph_->nodes()) {
416 for (Node* node : graph_->nodes()) {
469 for (const Node* node : graph_->nodes()) {
620 Graph* const graph_; // Not owned. member in class:tensorflow::__anon39500::ColocationGraph
642 : graph_(graph),
659 graph_, devices_,
674 for (const Edge* edge : graph_->edges()) {
742 for (Node* node : graph_->op_nodes()) {
800 assigned_device = graph_->InternDeviceName((*devices)[0]->name())
[all...] |
| /external/v8/src/crankshaft/ |
| lithium-allocator.h | 350 HGraph* graph() const { return graph_; }
351 Isolate* isolate() const { return graph_->isolate(); }
545 HGraph* graph_; member in class:v8::internal::BASE_EMBEDDED
|
| /system/update_engine/payload_generator/ |
| inplace_generator.cc | 87 : graph_(graph) {}
89 // Compares the operations in the vertex a and b of graph_.
91 return diff_utils::CompareAopsByDestination((*graph_)[a].aop,
92 (*graph_)[b].aop);
96 const Graph* const graph_; member in class:chromeos_update_engine::__anon3871::IndexedInstallOperationsDstComparator
|
| /external/tensorflow/tensorflow/compiler/tf2xla/ |
| functionalize_control_flow.cc | 622 : library_(library), graph_(graph), dump_graphs_(dump_graphs) {}
662 // Returns the switch clusters of graph_ in postorder. Dead switch nodes are
686 Graph* graph_; member in class:tensorflow::FunctionalizeCond
783 std::vector<UnionFind<Cluster>> clusters(graph_->num_node_ids());
787 DFS(*graph_, nullptr, [&](Node* n) {
811 graph_->RemoveNode(n);
[all...] |
| /external/tensorflow/tensorflow/contrib/tensorboard/db/ |
| summary_db_writer.cc | 252 : db_(db), txn_(txn), graph_(graph), now_(now), graph_id_(graph_id) {}
255 size_t toto = static_cast<size_t>(graph_->node_size());
258 for (int node_id = 0; node_id < graph_->node_size(); ++node_id) {
261 name_copies_.emplace_back(graph_->node(node_id).name());
279 for (int node_id = 0; node_id < graph_->node_size(); ++node_id) {
280 const NodeDef& node = graph_->node(node_id);
331 for (int node_id = 0; node_id < graph_->node_size(); ++node_id) {
332 NodeDef* node = graph_->mutable_node(node_id);
367 graph_->clear_node();
369 if (graph_->SerializeToString(&graph_def))
387 GraphDef* const graph_; member in class:tensorflow::__anon39434::GraphWriter
[all...] |
| /external/tensorflow/tensorflow/compiler/jit/ |
| encapsulate_subgraphs_pass.cc | 407 std::unique_ptr<Graph> graph_; member in class:tensorflow::__anon38700::Encapsulator::Subgraph
636 if (!graph_) {
637 graph_.reset(new Graph(graph_in->op_registry()));
638 graph_->set_versions(graph_in->versions());
647 return graph_->CopyNode(node);
650 Graph* Encapsulator::Subgraph::GetGraph() const { return graph_.get(); }
672 Node* arg = graph_->AddNode(arg_def, &s);
682 graph_->AddEdge(args_[arg_index], 0, dst_image, dst_slot);
707 Node* ret = graph_->AddNode(ret_def, &s);
710 graph_->AddEdge(src_image, src_slot, ret, 0)
[all...] |
