unsigned foo4(unsigned short *P) { return *P & 255; }
unsigned foo5(short *P) { return *P & 255; }

to:

_foo4:
        lbz r3,1(r3)
        blr
_foo5:
        lbz r3,1(r3)
        blr

not:

_foo4:
        lhz r2, 0(r3)
        rlwinm r3, r2, 0, 24, 31
        blr
_foo5:
        lhz r2, 0(r3)
        rlwinm r3, r2, 0, 24, 31
        blr

llvm-svn: 26419

llvm-svn: 26418

unsigned foo3(unsigned *P) { return *P & 255; }
as:
_foo3:
        lbz r3, 3(r3)
        blr

instead of:

_foo3:
        lwz r2, 0(r3)
        rlwinm r3, r2, 0, 24, 31
        blr

and:

unsigned short foo2(float a) { return a; }

as:
_foo2:
        fctiwz f0, f1
        stfd f0, -8(r1)
        lhz r3, -2(r1)
        blr

instead of:

_foo2:
        fctiwz f0, f1
        stfd f0, -8(r1)
        lwz r2, -4(r1)
        rlwinm r3, r2, 0, 16, 31
        blr

llvm-svn: 26417

llvm-svn: 26416

llvm-svn: 26415

llvm-svn: 26414

llvm-svn: 26413

llvm-svn: 26412

llvm-svn: 26411

llvm-svn: 26410

llvm-svn: 26409

llvm-svn: 26405

llvm-svn: 26404

llvm-svn: 26403

llvm-svn: 26402

llvm-svn: 26401

llvm-svn: 26400

llvm-svn: 26399

llvm-svn: 26397

Make this code more powerful by using ComputeMaskedBits instead of looking
for an AND operand.  This lets us fold this:

int %test23(int %a) {
        %tmp.1 = and int %a, 1
        %tmp.2 = seteq int %tmp.1, 0
        %tmp.3 = cast bool %tmp.2 to int  ;; xor tmp1, 1
        ret int %tmp.3
}

into: xor (and a, 1), 1
llvm-svn: 26396

llvm-svn: 26395

and  (A-B) == A  ->  B == 0

llvm-svn: 26394

llvm-svn: 26393

PowerPC/div-2.ll

llvm-svn: 26392

llvm-svn: 26391

llvm-svn: 26390

on PowerPC/small-arguments.ll

llvm-svn: 26389

simplify the RHS.  This allows for the elimination of many thousands of
ands from multisource, and compiles CodeGen/PowerPC/and-elim.ll:test2
into this:

_test2:
        srwi r2, r3, 1
        xori r3, r2, 40961
        blr

instead of this:

_test2:
        rlwinm r2, r3, 31, 17, 31
        xori r2, r2, 40961
        rlwinm r3, r2, 0, 16, 31
        blr

llvm-svn: 26388

llvm-svn: 26387

assertzext produces zero bits.

llvm-svn: 26386

InstCombine/or.ll:test23.

llvm-svn: 26385

llvm-svn: 26384

target assembler code gen.

llvm-svn: 26383

than base).

llvm-svn: 26382

llvm-svn: 26381

and 2005-05-12-Int64ToFP.

llvm-svn: 26380

llvm-svn: 26379

llvm-svn: 26378

llvm-svn: 26377

* Cleaned up and tweaked LEA cost analysis code. Removed some hacks.
* Handle ADD $X, c to MOV32ri $X+c. These patterns cannot be autogen'd and
  they need to be matched before LEA.

llvm-svn: 26376