diff options
| author | Duncan Sands <baldrick@free.fr> | 2012-07-26 09:26:40 +0000 |
|---|---|---|
| committer | Duncan Sands <baldrick@free.fr> | 2012-07-26 09:26:40 +0000 |
| commit | 20b2d21509b3d5a10ec5d7be6dea8afa9e92fdee (patch) | |
| tree | daebc7604cfb9311f7d2990c3402f46fa76f1a5f /lib/Transforms/Scalar/Reassociate.cpp | |
| parent | 52a111fe1aa10e5e499d8bccc225052ae06f1941 (diff) | |
Stop reassociate from looking through expressions of arbitrary complexity. This
is a temporary measure until my fix for PR13021 is ready.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@160778 91177308-0d34-0410-b5e6-96231b3b80d8
Diffstat (limited to 'lib/Transforms/Scalar/Reassociate.cpp')
| -rw-r--r-- | lib/Transforms/Scalar/Reassociate.cpp | 2 |
1 files changed, 2 insertions, 0 deletions
diff --git a/lib/Transforms/Scalar/Reassociate.cpp b/lib/Transforms/Scalar/Reassociate.cpp index ffcf97c62e..09687d8909 100644 --- a/lib/Transforms/Scalar/Reassociate.cpp +++ b/lib/Transforms/Scalar/Reassociate.cpp @@ -543,6 +543,7 @@ static bool LinearizeExprTree(BinaryOperator *I, // Update the number of paths to the leaf. IncorporateWeight(It->second, Weight, Opcode); +#if 0 // TODO: Re-enable once PR13021 is fixed. // The leaf already has one use from inside the expression. As we want // exactly one such use, drop this new use of the leaf. assert(!Op->hasOneUse() && "Only one use, but we got here twice!"); @@ -559,6 +560,7 @@ static bool LinearizeExprTree(BinaryOperator *I, Leaves.erase(It); continue; } +#endif // If we still have uses that are not accounted for by the expression // then it is not safe to modify the value. |