| /external/tensorflow/tensorflow/core/common_runtime/ |
| 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/tensorflow/tensorflow/core/distributed_runtime/ |
| 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/core/graph/ |
| 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
|
| mkl_layout_pass_test.cc | 65 MklLayoutPassTest() : graph_(OpRegistry::Global()) {}
68 ::tensorflow::InitGraph(s, &graph_, device);
69 original_ = CanonicalGraphString(&graph_);
106 string before = CanonicalGraphString(&graph_);
109 std::unique_ptr<Graph>* ug = new std::unique_ptr<Graph>(&graph_);
112 string result = CanonicalGraphString(&graph_);
119 Graph graph_; member in class:tensorflow::__anon39630::MklLayoutPassTest
[all...] |
| 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::__anon39631::MklToTfConversionPass
|
| 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::__anon39633::OptimizerCSETest
|
| /external/v8/src/compiler/ |
| graph.h | 43 : graph_(graph), start_(graph->start()), end_(graph->end()) {}
45 graph_->SetStart(start_);
46 graph_->SetEnd(end_);
50 Graph* const graph_; member in class:v8::internal::compiler::final::final
|
| typer.h | 41 Graph* graph() const { return graph_; }
48 Graph* const graph_; member in class:v8::internal::compiler::Typer
|
| graph-reducer.h | 130 Graph* graph() const { return graph_; }
173 Graph* const graph_; member in class:v8::internal::compiler::GraphReducer
|
| int64-lowering.h | 42 Graph* graph() const { return graph_; }
69 Graph* const graph_; member in class:v8::internal::compiler::Int64Lowering
|
| loop-variable-optimizer.h | 102 Graph* graph() { return graph_; }
106 Graph* graph_; member in class:v8::internal::compiler::LoopVariableOptimizer
|
| scheduler.h | 65 Graph* graph_; member in class:v8::internal::compiler::Scheduler
|
| simd-scalar-lowering.h | 42 Graph* graph() const { return graph_; }
70 Graph* const graph_; member in class:v8::internal::compiler::SimdScalarLowering
|
| /art/compiler/optimizing/ |
| loop_optimization_test.cc | 30 : graph_(CreateGraph()),
31 iva_(new (GetAllocator()) HInductionVarAnalysis(graph_)),
32 loop_opt_(new (GetAllocator()) HLoopOptimization(graph_, nullptr, iva_, nullptr)) {
40 graph_->SetNumberOfVRegs(1);
41 entry_block_ = new (GetAllocator()) HBasicBlock(graph_);
42 return_block_ = new (GetAllocator()) HBasicBlock(graph_);
43 exit_block_ = new (GetAllocator()) HBasicBlock(graph_);
44 graph_->AddBlock(entry_block_);
45 graph_->AddBlock(return_block_);
46 graph_->AddBlock(exit_block_)
103 HGraph* graph_; member in class:art::LoopOptimizationTest
[all...] |
| nodes_vector_test.cc | 29 : graph_(CreateGraph()) {
36 graph_->SetNumberOfVRegs(1);
37 entry_block_ = new (GetAllocator()) HBasicBlock(graph_);
38 exit_block_ = new (GetAllocator()) HBasicBlock(graph_);
39 graph_->AddBlock(entry_block_);
40 graph_->AddBlock(exit_block_);
41 graph_->SetEntryBlock(entry_block_);
42 graph_->SetExitBlock(exit_block_);
43 int8_parameter_ = new (GetAllocator()) HParameterValue(graph_->GetDexFile(),
48 int16_parameter_ = new (GetAllocator()) HParameterValue(graph_->GetDexFile()
61 HGraph* graph_; member in class:art::NodesVectorTest
[all...] |
| optimization.h | 38 : graph_(graph),
54 HGraph* const graph_; member in class:art::HOptimization
|
| optimizing_cfi_test.cc | 53 graph_(nullptr),
66 graph_ = CreateGraph();
68 code_gen_ = CodeGenerator::Create(graph_, isa, *isa_features_, opts_);
154 HGraph* graph_; member in class:art::OptimizingCFITest
|
| ssa_liveness_analysis_test.cc | 33 : graph_(CreateGraph()),
39 codegen_ = CodeGenerator::Create(graph_,
45 entry_ = new (GetAllocator()) HBasicBlock(graph_);
46 graph_->AddBlock(entry_);
47 graph_->SetEntryBlock(entry_);
59 HGraph* graph_; member in class:art::SsaLivenessAnalysisTest
69 graph_->GetDexFile(), dex::TypeIndex(0), 0, DataType::Type::kInt32);
77 graph_->BuildDominatorTree();
78 SsaLivenessAnalysis ssa_analysis(graph_, codegen_.get(), GetScopedAllocator());
89 graph_->GetDexFile(), dex::TypeIndex(0), 0, DataType::Type::kReference)
[all...] |
| superblock_cloner.h | 277 DCHECK(block_id < graph_->GetBlocks().size());
278 HBasicBlock* block = graph_->GetBlocks()[block_id];
283 HGraph* const graph_; member in class:art::SuperblockCloner
|
| scheduler_test.cc | 76 SchedulerTest() : graph_(CreateGraph()) { }
80 HBasicBlock* entry = new (GetAllocator()) HBasicBlock(graph_);
81 HBasicBlock* block1 = new (GetAllocator()) HBasicBlock(graph_);
82 graph_->AddBlock(entry);
83 graph_->AddBlock(block1);
84 graph_->SetEntryBlock(entry);
101 HInstruction* array = new (GetAllocator()) HParameterValue(graph_->GetDexFile(),
105 HInstruction* c1 = graph_->GetIntConstant(1);
106 HInstruction* c2 = graph_->GetIntConstant(10);
140 graph_->GetArtMethod()
349 HGraph* graph_; member in class:art::SchedulerTest
[all...] |
| superblock_cloner_test.cc | 34 : graph_(CreateGraph()), entry_block_(nullptr), exit_block_(nullptr), parameter_(nullptr) {}
38 entry_block_ = new (GetAllocator()) HBasicBlock(graph_);
39 graph_->AddBlock(entry_block_);
40 graph_->SetEntryBlock(entry_block_);
42 HBasicBlock* loop_preheader = new (GetAllocator()) HBasicBlock(graph_);
43 HBasicBlock* loop_header = new (GetAllocator()) HBasicBlock(graph_);
44 HBasicBlock* loop_body = new (GetAllocator()) HBasicBlock(graph_);
45 HBasicBlock* loop_exit = new (GetAllocator()) HBasicBlock(graph_);
47 graph_->AddBlock(loop_preheader);
48 graph_->AddBlock(loop_header)
153 HGraph* graph_; member in class:art::SuperblockClonerTest
[all...] |
| /external/googletest/googlemock/src/ |
| gmock-matchers.cc | 201 : graph_(&graph),
202 left_(graph_->LhsSize(), kUnused),
203 right_(graph_->RhsSize(), kUnused) {
222 for (size_t ilhs = 0; ilhs < graph_->LhsSize(); ++ilhs) {
227 // 'seen' initialized to 'graph_->RhsSize()' copies of 0.
228 seen.assign(graph_->RhsSize(), 0);
260 for (size_t irhs = 0; irhs < graph_->RhsSize(); ++irhs) {
263 if (!graph_->HasEdge(ilhs, irhs))
287 const MatchMatrix* graph_; // not owned member in class:testing::internal::MaxBipartiteMatchState
|
| /external/tensorflow/tensorflow/contrib/lite/ |
| 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::__anon39182::TestGraphInfo
146 graph_ = graph;
161 const TfLiteTensor& tensor = (*graph_->tensors())[tensor_index]
178 TestGraph* graph_; member in class:tflite::__anon39182::ArenaPlannerTest
[all...] |
| /external/v8/src/crankshaft/ |
| 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/v8/testing/gmock/src/ |
| gmock-matchers.cc | 201 : graph_(&graph),
202 left_(graph_->LhsSize(), kUnused),
203 right_(graph_->RhsSize(), kUnused) {
222 for (size_t ilhs = 0; ilhs < graph_->LhsSize(); ++ilhs) {
227 // 'seen' initialized to 'graph_->RhsSize()' copies of 0.
228 seen.assign(graph_->RhsSize(), 0);
260 for (size_t irhs = 0; irhs < graph_->RhsSize(); ++irhs) {
263 if (!graph_->HasEdge(ilhs, irhs))
287 const MatchMatrix* graph_; // not owned member in class:testing::internal::MaxBipartiteMatchState
|
