Lines Matching refs:graph
29 HBasicBlock* CreateIfBlock(HGraph* graph);
30 HBasicBlock* CreateGotoBlock(HGraph* graph);
31 HBasicBlock* CreateEntryBlock(HGraph* graph);
32 HBasicBlock* CreateReturnBlock(HGraph* graph);
33 HBasicBlock* CreateExitBlock(HGraph* graph);
36 HBasicBlock* GraphTest::CreateIfBlock(HGraph* graph) { in CreateIfBlock() argument
37 HBasicBlock* if_block = new (GetAllocator()) HBasicBlock(graph); in CreateIfBlock()
38 graph->AddBlock(if_block); in CreateIfBlock()
39 HInstruction* instr = graph->GetIntConstant(4); in CreateIfBlock()
47 HBasicBlock* GraphTest::CreateGotoBlock(HGraph* graph) { in CreateGotoBlock() argument
48 HBasicBlock* block = new (GetAllocator()) HBasicBlock(graph); in CreateGotoBlock()
49 graph->AddBlock(block); in CreateGotoBlock()
55 HBasicBlock* GraphTest::CreateEntryBlock(HGraph* graph) { in CreateEntryBlock() argument
56 HBasicBlock* block = CreateGotoBlock(graph); in CreateEntryBlock()
57 graph->SetEntryBlock(block); in CreateEntryBlock()
61 HBasicBlock* GraphTest::CreateReturnBlock(HGraph* graph) { in CreateReturnBlock() argument
62 HBasicBlock* block = new (GetAllocator()) HBasicBlock(graph); in CreateReturnBlock()
63 graph->AddBlock(block); in CreateReturnBlock()
69 HBasicBlock* GraphTest::CreateExitBlock(HGraph* graph) { in CreateExitBlock() argument
70 HBasicBlock* block = new (GetAllocator()) HBasicBlock(graph); in CreateExitBlock()
71 graph->AddBlock(block); in CreateExitBlock()
81 HGraph* graph = CreateGraph(); in TEST_F() local
82 HBasicBlock* entry_block = CreateEntryBlock(graph); in TEST_F()
83 HBasicBlock* if_block = CreateIfBlock(graph); in TEST_F()
84 HBasicBlock* if_true = CreateGotoBlock(graph); in TEST_F()
85 HBasicBlock* return_block = CreateReturnBlock(graph); in TEST_F()
86 HBasicBlock* exit_block = CreateExitBlock(graph); in TEST_F()
97 graph->SimplifyCFG(); in TEST_F()
113 HGraph* graph = CreateGraph(); in TEST_F() local
114 HBasicBlock* entry_block = CreateEntryBlock(graph); in TEST_F()
115 HBasicBlock* if_block = CreateIfBlock(graph); in TEST_F()
116 HBasicBlock* if_false = CreateGotoBlock(graph); in TEST_F()
117 HBasicBlock* return_block = CreateReturnBlock(graph); in TEST_F()
118 HBasicBlock* exit_block = CreateExitBlock(graph); in TEST_F()
129 graph->SimplifyCFG(); in TEST_F()
145 HGraph* graph = CreateGraph(); in TEST_F() local
146 HBasicBlock* entry_block = CreateEntryBlock(graph); in TEST_F()
147 HBasicBlock* if_block = CreateIfBlock(graph); in TEST_F()
148 HBasicBlock* return_block = CreateReturnBlock(graph); in TEST_F()
149 HBasicBlock* exit_block = CreateExitBlock(graph); in TEST_F()
159 graph->BuildDominatorTree(); in TEST_F()
177 HGraph* graph = CreateGraph(); in TEST_F() local
178 HBasicBlock* entry_block = CreateEntryBlock(graph); in TEST_F()
179 HBasicBlock* if_block = CreateIfBlock(graph); in TEST_F()
180 HBasicBlock* return_block = CreateReturnBlock(graph); in TEST_F()
181 HBasicBlock* exit_block = CreateExitBlock(graph); in TEST_F()
191 graph->BuildDominatorTree(); in TEST_F()
209 HGraph* graph = CreateGraph(); in TEST_F() local
210 HBasicBlock* entry_block = CreateEntryBlock(graph); in TEST_F()
211 HBasicBlock* first_if_block = CreateIfBlock(graph); in TEST_F()
212 HBasicBlock* if_block = CreateIfBlock(graph); in TEST_F()
213 HBasicBlock* loop_block = CreateGotoBlock(graph); in TEST_F()
214 HBasicBlock* return_block = CreateReturnBlock(graph); in TEST_F()
227 graph->BuildDominatorTree(); in TEST_F()
245 HGraph* graph = CreateGraph(); in TEST_F() local
246 HBasicBlock* entry_block = CreateEntryBlock(graph); in TEST_F()
247 HBasicBlock* first_if_block = CreateIfBlock(graph); in TEST_F()
248 HBasicBlock* if_block = CreateIfBlock(graph); in TEST_F()
249 HBasicBlock* loop_block = CreateGotoBlock(graph); in TEST_F()
250 HBasicBlock* return_block = CreateReturnBlock(graph); in TEST_F()
262 graph->BuildDominatorTree(); in TEST_F()
278 HGraph* graph = CreateGraph(); in TEST_F() local
279 HBasicBlock* block = CreateGotoBlock(graph); in TEST_F()