- Apr 23, 2003
-
-
Chris Lattner authored
llvm-svn: 5865
-
Chris Lattner authored
llvm-svn: 5863
-
- Apr 22, 2003
-
-
Chris Lattner authored
llvm-svn: 5845
-
Chris Lattner authored
llvm-svn: 5835
-
- Apr 21, 2003
-
-
Chris Lattner authored
llvm-svn: 5828
-
Chris Lattner authored
Fixed bug: Linker/2003-04-21-Linkage.ll llvm-svn: 5827
-
Chris Lattner authored
llvm-svn: 5824
-
- Apr 19, 2003
-
-
Chris Lattner authored
llvm-svn: 5816
-
- Apr 18, 2003
-
-
Chris Lattner authored
llvm-svn: 5810
-
Chris Lattner authored
llvm-svn: 5808
-
Chris Lattner authored
llvm-svn: 5806
-
Chris Lattner authored
llvm-svn: 5805
-
- Apr 17, 2003
-
-
Chris Lattner authored
llvm-svn: 5793
-
- Apr 16, 2003
-
-
Chris Lattner authored
llvm-svn: 5786
-
- Apr 13, 2003
-
-
Chris Lattner authored
llvm-svn: 5775
-
- Apr 10, 2003
-
-
Chris Lattner authored
* Make Mem2Reg assign version numbers now for renamed variables instead of .mem2reg suffixes. This produces what people think of as SSA. llvm-svn: 5771
-
- Mar 31, 2003
-
-
Chris Lattner authored
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
-
Chris Lattner authored
* Small modification to be more efficient llvm-svn: 5757
-
- Mar 21, 2003
-
-
Chris Lattner authored
llvm-svn: 5754
-
- Mar 11, 2003
-
-
Chris Lattner authored
- 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
-
Chris Lattner authored
llvm-svn: 5740
-
Chris Lattner authored
llvm-svn: 5738
-
Chris Lattner authored
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
-
- Mar 10, 2003
-
-
Chris Lattner authored
llvm-svn: 5733
-
Chris Lattner authored
llvm-svn: 5731
-
Chris Lattner authored
Implement new shift optimizations for shifting the result of a shift. llvm-svn: 5729
-
Chris Lattner authored
llvm-svn: 5728
-
- Mar 07, 2003
-
-
Chris Lattner authored
llvm-svn: 5722
-
- Mar 05, 2003
-
-
Chris Lattner authored
llvm-svn: 5704
-
Chris Lattner authored
llvm-svn: 5702
-
Chris Lattner authored
llvm-svn: 5699
-
- Mar 04, 2003
-
-
Chris Lattner authored
allows LICM to use access sizes to help alias analysis be more precise. llvm-svn: 5693
-
- Mar 03, 2003
-
-
Chris Lattner authored
llvm-svn: 5686
-
Chris Lattner authored
llvm-svn: 5685
-
- Feb 28, 2003
-
-
Chris Lattner authored
llvm-svn: 5675
-
Chris Lattner authored
llvm-svn: 5669
-
Chris Lattner authored
llvm-svn: 5667
-
- Feb 27, 2003
-
-
Chris Lattner authored
llvm-svn: 5664
-
Chris Lattner authored
Ironically the exit block modification code wasn't updating the exit block information itself. Fix this. llvm-svn: 5659
-
Chris Lattner authored
llvm-svn: 5658
-