From 639cc8c7bbb7d8c341173bcf24604ccb4328acb8 Mon Sep 17 00:00:00 2001 From: Aart Bik Date: Tue, 18 Oct 2016 13:03:31 -0700 Subject: Improve recognition of select-based period induction. Rationale: Similar to the previous CL, this helps to eliminate more dead induction. Now, CaffeineLogic, when compiled with dx (rather than jack) improves by a 1.5 speedup (9000us -> 6000us). Note: We need to run the simplifier before induction analysis to trigger the select simplification first. Although a bit of a compile-time hit, it seems a good idea to run a simplifier here again anyway. Test: test-art-host Change-Id: I93b91ca40a4d64385c64393028e8d213f0c904a8 --- compiler/optimizing/loop_optimization.cc | 1 + 1 file changed, 1 insertion(+) (limited to 'compiler/optimizing/loop_optimization.cc') diff --git a/compiler/optimizing/loop_optimization.cc b/compiler/optimizing/loop_optimization.cc index 703a10402d..b88e73b979 100644 --- a/compiler/optimizing/loop_optimization.cc +++ b/compiler/optimizing/loop_optimization.cc @@ -221,6 +221,7 @@ void HLoopOptimization::TraverseLoopsInnerToOuter(LoopNode* node) { if (current_induction_simplification_count != induction_simplication_count_) { induction_range_.ReVisit(node->loop_info); } + SimplifyBlocks(node); SimplifyInduction(node); SimplifyBlocks(node); if (node->inner == nullptr) { -- cgit v1.2.3-59-g8ed1b