- Conditionalize Dwarf debugging output (Darwin only for now).

llvm-svn: 26582

llvm-svn: 26581

llvm-svn: 26580

the pointer is known to come from either a global variable, alloca or
malloc.  This allows us to compile this:

  P = malloc(28);
  memset(P, 0, 28);

into explicit stores on PPC instead of a memset call.

llvm-svn: 26577

llvm-svn: 26573

llvm-svn: 26572

range to be generated.

llvm-svn: 26570

targets can implement them.  Make the top-down scheduler non-g5-specific.

Remove the old testing hazard recognizer.

llvm-svn: 26569

llvm-svn: 26567

llvm-svn: 26566

noops as null pointers in the instruction sequence.

llvm-svn: 26564

llvm-svn: 26562

copyfromreg nodes.  Clearly useful!

llvm-svn: 26559

llvm-svn: 26558

llvm-svn: 26554

function of the top-down scheduler are completely bogus currently, and
having (future) PPC specific in this file is also wrong, but this is a
small incremental step.

llvm-svn: 26552

bounds its lifetime.

llvm-svn: 26550

llvm-svn: 26549

llvm-svn: 26548

we want to canonicalize the other way.

llvm-svn: 26547

llvm-svn: 26545

It's causing an infinite loop compiling ldecod on x86 / Darwin.

llvm-svn: 26544

llvm-svn: 26543

llvm-svn: 26542

implement copysign as a native op if they have it.

llvm-svn: 26541

llvm-svn: 26539

Transforms/InstCombine/vec_narrow.ll.  This add support for narrowing
extract_element(insertelement) also.

llvm-svn: 26538

llvm-svn: 26536

fold (shl (add x, c1), c2) -> (add (shl x, c2), c1<<c2)

This allows us to compile CodeGen/PowerPC/addi-reassoc.ll into:

_test1:
        slwi r2, r4, 4
        add r2, r2, r3
        lwz r3, 36(r2)
        blr
_test2:
        mulli r2, r4, 5
        add r2, r2, r3
        lbz r2, 11(r2)
        extsb r3, r2
        blr

instead of:

_test1:
        addi r2, r4, 2
        slwi r2, r2, 4
        add r2, r3, r2
        lwz r3, 4(r2)
        blr
_test2:
        addi r2, r4, 2
        mulli r2, r2, 5
        add r2, r3, r2
        lbz r2, 1(r2)
        extsb r3, r2
        blr

llvm-svn: 26535

llvm-svn: 26529

Testcase here: Transforms/Reassociate/mulfactor.ll

llvm-svn: 26524

llvm-svn: 26523

llvm-svn: 26522

llvm-svn: 26521

llvm-svn: 26520

This implements Transforms/InstCombine/add.ll:test31

llvm-svn: 26519

rep/stos and rep/mov if the count is not a constant. We could do
  rep/stosl; and $count, 3; rep/stosb
For now, I will lower them to memset / memcpy calls. We will revisit this after
a little bit experiment.

Also need to take care of the trailing bytes even if the count is a constant.
Since the max. number of trailing bytes are 3, we will simply issue loads /
stores.

llvm-svn: 26517

don't assume that A[1][0] and A[0][i] can't alias.  "i" might be out of
range, or even negative.  This fixes a miscompilation of 188.ammp (which
does bad pointer tricks) with the new CFE.

Testcase here: Analysis/BasicAA/2006-03-03-BadArraySubscript.ll

llvm-svn: 26515

llvm-svn: 26513

llvm-svn: 26512