* Remove bogus assertion: there may be a single outside predecessor and
    still need a new loop-preheader if the predecessor has multiple
    successors.  See bug: LICM/2003-02-27-PreheaderProblem.ll

llvm-svn: 5655

   - Now we perform loop exit-block splitting to ensure exit blocks are
     always dominated by the loop header.
   - We now preserve dominance frontier information
   - This fixes bug: LICM/2003-02-26-LoopExitNotDominated.ll

llvm-svn: 5652

Convert to work with new AliasAnalysis interface by conservatively assuming all pointers are arbitrarily large accesses

llvm-svn: 5636

llvm-svn: 5620

llvm-svn: 5613

a pass which wraps the function.  This allows other passes to use the functionality

llvm-svn: 5610

  * X*C + X --> X * (C+1)
  * X + X*C --> X * (C+1)
  * X - X*C --> X * (1-C)
  * X*C - X --> X * (C-1)

llvm-svn: 5592

  * A & ~A == 0
  * A / (2^c) == A >> c  if unsigned
  * 0 / A == 0
  * 1.0 * A == A
  * A * (2^c) == A << c
  * A ^ ~A == -1
  * A | ~A == -1
  * 0 % X = 0
  * A % (2^c) == A & (c-1) if unsigned
  * A - (A & B) == A & ~B
  * -1 - A == ~A

llvm-svn: 5587

llvm-svn: 5458

llvm-svn: 5405

rank map cache for instruction ranks

llvm-svn: 5030

  * Reword comment to make more clear
  * Don't print out BB's after modification made
  * Don't delete and new an instruction when we need to move something, just move it.

llvm-svn: 5029

llvm-svn: 4952

llvm-svn: 4935

    wasn't an optimization and it was causing lots of bugs.

llvm-svn: 4779

llvm-svn: 4649

llvm-svn: 4645

        %A = getelementptr [4 x int]* %M, long 0, long 0
        %B = getelementptr int* %A, long 2

llvm-svn: 4536

  malloc Ty, C
int
  malloc [C x Ty], 1

llvm-svn: 4534

llvm-svn: 4523

Huge thanks go to Casey Carter for writing this fix, reassociate is now
reoperational!

llvm-svn: 4471

other dominance stuff.  Patch contributed by Casey Carter

llvm-svn: 4457

llvm-svn: 4423

    setPreservesCFG to be less confusing.

llvm-svn: 4255

llvm-svn: 4081

    powerful, but that are largely disabled.  The basic idea here is that it
    is trying to forward branches across basic blocks that have PHI nodes in
    it, which are crucial to be able to handle cases like whet.ll.
    Unfortunately we are not updating SSA correctly, causing sim.c to die, and I
    don't have time to fix the regression now, so I must disable the
    functionality.

llvm-svn: 4077

llvm-svn: 4075

llvm-svn: 4071

llvm-svn: 4070

    * Renamed StatisticReporter.h/cpp to Statistic.h/cpp
    * Broke constructor to take two const char * arguments instead of one, so
      that indendation can be taken care of automatically.
    * Sort the list by pass name when printing
    * Make sure to print all statistics as a group, instead of randomly when
      the statistics dtors are called.
    * Updated ProgrammersManual with new semantics.

llvm-svn: 4002

llvm-svn: 3980

rather than in random order.  This causes LICM to be DRAMATICALLY more
effective. For example, on bzip2.c, it is able to hoist 302 loads and
2380 total instructions, as opposed to 44/338 before.  This  obviously
makes other transformations much more powerful as well!

llvm-svn: 3978

llvm-svn: 3975

 - Do not clone instructions then insert clone outside of loop.  Just move them.

llvm-svn: 3951

llvm-svn: 3950

llvm-svn: 3947

llvm-svn: 3946

has not yet been removed.

llvm-svn: 3945

- break-crit-edges pass does not invalidate loop-preheader pass.

llvm-svn: 3944

llvm-svn: 3942