Home
last modified time | relevance | path

Searched refs:HDeadCodeElimination (Results 1 – 6 of 6) sorted by relevance

/art/compiler/optimizing/
Ddead_code_elimination.h31 class HDeadCodeElimination : public HOptimization {
33 HDeadCodeElimination(HGraph* graph, OptimizingCompilerStats* stats, const char* name) in HDeadCodeElimination() function
136 DISALLOW_COPY_AND_ASSIGN(HDeadCodeElimination);
Ddead_code_elimination.cc94 void HDeadCodeElimination::MaybeRecordDeadBlock(HBasicBlock* block) { in MaybeRecordDeadBlock()
101 void HDeadCodeElimination::MaybeRecordSimplifyIf() { in MaybeRecordSimplifyIf()
251 bool HDeadCodeElimination::SimplifyAlwaysThrows() { in SimplifyAlwaysThrows()
321 bool HDeadCodeElimination::SimplifyIfs() { in SimplifyIfs()
452 void HDeadCodeElimination::MaybeAddPhi(HBasicBlock* block) { in MaybeAddPhi()
571 void HDeadCodeElimination::ConnectSuccessiveBlocks() { in ConnectSuccessiveBlocks()
591 struct HDeadCodeElimination::TryBelongingInformation {
603 bool HDeadCodeElimination::CanPerformTryRemoval(const TryBelongingInformation& try_belonging_info) { in CanPerformTryRemoval()
615 void HDeadCodeElimination::DisconnectHandlersAndUpdateTryBoundary( in DisconnectHandlersAndUpdateTryBoundary()
641 void HDeadCodeElimination::RemoveTry(HBasicBlock* try_entry, in RemoveTry()
[all …]
Ddead_code_elimination_test.cc47 HDeadCodeElimination(graph, /* stats= */ nullptr, "dead_code_elimination").Run(); in TestCode()
Doptimization.cc87 return HDeadCodeElimination::kDeadCodeEliminationPassName; in OptimizationPassName()
245 opt = new (allocator) HDeadCodeElimination(graph, stats, pass_name); in ConstructOptimizations()
Dconstant_folding_test.cc75 HDeadCodeElimination(graph_, /* stats= */ nullptr, "dead_code_elimination").Run(); in TestCodeOnReadyGraph()
Dinliner.cc2310 HDeadCodeElimination dce(callee_graph, inline_stats_, "dead_code_elimination$inliner"); in RunOptimizations()