Lines Matching refs:graph_
150 const std::vector<Edge>& adj) : graph_(graph) { in AdjacencyListGraph()
152 HBasicBlock* blk = new (alloc) HBasicBlock(graph_); in AdjacencyListGraph()
153 graph_->AddBlock(blk); in AdjacencyListGraph()
158 graph_->SetEntryBlock(entry); in AdjacencyListGraph()
159 graph_->SetExitBlock(exit); in AdjacencyListGraph()
167 graph_->ComputeDominanceInformation(); in AdjacencyListGraph()
205 return graph_->Dump(os, /* codegen_= */ nullptr, namer); in Dump()
209 HGraph* graph_;
220 graph_(nullptr), in OptimizingUnitTestHelper()
250 graph_ = new (allocator) HGraph(
257 return graph_;
299 graph_->SetEntryBlock(entry_block_);
300 graph_->SetExitBlock(exit_block_);
315 HBasicBlock* block = new (GetAllocator()) HBasicBlock(graph_); in AddNewBlock()
316 graph_->AddBlock(block); in AddNewBlock()
324 return CheckGraph(graph_, oss);
332 graph_->GetArtMethod(), in ManuallyBuildEnvFor()
386 return AdjacencyListGraph(graph_, GetAllocator(), entry_name, exit_name, adj); in SetupFromAdjacencyList()
396 return new (GetAllocator()) HLoadClass(graph_->GetCurrentMethod(),
398 graph_->GetDexFile(),
412 graph_->GetDexFile(),
429 graph_->GetDexFile(),
444 graph_->GetDexFile(),
450 MethodReference method_reference{/* file= */ &graph_->GetDexFile(), /* index= */ method_idx_++}; in MakeInvoke()
462 !graph_->IsDebuggable()); in MakeInvoke()
514 graph_->GetDexFile(), ti ? *ti : DefaultTypeIndexForType(type), param_count_++, type);
515 graph_->GetEntryBlock()->AddInstruction(val);
530 HGraph* graph_; variable