- Jan 29, 2005
-
-
Chris Lattner authored
llvm-svn: 19924
-
Chris Lattner authored
llvm-svn: 19923
-
Chris Lattner authored
cases it represented them as 'unsigned's, which are not enough for 64-bit hosts. In other cases, it represented them as uint64_t's, which are inefficient for 32-bit hosts. This patch unifies all of the sizes to use size_t instead. llvm-svn: 19918
-
Chris Lattner authored
really need. This reduces 4M of memory consumption reading 176.gcc. llvm-svn: 19916
-
Chris Lattner authored
llvm-svn: 19915
-
Andrew Lenharth authored
first step towards a correct and complete stack. also add some forms for things that were getting stuck in the nightly tester. llvm-svn: 19914
-
Chris Lattner authored
used here. llvm-svn: 19913
-
Chris Lattner authored
llvm-svn: 19912
-
Chris Lattner authored
BB as the load are not included in the Cand* sets at all. llvm-svn: 19911
-
Chris Lattner authored
not invalidated on entry and on exit of the block. This fixes some N^2 behavior in common cases, and speeds up gcc another 5% to 22.35s. llvm-svn: 19910
-
Chris Lattner authored
This speeds up 176.gcc from 25.73s to 23.48s, which is 9.5% llvm-svn: 19907
-
Chris Lattner authored
will cause us to miss cases where the input pointer to a load could be value numbered to another load. Something like this: %X = load int* %P1 %Y = load int* %P2 Those are obviously the same if P1/P2 are the same. The code this patch removes attempts to handle that. However, since GCSE iterates, this doesn't actually buy us anything: GCSE will first replace P1 or P2 with the other one, then the load can be value numbered as equal. Removing this code speeds up gcse a lot. On 176.gcc in debug mode, this speeds up gcse from 29.08s -> 25.73s, a 13% savings. llvm-svn: 19906
-
Chris Lattner authored
%A = alloca int %V = load int* %A value number %V to undef, not 0. llvm-svn: 19905
-
Chris Lattner authored
memuse at the end, thus it is signed. llvm-svn: 19904
-
Chris Lattner authored
llvm-svn: 19902
-
Chris Lattner authored
llvm-svn: 19900
-
Chris Lattner authored
llvm-svn: 19899
-
Chris Lattner authored
llvm-svn: 19898
-
Chris Lattner authored
llvm-svn: 19897
-
Chris Lattner authored
Adjust TmpInstruction to work with the new User model. llvm-svn: 19896
-
Chris Lattner authored
llvm-svn: 19895
-
Chris Lattner authored
llvm-svn: 19894
-
Chris Lattner authored
llvm-svn: 19893
-
Chris Lattner authored
llvm-svn: 19892
-
Chris Lattner authored
Adjust to changes in the User class, operand handling is very different. PHI node and switch statements must handle explicit resizing of operand lists. llvm-svn: 19891
-
Chris Lattner authored
manage their operands. llvm-svn: 19890
-
Chris Lattner authored
llvm-svn: 19889
-
Andrew Lenharth authored
llvm-svn: 19882
-
Chris Lattner authored
llvm-svn: 19881
-
- Jan 28, 2005
-
-
Chris Lattner authored
llvm-svn: 19880
-
Chris Lattner authored
truncated, e.g. (truncate:i8 something:i16) on a 32 or 64-bit RISC. llvm-svn: 19879
-
Chris Lattner authored
llvm-svn: 19878
-
Chris Lattner authored
* Properly compile this: struct a {}; int test() { struct a b[2]; if (&b[0] != &b[1]) abort (); return 0; } to 'return 0', not abort(). llvm-svn: 19875
-
Chris Lattner authored
not change the address. llvm-svn: 19874
-
Andrew Lenharth authored
llvm-svn: 19870
-
Andrew Lenharth authored
llvm-svn: 19867
-
Chris Lattner authored
legalized, and actually return the correct result when we legalize the chain first. llvm-svn: 19866
-
Chris Lattner authored
If needed, this can be resurrected from CVS. Note that several of the interfaces (e.g. the IPModRef ones) are supersumed by generic AliasAnalysis interfaces that have been written since this code was developed (and they are not DSA specific). llvm-svn: 19864
-
Jeff Cohen authored
llvm-svn: 19863
-
- Jan 27, 2005
-
-
Andrew Lenharth authored
llvm-svn: 19857
-