- Aug 27, 2007
-
-
Chris Lattner authored
llvm-svn: 41472
-
- Aug 24, 2007
-
-
Chris Lattner authored
llvm-svn: 41350
-
- Aug 21, 2007
-
-
Chris Lattner authored
llvm-svn: 41236
-
Chris Lattner authored
llvm-svn: 41218
-
Chris Lattner authored
This means that we get rid of tons of intermediate allocas. For example: void foo(double _Complex a, double _Complex b) { a = b+a+a; } this used to have 4 temporary allocas, now it has zero of them. This also simplifies the individual visitor methods because they now can all operate on real/imag pairs instead of having to load/store all over the place. llvm-svn: 41217
-
Chris Lattner authored
llvm-svn: 41216
-
Chris Lattner authored
llvm-svn: 41215
-
Chris Lattner authored
match on binop then explicitly switching again. llvm-svn: 41214
-
Chris Lattner authored
details in its own file. llvm-svn: 41213
-
- Aug 11, 2007
-
-
Chris Lattner authored
aggregate value and scalar expression computation are very different, this gets them away from each other. This causes a temporary regression on some complex number examples. llvm-svn: 41014
-
- Aug 10, 2007
-
-
Chris Lattner authored
llvm-svn: 41002
-