Owen Anderson ec3953ff95 When determining if we can fold (x >> C1) << C2, the bits that we need to verify are zero ...

are not the low bits of x, but the bits that WILL be the low bits after the operation completes.


git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@122529 91177308-0d34-0410-b5e6-96231b3b80d8

2010-12-23 23:56: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 determining if we can fold (x >> C1) << C2, the bits that we need to verify are zero

2010-12-23 23:56:24 +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

reapply r121100 with a tweak to constant fold ConstExprs with TargetData

2010-12-07 04:33:29 +00:00

Scalar

It is possible for SimplifyCFG to cause PHI nodes to become redundant too late in the optimization

2010-12-23 20:57:35 +00:00

Utils

Change all self assignments X=X to (void)X, so that we can turn on a

2010-12-23 00:58:24 +00:00

Makefile

Revert r100896 and around - this breaks the only mingw32 buildbot we have.

2010-04-15 19:51:42 +00:00