aboutsummaryrefslogtreecommitdiff
path: root/lib/Support/APInt.cpp
diff options
context:
space:
mode:
authorNick Lewycky <nicholas@mxc.ca>2011-03-27 07:30:57 +0000
committerNick Lewycky <nicholas@mxc.ca>2011-03-27 07:30:57 +0000
commit98cd75027c3db009ffb64aebf613382299858c32 (patch)
tree3ee01543981f258d513adac670761dea5507c972 /lib/Support/APInt.cpp
parentd645151ac680ae9d6b9c032b3de903d5ae5a22ac (diff)
Add a small missed optimization: turn X == C ? X : Y into X == C ? C : Y. This
removes one use of X which helps it pass the many hasOneUse() checks. In my analysis, this turns up very often where X = A >>exact B and that can't be simplified unless X has one use (except by increasing the lifetime of A which is generally a performance loss). git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@128373 91177308-0d34-0410-b5e6-96231b3b80d8
Diffstat (limited to 'lib/Support/APInt.cpp')
0 files changed, 0 insertions, 0 deletions