llvm-svn: 88742

llvm-svn: 87042

  cannot be folded into target cmp instruction.
- Avoid a phase ordering issue where early cmp optimization would prevent the
  later count-to-zero optimization.
- Add missing checks which could cause LSR to reuse stride that does not have
  users.
- Fix a bug in count-to-zero optimization code which failed to find the pre-inc
  iv's phi node.
- Remove, tighten, loosen some incorrect checks disable valid transformations.
- Quite a bit of code clean up.

llvm-svn: 86969

which implements GCC PR18046.  This also gets us 360 more
jump threads on 176.gcc.

llvm-svn: 86953

llvm-svn: 86952

making the new LVI stuff smart enough to subsume some special
cases in the old code.  Disable them when LVI is around, the
testcase still passes.

llvm-svn: 86951

allows us to handle the test10 testcase.

llvm-svn: 86924

llvm-svn: 86923

llvm-svn: 86920

uses LVI info when -enable-jump-threading-lvi is passed.

llvm-svn: 86886

llvm-svn: 86810

start using them in a trivial way when -enable-jump-threading-lvi
is passed.  enable-jump-threading-lvi will be my playground for 
awhile.

llvm-svn: 86789

llvm-svn: 86766

llvm-svn: 86761

llvm-svn: 86739

into libanalysis and transformutils.

llvm-svn: 86735

tracked down by Stephan Reiter!

llvm-svn: 86726

llvm-svn: 86723

debug intrinsics, and an unconditional branch when possible.  This
reuses the TryToSimplifyUncondBranchFromEmptyBlock function split
out of simplifycfg.

llvm-svn: 86722

llvm-svn: 86715

llvm-svn: 86705

llvm-svn: 86694

llvm-svn: 86689

llvm-svn: 86683

llvm-svn: 86681

of a computation.  This fixes some infinite loops when dealing with TD that
has no native types.

llvm-svn: 86670

llvm-svn: 86668

memory just like a store" with bug fixed (partial-overwrite.ll is the
regression test).

llvm-svn: 86667

just one level deep.  On the testcase we go from getting this:

F1:                                               ; preds = %T2
  %F = and i1 true, %cond                         ; <i1> [#uses=1]
  br i1 %F, label %X, label %Y

to a fully threaded:

F1:                                               ; preds = %T2
  br label %Y


This changes gets us to the point where we're forming (too many) switch 
instructions on doug's strswitch testcase.

llvm-svn: 86646

llvm-svn: 86639

except that the result may not be a constant.  Switch jump threading to 
use it so that it gets things like (X & 0) -> 0, which occur when phi preds
are deleted and the remaining phi pred was a zero.

llvm-svn: 86637

This patch forbids implicit conversion of DenseMap::const_iterator to
DenseMap::iterator which was possible because DenseMapIterator inherited
(publicly) from DenseMapConstIterator. Conversion the other way around is now
allowed as one may expect.

The template DenseMapConstIterator is removed and the template parameter
IsConst which specifies whether the iterator is constant is added to
DenseMapIterator.

Actually IsConst parameter is not necessary since the constness can be
determined from KeyT but this is not relevant to the fix and can be addressed
later.

Patch by Victor Zverovich!

llvm-svn: 86636

llvm-svn: 86635

simplification, this handles the foldable fcmp x,x cases among many others.

llvm-svn: 86627

llvm-svn: 86625

Simplify[IF]Cmp pieces.  Add some predicates to CmpInst to 
determine whether a predicate is fp or int.

llvm-svn: 86624

llvm-svn: 86616

simplifies instruction users of PHIs when the phi is eliminated.  This
will be moved to transforms/utils after some other refactoring.

llvm-svn: 86603

it to a normal binop.  Patch by Alastair Lynn, testcase by me.

llvm-svn: 86524

putchar in case there is an error.

llvm-svn: 86515