Nick Lewycky bb2518c716 Remove bogus test: for all possible inputs of %X, the 'sub nsw' is guaranteed ... to perform a signed wrap. Don't rely on any particular handling of that case. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@135471 91177308-0d34-0410-b5e6-96231b3b80d8		2011-07-19 08:22:57 +00:00
..
2010-12-20-Boolean.ll
2010-12-20-Distribute.ll	Simplify (X<<1)-X into X. According to my auto-simplier this is the most common missed	2011-01-18 09:24:58 +00:00
2011-01-14-Thread.ll	Factorize common code out of the InstructionSimplify shift logic. Add in	2011-01-14 14:44:12 +00:00
2011-02-01-Vector.ll	Have m_One also match constant vectors for which every element is 1.	2011-02-01 08:39:12 +00:00
compare.ll	Remove bogus test: for all possible inputs of %X, the 'sub nsw' is guaranteed	2011-07-19 08:22:57 +00:00
dg.exp
exact-nsw-nuw.ll	Teach instsimplify some tricks about exact/nuw/nsw shifts.	2011-02-09 17:15:04 +00:00
fdiv.ll	Move InstCombine's knowledge of fdiv to SimplifyInstruction().	2011-01-29 15:26:31 +00:00
maxmin.ll	The comparision "max(x,y)==x" is equivalent to "x>=y". Since the max is	2011-05-07 16:56:49 +00:00
reassociate.ll	teach instsimplify to transform (X / Y) * Y to X	2011-02-06 22:05:31 +00:00
rem.ll	Move some rem transforms out of instcombine and into instsimplify.	2011-05-02 16:27:02 +00:00
undef.ll	Improve constant folding of undef for cmp and select operators.	2011-07-01 01:03:43 +00:00