llvm-svn: 60403

llvm-svn: 60402

llvm-svn: 60401

llvm-svn: 60400

  constant. If X is a constant, then this is folded elsewhere.

- Added a note to Target/README.txt to indicate that we'd like to implement
  this when we're able.

llvm-svn: 60399

llvm-svn: 60398

- No need to do a swap on a canonicalized pattern.

No functionality change.

llvm-svn: 60397

llvm-svn: 60395

llvm-svn: 60394

a new value numbering set after splitting a critical edge.  This increases
the number of instances of PRE on 403.gcc from ~60 to ~570.

llvm-svn: 60393

llvm-svn: 60392

llvm-svn: 60391

- LowerXADDO lowers [SU]ADDO into an ADD with an implicit EFLAGS define. The
  EFLAGS are fed into a SETCC node which has the conditional COND_O or COND_C,
  depending on the type of ADDO requested.

- LowerBRCOND now recognizes if it's coming from a SETCC node with COND_O or
  COND_C set.

llvm-svn: 60388

llvm-svn: 60385

llvm-svn: 60383

- Add support for seto, setno, setc, and setnc instructions.

llvm-svn: 60382

llvm-svn: 60381

llvm-svn: 60376

figuring out the base of the IV.  This produces better
code in the example.  (Addresses use (IV) instead of 
(BASE,IV) - a significant improvement on low-register
machines like x86).

llvm-svn: 60374

and big endian systems.

llvm-svn: 60371

llvm-svn: 60370

llvm-svn: 60369

integer is "minint".

llvm-svn: 60366

llvm-svn: 60365

- Fix v2[if]64 vector insertion code before IBM files a bug report.
- Ensure that zero (0) offsets relative to $sp don't trip an assert
  (add $sp, 0 gets legalized to $sp alone, tripping an assert)
- Shuffle masks passed to SPUISD::SHUFB are now v16i8 or v4i32

llvm-svn: 60358

llvm-svn: 60354

llvm-svn: 60353

damaged approximation.  This should fix it on big endian platforms
and on 64-bit.

llvm-svn: 60352

MERGE_VALUES node with only one operand, so get
rid of special code that only existed to handle
that possibility.

llvm-svn: 60349

ReplaceNodeResults: rather than returning a node which
must have the same number of results as the original
node (which means mucking around with MERGE_VALUES,
and which is also easy to get wrong since SelectionDAG
folding may mean you don't get the node you expect),
return the results in a vector.

llvm-svn: 60348

don't have overlapping bits.

llvm-svn: 60344

llvm-svn: 60343

llvm-svn: 60341

Move pattern check outside of the if-then statement. This prevents us from fiddling with constants unless we have to.

llvm-svn: 60340

llvm-svn: 60339

that it isn't reallocated all the time.  This is a tiny speedup for
GVN: 3.90->3.88s

llvm-svn: 60338

llvm-svn: 60337

llvm-svn: 60336

instead of std::sort.  This shrinks the release-asserts LSR.o file
by 1100 bytes of code on my system.

We should start using array_pod_sort where possible.

llvm-svn: 60335

This is a lot cheaper and conceptually simpler.

llvm-svn: 60332