37   HGraph* graph = CreateGraph();  in CreateSimpleCFG()  local
38   HBasicBlock* entry_block = new (GetAllocator()) HBasicBlock(graph);  in CreateSimpleCFG()
40   graph->AddBlock(entry_block);  in CreateSimpleCFG()
41   graph->SetEntryBlock(entry_block);  in CreateSimpleCFG()
42   HBasicBlock* exit_block = new (GetAllocator()) HBasicBlock(graph);  in CreateSimpleCFG()
44   graph->AddBlock(exit_block);  in CreateSimpleCFG()
45   graph->SetExitBlock(exit_block);  in CreateSimpleCFG()
47   graph->BuildDominatorTree();  in CreateSimpleCFG()
48   return graph;  in CreateSimpleCFG()
52   HGraph* graph = CreateCFG(data);  in TestCode()  local
53   ASSERT_NE(graph, nullptr);  in TestCode()
55   GraphChecker graph_checker(graph);  in TestCode()
98   HGraph* graph = CreateSimpleCFG();  in TEST_F()  local
99   GraphChecker graph_checker(graph);  in TEST_F()
105   graph->GetExitBlock()->RemovePredecessor(graph->GetEntryBlock());  in TEST_F()
113   HGraph* graph = CreateSimpleCFG();  in TEST_F()  local
114   GraphChecker graph_checker(graph);  in TEST_F()
121   HBasicBlock* exit_block = graph->GetExitBlock();  in TEST_F()