Home
last modified time | relevance | path

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

1234

/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.cc38 HGraph* graph = CreateCFG(data); in TEST_F() local
49 HGraph* graph = CreateCFG(data); in TEST_F() local
63 HGraph* graph = CreateCFG(data); in TEST_F() local
78 HGraph* graph = CreateCFG(data); in TEST_F() local
91 HGraph* graph = CreateCFG(data); in TEST_F() local
97 static void TestBlock(HGraph* graph, in TestBlock()
135 HGraph* graph = CreateCFG(data); in TEST_F() local
161 HGraph* graph = CreateCFG(data); in TEST_F() local
184 HGraph* graph = CreateCFG(data); in TEST_F() local
208 HGraph* graph = CreateCFG(data); in TEST_F() local
[all …]
Dgraph_test.cc36 HBasicBlock* GraphTest::CreateIfBlock(HGraph* graph) { in CreateIfBlock()
47 HBasicBlock* GraphTest::CreateGotoBlock(HGraph* graph) { in CreateGotoBlock()
55 HBasicBlock* GraphTest::CreateEntryBlock(HGraph* graph) { in CreateEntryBlock()
61 HBasicBlock* GraphTest::CreateReturnBlock(HGraph* graph) { in CreateReturnBlock()
69 HBasicBlock* GraphTest::CreateExitBlock(HGraph* graph) { in CreateExitBlock()
81 HGraph* graph = CreateGraph(); in TEST_F() local
113 HGraph* graph = CreateGraph(); in TEST_F() local
145 HGraph* graph = CreateGraph(); in TEST_F() local
177 HGraph* graph = CreateGraph(); in TEST_F() local
209 HGraph* graph = CreateGraph(); in TEST_F() local
[all …]
Dcodegen_test_utils.h56 CodeGenerator* CreateCodeGenerator(HGraph* graph, const CompilerOptions& compiler_options) { in CreateCodeGenerator()
88 TestCodeGeneratorARMVIXL(HGraph* graph, const CompilerOptions& compiler_options) in TestCodeGeneratorARMVIXL()
130 TestCodeGeneratorARM64(HGraph* graph, const CompilerOptions& compiler_options) in TestCodeGeneratorARM64()
148 TestCodeGeneratorX86(HGraph* graph, const CompilerOptions& compiler_options) in TestCodeGeneratorX86()
261 static void ValidateGraph(HGraph* graph) { in ValidateGraph()
274 HGraph* graph, in RunCodeNoCheck()
295 HGraph* graph, in RunCode()
306 HGraph* graph, in RunCode()
316 inline CodeGenerator* create_codegen_arm_vixl32(HGraph* graph, const CompilerOptions& compiler_opti… in create_codegen_arm_vixl32()
322 inline CodeGenerator* create_codegen_arm64(HGraph* graph, const CompilerOptions& compiler_options) { in create_codegen_arm64()
[all …]
Dregister_allocator_test.cc91 HGraph* graph = CreateCFG(data); in Check() local
106 HGraph* graph = CreateGraph(); in TEST_F() local
330 HGraph* graph = CreateCFG(data); in Loop3() local
363 HGraph* graph = CreateCFG(data); in TEST_F() local
413 HGraph* graph = CreateCFG(data); in DeadPhi() local
437 HGraph* graph = CreateCFG(data); in TEST_F() local
491 HGraph* graph = CreateGraph(); in BuildIfElseWithPhi() local
564 HGraph* graph = BuildIfElseWithPhi(&phi, &input1, &input2); in PhiHint() local
580 HGraph* graph = BuildIfElseWithPhi(&phi, &input1, &input2); in PhiHint() local
598 HGraph* graph = BuildIfElseWithPhi(&phi, &input1, &input2); in PhiHint() local
[all …]
Dlive_ranges_test.cc38 HGraph* graph = CreateCFG(data); in BuildGraph() local
65 HGraph* graph = BuildGraph(data); in TEST_F() local
110 HGraph* graph = BuildGraph(data); in TEST_F() local
157 HGraph* graph = BuildGraph(data); in TEST_F() local
231 HGraph* graph = BuildGraph(data); in TEST_F() local
307 HGraph* graph = BuildGraph(data); in TEST_F() local
381 HGraph* graph = BuildGraph(data); in TEST_F() local
Dssa_phi_elimination.h31 explicit SsaDeadPhiElimination(HGraph* graph) in SsaDeadPhiElimination()
53 explicit SsaRedundantPhiElimination(HGraph* graph) in SsaRedundantPhiElimination()
Dnodes_test.cc33 HGraph* graph = CreateGraph(); in TEST_F() local
73 HGraph* graph = CreateGraph(); in TEST_F() local
98 HGraph* graph = CreateGraph(); in TEST_F() local
116 HGraph* graph = CreateGraph(); in TEST_F() local
Dgraph_checker_test.cc37 HGraph* graph = CreateGraph(); in CreateSimpleCFG() local
52 HGraph* graph = CreateCFG(data); in TestCode() local
98 HGraph* graph = CreateSimpleCFG(); in TEST_F() local
113 HGraph* graph = CreateSimpleCFG(); in TEST_F() local
Dconstant_folding_test.cc124 auto check_after_cf = [](HGraph* graph) { in TEST_F()
185 auto check_after_cf = [](HGraph* graph) { in TEST_F()
246 auto check_after_cf = [](HGraph* graph) { in TEST_F()
325 auto check_after_cf = [](HGraph* graph) { in TEST_F()
396 auto check_after_cf = [](HGraph* graph) { in TEST_F()
459 auto check_after_cf = [](HGraph* graph) { in TEST_F()
523 auto check_after_cf = [](HGraph* graph) { in TEST_F()
623 auto check_after_cf = [](HGraph* graph) { in TEST_F()
708 auto check_after_cf = [](HGraph* graph) { in TEST_F()
840 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.cc30 HGraph* graph = CreateGraph(); in TEST_F() local
111 HGraph* graph = CreateGraph(); in TEST_F() local
190 HGraph* graph = CreateGraph(); in TEST_F() local
311 HGraph* graph = CreateGraph(); in TEST_F() local
Doptimizing_unit_test.h76 inline void RemoveSuspendChecks(HGraph* graph) { in RemoveSuspendChecks()
158 HGraph* graph = CreateGraph(handles); variable
216 bool CheckGraph(HGraph* graph) { in CheckGraph()
227 bool CheckGraphSkipRefTypeInfoChecks(HGraph* graph) { in CheckGraphSkipRefTypeInfoChecks()
250 bool CheckGraph(HGraph* graph, bool check_ref_type_info) { in CheckGraph()
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
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 …]
Dlinear_order.h40 void LinearizeGraph(const HGraph* graph, Vector* linear_order) { in LinearizeGraph()
Dcha_guard_optimization.h31 : HOptimization(graph, name) {} in HOptimization() argument
Dinstruction_simplifier_arm64.h28 InstructionSimplifierArm64(HGraph* graph, OptimizingCompilerStats* stats) in InstructionSimplifierArm64()
Dconstant_folding.h42 HConstantFolding(HGraph* graph, const char* name) : HOptimization(graph, name) {} in HConstantFolding()
Dinstruction_simplifier_arm.h28 InstructionSimplifierArm(HGraph* graph, OptimizingCompilerStats* stats) in InstructionSimplifierArm()
Dconstructor_fence_redundancy_elimination.h53 : HOptimization(graph, name, stats) {} in HOptimization() argument
Ddead_code_elimination.h32 HDeadCodeElimination(HGraph* graph, OptimizingCompilerStats* stats, const char* name) in HDeadCodeElimination()
Dgvn.h32 : HOptimization(graph, pass_name), side_effects_(side_effects) {} in HOptimization() argument
Dcode_sinking.h34 : HOptimization(graph, name, stats) {} in HOptimization() argument
Dpc_relative_fixups_x86.h31 PcRelativeFixups(HGraph* graph, CodeGenerator* codegen, OptimizingCompilerStats* stats) in PcRelativeFixups()
Dinstruction_simplifier_x86_64.h30 InstructionSimplifierX86_64(HGraph* graph, CodeGenerator* codegen, OptimizingCompilerStats* stats) in InstructionSimplifierX86_64()

1234