Home
last modified time | relevance | path

Searched refs:Cleanup (Results 1 - 25 of 74) sorted by relevance

123

/arkcompiler/runtime_core/static_core/compiler/optimizer/optimizations/
H A Dcleanup.cpp28 bool Cleanup::CanBeMerged(BasicBlock *bb) in CanBeMerged()
38 /* Cleanup pass works like dead code elimination (DCE) and removes code which does not affect the program results.
43 bool Cleanup::RunImpl() in RunImpl()
108 void Cleanup::CheckBBPhisUsers(BasicBlock *succ, BasicBlock *bb) in CheckBBPhisUsers()
121 bool Cleanup::RunOnce(ArenaSet<BasicBlock *> *emptyBlocks, ArenaSet<BasicBlock *> *newEmptyBlocks, bool simpleDce) in RunOnce()
159 bool Cleanup::SkipBasicBlock(BasicBlock *bb) in SkipBasicBlock()
166 bool Cleanup::CheckSpecialTriangle(BasicBlock *bb) in CheckSpecialTriangle()
200 void Cleanup::RemoveDeadPhi(BasicBlock *bb, ArenaSet<BasicBlock *> *newEmptyBlocks) in RemoveDeadPhi()
219 bool Cleanup::ProcessBB(BasicBlock *bb, Marker deadMrk, ArenaSet<BasicBlock *> *newEmptyBlocks) in ProcessBB()
271 void Cleanup
[all...]
H A Dcleanup.h23 class Cleanup final : public Optimization {
25 explicit Cleanup(Graph *graph, bool lightMode = true) in Cleanup() function in ark::compiler::final
44 NO_MOVE_SEMANTIC(Cleanup);
45 NO_COPY_SEMANTIC(Cleanup);
46 ~Cleanup() override = default;
52 return "Cleanup";
H A Dsimplify_string_builder.h90 void Cleanup(const ConcatenationMatch &match);
212 void Cleanup(const ConcatenationLoopMatch &match);
222 void Cleanup(Loop *loop);
267 void Cleanup(Inst *instance, Inst *instanceFirstAppendCall, Inst *inputInstanceToStringCall);
H A Dsimplify_string_builder.cpp71 // Cleanup should be done before block optimizations, to erase instruction marked as dead in RunImpl()
72 GetGraph()->RunPass<compiler::Cleanup>(); in RunImpl()
76 // Cleanup should be done before block optimizations, to erase instruction marked as dead in RunImpl()
77 GetGraph()->RunPass<compiler::Cleanup>(); in RunImpl()
100 // Cleanup should be done inside pass, to satisfy GraphChecker in RunImpl()
101 GetGraph()->RunPass<compiler::Cleanup>(); in RunImpl()
374 void SimplifyStringBuilder::Cleanup(const ConcatenationMatch &match)
413 Cleanup(match);
789 // Cleanup save states
794 // Cleanup instruction
[all...]
H A Dscheduler.cpp98 Cleanup(); in BuildAllDeps()
344 Cleanup(); in FinalizeBB()
348 void Scheduler::Cleanup() in Cleanup() function in ark::compiler::Scheduler
422 // Cleanup in ScheduleInstsBetweenBarriers()
/arkcompiler/runtime_core/compiler/optimizer/optimizations/
H A Dcleanup.cpp31 /* Cleanup pass works like dead code elimination (DCE) and removes code which does not affect the program results.
35 bool Cleanup::RunImpl() in RunImpl()
97 bool Cleanup::RunOnce(ArenaSet<BasicBlock *> *empty_blocks, ArenaSet<BasicBlock *> *new_empty_blocks, bool simple_dce) in RunOnce()
142 bool Cleanup::CheckSpecialTriangle(BasicBlock *bb) in CheckSpecialTriangle()
174 void Cleanup::RemoveDeadPhi(BasicBlock *bb, ArenaSet<BasicBlock *> *new_empty_blocks) in RemoveDeadPhi()
193 bool Cleanup::ProcessBB(BasicBlock *bb, Marker dead_mrk, ArenaSet<BasicBlock *> *new_empty_blocks) in ProcessBB()
244 void Cleanup::MarkLiveRec(Marker live_mrk, Inst *inst) in MarkLiveRec()
262 bool Cleanup::Dce(Marker dead_mrk, ArenaSet<BasicBlock *> *new_empty_blocks) in Dce()
304 void Cleanup::SetLiveRec(Inst *inst, Marker mrk, Marker live_mrk) in SetLiveRec()
316 void Cleanup
[all...]
H A Dcleanup.h23 class Cleanup final : public Optimization {
25 explicit Cleanup(Graph *graph) in Cleanup() function in panda::compiler::final
43 NO_MOVE_SEMANTIC(Cleanup);
44 NO_COPY_SEMANTIC(Cleanup);
45 ~Cleanup() override = default;
51 return "Cleanup";
/arkcompiler/runtime_core/static_core/compiler/optimizer/
H A Dpipeline.cpp146 graph->template RunPass<Cleanup>(); in RunRegAllocAndCodeGenPass()
198 graph->RunPass<Cleanup>(false); in RunOptimizations()
209 graph->RunPass<Cleanup>(false); in RunOptimizations()
224 graph->RunPass<Cleanup>(); in RunOptimizations()
254 graph->RunPass<Cleanup>(false); in RunOptimizations()
256 graph->RunPass<Cleanup>(false); in RunOptimizations()
266 graph->RunPass<Cleanup>(false); in RunOptimizations()
/arkcompiler/runtime_core/compiler/tests/
H A Dcleanup_test.cpp35 ASSERT_TRUE(GetGraph()->RunPass<Cleanup>()); in TEST_F()
77 ASSERT_TRUE(GetGraph()->RunPass<Cleanup>()); in TEST_F()
129 ASSERT_TRUE(GetGraph()->RunPass<Cleanup>()); in TEST_F()
178 ASSERT_TRUE(GetGraph()->RunPass<Cleanup>()); in TEST_F()
210 ASSERT_FALSE(GetGraph()->RunPass<Cleanup>()); in TEST_F()
256 ASSERT_TRUE(GetGraph()->RunPass<Cleanup>()); in TEST_F()
321 ASSERT_TRUE(GetGraph()->RunPass<Cleanup>()); in TEST_F()
376 ASSERT_TRUE(GetGraph()->RunPass<Cleanup>()); in TEST_F()
409 ASSERT_TRUE(GetGraph()->RunPass<Cleanup>()); in TEST_F()
447 ASSERT_TRUE(GetGraph()->RunPass<Cleanup>()); in TEST_F()
[all...]
H A Dcompiler_optimizations_test.cpp230 EXPECT_TRUE(graph->RunPass<Cleanup>()); in HWTEST_F()
237 * @tc.desc: Verify the Cleanup function.
253 EXPECT_TRUE(graph->RunPass<Cleanup>()); in HWTEST_F()
H A Dvn_test.cpp610 GetGraph()->RunPass<Cleanup>(); in TEST_F()
681 graph_osr->RunPass<Cleanup>(); in TEST_F()
737 GetGraph()->RunPass<Cleanup>(); in TEST_F()
796 GetGraph()->RunPass<Cleanup>(); in TEST_F()
843 GetGraph()->RunPass<Cleanup>(); in TEST_F()
865 GetGraph()->RunPass<Cleanup>(); in TEST_F()
895 GetGraph()->RunPass<Cleanup>(); in TEST_F()
937 GetGraph()->RunPass<Cleanup>(); in TEST_F()
976 GetGraph()->RunPass<Cleanup>(); in TEST_F()
1017 GetGraph()->RunPass<Cleanup>(); in TEST_F()
[all...]
/arkcompiler/runtime_core/static_core/irtoc/backend/
H A Dfunction.cpp257 graph->RunPass<compiler::Cleanup>(); in RunIrtocInterpreterOptimizations()
267 graph->RunPass<compiler::Cleanup>(); in RunIrtocInterpreterOptimizations()
282 graph->RunPass<compiler::Cleanup>(); in RunIrtocInterpreterOptimizations()
290 graph->RunPass<compiler::Cleanup>(); in RunIrtocInterpreterOptimizations()
307 graph->RunPass<compiler::Cleanup>(); in RunIrtocOptimizations()
312 graph->RunPass<compiler::Cleanup>(); in RunIrtocOptimizations()
319 graph->RunPass<compiler::Cleanup>(); in RunIrtocOptimizations()
/arkcompiler/runtime_core/compiler/optimizer/optimizations/regalloc/
H A Dreg_alloc.cpp24 graph->RunPass<Cleanup>(); in RegAlloc()
/arkcompiler/runtime_core/static_core/compiler/tests/
H A Dcleanup_test.cpp28 auto applied = GetGraph()->RunPass<Cleanup>(); in RunCleanupEmptyBlocks()
200 ASSERT_TRUE(GetGraph()->RunPass<Cleanup>()); in TEST_F()
418 ASSERT_TRUE(GetGraph()->RunPass<Cleanup>()); in TEST_F()
451 ASSERT_TRUE(GetGraph()->RunPass<Cleanup>()); in TEST_F()
489 ASSERT_TRUE(GetGraph()->RunPass<Cleanup>()); in TEST_F()
653 ASSERT_TRUE(GetGraph()->RunPass<Cleanup>()); in TEST_F()
722 ASSERT_TRUE(GetGraph()->RunPass<Cleanup>()); in TEST_F()
752 ASSERT_TRUE(GetGraph()->RunPass<Cleanup>()); in TEST_F()
791 ASSERT_TRUE(GetGraph()->RunPass<Cleanup>()); in TEST_F()
820 ASSERT_TRUE(GetGraph()->RunPass<Cleanup>()); in TEST_F()
[all...]
H A Dlinear_order_test.cpp223 ASSERT_TRUE(GetGraph()->RunPass<Cleanup>(false)); in TEST_F()
380 GetGraph()->RunPass<Cleanup>(false); in TEST_F()
382 GetGraph()->RunPass<Cleanup>(); in TEST_F()
385 GetGraph()->RunPass<Cleanup>(); in TEST_F()
H A Dif_merging_test.cpp106 ASSERT_TRUE(graph->RunPass<Cleanup>()); in TEST_F()
268 ASSERT_TRUE(GetGraph()->RunPass<Cleanup>()); in TEST_F()
328 ASSERT_TRUE(graph->RunPass<Cleanup>()); in TEST_F()
571 ASSERT_TRUE(GetGraph()->RunPass<Cleanup>()); in TEST_F()
647 ASSERT_TRUE(GetGraph()->RunPass<Cleanup>()); in TEST_F()
724 ASSERT_TRUE(GetGraph()->RunPass<Cleanup>()); in TEST_F()
867 ASSERT_TRUE(GetGraph()->RunPass<Cleanup>()); in TEST_F()
963 ASSERT_TRUE(GetGraph()->RunPass<Cleanup>()); in TEST_F()
1122 ASSERT_TRUE(GetGraph()->RunPass<Cleanup>()); in TEST_F()
1210 ASSERT_TRUE(graph->RunPass<Cleanup>()); in TEST_F()
[all...]
H A Dloop_unroll_test.cpp48 graph->RunPass<Cleanup>(); in CheckRetOnVixlSimulator()
114 graph->RunPass<Cleanup>(); in CheckSimpleLoop()
578 graph->RunPass<Cleanup>(); in TEST_F()
631 graph->RunPass<Cleanup>(); in TEST_F()
660 graph->RunPass<Cleanup>(); in TEST_F()
791 graph->RunPass<Cleanup>(); in TEST_F()
837 graph->RunPass<Cleanup>(); in TEST_F()
891 clone->RunPass<Cleanup>(); in TEST_F()
899 graph->RunPass<Cleanup>(); in TEST_F()
912 graph->RunPass<Cleanup>(); in TEST_F()
[all...]
H A Dlowering_test.cpp204 graph->RunPass<compiler::Cleanup>(); in TEST_F()
532 EXPECT_TRUE(graph->RunPass<Cleanup>()); in TEST_F()
600 EXPECT_TRUE(graph->RunPass<Cleanup>()); in TEST_F()
678 EXPECT_TRUE(graph->RunPass<Cleanup>()); in TEST_F()
811 EXPECT_TRUE(graph->RunPass<Cleanup>()); in TEST_F()
866 EXPECT_TRUE(graph->RunPass<Cleanup>()); in TEST_F()
929 EXPECT_TRUE(graph->RunPass<Cleanup>()); in TEST_F()
986 EXPECT_TRUE(graph->RunPass<Cleanup>()); in TEST_F()
1040 EXPECT_TRUE(graph->RunPass<Cleanup>()); in TEST_F()
1141 EXPECT_TRUE(graph->RunPass<Cleanup>()); in TEST_F()
[all...]
/arkcompiler/runtime_core/bytecode_optimizer/tests/
H A Dcodegen_test.cpp541 EXPECT_TRUE(graph->RunPass<compiler::Cleanup>()); in HWTEST_F()
542 EXPECT_FALSE(graph->RunPass<compiler::Cleanup>()); in HWTEST_F()
546 EXPECT_FALSE(graph->RunPass<compiler::Cleanup>()); in HWTEST_F()
548 EXPECT_FALSE(graph->RunPass<compiler::Cleanup>()); in HWTEST_F()
550 EXPECT_FALSE(graph->RunPass<compiler::Cleanup>()); in HWTEST_F()
H A Dconstant_propagation_test.cpp76 EXPECT_TRUE(graph->RunPass<compiler::Cleanup>()); in CheckFunction()
90 auto modified = graph->RunPass<compiler::Cleanup>(); in CheckFunction()
444 EXPECT_TRUE(graph->RunPass<compiler::Cleanup>()); in HWTEST_F()
454 EXPECT_TRUE(graph->RunPass<compiler::Cleanup>()); in HWTEST_F()
H A Dcommon.h718 GetGraph()->RunPass<compiler::Cleanup>();
723 GetGraph()->RunPass<compiler::Cleanup>();
725 GetGraph()->RunPass<compiler::Cleanup>();
727 GetGraph()->RunPass<compiler::Cleanup>();
731 GetGraph()->RunPass<compiler::Cleanup>();
/arkcompiler/runtime_core/static_core/compiler/optimizer/optimizations/regalloc/
H A Dcleanup_empty_blocks.cpp63 if (!Cleanup::SkipBasicBlock(bb) && bb->IsEmpty()) { in CleanupEmptyBlocks()
/arkcompiler/runtime_core/static_core/bytecode_optimizer/
H A Doptimize_bytecode.cpp61 graph->RunPass<compiler::Cleanup>(false); in RunOpts()
95 graph->RunPass<compiler::Cleanup>(false); in RunOptimizations()
115 graph->RunPass<compiler::Cleanup>(false); in RunOptimizations()
118 graph->RunPass<compiler::Cleanup>(false); in RunOptimizations()
/arkcompiler/runtime_core/bytecode_optimizer/
H A Doptimize_bytecode.cpp56 graph->RunPass<compiler::Cleanup>(); in RunOpts()
75 graph->RunPass<compiler::Cleanup>(); in RunOptimizations()
86 graph->RunPass<compiler::Cleanup>(); in RunOptimizations()
89 graph->RunPass<compiler::Cleanup>(); in RunOptimizations()
95 graph->RunPass<compiler::Cleanup>(); in RunOptimizations()
/arkcompiler/runtime_core/static_core/bytecode_optimizer/tests/
H A Dbc_lowering_test.cpp59 GetGraph()->RunPass<compiler::Cleanup>(); in TEST_F()
116 init->RunPass<compiler::Cleanup>(); in TEST_F()
191 init->RunPass<compiler::Cleanup>(); in TEST_F()
271 init->RunPass<compiler::Cleanup>(); in TEST_F()
347 init->RunPass<compiler::Cleanup>(); in TEST_F()

Completed in 39 milliseconds

123