llvm-svn: 26105

with branches on partially invariant computations.

llvm-svn: 26104

llvm-svn: 26103

llvm-svn: 26102

branches in their entry block that control whether or not the loop is a noop or not.

llvm-svn: 26101

llvm-svn: 26098

llvm-svn: 26096

problem where it inline the map insertion call too aggressively. Before this
change it was producing a frame size of 24k for Select_store(), now it's down
to 10k (by calling this method rather than calling the map insertion operator).

llvm-svn: 26094

llvm-svn: 26093

llvm-svn: 26091

llvm-svn: 26090

uses of loop values outside the loop.  We need loop-closed SSA form to do
this right, or to use SSA rewriting if we really care.

llvm-svn: 26089

llvm-svn: 26088

1. Teach it new tricks: in particular how to propagate through signed shr and sexts.
2. Teach it to return a bitset of known-1 and known-0 bits, instead of just zero.
3. Teach instcombine (AND X, C) to fold when we know all C bits of X.

This implements Regression/Transforms/InstCombine/bittest.ll, and allows
future things to be simplified.

llvm-svn: 26087

llvm-svn: 26085

Move all getTargetNode() out of SelectionDAG.h into SelectionDAG.cpp. This
prevents them from being inlined.
Change getTargetNode() so they return SDNode * instead of SDOperand to prevent
copying. It should also help compilation speed.

llvm-svn: 26083

llvm-svn: 26080

llvm-svn: 26079

value/alignment pair for each constant, keep a value/offset pair.

llvm-svn: 26078

llvm-svn: 26076

llvm-svn: 26074

llvm-svn: 26071

llvm-svn: 26070

llvm-svn: 26069

SDOperand Select(SDOperand N);
to
void Select(SDOperand &Result, SDOperand N);

llvm-svn: 26067

llvm-svn: 26066

llvm-svn: 26065

Move the methods out of line.
Remove unused Debug.h stuff.
Teach getNumBytesForInstruction to know the size of an inline asm.

llvm-svn: 26064

llvm-svn: 26062

optimization where we reduce the number of bits in AND masks when possible.

llvm-svn: 26056

llvm-svn: 26054

llvm-svn: 26053

llvm-svn: 26052

llvm-svn: 26051

instruction onto the worklist (in case they are now dead).

Add a really trivial local DSE implementation to help out bitfield code.
We now fold this:

struct S {
    unsigned char a : 1, b : 1, c : 1, d : 2, e : 3;
    S();
};

S::S() : a(0), b(0), c(1), d(0), e(6) {}

to this:

void %_ZN1SC1Ev(%struct.S* %this) {
entry:
        %tmp.1 = getelementptr %struct.S* %this, int 0, uint 0
        store ubyte 38, ubyte* %tmp.1
        ret void
}

much earlier (in gccas instead of only in gccld after DSE runs).

llvm-svn: 26050

test/Regression/Transforms/SCCP/select.ll

llvm-svn: 26049

        xori r6, r2, 1
        rlwinm r6, r6, 0, 31, 31
        cmpwi cr0, r6, 0
        bne cr0, LBB1_3 ; endif

to this:

        rlwinm r6, r2, 0, 31, 31
        cmpwi cr0, r6, 0
        beq cr0, LBB1_3 ; endif

llvm-svn: 26047

llvm-svn: 26045

llvm-svn: 26044

specified in bytes.

llvm-svn: 26043