llvm-svn: 47111

llvm-svn: 47093

actually does.

llvm-svn: 47090

llvm-svn: 47089

llvm-svn: 47082

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

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

stores to be deleted in some cases.

llvm-svn: 46694

llvm-svn: 46693

llvm-svn: 46687

llvm-svn: 46684

reassociate anyways, but they could be generated during instcombine's run.

llvm-svn: 46683

list just to see if whether the list is empty.

llvm-svn: 46555

llvm-svn: 46554

llvm-svn: 46553

Make DSE much more aggressive by performing DCE earlier.  Update a testcase to reflect this increased aggressiveness.

llvm-svn: 46542

In practice this can only happen on code with already undefined behavior, 
but this is still a good thing to handle correctly.

llvm-svn: 46539

llvm-svn: 46514

avoid turning -0.0 + 0.0 -> -0.0 which is incorrect.

llvm-svn: 46499

the handling of eliminating stores to byval arguments.

llvm-svn: 46494

These loops are not yet handled.

Fix PR 1912.

llvm-svn: 46484

llvm-svn: 46431

llvm-svn: 46429

way or the other.  Rewriting the code itself prevents subsequent analysis
passes from making contradictory conclusions about the code that could 
cause an infeasible path to be made feasible.

llvm-svn: 46427

llvm-svn: 46417

This fixes PR1769.

llvm-svn: 46408

llvm-svn: 46406

a "nop" instruction so that we don't have the function's label associated
with something that it's not supposed to be associated with.

llvm-svn: 46394

void bork() {
  int *address = 0;
  *address = 0;
}

It's compiled into LLVM code that looks like this:

define void @bork() noreturn nounwind  {
entry:
        unreachable
}

This is bad on some platforms (like PPC) because it will generate the label for
the function but no body. The label could end up being associated with some
non-code related stuff, like a section. This places a "trap" instruction if the
SimplifyCFG pass removed all code from the function leaving only one
"unreachable" instruction.

llvm-svn: 46387

DeadStoreElimination can treat byval parameters as if there were alloca's for the purpose of removing end-of-function stores.

llvm-svn: 46351

llvm-svn: 46247

a smaller bitwidth.

llvm-svn: 46244

Fixes PR1935.

llvm-svn: 46203

to complain on x86-64 (gcc 4.1).  Use ~0U instead.

llvm-svn: 46197

drop attributes on varargs call arguments.  Also, it could generate
invalid IR if the transformed call already had the 'nest' attribute
somewhere (this can never happen for code coming from llvm-gcc,
but it's a theoretical possibility).  Fix both problems.

llvm-svn: 45973

a load/store of i64.  The later prevents promotion/scalarrepl of the
source and dest in many cases.

This fixes the 300% performance regression of the byval stuff on 
stepanov_v1p2.

llvm-svn: 45945