diff options
| author | Dan Gohman <gohman@apple.com> | 2010-09-03 22:12:56 +0000 |
|---|---|---|
| committer | Dan Gohman <gohman@apple.com> | 2010-09-03 22:12:56 +0000 |
| commit | 76abb25cc99e676faceaacba052413284f438c2e (patch) | |
| tree | f97decdcdf7f3998a4c5819d2d650da259fc425c /lib/Analysis/ScalarEvolutionNormalization.cpp | |
| parent | 5f53c6699e69b0b42f8fb73cf80c9db433940b34 (diff) | |
| download | external_llvm-76abb25cc99e676faceaacba052413284f438c2e.zip external_llvm-76abb25cc99e676faceaacba052413284f438c2e.tar.gz external_llvm-76abb25cc99e676faceaacba052413284f438c2e.tar.bz2 | |
Disable the asserts that check that normalization is perfectly
invertible. ScalarEvolution's folding routines don't always succeed
in canonicalizing equal expressions to a single canonical form, and
this can cause these asserts to fail, even though there's no actual
correctness problem. This fixes PR8066.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@113021 91177308-0d34-0410-b5e6-96231b3b80d8
Diffstat (limited to 'lib/Analysis/ScalarEvolutionNormalization.cpp')
| -rw-r--r-- | lib/Analysis/ScalarEvolutionNormalization.cpp | 9 |
1 files changed, 7 insertions, 2 deletions
diff --git a/lib/Analysis/ScalarEvolutionNormalization.cpp b/lib/Analysis/ScalarEvolutionNormalization.cpp index 498387a..ac36cef 100644 --- a/lib/Analysis/ScalarEvolutionNormalization.cpp +++ b/lib/Analysis/ScalarEvolutionNormalization.cpp @@ -108,7 +108,11 @@ const SCEV *llvm::TransformForPostIncUse(TransformKind Kind, Result = SE.getMinusSCEV(Result, TransformedStep); Loops.insert(L); } -#ifdef XDEBUG +#if 0 + // This assert is conceptually correct, but ScalarEvolution currently + // sometimes fails to canonicalize two equal SCEVs to exactly the same + // form. It's possibly a pessimization when this happens, but it isn't a + // correctness problem, so disable this assert for now. assert(S == TransformForPostIncUse(Denormalize, Result, User, OperandValToReplace, Loops, SE, DT) && @@ -122,7 +126,8 @@ const SCEV *llvm::TransformForPostIncUse(TransformKind Kind, User, OperandValToReplace, Loops, SE, DT); Result = SE.getMinusSCEV(Result, TransformedStep); } -#ifdef XDEBUG +#if 0 + // See the comment on the assert above. assert(S == TransformForPostIncUse(Denormalize, Result, User, OperandValToReplace, Loops, SE, DT) && |