Philip Reames 5da5d12ae7 [ValueTracking] Remove dead code from an old experiment ... This experiment was originally about trying to use facts implied dominating conditions to infer more precise known bits. While the compile time was found to be acceptable on several large code bases, we never found sufficiently profitable examples to justify turning on the code by default. Given this, it's time to abandon the experiment. Several folks have commented that they've found this useful for experimentation, but nothing has come of those experiments. Given how easy the patch is to apply, there's no reason to leave the code in tree. For anyone interested in further investigation in this area, I recommend finding the summary email I sent on one of the original review threads. In particular, I now believe the use-list based approach is strictly worse than the dom-tree-walking approach. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@262646 91177308-0d34-0410-b5e6-96231b3b80d8		2016-03-03 19:44:06 +00:00
..
assume.ll	[ValueTracking] do not overwrite analysis results already computed	2015-06-15 05:46:29 +00:00
known-bits-from-range-md.ll	[ValueTracking] Use !range metadata more aggressively in KnownBits	2015-10-28 03:20:15 +00:00
known-non-equal.ll	[ValueTracking] Add a new predicate: isKnownNonEqual()	2015-10-22 13:18:42 +00:00
known-power-of-two.ll	[ValueTracking] fix bug computing isKnownToBeAPowerOfTwo() with arithmetic shift right (PR25900)	2015-12-30 22:40:52 +00:00
knownnonzero-shift.ll	[ValueTracking] Extend r251146 to catch a fairly common case	2015-10-26 14:10:46 +00:00
knownzero-shift.ll	[ValueTracking] Teach isKnownNonZero a new trick	2015-09-24 16:06:32 +00:00
memory-dereferenceable.ll	[gc.statepoint] Change gc.statepoint intrinsic's return type to token type instead of i32 type	2015-12-26 07:54:32 +00:00
monotonic-phi.ll	[ValueTracking] Teach isKnownNonZero about monotonically increasing PHIs	2015-09-29 14:08:45 +00:00
pr23011.ll	[ValueTracking] Fix PR23011.	2015-03-25 22:33:53 +00:00