/external/tensorflow/tensorflow/core/graph/ |
H A D | 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::__anon26302::GraphTest [all...] |
H A D | graph_def_builder.h | 121 return graph_->op_registry(); 136 Graph* const graph_; member in class:tensorflow::GraphDefBuilder::Options 147 : graph_(op_registry), opts_(&graph_, &status_) {} 155 : graph_(op_registry), opts_(&graph_, nullptr) {} 169 return graph_.AddFunctionLibrary(fdef_lib); 175 return graph_.flib_def().Find(name) != nullptr; 179 Graph graph_; member in class:tensorflow::GraphDefBuilder
|
H A D | mkl_tfconversion_pass_test.cc | 44 MklToTfConversionPass() : graph_(OpRegistry::Global()) {} 56 InitGraph(s, &graph_); 57 original_ = CanonicalGraphString(&graph_); 94 string before = CanonicalGraphString(&graph_); 97 std::unique_ptr<Graph>* ug = new std::unique_ptr<Graph>(&graph_); 100 string result = CanonicalGraphString(&graph_); 107 Graph graph_; member in class:tensorflow::__anon26310::MklToTfConversionPass
|
H A D | 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_ 166 Graph graph_; member in class:tensorflow::__anon26298::GraphConstructorTest [all...] |
H A D | optimizer_cse_test.cc | 49 OptimizerCSETest() : graph_(OpRegistry::Global()) {} 52 ::tensorflow::InitGraph(s, &graph_); 53 original_ = CanonicalGraphString(&graph_); 90 string before = CanonicalGraphString(&graph_); 93 OptimizeCSE(&graph_, consider_fn); 95 string result = CanonicalGraphString(&graph_); 102 Graph graph_; member in class:tensorflow::__anon26312::OptimizerCSETest
|
/external/v8/src/compiler/ |
H A D | tail-call-optimization.h | 25 : common_(common), graph_(graph) {} 31 Graph* graph() const { return graph_; } 34 Graph* const graph_; member in class:v8::internal::compiler::final
|
H A D | select-lowering.h | 29 Graph* graph() const { return graph_; } 32 Graph* graph_; member in class:v8::internal::compiler::final
|
H A D | compiler-source-position-table.cc | 28 : graph_(graph), 35 decorator_ = new (graph_->zone()) Decorator(this); 36 graph_->AddDecorator(decorator_); 41 graph_->RemoveDecorator(decorator_);
|
H A D | control-flow-optimizer.h | 37 Graph* graph() const { return graph_; } 42 Graph* const graph_; member in class:v8::internal::compiler::final
|
H A D | dead-code-elimination.h | 43 Graph* graph() const { return graph_; } 47 Graph* const graph_; member in class:v8::internal::compiler::final
|
H A D | graph-trimmer.h | 49 Graph* graph() const { return graph_; } 51 Graph* const graph_; member in class:v8::internal::compiler::final
|
H A D | common-operator-reducer.h | 46 Graph* graph() const { return graph_; } 51 Graph* const graph_; member in class:v8::internal::compiler::final
|
H A D | typer.h | 41 Graph* graph() const { return graph_; } 48 Graph* const graph_; member in class:v8::internal::compiler::Typer
|
H A D | instruction-scheduler.cc | 85 graph_(zone), 94 DCHECK(graph_.empty()); 111 graph_.clear(); 126 for (ScheduleGraphNode* node : graph_) { 197 graph_.push_back(new_node); 209 for (ScheduleGraphNode* node : graph_) { 347 for (ScheduleGraphNode* node : base::Reversed(graph_)) {
|
/external/tensorflow/tensorflow/core/distributed_runtime/ |
H A D | scheduler.cc | 75 : graph_(g), cost_model_(cost_model) {} 78 asap_times->resize(graph_->num_node_ids()); 80 std::vector<int> pending_count(graph_->num_node_ids()); 81 InitializePending(graph_, &pending_count); 84 Node* srcNode = graph_->source_node(); 116 return (*asap_times)[graph_->sink_node()->id()]; 120 alap_times->resize(graph_->num_node_ids()); 123 pending_count.resize(graph_->num_node_ids()); 124 for (const Node* n : graph_->nodes()) { 141 Node* sinkNode = graph_ [all...] |
H A D | scheduler.h | 49 const Graph* graph_; member in class:tensorflow::SlackAnalysis 86 const Graph* graph_; member in class:tensorflow::GreedyScheduler 111 const Graph* graph_; member in class:tensorflow::PriorityScheduler
|
/external/tensorflow/tensorflow/compiler/tf2xla/ |
H A D | graph_compiler.h | 63 graph_(graph), 87 Graph* graph_; member in class:tensorflow::GraphCompiler
|
/external/tensorflow/tensorflow/core/grappler/optimizers/ |
H A D | auto_parallel.cc | 35 NodeDef* node = graph_.add_node(); 53 NodeDef* node = graph_.add_node(); 80 graph_ = item.graph; 81 LOG(INFO) << "Original graph size: " << graph_.node_size(); 113 for (int i = 0; i < graph_.node_size(); i++) { 115 std::make_pair(graph_.node(i).name(), graph_.mutable_node(i))); 116 if (apply_gradients_ops.find(graph_.node(i).op()) != 118 apply_gradients_nodes_.insert(graph_.node(i).name()); 119 VLOG(2) << "Apply gradients node: " << graph_ [all...] |
/external/tensorflow/tensorflow/core/common_runtime/ |
H A D | placer.h | 91 Graph* const graph_; // Not owned. member in class:tensorflow::Placer
|
H A D | graph_execution_state.h | 142 const Graph* full_graph() { return graph_; } 149 return graph_->FindNodeId(iter->second); 199 Graph* graph_; member in class:tensorflow::GraphExecutionState
|
/external/v8/src/crankshaft/ |
H A D | hydrogen-flow-engine.h | 71 : graph_(graph), 78 loop_effects_.AddBlock(NULL, graph_->blocks()->length(), zone); 97 for (int i = root->block_id(); i < graph_->blocks()->length(); i++) { 98 HBasicBlock* block = graph_->blocks()->at(i); 154 HBasicBlock* member = graph_->blocks()->at(i); 191 pred_counts_.AddBlock(0, graph_->blocks()->length(), zone_); 194 block_states_.AddBlock(NULL, graph_->blocks()->length(), zone_); 207 HGraph* graph_; // The hydrogen graph. member in class:v8::internal::HFlowEngine
|
/external/tensorflow/tensorflow/c/ |
H A D | 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:__anon25338::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_nam [all...] |
/external/tensorflow/tensorflow/cc/framework/ |
H A D | scope.cc | 41 : graph_(graph), 53 : graph_(graph), 79 : graph_(other.impl()->graph_), 96 : graph_(other.impl()->graph_), 112 : graph_(other.impl()->graph_), 133 : graph_(other.impl()->graph_), [all...] |
/external/tensorflow/tensorflow/contrib/lite/ |
H A D | arena_planner_test.cc | 114 explicit TestGraphInfo(TestGraph* graph) : graph_(graph) {} 116 size_t num_tensors() const override { return graph_->tensors()->size(); } 118 return &graph_->tensors()->at(index); 120 size_t num_nodes() const override { return graph_->nodes().size(); } 122 return graph_->nodes()[index]; 124 const std::vector<int>& inputs() const override { return graph_->inputs(); } 125 const std::vector<int>& outputs() const override { return graph_->outputs(); } 128 TestGraph* graph_; member in class:tflite::__anon25861::TestGraphInfo 146 graph_ = graph; 161 const TfLiteTensor& tensor = (*graph_ 178 TestGraph* graph_; member in class:tflite::__anon25861::ArenaPlannerTest [all...] |
/external/tensorflow/tensorflow/cc/client/ |
H A D | client_session.cc | 35 : session_(session), graph_(std::move(graph)) {} 41 std::shared_ptr<Graph> graph_; member in class:tensorflow::ClientSession::Impl 95 int num_nodes = graph_->num_node_ids(); 98 graph_->ToGraphDefSubRange(&graph_def, last_num_graph_nodes_);
|