| /art/tools/ahat/src/test/com/android/ahat/ |
| D | DominatorsTest.java | 75 Graph graph = new Graph(); in singleNode() local
84 Graph graph = new Graph(); in parentWithChild() local
98 Graph graph = new Graph(); in reachableTwoWays() local
115 Graph graph = new Graph(); in reachableDirectAndIndirect() local
129 Graph graph = new Graph(); in subDominator() local
144 Graph graph = new Graph(); in childSelfLoop() local
157 Graph graph = new Graph(); in singleEntryLoop() local
176 Graph graph = new Graph(); in multiEntryLoop() local
201 Graph graph = new Graph(); in dominatorOverwrite() local
217 Graph graph = new Graph(); in stackOverflow() local
[all …]
|
| /art/compiler/optimizing/ |
| D | find_loops_test.cc | 39 HGraph* graph = CreateCFG(data); in TEST_F() local
50 HGraph* graph = CreateCFG(data); in TEST_F() local
64 HGraph* graph = CreateCFG(data); in TEST_F() local
79 HGraph* graph = CreateCFG(data); in TEST_F() local
92 HGraph* graph = CreateCFG(data); in TEST_F() local
98 static void TestBlock(HGraph* graph, in TestBlock()
136 HGraph* graph = CreateCFG(data); in TEST_F() local
162 HGraph* graph = CreateCFG(data); in TEST_F() local
185 HGraph* graph = CreateCFG(data); in TEST_F() local
209 HGraph* graph = CreateCFG(data); in TEST_F() local
[all …]
|
| D | graph_test.cc | 37 HBasicBlock* GraphTest::CreateIfBlock(HGraph* graph) { in CreateIfBlock()
48 HBasicBlock* GraphTest::CreateGotoBlock(HGraph* graph) { in CreateGotoBlock()
56 HBasicBlock* GraphTest::CreateEntryBlock(HGraph* graph) { in CreateEntryBlock()
62 HBasicBlock* GraphTest::CreateReturnBlock(HGraph* graph) { in CreateReturnBlock()
70 HBasicBlock* GraphTest::CreateExitBlock(HGraph* graph) { in CreateExitBlock()
82 HGraph* graph = CreateGraph(); in TEST_F() local
114 HGraph* graph = CreateGraph(); in TEST_F() local
146 HGraph* graph = CreateGraph(); in TEST_F() local
178 HGraph* graph = CreateGraph(); in TEST_F() local
210 HGraph* graph = CreateGraph(); in TEST_F() local
[all …]
|
| D | codegen_test_utils.h | 61 CodeGenerator* CreateCodeGenerator(HGraph* graph, const CompilerOptions& compiler_options) { in CreateCodeGenerator()
93 TestCodeGeneratorARMVIXL(HGraph* graph, const CompilerOptions& compiler_options) in TestCodeGeneratorARMVIXL()
135 TestCodeGeneratorARM64(HGraph* graph, const CompilerOptions& compiler_options) in TestCodeGeneratorARM64()
153 TestCodeGeneratorX86(HGraph* graph, const CompilerOptions& compiler_options) in TestCodeGeneratorX86()
270 static void ValidateGraph(HGraph* graph) { in ValidateGraph()
283 HGraph* graph, in RunCodeNoCheck()
304 HGraph* graph, in RunCode()
315 HGraph* graph, in RunCode()
325 inline CodeGenerator* create_codegen_arm_vixl32(HGraph* graph, const CompilerOptions& compiler_opti… in create_codegen_arm_vixl32()
331 inline CodeGenerator* create_codegen_arm64(HGraph* graph, const CompilerOptions& compiler_options) { in create_codegen_arm64()
[all …]
|
| D | register_allocator_test.cc | 92 HGraph* graph = CreateCFG(data); in Check() local
107 HGraph* graph = CreateGraph(); in TEST_F() local
331 HGraph* graph = CreateCFG(data); in Loop3() local
364 HGraph* graph = CreateCFG(data); in TEST_F() local
414 HGraph* graph = CreateCFG(data); in DeadPhi() local
438 HGraph* graph = CreateCFG(data); in TEST_F() local
492 HGraph* graph = CreateGraph(); in BuildIfElseWithPhi() local
565 HGraph* graph = BuildIfElseWithPhi(&phi, &input1, &input2); in PhiHint() local
581 HGraph* graph = BuildIfElseWithPhi(&phi, &input1, &input2); in PhiHint() local
599 HGraph* graph = BuildIfElseWithPhi(&phi, &input1, &input2); in PhiHint() local
[all …]
|
| D | live_ranges_test.cc | 39 HGraph* graph = CreateCFG(data); in BuildGraph() local
66 HGraph* graph = BuildGraph(data); in TEST_F() local
111 HGraph* graph = BuildGraph(data); in TEST_F() local
158 HGraph* graph = BuildGraph(data); in TEST_F() local
232 HGraph* graph = BuildGraph(data); in TEST_F() local
308 HGraph* graph = BuildGraph(data); in TEST_F() local
382 HGraph* graph = BuildGraph(data); in TEST_F() local
|
| D | ssa_phi_elimination.h | 32 explicit SsaDeadPhiElimination(HGraph* graph) in SsaDeadPhiElimination()
54 explicit SsaRedundantPhiElimination(HGraph* graph) in SsaRedundantPhiElimination()
|
| D | graph_checker_test.cc | 38 HGraph* graph = CreateGraph(); in CreateSimpleCFG() local
53 HGraph* graph = CreateCFG(data); in TestCode() local
99 HGraph* graph = CreateSimpleCFG(); in TEST_F() local
114 HGraph* graph = CreateSimpleCFG(); in TEST_F() local
|
| D | constant_folding_test.cc | 128 auto check_after_cf = [](HGraph* graph) { in TEST_F()
189 auto check_after_cf = [](HGraph* graph) { in TEST_F()
250 auto check_after_cf = [](HGraph* graph) { in TEST_F()
329 auto check_after_cf = [](HGraph* graph) { in TEST_F()
400 auto check_after_cf = [](HGraph* graph) { in TEST_F()
463 auto check_after_cf = [](HGraph* graph) { in TEST_F()
527 auto check_after_cf = [](HGraph* graph) { in TEST_F()
627 auto check_after_cf = [](HGraph* graph) { in TEST_F()
712 auto check_after_cf = [](HGraph* graph) { in TEST_F()
844 auto check_after_cf = [](HGraph* graph) { in TEST_F()
|
| D | x86_memory_gen.cc | 29 MemoryOperandVisitor(HGraph* graph, bool do_implicit_null_checks) in MemoryOperandVisitor()
72 X86MemoryOperandGeneration::X86MemoryOperandGeneration(HGraph* graph, in X86MemoryOperandGeneration()
|
| D | gvn_test.cc | 31 HGraph* graph = CreateGraph(); in TEST_F() local
112 HGraph* graph = CreateGraph(); in TEST_F() local
191 HGraph* graph = CreateGraph(); in TEST_F() local
312 HGraph* graph = CreateGraph(); in TEST_F() local
|
| D | nodes_test.cc | 146 HGraph* graph = CreateGraph(); in TEST_F() local
186 HGraph* graph = CreateGraph(); in TEST_F() local
211 HGraph* graph = CreateGraph(); in TEST_F() local
229 HGraph* graph = CreateGraph(); in TEST_F() local
|
| D | linear_order.h | 41 void LinearizeGraph(const HGraph* graph, Vector* linear_order) { in LinearizeGraph()
|
| D | codegen_test.cc | 81 HGraph* graph = CreateCFG(data); in TestCode() local
94 HGraph* graph = CreateCFG(data, DataType::Type::kInt64); in TestCodeLong() local
415 HGraph* graph = CreateGraph(); in TEST_F() local
477 HGraph* graph = CreateGraph(); in TEST_F() local
526 HGraph* graph = CreateGraph(); in TEST_F() local
608 HGraph* graph = CreateGraph(); in TestComparison() local
722 HGraph* graph = CreateGraph(); in TEST_F() local
746 HGraph* graph = CreateGraph(); in TEST_F() local
796 HGraph* graph = CreateGraph(); in TEST_F() local
832 HGraph* graph = CreateGraph(); in TEST_F() local
[all …]
|
| D | cha_guard_optimization.h | 32 : HOptimization(graph, name) {} in HOptimization() argument
|
| D | critical_native_abi_fixup_arm.h | 29 CriticalNativeAbiFixupArm(HGraph* graph, OptimizingCompilerStats* stats) in CriticalNativeAbiFixupArm()
|
| D | instruction_simplifier_arm.h | 29 InstructionSimplifierArm(HGraph* graph, OptimizingCompilerStats* stats) in InstructionSimplifierArm()
|
| D | instruction_simplifier_arm64.h | 29 InstructionSimplifierArm64(HGraph* graph, OptimizingCompilerStats* stats) in InstructionSimplifierArm64()
|
| D | code_sinking.h | 35 : HOptimization(graph, name, stats) {} in HOptimization() argument
|
| D | gvn.h | 33 : HOptimization(graph, pass_name), side_effects_(side_effects) {} in HOptimization() argument
|
| D | constant_folding.h | 48 : HOptimization(graph, name, stats), use_all_optimizations_(use_all_optimizations) {} in HOptimization() argument
|
| D | constructor_fence_redundancy_elimination.h | 54 : HOptimization(graph, name, stats) {} in HOptimization() argument
|
| D | write_barrier_elimination.h | 44 : HOptimization(graph, name, stats) {} in HOptimization() argument
|
| D | dead_code_elimination.h | 33 HDeadCodeElimination(HGraph* graph, OptimizingCompilerStats* stats, const char* name) in HDeadCodeElimination()
|
| D | instruction_simplifier_x86_64.h | 31 InstructionSimplifierX86_64(HGraph* graph, CodeGenerator* codegen, OptimizingCompilerStats* stats) in InstructionSimplifierX86_64()
|