code sequences.

llvm-svn: 22719

opts than they take directly.  Thanks to John C for pointing this problem
out to me!

llvm-svn: 22717

Patch by Jim Laskey.

llvm-svn: 22716

Patch by Jim Laskey!

llvm-svn: 22715

way.  This allows ORI/ORIS pairs, for example.

llvm-svn: 22714

Includes wider support for rotate and mask cases.

Patch by Jim Laskey.

I've requested that Jim add new regression tests the newly handled cases.

llvm-svn: 22712

Includes support for 32-bit constants using addi/addis.

Patch by Jim Laskey.

llvm-svn: 22711

Patch by Jim Laskey

llvm-svn: 22710

Patch by Jim Laskey

llvm-svn: 22709

(lowercase isXXX).

Patch by Jim Laskey.

llvm-svn: 22708

llvm-svn: 22707

easier to understand?  :)

llvm-svn: 22706

'opt x y').  This fixes PR493.

Patch contributed by Owen Anderson!

llvm-svn: 22705

llvm-svn: 22704

rewriter for all code inserted into the preheader, which is never flushed.

llvm-svn: 22702

The termination condition actually wants to use the post-incremented value
of the loop, not a new indvar with an unusual base.

On PPC, for example, this allows us to compile
LoopStrengthReduce/exit_compare_live_range.ll to:

_foo:
        li r2, 0
.LBB_foo_1:     ; no_exit
        li r5, 0
        stw r5, 0(r3)
        addi r2, r2, 1
        cmpw cr0, r2, r4
        bne .LBB_foo_1  ; no_exit
        blr

instead of:

_foo:
        li r2, 1                ;; IV starts at 1, not 0
.LBB_foo_1:     ; no_exit
        li r5, 0
        stw r5, 0(r3)
        addi r5, r2, 1
        cmpw cr0, r2, r4
        or r2, r5, r5           ;; Reg-reg copy, extra live range
        bne .LBB_foo_1  ; no_exit
        blr

This implements LoopStrengthReduce/exit_compare_live_range.ll

llvm-svn: 22699

llvm-svn: 22698

llvm-svn: 22696

llvm-svn: 22694

isHighOnes, where it would consider 0 to have high ones.

llvm-svn: 22693

llvm-svn: 22692

llvm-svn: 22691

* Teach this code to move allocas out of the loop when tail call eliminating
  a call marked 'tail'.  This implements TailCallElim/move_alloca_for_tail_call.ll
* Do not perform this transformation if a call is marked 'tail' and if there
  are allocas that we cannot move out of the loop in #2.  Doing so would increase
  the stack usage of the function.  This implements fixes
  PR615 and TailCallElim/dont-tce-tail-marked-call.ll.

llvm-svn: 22690

depending on the command line option.  Now the command line option just
sets the subtarget as appropriate.  G5 opts will now default to on on
G5-enabled nightly testers among other machines.

llvm-svn: 22688

llvm-svn: 22687

is available, since the target triple doesn't specify whether to use gpopts
or not.

llvm-svn: 22685

llvm-svn: 22681

avoid revisiting nodes more than once.  This eliminates a source of
potentially exponential behavior.  For a small function in 191.fma3d
(hexah_stress_divergence_), this speeds up isel from taking > 20mins to
taking 0.07s.

llvm-svn: 22680

llvm-svn: 22679

yesterday.  This fixes whetstone and a bunch of programs in the External tests.

llvm-svn: 22678

a subtarget.

llvm-svn: 22677

PHI is its only operand.

llvm-svn: 22676

llvm-svn: 22675

This fixes LSR crashes on 301.apsi, 191.fma3d, and 189.lucas

llvm-svn: 22673

the PHI node, this ugly code can vanish.

llvm-svn: 22672

llvm-svn: 22671

dominate the PHI node, this code can go away.  This also makes passes more
aggressive, e.g. implementing Transforms/CondProp/phisimplify2.ll

llvm-svn: 22670

prepared to deal with return values that do not dominate the PHI.  If we
cannot prove that the result dominates the PHI node, do not return it if
the client can't cope.

llvm-svn: 22669

llvm-svn: 22667

llvm-svn: 22666