RPCS3/llvm
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm.git synced 2024-12-31 08:54:31 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

[BasicAliasAnalysis] Simplify expression, no functional change.

Browse Source 
(-1) - x + 1 is the same as -x.

git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@251185 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Benjamin Kramer 2015-10-24 11:38:01 +00:00
parent a6f34a57ce
commit d2c7e761d2
1 changed files with 2 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

5
lib/Analysis/BasicAliasAnalysis.cpp
View File

@ -1538,11 +1538,10 @@ bool BasicAAResult::constantOffsetHeuristic(
// If we've been sext'ed then zext'd the maximum difference between Var0 and
// Var1 is possible to calculate, but we're just interested in the absolute
// minumum difference between the two. The minimum distance may occur due to
// minimum difference between the two. The minimum distance may occur due to
// wrapping; consider "add i3 %i, 5": if %i == 7 then 7 + 5 mod 8 == 4, and so
// the minimum distance between %i and %i + 5 is 3.
APInt MinDiff = V0Offset - V1Offset,
Wrapped = APInt::getMaxValue(Width) - MinDiff + APInt(Width, 1);
APInt MinDiff = V0Offset - V1Offset, Wrapped = -MinDiff;
MinDiff = APIntOps::umin(MinDiff, Wrapped);
uint64_t MinDiffBytes = MinDiff.getZExtValue() * std::abs(Var0.Scale);