| /arkcompiler/runtime_core/static_core/compiler/tests/ |
| D | licm_conditions_test.cpp | 141 SRC_GRAPH(TestBrachWithoutPhi, Graph *graph) in SRC_GRAPH()
185 OUT_GRAPH(TestBrachWithoutPhi, Graph *graph) in OUT_GRAPH()
254 auto graph = CreateEmptyGraph(); in TEST_F() local
310 SRC_GRAPH(TestProcessLongestChain, Graph *graph) in SRC_GRAPH()
369 OUT_GRAPH(TestProcessLongestChain, Graph *graph) in OUT_GRAPH()
449 auto graph = CreateEmptyGraph(); in TEST_F() local
459 SRC_GRAPH(TestProcessLongestChainNotSuitable, Graph *graph) in SRC_GRAPH()
522 OUT_GRAPH(TestProcessLongestChainNotSuitable, Graph *graph) in OUT_GRAPH()
606 auto graph = CreateEmptyGraph(); in TEST_F() local
639 SRC_GRAPH(TestUpdatePhi, Graph *graph) in SRC_GRAPH()
[all …]
|
| D | escape_analysis_test.cpp | 74 auto graph = CreateEmptyGraph(); in TEST_F() local
107 auto graph = CreateEmptyGraph(); in TEST_F() local
122 SRC_GRAPH(NewUnusedObjectAndControlFlow, Graph *graph) in SRC_GRAPH()
149 OUT_GRAPH(NewUnusedObjectAndControlFlow, Graph *graph) in OUT_GRAPH()
181 auto graph = CreateEmptyGraph(); in TEST_F() local
186 SRC_GRAPH(NewUnusedArrayAndControlFlow, Graph *graph) in SRC_GRAPH()
213 OUT_GRAPH(NewUnusedArrayAndControlFlow, Graph *graph) in OUT_GRAPH()
245 auto graph = CreateEmptyGraph(); in TEST_F() local
250 SRC_GRAPH(NewUnusedObjectsFromDifferentBranches, Graph *graph) in SRC_GRAPH()
281 OUT_GRAPH(NewUnusedObjectsFromDifferentBranches, Graph *graph) in OUT_GRAPH()
[all …]
|
| D | cleanup_test.cpp | 49 auto graph = CreateEmptyGraph(); in TEST_F() local
60 SRC_GRAPH(BothHasPhi, Graph *graph) in SRC_GRAPH()
90 OUT_GRAPH(BothHasPhi, Graph *graph) in OUT_GRAPH()
122 auto graph = CreateEmptyGraph(); in TEST_F() local
153 auto graph = CreateEmptyGraph(); in TEST_F() local
202 auto graph = CreateEmptyGraph(); in TEST_F() local
234 auto graph = CreateEmptyGraph(); in TEST_F() local
250 SRC_GRAPH(TwoPredecessors, Graph *graph) in SRC_GRAPH()
279 OUT_GRAPH(TwoPredecessors, Graph *graph) in OUT_GRAPH()
313 auto graph = CreateEmptyGraph(); in TEST_F() local
[all …]
|
| D | deoptimize_elimination_test.cpp | 77 auto graph = CreateEmptyGraph(); in TEST_F() local
113 auto graph = CreateEmptyGraph(); in TEST_F() local
184 auto graph = CreateEmptyGraph(); in TEST_F() local
232 auto graph = CreateEmptyGraph(); in TEST_F() local
298 SRC_GRAPH(ChaGuardIfSeveralGuardsTest, Graph *graph) in SRC_GRAPH()
333 OUT_GRAPH(ChaGuardIfSeveralGuardsTest, Graph *graph) in OUT_GRAPH()
384 auto graph = CreateEmptyGraph(); in TEST_F() local
389 SRC_GRAPH(ChaGuardLoopTest, Graph *graph) in SRC_GRAPH()
422 OUT_GRAPH(ChaGuardLoopTest, Graph *graph) in OUT_GRAPH()
459 auto graph = CreateEmptyGraph(); in TEST_F() local
[all …]
|
| D | redundant_loop_elimination_test.cpp | 60 auto graph = CreateEmptyGraph(); in TEST_F() local
99 auto graph = CreateEmptyGraph(); in TEST_F() local
123 SRC_GRAPH(SimpleLoopTest3, Graph *graph) in SRC_GRAPH()
149 OUT_GRAPH(SimpleLoopTest3, Graph *graph) in OUT_GRAPH()
180 auto graph = CreateEmptyGraph(); in TEST_F() local
220 auto graph = CreateEmptyGraph(); in TEST_F() local
236 SRC_GRAPH(InnerLoopsTest2, Graph *graph) in SRC_GRAPH()
273 OUT_GRAPH(InnerLoopsTest2, Graph *graph) in OUT_GRAPH()
315 auto graph = CreateEmptyGraph(); in TEST_F() local
320 SRC_GRAPH(InnerLoopsTest3, Graph *graph) in SRC_GRAPH()
[all …]
|
| D | if_conversion_test.cpp | 75 auto graph = CreateEmptyGraph(); in TEST_F() local
116 auto graph = CreateEmptyGraph(); in TEST_F() local
169 auto graph = CreateEmptyGraph(); in TEST_F() local
210 auto graph = CreateEmptyGraph(); in TEST_F() local
228 auto graph = CreateEmptyGraph(); in CreateExpectedJointTriangleImm() local
300 auto graph = CreateExpectedJointTriangleImm(); in TEST_F() local
333 auto graph = CreateEmptyGraph(); in TEST_F() local
353 auto graph = CreateEmptyGraph(); in CreateExpJointTriangleWithTrickFloatPhi() local
417 auto graph = CreateExpJointTriangleWithTrickFloatPhi(); in TEST_F() local
462 auto graph = CreateEmptyGraph(); in TEST_F() local
[all …]
|
| D | adjust_arefs_test.cpp | 36 auto graph = CreateEmptyFastpathGraph(RUNTIME_ARCH); in BuildGraphOneBlockContinuousChain() local
72 auto *graph = BuildGraphOneBlockContinuousChain(); in TEST_F() local
112 auto graph = CreateEmptyFastpathGraph(RUNTIME_ARCH); in BuildGraphOneBlockBrokenChain() local
149 auto *graph = BuildGraphOneBlockBrokenChain(); in TEST_F() local
193 auto graph = CreateEmptyFastpathGraph(RUNTIME_ARCH); in BuildGraphMultipleBlockContinuousChain() local
239 auto *graph = BuildGraphMultipleBlockContinuousChain(); in TEST_F() local
287 auto graph = CreateEmptyFastpathGraph(RUNTIME_ARCH); in BuildGraphMultipleBlockBrokenChain() local
335 auto *graph = BuildGraphMultipleBlockBrokenChain(); in TEST_F() local
384 auto graph = CreateEmptyFastpathGraph(RUNTIME_ARCH); in BuildGraphProcessIndex() local
414 auto *graph = BuildGraphProcessIndex(offset1, offset2, offset3); in TEST_F() local
[all …]
|
| D | ir_builder_test.cpp | 78 auto graph = CreateGraphWithDefaultRuntime(); in CheckSimple() local
118 auto graph = CreateGraphWithDefaultRuntime(); in CheckSimpleWithImm() local
153 auto graph = CreateGraphWithDefaultRuntime(); in CheckCmp() local
185 auto graph = CreateGraphWithDefaultRuntime(); in CheckFloatCmp() local
204 auto graph = CreateGraphWithDefaultRuntime(); in ExpectedGraphCheckCondJump() local
270 auto graph = ExpectedGraphCheckCondJump(type, cc); in CheckCondJump() local
324 auto graph = CreateGraphWithDefaultRuntime(); in CheckCondJumpWithZero() local
367 auto graph = CreateGraphWithDefaultRuntime(); in TEST_F() local
406 auto graph = CreateGraphWithDefaultRuntime(); in TEST_F() local
436 auto graph = CreateGraphWithDefaultRuntime(); in TEST_F() local
[all …]
|
| D | cse_test.cpp | 42 SRC_GRAPH(CSETestApply1, Graph *graph) in SRC_GRAPH()
94 OUT_GRAPH(CSETestApply1, Graph *graph) in OUT_GRAPH()
145 SRC_GRAPH(CSETestApply2, Graph *graph) in SRC_GRAPH()
189 OUT_GRAPH(CSETestApply2, Graph *graph) in OUT_GRAPH()
243 SRC_GRAPH(CSETestApply3, Graph *graph) in SRC_GRAPH()
295 OUT_GRAPH(CSETestApply3, Graph *graph) in OUT_GRAPH()
361 SRC_GRAPH(CSETestApply4, Graph *graph) in SRC_GRAPH()
400 OUT_GRAPH(CSETestApply4, Graph *graph) in OUT_GRAPH()
444 SRC_GRAPH(CSETestApply5, Graph *graph) in SRC_GRAPH()
488 OUT_GRAPH(CSETestApply5, Graph *graph) in OUT_GRAPH()
[all …]
|
| D | vn_test.cpp | 38 SRC_GRAPH(VnTestApply1, Graph *graph) in SRC_GRAPH()
66 OUT_GRAPH(VnTestApply1, Graph *graph) in OUT_GRAPH()
106 SRC_GRAPH(VnTestApply2, Graph *graph) in SRC_GRAPH()
154 OUT_GRAPH(VnTestApply2, Graph *graph) in OUT_GRAPH()
214 SRC_GRAPH(VnTestNotApply1, Graph *graph) in SRC_GRAPH()
244 OUT_GRAPH(VnTestNotApply1, Graph *graph) in OUT_GRAPH()
287 SRC_GRAPH(VnTestNotApply2, Graph *graph) in SRC_GRAPH()
335 OUT_GRAPH(VnTestNotApply2, Graph *graph) in OUT_GRAPH()
400 SRC_GRAPH(VnTestNotApply3, Graph *graph) in SRC_GRAPH()
445 OUT_GRAPH(VnTestNotApply3, Graph *graph) in OUT_GRAPH()
[all …]
|
| D | if_merging_test.cpp | 72 auto graph = CreateEmptyGraph(); in TEST_F() local
195 auto graph = CreateEmptyGraph(); in CreateExpectedCheckInstsSplit() local
269 auto graph = CreateExpectedCheckInstsSplit(); in TEST_F() local
301 auto graph = CreateEmptyGraph(); in TEST_F() local
504 auto graph = CreateEmptyGraph(); in CreateExpectedConstPhiIf() local
572 auto graph = CreateExpectedConstPhiIf(); in TEST_F() local
578 auto graph = CreateEmptyGraph(); in CreateExpConstantEqualToAllPhiInputs() local
648 auto graph = CreateExpConstantEqualToAllPhiInputs(); in TEST_F() local
654 auto graph = CreateEmptyGraph(); in CreateExpConstantNotEqualToPhiInputs() local
725 auto graph = CreateExpConstantNotEqualToPhiInputs(); in TEST_F() local
[all …]
|
| D | move_constants_test.cpp | 24 SRC_GRAPH(MoveNullPtrToCommonImmediateDominator, Graph *graph) in SRC_GRAPH()
58 OUT_GRAPH(MoveNullPtrToCommonImmediateDominator, Graph *graph) in OUT_GRAPH()
105 SRC_GRAPH(MoveToCommonImmediateDominator, Graph *graph) in SRC_GRAPH()
141 OUT_GRAPH(MoveToCommonImmediateDominator, Graph *graph) in OUT_GRAPH()
190 SRC_GRAPH(MoveToClosestCommonDominator, Graph *graph) in SRC_GRAPH()
237 OUT_GRAPH(MoveToClosestCommonDominator, Graph *graph) in OUT_GRAPH()
297 SRC_GRAPH(MoveJustBeforeUser, Graph *graph) in SRC_GRAPH()
332 OUT_GRAPH(MoveJustBeforeUser, Graph *graph) in OUT_GRAPH()
380 SRC_GRAPH(MoveJustBeforeUserSingleBlock, Graph *graph) in SRC_GRAPH()
416 OUT_GRAPH(MoveJustBeforeUserSingleBlock, Graph *graph) in OUT_GRAPH()
[all …]
|
| D | scheduler_test.cpp | 188 auto graph = CreateEmptyGraph(); in TEST_F() local
213 SRC_GRAPH(FixSSInBBAfterSchedulerOutToBlock, Graph *graph) in SRC_GRAPH()
240 OUT_GRAPH(FixSSInBBAfterSchedulerOutToBlock, Graph *graph) in OUT_GRAPH()
273 auto graph = CreateEmptyGraph(); in TEST_F() local
323 auto graph = CreateEmptyGraph(); in TEST_F() local
367 SRC_GRAPH(LoadPair, Graph *graph) in SRC_GRAPH()
419 OUT_GRAPH(LoadPair, Graph *graph) in OUT_GRAPH()
475 auto graph = CreateEmptyGraph(); in TEST_F() local
504 auto graph = CreateEmptyGraph(); in TEST_F() local
552 auto graph = CreateEmptyGraph(); in TEST_F() local
|
| D | peepholes_test.cpp | 87 auto graph = CreateEmptyGraph(); in CheckCompare() local
173 auto graph = CreateEmptyGraph(); in BuildCheckCastResJoined() local
193 auto graph = CreateEmptyGraph(); in BuildCheckCastResNotJoined() local
262 auto graph = CreateEmptyGraph(); in CheckCompareFoldIntoTest() local
303 auto graph = CreateEmptyGraph(); in CheckIfAndZeroFoldIntoIfTest() local
362 auto graph = CreateEmptyGraph(); in CheckCompareLenArrayWithZeroTest() local
885 auto graph = CreateEmptyGraph(); in TEST_F() local
1236 auto graph = CreateEmptyGraph(); in TEST_F() local
1572 SRC_GRAPH(NegationCompare, Graph *graph) in SRC_GRAPH()
1589 OUT_GRAPH(NegationCompare, Graph *graph) in OUT_GRAPH()
[all …]
|
| D | lse_test.cpp | 118 SRC_GRAPH(PreviousBlocks, Graph *graph) in SRC_GRAPH()
146 OUT_GRAPH(PreviousBlocks, Graph *graph) in OUT_GRAPH()
519 SRC_GRAPH(LoopElimination, Graph *graph) in SRC_GRAPH()
558 OUT_GRAPH(LoopElimination, Graph *graph) in OUT_GRAPH()
606 SRC_GRAPH(LoopBranches, Graph *graph) in SRC_GRAPH()
662 OUT_GRAPH(LoopBranches, Graph *graph) in OUT_GRAPH()
727 SRC_GRAPH(NestedLoopElimination, Graph *graph) in SRC_GRAPH()
787 OUT_GRAPH(NestedLoopElimination, Graph *graph) in OUT_GRAPH()
857 SRC_GRAPH(LoopWithMayAliases, Graph *graph) in SRC_GRAPH()
896 OUT_GRAPH(LoopWithMayAliases, Graph *graph) in OUT_GRAPH()
[all …]
|
| D | loop_unroll_test.cpp | 40 bool CheckRetOnVixlSimulator([[maybe_unused]] Graph *graph, [[maybe_unused]] T returnValue, in CheckRetOnVixlSimulator()
83 auto graph = CreateEmptyGraph(); in BuildGraphSimpleLoop() local
112 auto graph = BuildGraphSimpleLoop(); in CheckSimpleLoop() local
171 auto graph = CreateEmptyGraph(); in BuildGraphCheckLoopWithPhiAndSafePoint() local
217 auto graph = BuildGraphCheckLoopWithPhiAndSafePoint(); in CheckLoopWithPhiAndSafePoint() local
519 auto graph = CreateEmptyGraph(); in BuildGraphPhiInputOfAnotherPhi() local
546 auto graph = BuildGraphPhiInputOfAnotherPhi(); in TEST_F() local
586 auto graph = BuildGraphPhiInputOfAnotherPhi(); in TEST_F() local
638 auto graph = CreateEmptyGraph(); in TEST_F() local
697 auto graph = CreateEmptyGraph(); in BuildLoopWithIncrement() local
[all …]
|
| D | try_catch_resolving_test.cpp | 69 auto graph = GetGraph(); in TEST_F() local
91 SRC_GRAPH(RemoveAllCatchHandlers, Graph *graph) in SRC_GRAPH()
140 auto graph = GetGraph(); in TEST_F() local
149 SRC_GRAPH(EmptyTryCatches, Graph *graph) in SRC_GRAPH()
184 OUT_GRAPH(EmptyTryCatches, Graph *graph) in OUT_GRAPH()
201 auto graph = CreateGraphWithDefaultRuntime(); in TEST_F() local
|
| D | licm_test.cpp | 293 auto graph = CreateEmptyGraph(); in TEST_F() local
368 auto graph = CreateEmptyGraph(); in TEST_F() local
448 auto graph = CreateEmptyGraph(); in TEST_F() local
686 auto graph = CreateEmptyGraph(); in HoistResolverBeforeMovableObjectBuildExpectedGraph() local
821 auto graph = CreateEmptyGraph(); in TEST_F() local
854 auto graph = CreateEmptyGraph(); in BuildGraphLoadImmediate() local
882 auto graph = BuildGraphLoadImmediate(class1); in TEST_F() local
914 auto graph = CreateEmptyGraph(); in BuildGraphLoadObjFromConst() local
942 auto graph = BuildGraphLoadObjFromConst(obj1); in TEST_F() local
974 auto graph = CreateEmptyGraph(); in BuildGraphFunctionImmediate() local
[all …]
|
| D | branch_elimination_test.cpp | 97 void BranchEliminationTest::BuildTestGraph(Graph *graph) in BuildTestGraph()
163 void BranchEliminationTest::BuildTestGraph2(Graph *graph) in BuildTestGraph2()
239 auto graph = CreateEmptyGraph(); in TEST_F() local
287 auto graph = CreateEmptyGraph(); in TEST_F() local
806 void BranchEliminationTest::BuildContitionsCheckGraph(Graph *graph, ConditionCode dominantCode, Con… in BuildContitionsCheckGraph()
867 void BranchEliminationTest::BuildContitionsCheckGraphElimFalseSucc(Graph *graph, ConditionCode domi… in BuildContitionsCheckGraphElimFalseSucc()
923 void BranchEliminationTest::BuildContitionsCheckGraphElimTrueSucc(Graph *graph, ConditionCode domin… in BuildContitionsCheckGraphElimTrueSucc()
968 auto graph = CreateEmptyGraph(); in BuildGraphAndCheckElimination() local
1138 SRC_GRAPH(CascadeElimination1, Graph *graph) in SRC_GRAPH()
1185 OUT_GRAPH(CascadeElimination1, Graph *graph) in OUT_GRAPH()
[all …]
|
| D | lowering_test.cpp | 44 auto graph = CreateGraphStartEndBlocks(); in ReturnTest() local
69 auto graph = CreateEmptyGraph(); in CreateEmptyLowLevelGraph() local
183 auto graph = CreateEmptyBytecodeGraph(); in TEST_F() local
509 auto graph = CreateEmptyLowLevelGraph(); in TEST_F() local
558 auto graph = CreateEmptyLowLevelGraph(); in BuildGraphIf1() local
597 auto graph = BuildGraphIf1(cc); in TEST_F() local
634 auto graph = CreateEmptyLowLevelGraph(); in BuildGraphIf2() local
675 auto graph = BuildGraphIf2(cc); in TEST_F() local
715 auto graph = CreateEmptyLowLevelGraph(); in BuildGraphIfRef() local
748 auto graph = BuildGraphIfRef(); in TEST_F() local
[all …]
|
| /arkcompiler/runtime_core/compiler/tests/ |
| D | cleanup_test.cpp | 37 auto graph = CreateEmptyGraph(); in TEST_F() local
79 auto graph = CreateEmptyGraph(); in TEST_F() local
131 auto graph = CreateEmptyGraph(); in TEST_F() local
180 auto graph = CreateEmptyGraph(); in TEST_F() local
212 auto graph = CreateEmptyGraph(); in TEST_F() local
258 auto graph = CreateEmptyGraph(); in TEST_F() local
323 auto graph = CreateEmptyGraph(); in TEST_F() local
378 auto graph = CreateEmptyGraph(); in TEST_F() local
411 auto graph = CreateEmptyGraph(); in TEST_F() local
449 auto graph = CreateEmptyGraph(); in TEST_F() local
[all …]
|
| D | ir_builder_test.cpp | 67 auto graph = CreateGraphWithDefaultRuntime(); in CheckSimple() local
107 auto graph = CreateGraphWithDefaultRuntime(); in CheckSimpleWithImm() local
142 auto graph = CreateGraphWithDefaultRuntime(); in CheckCmp() local
174 auto graph = CreateGraphWithDefaultRuntime(); in CheckFloatCmp() local
236 auto graph = CreateGraphWithDefaultRuntime(); in CheckCondJump() local
303 auto graph = CreateGraphWithDefaultRuntime(); in CheckCondJumpWithZero() local
341 auto graph = CreateGraphWithDefaultRuntime(); in TEST_F() local
380 auto graph = CreateGraphWithDefaultRuntime(); in TEST_F() local
414 auto graph = CreateGraphWithDefaultRuntime(); in TEST_F() local
445 auto graph = CreateGraphWithDefaultRuntime(); in TEST_F() local
[all …]
|
| /arkcompiler/runtime_core/static_core/bytecode_optimizer/tests/ |
| D | reg_acc_alloc_test.cpp | 60 auto graph = CreateEmptyGraph(); in TEST_F() local
91 auto graph = CreateEmptyGraph(); in TEST_F() local
122 auto graph = CreateEmptyGraph(); in TEST_F() local
154 auto graph = CreateEmptyGraph(); in TEST_F() local
200 auto graph = CreateEmptyGraph(); in TEST_F() local
244 auto graph = CreateEmptyGraph(); in TEST_F() local
270 auto graph = CreateEmptyGraph(); in TEST_F() local
297 auto graph = CreateEmptyGraph(); in TEST_F() local
328 auto graph = CreateEmptyGraph(); in TEST_F() local
368 auto graph = CreateEmptyGraph(); in TEST_F() local
[all …]
|
| D | codegen_test.cpp | 91 auto graph = CreateEmptyGraph(); in TEST_F() local
116 auto graph = CreateEmptyGraph(); in TEST_F() local
182 auto graph = CreateEmptyGraph(); in TEST_F() local
215 auto graph = CreateEmptyGraph(); in TEST_F() local
250 auto graph = CreateEmptyGraph(); in TEST_F() local
283 auto graph = CreateEmptyGraph(); in TEST_F() local
318 auto graph = CreateEmptyGraph(); in TEST_F() local
351 auto graph = CreateEmptyGraph(); in TEST_F() local
385 auto graph = CreateEmptyGraph(); in TEST_F() local
418 auto graph = CreateEmptyGraph(); in TEST_F() local
[all …]
|
| /arkcompiler/runtime_core/static_core/compiler/optimizer/optimizations/regalloc/ |
| D | reg_alloc.cpp | 29 bool IsGraphColoringEnable(Graph *graph) in IsGraphColoringEnable()
42 bool ShouldSkipAllocation(Graph *graph) in ShouldSkipAllocation()
52 void RemoveThrowEdges(Graph *graph) in RemoveThrowEdges()
92 bool RegAlloc(Graph *graph) in RegAlloc()
|