Home
last modified time | relevance | path

Searched defs:graph (Results 1 – 25 of 106) sorted by relevance

12345

/art/tools/ahat/src/test/com/android/ahat/
DDominatorsTest.java75 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/
Dfind_loops_test.cc39 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 …]
Dgraph_test.cc37 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 …]
Dcodegen_test_utils.h61 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()
247 static void ValidateGraph(HGraph* graph) { in ValidateGraph()
260 HGraph* graph, in RunCodeNoCheck()
280 HGraph* graph, in RunCode()
291 HGraph* graph, in RunCode()
301 inline CodeGenerator* create_codegen_arm_vixl32(HGraph* graph, const CompilerOptions& compiler_opti… in create_codegen_arm_vixl32()
307 inline CodeGenerator* create_codegen_arm64(HGraph* graph, const CompilerOptions& compiler_options) { in create_codegen_arm64()
[all …]
Dregister_allocator_test.cc70 HGraph* graph = CreateCFG(data); in Check() local
85 HGraph* graph = CreateGraph(); in TEST_F() local
303 HGraph* graph = CreateCFG(data); in TEST_F() local
334 HGraph* graph = CreateCFG(data); in TEST_F() local
384 HGraph* graph = CreateCFG(data); in TEST_F() local
406 HGraph* graph = CreateCFG(data); in TEST_F() local
460 HGraph* graph = CreateGraph(); in BuildIfElseWithPhi() local
533 HGraph* graph = BuildIfElseWithPhi(&phi, &input1, &input2); in TEST_F() local
549 HGraph* graph = BuildIfElseWithPhi(&phi, &input1, &input2); in TEST_F() local
567 HGraph* graph = BuildIfElseWithPhi(&phi, &input1, &input2); in TEST_F() local
[all …]
Dlive_ranges_test.cc39 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
Dssa_phi_elimination.h32 explicit SsaDeadPhiElimination(HGraph* graph) in SsaDeadPhiElimination()
54 explicit SsaRedundantPhiElimination(HGraph* graph) in SsaRedundantPhiElimination()
Dgraph_checker_test.cc38 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
Dconstant_folding_test.cc126 auto check_after_cf = [](HGraph* graph) { in TEST_F()
187 auto check_after_cf = [](HGraph* graph) { in TEST_F()
248 auto check_after_cf = [](HGraph* graph) { in TEST_F()
327 auto check_after_cf = [](HGraph* graph) { in TEST_F()
398 auto check_after_cf = [](HGraph* graph) { in TEST_F()
461 auto check_after_cf = [](HGraph* graph) { in TEST_F()
525 auto check_after_cf = [](HGraph* graph) { in TEST_F()
625 auto check_after_cf = [](HGraph* graph) { in TEST_F()
710 auto check_after_cf = [](HGraph* graph) { in TEST_F()
842 auto check_after_cf = [](HGraph* graph) { in TEST_F()
Dx86_memory_gen.cc29 MemoryOperandVisitor(HGraph* graph, bool do_implicit_null_checks) in MemoryOperandVisitor()
72 X86MemoryOperandGeneration::X86MemoryOperandGeneration(HGraph* graph, in X86MemoryOperandGeneration()
Dgvn_test.cc31 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
Dnodes_test.cc146 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
Dcodegen_test.cc81 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
745 HGraph* graph = CreateGraph(); in TEST_F() local
794 HGraph* graph = CreateGraph(); in TEST_F() local
829 HGraph* graph = CreateGraph(); in TEST_F() local
[all …]
Dlinear_order.h41 void LinearizeGraph(const HGraph* graph, Vector* linear_order) { in LinearizeGraph()
Dcritical_native_abi_fixup_riscv64.h29 CriticalNativeAbiFixupRiscv64(HGraph* graph, OptimizingCompilerStats* stats) in CriticalNativeAbiFixupRiscv64()
Dcritical_native_abi_fixup_arm.h29 CriticalNativeAbiFixupArm(HGraph* graph, OptimizingCompilerStats* stats) in CriticalNativeAbiFixupArm()
Dcha_guard_optimization.h32 : HOptimization(graph, name) {} in HOptimization() argument
Dinstruction_simplifier_riscv64.h30 InstructionSimplifierRiscv64(HGraph* graph, OptimizingCompilerStats* stats) in InstructionSimplifierRiscv64()
Dconstructor_fence_redundancy_elimination.h54 : HOptimization(graph, name, stats) {} in HOptimization() argument
Dgvn.h33 : HOptimization(graph, pass_name), side_effects_(side_effects) {} in HOptimization() argument
Dwrite_barrier_elimination.h44 : HOptimization(graph, name, stats) {} in HOptimization() argument
Dconstant_folding.h47 : HOptimization(graph, name, stats) {} in HOptimization() argument
Ddead_code_elimination.h33 HDeadCodeElimination(HGraph* graph, OptimizingCompilerStats* stats, const char* name) in HDeadCodeElimination()
Dcode_sinking.h35 : HOptimization(graph, name, stats) {} in HOptimization() argument
Dinstruction_simplifier_x86.h30 InstructionSimplifierX86(HGraph* graph, CodeGenerator* codegen, OptimizingCompilerStats* stats) in InstructionSimplifierX86()

12345