Use the poolalloc module in CVS from now on.

llvm-svn: 7810

llvm-svn: 7807

llvm-svn: 7806

of a power of two are represented as a shift.

llvm-svn: 7803

 it's used 7 different times.
Rename `getBackEdges' to `findAndInstrumentBackEdges', for clarity.
Remove some excess whitespace and commented-out code.
Use shorter forms of CallInst ctors.
Do not make `reopt_threshold' visible to the LLVM program, and do not
 pass it to the call to `reoptimizerInitialize'.  Don't pass the
 GlobalVariable representing it to any of our helper methods.
 `reopt_threshold' is an internal parameter of the reoptimizer, which
 InstLoops does not need to know about.

llvm-svn: 7794

This implements InstCombine/shift.ll:test14*

llvm-svn: 7793

llvm-svn: 7792

llvm-svn: 7787

llvm-svn: 7783

llvm-svn: 7782

Bug fix: Some nodes pointed to by globals may not be marked incomplete and need to be tracked to find pool arguments

llvm-svn: 7763

llvm-svn: 7721

The original code does not work because the value from WorkList.end() is
invalidated once WorkList.erase() is called.  To ensure proper functionality,
we must ensure that WorkList.erase() is always called before WorkList.end().

llvm-svn: 7673

Added code for pool allocating only the pool-allocatable data structures in the presence of collapsed nodes + a couple of bug fixes

llvm-svn: 7662

llvm-svn: 7641

llvm-svn: 7614

llvm-svn: 7612

  * Expand most tabs into spaces
  * Move #define DEBUG_TYPE to top of file to avoid warning

llvm-svn: 7611

Major bug fixes including a memory leak and tracking some exceptional conditions. Also added support for including global and indirect call information in the DS graphs used by the pool allocation

llvm-svn: 7605

Fix bug: SimplifyCFG/2003-08-05-MishandleInvoke.ll

llvm-svn: 7599

llvm-svn: 7492

llvm-svn: 7295

Now it shoudl be a bit more efficient

llvm-svn: 7292

of codes.  For example,
short kernel (short t1) {
  t1 >>= 8; t1 <<= 8;
  return t1;
}

became:

short %kernel(short %t1.1) {
        %tmp.3 = shr short %t1.1, ubyte 8               ; <short> [#uses=1]
        %tmp.5 = cast short %tmp.3 to int               ; <int> [#uses=1]
        %tmp.7 = shl int %tmp.5, ubyte 8                ; <int> [#uses=1]
        %tmp.8 = cast int %tmp.7 to short               ; <short> [#uses=1]
        ret short %tmp.8
}

before, now it becomes:
short %kernel(short %t1.1) {
        %tmp.3 = shr short %t1.1, ubyte 8               ; <short> [#uses=1]
        %tmp.8 = shl short %tmp.3, ubyte 8              ; <short> [#uses=1]
        ret short %tmp.8
}

which will become:
short %kernel(short %t1.1) {
        %tmp.3 = and short %t1.1, 0xFF00
        ret short %tmp.3
}

This implements cast-set.ll:test4 and test5

llvm-svn: 7290

llvm-svn: 7289

This fixes a long time annoyance which caused prototypes for bzero, bcopy,
bcmp, fputs, and fputs_unlocked to never get deleted.  Grr.

llvm-svn: 7285

llvm-svn: 7283

  - InstCombine: (X & C1) ^ C2 --> (X & C1) | C2 iff (C1&C2) == 0
  - InstCombine: (X | C1) ^ C2 --> (X | C1) & ~C2 iff (C1&C2) == C2

llvm-svn: 7282

llvm-svn: 7272

  - InstCombine: (X | C) & C --> C
  - InstCombine: (X | C1) & C2 --> (X | (C1&C2)) & C2

llvm-svn: 7269

IC: (X ^ C1) | C2 --> (X | C2) ^ (C1&~C2)

We are now guaranteed that all 'or's will be inside of 'and's, and all 'and's
will be inside of 'xor's, if the second operands are constants.

llvm-svn: 7264

Minor code cleanup

llvm-svn: 7262

llvm-svn: 7260

IC: (X | 8) == 4  --> false

llvm-svn: 7257

whether the constant is signed or unsigned, then casting

llvm-svn: 7252

llvm-svn: 7243

  - InstCombine (cast (and X, (1 << size(X)-1)) to bool) ==> x < 0

llvm-svn: 7241

a load of the global variable with the variable's constant value.

llvm-svn: 7216

llvm-svn: 7206

llvm-svn: 7201