The most common simplification missed by instsimplify in unoptimized bitcode
authorDuncan Sands <baldrick@free.fr>
Thu, 13 Jan 2011 08:56:29 +0000 (08:56 +0000)
committerDuncan Sands <baldrick@free.fr>
Thu, 13 Jan 2011 08:56:29 +0000 (08:56 +0000)
commit6dc91253ab1872e118b08511a09d5c934988354e
tree810b5ba30e433923840e644ce3668854056c1187
parent7597212abced110723f2fee985a7d60557c092ec
The most common simplification missed by instsimplify in unoptimized bitcode
is "X != 0 -> X" when X is a boolean.  This occurs a lot because of the way
llvm-gcc converts gcc's conditional expressions.  Add this, and a few other
similar transforms for completeness.

git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@123372 91177308-0d34-0410-b5e6-96231b3b80d8
lib/Analysis/InstructionSimplify.cpp
test/Transforms/InstSimplify/2010-12-20-I1Arithmetic.ll