Cross Reference: /art/compiler/optimizing/graph

Lines Matching refs:graph
28 static HBasicBlock* createIfBlock(HGraph* graph, ArenaAllocator* allocator) {
29   HBasicBlock* if_block = new (allocator) HBasicBlock(graph);
30   graph->AddBlock(if_block);
31   HInstruction* instr = graph->GetIntConstant(4);
39 static HBasicBlock* createGotoBlock(HGraph* graph, ArenaAllocator* allocator) {
40   HBasicBlock* block = new (allocator) HBasicBlock(graph);
41   graph->AddBlock(block);
47 static HBasicBlock* createEntryBlock(HGraph* graph, ArenaAllocator* allocator) {
48   HBasicBlock* block = createGotoBlock(graph, allocator);
49   graph->SetEntryBlock(block);
53 static HBasicBlock* createReturnBlock(HGraph* graph, ArenaAllocator* allocator) {
54   HBasicBlock* block = new (allocator) HBasicBlock(graph);
55   graph->AddBlock(block);
61 static HBasicBlock* createExitBlock(HGraph* graph, ArenaAllocator* allocator) {
62   HBasicBlock* block = new (allocator) HBasicBlock(graph);
63   graph->AddBlock(block);
76   HGraph* graph = CreateGraph(&allocator);
77   HBasicBlock* entry_block = createEntryBlock(graph, &allocator);
78   HBasicBlock* if_block = createIfBlock(graph, &allocator);
79   HBasicBlock* if_true = createGotoBlock(graph, &allocator);
80   HBasicBlock* return_block = createReturnBlock(graph, &allocator);
81   HBasicBlock* exit_block = createExitBlock(graph, &allocator);
92   graph->SimplifyCFG();
111   HGraph* graph = CreateGraph(&allocator);
112   HBasicBlock* entry_block = createEntryBlock(graph, &allocator);
113   HBasicBlock* if_block = createIfBlock(graph, &allocator);
114   HBasicBlock* if_false = createGotoBlock(graph, &allocator);
115   HBasicBlock* return_block = createReturnBlock(graph, &allocator);
116   HBasicBlock* exit_block = createExitBlock(graph, &allocator);
127   graph->SimplifyCFG();
146   HGraph* graph = CreateGraph(&allocator);
147   HBasicBlock* entry_block = createEntryBlock(graph, &allocator);
148   HBasicBlock* if_block = createIfBlock(graph, &allocator);
149   HBasicBlock* return_block = createReturnBlock(graph, &allocator);
150   HBasicBlock* exit_block = createExitBlock(graph, &allocator);
160   graph->BuildDominatorTree();
181   HGraph* graph = CreateGraph(&allocator);
182   HBasicBlock* entry_block = createEntryBlock(graph, &allocator);
183   HBasicBlock* if_block = createIfBlock(graph, &allocator);
184   HBasicBlock* return_block = createReturnBlock(graph, &allocator);
185   HBasicBlock* exit_block = createExitBlock(graph, &allocator);
195   graph->BuildDominatorTree();
216   HGraph* graph = CreateGraph(&allocator);
217   HBasicBlock* entry_block = createEntryBlock(graph, &allocator);
218   HBasicBlock* first_if_block = createIfBlock(graph, &allocator);
219   HBasicBlock* if_block = createIfBlock(graph, &allocator);
220   HBasicBlock* loop_block = createGotoBlock(graph, &allocator);
221   HBasicBlock* return_block = createReturnBlock(graph, &allocator);
234   graph->BuildDominatorTree();
255   HGraph* graph = CreateGraph(&allocator);
256   HBasicBlock* entry_block = createEntryBlock(graph, &allocator);
257   HBasicBlock* first_if_block = createIfBlock(graph, &allocator);
258   HBasicBlock* if_block = createIfBlock(graph, &allocator);
259   HBasicBlock* loop_block = createGotoBlock(graph, &allocator);
260   HBasicBlock* return_block = createReturnBlock(graph, &allocator);
272   graph->BuildDominatorTree();
291   HGraph* graph = CreateGraph(&allocator);
292   HBasicBlock* block = createGotoBlock(graph, &allocator);