DbgInfoIntrinsics no longer appear in an instruction's use list; so clean up looking for them in use iterations and remove OnlyUsedByDbgInfoIntrinsics()

llvm-svn: 94111

loop-variant components, adds must be inserted after the increment.
Keep track of the increment position for this case, and insert
these adds in the correct location.

llvm-svn: 94110

llvm-svn: 94108

operands exceeds the number of registers used in the initial
solution, as that wouldn't lead to a profitable solution anyway.

llvm-svn: 94107

llvm-svn: 94104

This new version is much more aggressive about doing "full" reduction in
cases where it reduces register pressure, and also more aggressive about
rewriting induction variables to count down (or up) to zero when doing so
reduces register pressure.

It currently uses fairly simplistic algorithms for finding reuse
opportunities, but it introduces a new framework allows it to combine
multiple strategies at once to form hybrid solutions, instead of doing
all full-reduction or all base+index.

llvm-svn: 94061

answers.  This will update as object size checking gets better information.

llvm-svn: 94059

than the scaled register. This makes it more likely that subsequent
AddrModeMatcher queries will match the new address the same way as the
old, instead of accidentally matching what had been the base register
as the new scaled register, and then failing to match the scaled register.
This fixes some problems with address-mode sinking multiple muls into a
block, which will be a lot more common with some upcoming
LoopStrengthReduction changes.

llvm-svn: 93935

are the same.  I had already fixed a similar problem where the source and
destination were different bitcasts derived from the same alloca, but the
previous fix still did not handle the case where both operands are exactly
the same value.  Radar 7552893.

llvm-svn: 93848

llvm-svn: 93693

in JT.

2) When cloning blocks for PHI or xor conditions, use
instsimplify to simplify the code as we go.  This allows us to 
squish common cases early in JT which opens up opportunities for
subsequent iterations, and allows it to completely simplify the
testcase.

llvm-svn: 93253

llvm-svn: 93222

condition is a xor with a phi node.  This eliminates nonsense
like this from 176.gcc in several places:

 LBB166_84:
        testl   %eax, %eax
-       setne   %al
-       xorb    %cl, %al
-       notb    %al
-       testb   $1, %al
-       je      LBB166_85
+       je      LBB166_69
+       jmp     LBB166_85

This is rdar://7391699

llvm-svn: 93221

on branches by renaming it and checking for a branch at the call site.

llvm-svn: 93208

base is the right expression type.  This fixes PR5981.

llvm-svn: 93045

remove some trailing whitespace while there.

llvm-svn: 93008

llvm-svn: 92912

it work for any integer size return type.

llvm-svn: 92853

llvm-svn: 92831

llvm-svn: 92771

llvm-svn: 92760

llvm-svn: 92735

non-zero trip count. Use SmallVector's pop_back_val().

llvm-svn: 92734

llvm-svn: 92679

llvm-svn: 92624

llvm-svn: 92623

llvm-svn: 92622

llvm-svn: 92620

llvm-svn: 92619

llvm-svn: 92617

llvm-svn: 92615

llvm-svn: 92614

llvm-svn: 92613

llvm-svn: 92612

llvm-svn: 92611

llvm-svn: 92610

llvm-svn: 92609

llvm-svn: 92608

 Intrinsic::dbg_stoppoint
 Intrinsic::dbg_region_start 
 Intrinsic::dbg_region_end 
 Intrinsic::dbg_func_start
AutoUpgrade simply ignores these intrinsics now.

llvm-svn: 92557

llvm-svn: 92470