* Implement SCCP of load instructions, implementing Transforms/SCCP/loadtest.ll
  This allows us to fold expressions like "foo"[2], even if the pointer is only
  a conditional constant.

llvm-svn: 10767

from constant memory is, but lets not take chances.

llvm-svn: 10765

llvm-svn: 10763

Fix iterator invalidation problems which was causing -mstrip to miss some
entries, and read free'd memory.  This shrinks the symbol table of 254.gap
from 333 to 284 bytes!  :)

llvm-svn: 10751

llvm-svn: 10725

getSubLoops/getTopLevelLoops methods, replacing them with iterator-based
accessors.

llvm-svn: 10714

it doesn't do anything with it.

llvm-svn: 10590

contains no functionality changes.

llvm-svn: 10583

arithmetic into "array subscripts"

llvm-svn: 10580

llvm-svn: 10573

llvm-svn: 10539

llvm-svn: 10536

loop before hoisting any.

llvm-svn: 10534

llvm-svn: 10531

llvm-svn: 10530

according to the CVS log messages.

llvm-svn: 10517

llvm-svn: 10516

AliasSetTracker as well.

llvm-svn: 10507

llvm-svn: 10473

llvm-svn: 10467

llvm-svn: 10458

Fix LICM/2003-12-11-SinkingToPHI.ll, and quite possibly all of the other known problems in the universe.

llvm-svn: 10409

Thanks for pointing this out John  :)

llvm-svn: 10387

llvm-svn: 10386

llvm-svn: 10385

Fix bug: LowerInvoke/2003-12-10-Crash.llx

llvm-svn: 10382

Reorder #includes
Implement: IndVarsSimplify/2003-12-10-IndVarDeadCode.ll

llvm-svn: 10376

Fix bug: LoopSimplify/2003-12-10-ExitBlocksProblem.ll

llvm-svn: 10373

llvm-svn: 10371

llvm-svn: 10370

Make LICM itself a bit more efficient, and make the generated code more efficient too: don't insert a store in every exit block, because a particular block may be exited to more than once by a loop

llvm-svn: 10369

better job, but this is the majority of the work.  This implements
LICM/sink*.ll

llvm-svn: 10358

llvm-svn: 10348

should make subsequent changes simpler.  This also allows us to hoist vaarg
and vanext instructions

llvm-svn: 10342

Code cleanups
Make LICM::SafeToHoist marginally more efficient

llvm-svn: 10341

Also make sure to clean up any PHI nodes that are inserted which are pointless.

llvm-svn: 10333

We now insert accumulator variables as necessary to eliminate tail recursion
more aggressively.  This is still fairly limited, but allows us to transform
fib/factorial, and other functions into nice happy loops.  :)

llvm-svn: 10332

The only functionality change is that we now implement:
  Regression/Transforms/TailCallElim/intervening-inst.ll

Which is really kinda pointless, because it means that trivially dead code
does not interfere with -tce, but trivially dead code probably wouldn't be
around anytime when this pass is run anyway.

The point of including this change it to support other more aggressive
transformations when we have the analysis capabilities to do so.

llvm-svn: 10312

* Transform: free <ty>* (cast <ty2>* X to <ty>*) into free <ty2>* X

llvm-svn: 10303

Fix regressions ScalarRepl/basictest.ll & arraytest.ll

llvm-svn: 10287