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_->ClearReachabilityInformation();  in AdjacencyListGraph()
168     graph_->ComputeDominanceInformation();  in AdjacencyListGraph()
169     graph_->ComputeReachabilityInformation();  in AdjacencyListGraph()
207     return graph_->Dump(os, /* codegen_= */ nullptr, namer);  in Dump()
211   HGraph* graph_;
222         graph_(nullptr),  in OptimizingUnitTestHelper()
253     graph_ = new (allocator) HGraph(
260     return graph_;
302     graph_->SetEntryBlock(entry_block_);
303     graph_->SetExitBlock(exit_block_);
318     HBasicBlock* block = new (GetAllocator()) HBasicBlock(graph_);  in AddNewBlock()
319     graph_->AddBlock(block);  in AddNewBlock()
327     return CheckGraph(graph_, oss);
335         graph_->GetArtMethod(),  in ManuallyBuildEnvFor()
389     return AdjacencyListGraph(graph_, GetAllocator(), entry_name, exit_name, adj);  in SetupFromAdjacencyList()
399     return new (GetAllocator()) HLoadClass(graph_->GetCurrentMethod(),
401                                            graph_->GetDexFile(),
415                                              graph_->GetDexFile(),
432                                                   graph_->GetDexFile(),
447                                                   graph_->GetDexFile(),
453     MethodReference method_reference{/* file= */ &graph_->GetDexFile(), /* index= */ method_idx_++};  in MakeInvoke()
465                               !graph_->IsDebuggable());  in MakeInvoke()
517         graph_->GetDexFile(), ti ? *ti : DefaultTypeIndexForType(type), param_count_++, type);
518     graph_->GetEntryBlock()->AddInstruction(val);
533   HGraph* graph_;  variable