llvm-svn: 9768

llvm-svn: 9731

-      // ~(c-X) == X-(c-1) == X+(-c+1)
+      // ~(c-X) == X-c-1 == X+(-c-1)

Implement: C - ~X == X + (1+C)
llvm-svn: 9715

llvm-svn: 9711

llvm-svn: 9708

a hot function in em3d

llvm-svn: 9673

llvm-svn: 9670

llvm-svn: 9667

llvm-svn: 9656

llvm-svn: 9654

llvm-svn: 9600

llvm-svn: 9585

llvm-svn: 9312

Header files will be on the way.

llvm-svn: 9298

Change the Opcode enum for PHI nodes from "Instruction::PHINode" to "Instruction::PHI" to be more consistent with the other instructions.

llvm-svn: 9269

llvm-svn: 9225

llvm-svn: 9156

llvm-svn: 9135

llvm-svn: 9073

have a SINGLE backedge.  This is useful to, for example, the -indvars pass.

This implements testcase LoopSimplify/single-backedge.ll and closes PR#34

llvm-svn: 9065

llvm-svn: 9061

llvm-svn: 9059

llvm-svn: 9058

allows GCCAS to only run it once.

llvm-svn: 9056

llvm-svn: 9027

llvm-svn: 8965

to avoid reprocessing PHI nodes needlessly.  This speeds up the big bad PHI
testcase 43%: from 104.9826 to 73.5157s

llvm-svn: 8964

llvm-svn: 8963

of a test that Bill Wendling sent me from 228.5s to 105s.  Obviously there is
more improvement to be had, but this is a nice speedup which should be "felt"
by many programs.

llvm-svn: 8962

llvm-svn: 8955

llvm-svn: 8954

llvm-svn: 8952

logarithmic conditional branch sequences instead of linear sequences.  Thanks Bill!

llvm-svn: 8928

llvm-svn: 8922

llvm-svn: 8894

llvm-svn: 8883

do not support stack unwinding yet

llvm-svn: 8869

llvm-svn: 8868

llvm-svn: 8817

llvm-svn: 8689