llvm-svn: 46601

llvm-svn: 46547

Assert that the type of the cast is equal to the _unqualified_ type of the subexpression. Fixes a problem spotted by Nuno Lopes.

llvm-svn: 46158

llvm-svn: 45954

discussion of this change.

llvm-svn: 45410

llvm-svn: 45330

llvm-svn: 45081

llvm-svn: 45023

llvm-svn: 45020

llvm-svn: 44503

llvm-svn: 43641

llvm-svn: 43581

llvm-svn: 43516

an unimplemented work  and continue.

llvm-svn: 43449

llvm-svn: 43385

llvm-svn: 42807

llvm-svn: 41907

llvm-svn: 41662

llvm-svn: 41472

llvm-svn: 41350

llvm-svn: 41236

llvm-svn: 41218

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

llvm-svn: 41216

llvm-svn: 41215

match on binop then explicitly switching again.

llvm-svn: 41214

details in its own file.

llvm-svn: 41213

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

llvm-svn: 41002