- First patch from Nehal Desai, a new contributor at Aerospace. Nehal's patch
  fixes sign/zero/any-extending loads for integers and floating point. Example
  code, compiled w/o debugging or optimization where he first noticed the bug:

  int main(void) {
    float a = 99.0;
    printf("%d\n", a);
    return 0;
  }

  Verified that this code actually works on a Cell SPU.

Changes by Scott Michel:
- Fix bug in the value type list constructed by SPUISD::LDRESULT to include
  both the load result's result and chain, not just the chain alone.
- Simplify LowerLOAD and remove extraneous and unnecessary chains.
- Remove unused SPUISD pseudo instructions.

llvm-svn: 60526

llvm-svn: 60525

llvm-svn: 60524

llvm-svn: 60519

the main thing this covers is spills to distinct spill slots.

llvm-svn: 60517

llvm-svn: 60514

issues with subreg operands and tied operands.

llvm-svn: 60510

llvm-svn: 60509

llvm-svn: 60508

on PseudoSourceValue values. This also fixes a FIXME in
lib/VMCode/AsmWriter.cpp.

llvm-svn: 60507

llvm-svn: 60506

llvm-svn: 60501

llvm-svn: 60500

llvm-svn: 60499

an area where eventually it would be good to use target-dependent
information.

llvm-svn: 60498

llvm-svn: 60497

examining non-anti-dependence edges.

llvm-svn: 60496

llvm-svn: 60495

llvm-svn: 60494

llvm-svn: 60492

parts, and add target-independent code to add/preserve
MachineMemOperands.

llvm-svn: 60488

llvm-svn: 60487

the frame reference. This will help post-RA scheduling determine
that spills to distinct stack slots are independent.

llvm-svn: 60486

llvm-svn: 60485

llvm-svn: 60484

a new node if the node was actually remapped.

llvm-svn: 60482

Print a single parameter .file directive if we have an ELF target.

llvm-svn: 60480

llvm-svn: 60479

llvm-svn: 60478

llvm-svn: 60477

llvm-svn: 60476

llvm-svn: 60471

1) have it fold "br undef", which does occur with
   surprising frequency as jump threading iterates.
2) teach j-t to delete dead blocks.  This removes the successor
   edges, reducing the in-edges of other blocks, allowing 
   recursive simplification.
3) Fold things like:
     br COND, BBX, BBY
  BBX:
     br COND, BBZ, BBW

   which also happens because jump threading iterates.

llvm-svn: 60470

llvm-svn: 60469

llvm-svn: 60468

loop deletion (it is for a ton of passes), which is very bad.

llvm-svn: 60465

unconditionally delete the block.  All likely clients will
do the checking anyway.

llvm-svn: 60464

DeleteBlockIfDead method.

llvm-svn: 60463

foldMemoryOperand how to "fold" them, by converting them into constant-pool
loads. When they aren't folded, they use xorps/cmpeqd, but for example when
register pressure is high, they may now be folded as memory operands, which
reduces register pressure.

Also, mark V_SET0 isAsCheapAsAMove so that two-address-elimination will
remat it instead of copying zeros around (V_SETALLONES was already marked).

llvm-svn: 60461

llvm-svn: 60460