Duncan Sands 88c3df7afb Have GVN simplify instructions as it goes. For example, consider ... "%z = %x and %y". If GVN can prove that %y equals %x, then it turns this into "%z = %x and %x". With the new code, %z will be replaced with %x everywhere (and then deleted). Previously %z would be value numbered too, which is a waste of time. Also, while a clever value numbering algorithm would give %z the same value number as %x, our current one doesn't do so (at least I don't think it does). The new logic has an essentially equivalent effect to what you would get if %z was given the same value number as %x, i.e. it should make value numbering smarter. While there, get hold of target data once at the start rather than a gazillion times all over the place. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@118923 91177308-0d34-0410-b5e6-96231b3b80d8		2010-11-12 21:10:24 +00:00
..
Hello	Since the Hello pass is built as a loadable dynamic library, don't try to convert it to new-style registration yet.	2010-10-07 00:31:16 +00:00
InstCombine	When checking that the necessary bits are zero in	2010-11-10 01:30:56 +00:00
Instrumentation	Get rid of static constructors for pass registration. Instead, every pass exposes an initializeMyPassFunction(), which	2010-10-19 17:21:58 +00:00
IPO	Add helper functions for computing the Location of load, store,	2010-11-11 21:50:19 +00:00
Scalar	Have GVN simplify instructions as it goes. For example, consider	2010-11-12 21:10:24 +00:00
Utils	Inline asm multiple alternative constraints development phase 2 - improved basic logic, added initial platform support.	2010-10-29 17:29:13 +00:00
Makefile	Revert r100896 and around - this breaks the only mingw32 buildbot we have.	2010-04-15 19:51:42 +00:00