251   HBasicBlock* exit = graph_->GetExitBlock();  in SimplifyAlwaysThrows()
252   if (!graph_->HasAlwaysThrowingInvokes() || exit == nullptr) {  in SimplifyAlwaysThrows()
259   for (HBasicBlock* block : graph_->GetReversePostOrder()) {  in SimplifyAlwaysThrows()
314     graph_->ClearLoopInformation();  in SimplifyAlwaysThrows()
315     graph_->ClearDominanceInformation();  in SimplifyAlwaysThrows()
316     graph_->BuildDominatorTree();  in SimplifyAlwaysThrows()
329   for (HBasicBlock* block : graph_->GetPostOrder()) {  in SimplifyIfs()
440       graph_->ClearLoopInformation();  in SimplifyIfs()
441       graph_->ClearDominanceInformation();  in SimplifyIfs()
442       graph_->BuildDominatorTree();  in SimplifyIfs()
444       graph_->ClearDominanceInformation();  in SimplifyIfs()
446       graph_->SimplifyCFG();  in SimplifyIfs()
447       graph_->ComputeDominanceInformation();  in SimplifyIfs()
448       graph_->ComputeTryBlockInformation();  in SimplifyIfs()
508   HPhi* new_phi = new (graph_->GetAllocator())  in MaybeAddPhi()
509       HPhi(graph_->GetAllocator(), kNoRegNumber, pred_size, DataType::Type::kInt32);  in MaybeAddPhi()
556           same_input == dominated_by_true ? graph_->GetIntConstant(1) : graph_->GetIntConstant(0));  in MaybeAddPhi()
576   for (size_t i = 1u, size = graph_->GetReversePostOrder().size(); i != size; ++i) {  in ConnectSuccessiveBlocks()
577     HBasicBlock* block  = graph_->GetReversePostOrder()[i];  in ConnectSuccessiveBlocks()
584       DCHECK_LT(i, IndexOfElement(graph_->GetReversePostOrder(), successor));  in ConnectSuccessiveBlocks()
587       DCHECK_EQ(size, graph_->GetReversePostOrder().size());  in ConnectSuccessiveBlocks()
588       DCHECK_EQ(block, graph_->GetReversePostOrder()[i]);  in ConnectSuccessiveBlocks()
638   block->AddInstruction(new (graph_->GetAllocator()) HGoto(last->GetDexPc()));  in DisconnectHandlersAndUpdateTryBoundary()
676         predecessor->ReplaceSuccessor(block, graph_->GetExitBlock());  in RemoveTry()
681           DCHECK_EQ(graph_->GetExitBlock()->GetDominator(), block);  in RemoveTry()
682           predecessor->AddDominatedBlock(graph_->GetExitBlock());  in RemoveTry()
683           graph_->GetExitBlock()->SetDominator(predecessor);  in RemoveTry()
684           block->RemoveDominatedBlock(graph_->GetExitBlock());  in RemoveTry()
692   if (!graph_->HasTryCatch()) {  in RemoveUnneededTries()
697   ScopedArenaAllocator allocator(graph_->GetArenaStack());  in RemoveUnneededTries()
701   for (HBasicBlock* block : graph_->GetReversePostOrderSkipEntryBlock()) {  in RemoveUnneededTries()
781   ScopedArenaAllocator allocator(graph_->GetArenaStack());  in RemoveDeadBlocks()
784   ArenaBitVector live_blocks(&allocator, graph_->GetBlocks().size(), false, kArenaAllocDCE);  in RemoveDeadBlocks()
787   MarkReachableBlocks(graph_, &live_blocks);  in RemoveDeadBlocks()
794   for (HBasicBlock* block : graph_->GetPostOrder()) {  in RemoveDeadBlocks()
810       graph_->ClearLoopInformation();  in RemoveDeadBlocks()
811       graph_->ClearDominanceInformation();  in RemoveDeadBlocks()
812       graph_->BuildDominatorTree();  in RemoveDeadBlocks()
814       graph_->ClearDominanceInformation();  in RemoveDeadBlocks()
815       graph_->ComputeDominanceInformation();  in RemoveDeadBlocks()
816       graph_->ComputeTryBlockInformation();  in RemoveDeadBlocks()
825   for (HBasicBlock* block : graph_->GetPostOrder()) {  in RemoveDeadInstructions()
849   for (HBasicBlock* block : graph_->GetReversePostOrder()) {  in UpdateGraphFlags()
864   graph_->SetHasMonitorOperations(has_monitor_operations);  in UpdateGraphFlags()
865   graph_->SetHasSIMD(has_simd);  in UpdateGraphFlags()
866   graph_->SetHasBoundsChecks(has_bounds_checks);  in UpdateGraphFlags()
867   graph_->SetHasAlwaysThrowingInvokes(has_always_throwing_invokes);  in UpdateGraphFlags()
874   if (!graph_->HasIrreducibleLoops()) {  in Run()
891   SsaRedundantPhiElimination(graph_).Run();  in Run()