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

llvm-svn: 10305

* 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

Some gep generalization changes

llvm-svn: 10252

llvm-svn: 10226

llvm-svn: 10164

llvm-svn: 10163

llvm-svn: 10161

The module stripping pass should not strip symbols on external globals

llvm-svn: 10157

would have caught this.  *sigh*

llvm-svn: 10142

llvm-svn: 10138

llvm-svn: 10137

* Make the cost metric for passing constants in as arguments to functions MUCH
  more accurate, by actually estimating the amount of code that will be constant
  propagated away.

llvm-svn: 10136

Print out the costs for functions that AREN'T inlined as well

llvm-svn: 10135

llvm-svn: 10127

* Implement FuncResolve/2003-11-20-BogusResolveWarning.ll
   ... which eliminates a large number of annoying warnings.  I know misha
   will miss them though!

llvm-svn: 10123

llvm-svn: 10111

llvm-svn: 10110

and pages of non-symbolic types.

llvm-svn: 10109

llvm-svn: 10055

llvm-svn: 10032

llvm-svn: 9981

llvm-svn: 9903

llvm-svn: 9857

llvm-svn: 9853

pool allocator no end of trouble, and doesn't make a lot of sense anyway.  This
does not solve the problem with mutually recursive functions, but they are much less common.

llvm-svn: 9828

llvm-svn: 9827

llvm-svn: 9768

llvm-svn: 9753

llvm-svn: 9752

of intrinsic functions, causing the verifier to fail.

llvm-svn: 9745

llvm-svn: 9741

llvm-svn: 9739

llvm-svn: 9738

llvm-svn: 9731

llvm-svn: 9725

-      // ~(c-X) == X-(c-1) == X+(-c+1)
+      // ~(c-X) == X-c-1 == X+(-c-1)

Implement: C - ~X == X + (1+C)
llvm-svn: 9715

llvm-svn: 9711

llvm-svn: 9708