Chris Lattner
|
9a95f2a944
|
Minor optimization efficiency improvement:
- Run mem2reg promotion first
- Only rerun passes if the previous thing changed something
llvm-svn: 8490
|
2003-09-12 15:36:03 +00:00 |
|
Misha Brukman
|
217ca0bcb9
|
Apostrophes are only used for possession and quoting.
llvm-svn: 8473
|
2003-09-11 16:58:31 +00:00 |
|
Chris Lattner
|
5d8a12e094
|
Integrate functionality of the mem2reg pass directly into this pass to make
the combination more effective
llvm-svn: 8471
|
2003-09-11 16:45:55 +00:00 |
|
Chris Lattner
|
c817458b66
|
ScalarRepl does not modify the CFG. Say so!
llvm-svn: 8243
|
2003-08-31 00:45:13 +00:00 |
|
Chris Lattner
|
8abcd56c74
|
DEBUG got moved to Support/Debug.h
llvm-svn: 7492
|
2003-08-01 22:15:03 +00:00 |
|
Chris Lattner
|
6077c3195f
|
Simplify code by using ConstantInt::getRawValue instead of checking to see
whether the constant is signed or unsigned, then casting
llvm-svn: 7252
|
2003-07-23 15:22:26 +00:00 |
|
Chris Lattner
|
0078d9c5bb
|
Okay totally give up on trying to optimize aggregates that cannot be completely
broken up into their elements. Too many programs break because of this.
llvm-svn: 6440
|
2003-05-30 19:22:14 +00:00 |
|
Chris Lattner
|
d847be0539
|
add a check that allows the SRoA pass to avoid breaking programs, even if their
behavior is technically undefined
llvm-svn: 6438
|
2003-05-30 18:09:57 +00:00 |
|
Chris Lattner
|
38d88c07f4
|
Fix bug: ScalarRepl/2003-05-30-MultiLevel.ll
llvm-svn: 6428
|
2003-05-30 05:26:30 +00:00 |
|
Chris Lattner
|
6e5398d69d
|
Fix bug: ScalarRepl/2003-05-29-ArrayFail.ll
llvm-svn: 6425
|
2003-05-30 04:15:41 +00:00 |
|
Chris Lattner
|
c16b210349
|
* Actually USE the statistic that we made
* Implement SRoA for arrays
llvm-svn: 6349
|
2003-05-27 16:09:27 +00:00 |
|
Chris Lattner
|
fb41a50d15
|
Implementation of the simple "scalar replacement of aggregates" transformation
llvm-svn: 6346
|
2003-05-27 15:45:27 +00:00 |