the back-edge block, we must check the preincremented value.

llvm-svn: 12968

llvm-svn: 12967

@parameter line documentation that way, too.

llvm-svn: 12966

llvm-svn: 12965

llvm-svn: 12964

llvm-svn: 12963

llvm-svn: 12962

Instead of producing code like this:

Loop:
  X = phi 0, X2
  ...

  X2 = X + 1
  if (X != N-1) goto Loop

We now generate code that looks like this:

Loop:
  X = phi 0, X2
  ...

  X2 = X + 1
  if (X2 != N) goto Loop

This has two big advantages:
  1. The trip count of the loop is now explicit in the code, allowing
     the direct implementation of Loop::getTripCount()
  2. This reduces register pressure in the loop, and allows X and X2 to be
     put into the same register.

As a consequence of the second point, the code we generate for loops went
from:

.LBB2:  # no_exit.1
	...
        mov %EDI, %ESI
        inc %EDI
        cmp %ESI, 2
        mov %ESI, %EDI
        jne .LBB2 # PC rel: no_exit.1

To:

.LBB2:  # no_exit.1
	...
        inc %ESI
        cmp %ESI, 3
        jne .LBB2 # PC rel: no_exit.1

... which has two fewer moves, and uses one less register.

llvm-svn: 12961

llvm-svn: 12960

llvm-svn: 12959

llvm-svn: 12958

llvm-svn: 12957

llvm-svn: 12956

insert it once!

llvm-svn: 12955

The iterator is pointing at the next instruction which should not disappear
when doing the load/store replacement.

llvm-svn: 12954

llvm-svn: 12953

at the bottom of the loop instead of the top.  This reduces the number of
overlapping live ranges a lot, for example, eliminating a spill in an important
loop in 183.equake with linear scan.

I still need to make the exit comparison of the loop use the post-incremented
version of this variable, but this is an easy first step.

llvm-svn: 12952

This should unbreak the Sparc JIT again.

llvm-svn: 12949

llvm-svn: 12948

Make autoconf default to checking to look to see if our funny directory exists

llvm-svn: 12947

llvm-svn: 12946

functions and is not needed here.
Simplify the pointer type check per Chris's suggestions.

llvm-svn: 12945

that matches its return type.

llvm-svn: 12944

llvm-svn: 12943

Sorry these didn't get in yesterday.

llvm-svn: 12942

llvm-svn: 12940

even when the "optimization" I added before is turned off.  It generates this
extremely pointless code:

test:
        fld QWORD PTR [%ESP + 4]
        mov %AL, 0
        test %AL, %AL
        fcmove %ST(0), %ST(0)
        ret

Good thing the optimizer will have removed this before code generation
anyway.  :)

llvm-svn: 12939

Temporarily hack in the intrinsics that John added.  I expect him to finish up their addition, but in the meantime, the build should not be broken.

llvm-svn: 12938

On x86, memory operations occur in-order, so these are just lowered into
volatile loads and stores.

llvm-svn: 12936

X86/2004-04-13-FPCMOV-Crash.llx

A more robust fix is to follow.

llvm-svn: 12935

llvm-svn: 12934

llvm-svn: 12932

llvm-svn: 12929

llvm-svn: 12928

llvm-svn: 12927

Here is a simple minimal program that does what we want.  Instead of taking
minutes to compare mesa's output, and crashing on binary files (like spiff
does), this take < .02s in the common case and doesn't crash.

llvm-svn: 12926

llvm-svn: 12922

test/Regression/Transforms/SCCP/calltest.ll

llvm-svn: 12921

llvm-svn: 12920

llvm-svn: 12919