Cross Reference: /art/compiler/optimizing/nodes

Lines Matching refs:graph
26  * Test that removing instruction from the graph removes itself from user lists
33   HGraph* graph = CreateGraph(&allocator);
34   HBasicBlock* entry = new (&allocator) HBasicBlock(graph);
35   graph->AddBlock(entry);
36   graph->SetEntryBlock(entry);
38       graph->GetDexFile(), 0, 0, Primitive::kPrimNot);
42   HBasicBlock* first_block = new (&allocator) HBasicBlock(graph);
43   graph->AddBlock(first_block);
49   HBasicBlock* exit_block = new (&allocator) HBasicBlock(graph);
50   graph->AddBlock(exit_block);
55       &allocator, 1, graph->GetDexFile(), graph->GetMethodIdx(), 0, kStatic, null_check);
70  * Test that inserting an instruction in the graph updates user lists.
76   HGraph* graph = CreateGraph(&allocator);
77   HBasicBlock* entry = new (&allocator) HBasicBlock(graph);
78   graph->AddBlock(entry);
79   graph->SetEntryBlock(entry);
81       graph->GetDexFile(), 0, 0, Primitive::kPrimNot);
83       graph->GetDexFile(), 0, 0, Primitive::kPrimNot);
98  * Test that adding an instruction in the graph updates user lists.
104   HGraph* graph = CreateGraph(&allocator);
105   HBasicBlock* entry = new (&allocator) HBasicBlock(graph);
106   graph->AddBlock(entry);
107   graph->SetEntryBlock(entry);
109       graph->GetDexFile(), 0, 0, Primitive::kPrimNot);
125   HGraph* graph = CreateGraph(&allocator);
126   HBasicBlock* entry = new (&allocator) HBasicBlock(graph);
127   graph->AddBlock(entry);
128   graph->SetEntryBlock(entry);
130       graph->GetDexFile(), 0, 0, Primitive::kPrimNot);
140       &allocator, 1, graph->GetDexFile(), graph->GetMethodIdx(), 0, kStatic, with_environment);
151       &allocator, 1, graph->GetDexFile(), graph->GetMethodIdx(), 0, kStatic, nullptr);
157       &allocator, 1, graph->GetDexFile(), graph->GetMethodIdx(), 0, kStatic, nullptr);