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: 26534

llvm-svn: 26529

llvm-svn: 26525

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

llvm-svn: 26518

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

llvm-svn: 26516

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: 26514

llvm-svn: 26513

llvm-svn: 26512

llvm-svn: 26511

to the alignment argument.

llvm-svn: 26510

llvm-svn: 26509

llvm-svn: 26508

llvm-svn: 26507

llvm-svn: 26506

llvm-svn: 26505

llvm-svn: 26504

llvm-svn: 26503

llvm-svn: 26502

llvm-svn: 26501

llvm-svn: 26500

llvm-svn: 26499

llvm-svn: 26498

llvm-svn: 26497

llvm-svn: 26496

llvm-svn: 26495

llvm-svn: 26494

llvm-svn: 26493

llvm-svn: 26492

llvm-svn: 26491

llvm-svn: 26490