llvm-svn: 83755

llvm-svn: 83754

the IR, and to implement the FIXME'd optimization.

llvm-svn: 83748

inserted only once, just use vector.  Don't compute ExitBlocks unless we
need it, change std::sort to array_pod_sort.

llvm-svn: 83747

from GVN, this also speeds it up, inserts fewer PHI nodes (see the
testcase) and allows it to remove more loads (due to fewer PHI nodes
standing in the way).

llvm-svn: 83746

llvm-svn: 83745

PHI nodes inserted.

llvm-svn: 83744

llvm-svn: 83742

not just at the end.  Add a big comment explaining when this could
be useful (which never happens for jump threading).

llvm-svn: 83741

what it does.

llvm-svn: 83740

llvm-svn: 83707

DemoteRegToStack.  This makes it more efficient (because it isn't
creating a ton of load/stores that are eventually removed by a later
mem2reg), and more slightly more effective (because those load/stores
don't get in the way of threading).

llvm-svn: 83706

works on unstructured CFGs.  This implements PR217, our oldest open PR.

llvm-svn: 83705

llvm-svn: 83701

constants used in inlining heuristics (especially
those used in more than one file).  No functional change.

llvm-svn: 83675

and that will make Caller too big to inline, see if it
might be better to inline Caller into its callers instead.
This situation is described in PR 2973, although I haven't
tried the specific case in SPASS.

llvm-svn: 83602

to declare that they preserve other passes without needing to pull in
additional header file or library dependencies. Convert MachineFunctionPass
and CodeGenLICM to make use of this.

llvm-svn: 83555

already on the worklist, and print Visited when an instruction is about to be
visited.  Net, on one input, this reduced the output size by at least 9x.

llvm-svn: 83510

llvm-svn: 83489

not intrinsics.

llvm-svn: 83441

for inlining.

When MallocInst goes away this code will be subsumed as part of
calls and work just fine...

llvm-svn: 83434

llvm-svn: 83404

out of it, and jump threading, condprop and gvn are now getting
most of the benefit.  This was approved by Nicholas and Nicolas.

llvm-svn: 83390

where the element is of a basic builtin type.  For example, to get
an i8* use getInt8PtrTy.

llvm-svn: 83379

ConstantFoldLoadThroughGEPConstantExpr.

llvm-svn: 83311

llvm-svn: 83310

the new predicates I added) instead of going through a context and doing a
pointer comparison.  Besides being cheaper, this allows a smart compiler
to turn the if sequence into a switch.

llvm-svn: 83297

This fixes PR5130.

llvm-svn: 83290

Do away with the strange use of BitVectors in SSI, and just use normal sets.  This makes the code much more C++/LLVM-ish.

llvm-svn: 83286

llvm-svn: 83283

Similarly, it can be marked setPreservesAll, since it does no work in its runOnFunction.

llvm-svn: 83282

llvm-svn: 83274

llvm-svn: 83194

Ok'd by Owen.

llvm-svn: 83193

while calling changeImmediateDominator, which removes elements from the
vector. This fixes PR5097.

llvm-svn: 83166

llvm-svn: 82991

llvm-svn: 82990

phi nodes.  Make sure to phi translate from the right block. 

This fixes a llvm-building-llvm failure on GVN-PRE.cpp

llvm-svn: 82970

llvm-svn: 82936

The bitcast case is not needed here: instcombine turns icmp(bitcast(x), null) -> icmp(x, null) already.  

llvm-svn: 82935