diff options
| author | Aart Bik <ajcbik@google.com> | 2018-05-02 16:07:51 -0700 |
|---|---|---|
| committer | Aart Bik <ajcbik@google.com> | 2018-05-03 09:26:25 -0700 |
| commit | a8360cd6b858906f20558552f7bf3b3876c72ec4 (patch) | |
| tree | 357c6916cb832b9a27ff6bbcf2d9344fb818e569 /compiler/optimizing/loop_optimization.cc | |
| parent | d637fdac0ea396780b12052c7ab9de61744bcd4b (diff) | |
Perform rudimentary check on graph size for no-change assertions.
Rationale:
This will find blatant violations of asserting a no-change
pass change if the graph size changed nevertheless.
Bug: 78171933
Test: test-art-host,target
Change-Id: I07b38e71c75dd6f728246d096976c8333b363329
Diffstat (limited to 'compiler/optimizing/loop_optimization.cc')
| -rw-r--r-- | compiler/optimizing/loop_optimization.cc | 1 |
1 files changed, 1 insertions, 0 deletions
diff --git a/compiler/optimizing/loop_optimization.cc b/compiler/optimizing/loop_optimization.cc index 0d85c2fbf5..1ce3524bd6 100644 --- a/compiler/optimizing/loop_optimization.cc +++ b/compiler/optimizing/loop_optimization.cc @@ -589,6 +589,7 @@ bool HLoopOptimization::TraverseLoopsInnerToOuter(LoopNode* node) { // loop if the induction of any inner loop has changed. if (TraverseLoopsInnerToOuter(node->inner)) { induction_range_.ReVisit(node->loop_info); + changed = true; } // Repeat simplifications in the loop-body until no more changes occur. // Note that since each simplification consists of eliminating code (without |