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
..
Hello
InstCombine	Add a small missed optimization: turn X == C ? X : Y into X == C ? C : Y. This	2011-03-27 07:30:57 +00:00
Instrumentation	Implementation of path profiling.	2011-01-29 01:09:53 +00:00
IPO	No functionality change, just adjust some whitespace for coding style compliance.	2011-03-25 06:05:50 +00:00
Scalar	Simplification noticed by Frits.	2011-03-26 09:32:07 +00:00
Utils	Simplify.	2011-03-21 22:04:45 +00:00
CMakeLists.txt	Move library stuff out of the toplevel CMakeLists.txt file.	2011-02-18 22:06:14 +00:00
Makefile