llvm-svn: 13464

llvm-svn: 13462

llvm-svn: 13461

llvm-svn: 13460

can't be sure if these are OK, but they look OK.

llvm-svn: 13459

specified by top-level configure

llvm-svn: 13458

llvm-svn: 13457

llvm-svn: 13456

phi-elimination from 0.6 to 0.54s on kc++.

llvm-svn: 13454

in the basic block being processed.  This fixes PhiElimination on kimwitu++
from taking 105s to taking a much more reasonable 0.6s (in a debug build).

llvm-svn: 13453

than before.  Because this is the case, we can compute the first non-phi
instruction once when de-phi'ing a block.  This shaves ~4s off of
phielimination of _Z7yyparsev in kimwitu++ from 109s -> 105s.  There are
still much more important gains to come.

llvm-svn: 13452

compiling things like 'add long %X, 1'.  The problem is that we were switching
the order of the operands for longs even though we can't fold them yet.

llvm-svn: 13451

llvm-svn: 13450

when we see a read of a register.  This is important in cases like:

AL = ...
AH = ...

   = AX

The read of AX must make both the AL and AH defs live until the use.

llvm-svn: 13444

llvm-svn: 13443

llvm-svn: 13442

around the problem with Stacker on Solaris because the Stack can handle
64-bit entries (pointer sized).

llvm-svn: 13441

llvm-svn: 13440

llvm-svn: 13439

syntactically loopify natural loops so that the GCC loop optimizer can find them.  This should *dramatically* improve the performance of CBE compiled code on targets that depend on GCC's loop optimizations (like PPC)

llvm-svn: 13438

llvm-svn: 13437

llvm-svn: 13436

FindUsedTypes manipulation stuff out to be a seperate pass, and make the
main CWriter be a function pass now!

llvm-svn: 13435

Rewrite portability intro.

llvm-svn: 13434

llvm-svn: 13433

llvm-svn: 13432

llvm-svn: 13431

Print all PHI copies for successor blocks before the terminator, whether it be a conditional branch or switch.

llvm-svn: 13430

llvm-svn: 13429

llvm-svn: 13428

llvm-svn: 13427

Also added ModuloScheduling as a friend.

llvm-svn: 13426

llvm-svn: 13425

llvm-svn: 13424

Flesh out the SetCC support... which currently ends in a little bit
of unfinished code (which is probably completely hilarious) for
generating the condition value splitting the basic block up into 4
blocks, like this (clearly a better API is needed for this!):

       BB
   cond. branch
     /         /          R1=1    R2=0
     \      /
      \    /
    R=phi(R1,R2)

Other minor edits.

llvm-svn: 13423

llvm-svn: 13422

llvm-svn: 13421

llvm-svn: 13420

llvm-svn: 13419

Add support for branches (based loosely on X86/InstSelectSimple).
Add support for not visiting phi nodes in the first pass.
Add support for loading bools.
Flesh out support for stores.

llvm-svn: 13418