40   AdjacencyListGraph alg(graph_,  in TEST_F()
57   graph_->ClearDominanceInformation();  in TEST_F()
58   graph_->BuildDominatorTree();  in TEST_F()
62       std::all_of(graph_->GetBlocks().begin(), graph_->GetBlocks().end(), [&](HBasicBlock* b) {  in TEST_F()
63         return b == graph_->GetEntryBlock() || b == nullptr || b->GetDominator() != nullptr;  in TEST_F()
66       std::any_of(graph_->GetBlocks().begin(), graph_->GetBlocks().end(), [&](HBasicBlock* b) {  in TEST_F()
71   graph_->ClearLoopInformation();  in TEST_F()
72   graph_->ClearDominanceInformation();  in TEST_F()
76       std::none_of(graph_->GetBlocks().begin(), graph_->GetBlocks().end(), [&](HBasicBlock* b) {  in TEST_F()
80       std::all_of(graph_->GetBlocks().begin(), graph_->GetBlocks().end(), [&](HBasicBlock* b) {  in TEST_F()
96   AdjacencyListGraph alg(graph_,  in TEST_F()
113   graph_->ClearDominanceInformation();  in TEST_F()
114   graph_->BuildDominatorTree();  in TEST_F()
118       std::all_of(graph_->GetBlocks().begin(), graph_->GetBlocks().end(), [&](HBasicBlock* b) {  in TEST_F()
119         return b == graph_->GetEntryBlock() || b == nullptr || b->GetDominator() != nullptr;  in TEST_F()
122       std::any_of(graph_->GetBlocks().begin(), graph_->GetBlocks().end(), [&](HBasicBlock* b) {  in TEST_F()
127   graph_->ClearDominanceInformation();  in TEST_F()
128   graph_->ClearLoopInformation();  in TEST_F()
132       std::none_of(graph_->GetBlocks().begin(), graph_->GetBlocks().end(), [&](HBasicBlock* b) {  in TEST_F()
136       std::all_of(graph_->GetBlocks().begin(), graph_->GetBlocks().end(), [&](HBasicBlock* b) {  in TEST_F()