Nick Lewycky 98cd75027c 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
2011-03-27 07:30:57 +00:00
..
2009-09-27 06:25:05 +00:00
2010-02-17 00:54:58 +00:00
2010-01-18 22:00:46 +00:00
2010-01-05 21:54:09 +00:00
2011-02-13 08:27:31 +00:00
2011-02-11 19:37:55 +00:00
2011-03-09 22:07:31 +00:00
2010-07-12 00:19:47 +00:00
2009-09-16 16:33:59 +00:00
2010-09-02 22:38:56 +00:00

This directory contains test cases for the instcombine transformation.  The
dated tests are actual bug tests, whereas the named tests are used to test
for features that the this pass should be capable of performing.