llvm-svn: 5968

  * Warnings were emitted all of the time and were really annoying
  * Functions could not be resolved unless they had external linkage.  Linkonce
    linkage was not allowed
  * ConstantPointerRef's were not handled when linking functions
    we now actually handle cast (CPR) to X -> cast (NewCPR) to X

llvm-svn: 5967

llvm-svn: 5966

llvm-svn: 5952

the visit function.  The worklist is for when their lattice value changes.

llvm-svn: 5927

  * Spell propagate right
  * Improve performance of phi node handling
  * Delete using directive
  * Other minor changes

llvm-svn: 5920

llvm-svn: 5919

PassMAnager provides.

llvm-svn: 5896

llvm-svn: 5895

llvm-svn: 5894

llvm-svn: 5892

llvm-svn: 5879

llvm-svn: 5872

llvm-svn: 5865

llvm-svn: 5863

llvm-svn: 5845

llvm-svn: 5835

llvm-svn: 5828

  Fixed bug: Linker/2003-04-21-Linkage.ll

llvm-svn: 5827

llvm-svn: 5824

llvm-svn: 5816

llvm-svn: 5810

llvm-svn: 5808

llvm-svn: 5806

llvm-svn: 5805

llvm-svn: 5793

llvm-svn: 5786

llvm-svn: 5775

* Make Mem2Reg assign version numbers now for renamed variables instead of
  .mem2reg suffixes.  This produces what people think of as SSA.

llvm-svn: 5771

several ways:

 * Load expressions are not PRE'd well.  Alias Analysis should be used to
   get accurate information when computing anticipatibility.
 * The expression collection implementation does not handle PHI nodes properly,
   thus the implementation misses many opportunities to PRE.
 * This code could be sped up quite a bit

Despite these flaws, the code seems to work well, and handles PR's as one
would expect.

llvm-svn: 5759

* Small modification to be more efficient

llvm-svn: 5757

llvm-svn: 5754

  - Implement simple reassociation: (A|c1)|(B|c2) == (A|B)|(c1|c2)
  - (A & C1)+(B & C2) -> (A & C1)|(B & C2) iff C1&C2 == 0
  - (A & C1)^(B & C2) -> (A & C1)|(B & C2) iff C1&C2 == 0

llvm-svn: 5743

llvm-svn: 5740

llvm-svn: 5738

Generalize not and neg comparison testers to allow constant to be considered not'able and neg'able.  This
allows optimization of this:
int %test4(int %A, int %B) {
        %a = xor int %A, -1
        %c = and int %a, 5    ; 5 = ~c2
        %d = xor int %c, -1
        ret int %d
}

into this:
int %test4(int %A, int %B) {            ; No predecessors!
        %c.demorgan = or int %A, -6             ; <int> [#uses=1]
        ret int %c.demorgan
}

llvm-svn: 5736

llvm-svn: 5733

llvm-svn: 5731

Implement new shift optimizations for shifting the result of a shift.

llvm-svn: 5729

llvm-svn: 5728