Refactor this method a bit, and correct a test that was completely wrong but happened to work out anyways. :-)

llvm-svn: 47321

llvm-svn: 47320

llvm-svn: 47319

llvm-svn: 47318

and add some others that should have been in from the first place.  Document the whole thing better.

llvm-svn: 47315

can be a SNaN.  We could be more aggressive and turn this into 
unreachable, but that is less nice, and not really worth it.

llvm-svn: 47313

At some point in the future, this check will become smarter.

llvm-svn: 47310

over all the parameters of the callee looking for it.

llvm-svn: 47309

to apply to a memcpy into processInstruction.  Also, fix a bug in the check due to
missing braces.

llvm-svn: 47307

Fix Transforms/GVN/memcpy.ll, which Chris broke in r47275 by reordering the branches.  memcpy's are a kind of CallInst.

llvm-svn: 47305

llvm-svn: 47287

to Dale for noticing this!

llvm-svn: 47276

llvm-svn: 47275

requested by Chris.  While there, do the same
for an existing function committed by someone
called "lattner" :)

llvm-svn: 47273

Add support to GVN for performing sret return slot optimization.  This means that, if an sret function tail calls
another sret function, it should pass its own sret parameter to the tail callee, allowing it to fill in the correct
return value.  llvm-gcc does not emit this by default.  Instead, it allocates space in the caller for the sret of
the tail call and then uses memcpy to copy the result into the caller's sret parameter.  This optimization detects
and optimizes that case.

llvm-svn: 47265

this speeds it up 2.3% on eon.

llvm-svn: 47261

llvm-svn: 47258

llvm-svn: 47251

the second half of PR2047

llvm-svn: 47244

llvm-svn: 47242

that is also a subtract.  This implements PR2047 and Transforms/Reassociate/subtest2.ll 

llvm-svn: 47241

functionality change.

llvm-svn: 47239

is not passed as an argument to a trampoline intrinsic.

llvm-svn: 47220

llvm-svn: 47150

Fixes PR 2030.

llvm-svn: 47141

llvm-svn: 47129

llvm-svn: 47116

llvm-svn: 47111

llvm-svn: 47093

actually does.

llvm-svn: 47090

llvm-svn: 47089

llvm-svn: 47082

llvm-svn: 47066

bugs fixed.  This now passes PPC bootstrap.

llvm-svn: 47026

checks for a malloc/alloca immediately followed by a load.

llvm-svn: 47006

This fixes the store case, my previous patch just fixed the load
case.  rdar://5707076.

llvm-svn: 46932

llvm-svn: 46898

http://lists.cs.uiuc.edu/pipermail/llvm-commits/Week-of-Mon-20080128/057882.html

This is causing a miscompilation on PPC G5 and just now seeing it on iMac x86-64.

llvm-svn: 46822

check more intelligent.  This speeds up mem2reg from 5.29s to 
0.79s on a synthetic testcase with tons of predecessors and
phi nodes.

llvm-svn: 46767

was incorrectly simplifying "x == (gep x, 1, i)" into false, even 
though i could be negative.  As it turns out, all the code to 
handle this already existed, we just need to disable the incorrect
optimization case and let the general case handle it.

llvm-svn: 46739