llvm-svn: 13717

caller was in an SCC.

llvm-svn: 13693

Eventually it would be nice if CallGraph maintained an ilist of CallGraphNode's instead
of a vector of pointers to them, but today is not that day.

llvm-svn: 13100

llvm-svn: 13089

is done, which avoids invalidating iterators in the SCC traversal routines

llvm-svn: 13088

llvm-svn: 13080

execute other CallGraphSCCPasses after the inliner without crashing.

llvm-svn: 12861

llvm-svn: 12857

Now we collect all of the call sites we are interested in inlining, then inline
them.  This entirely avoids issues with trying to inline a call site we got by
inlining another call site.  This also eliminates iterator invalidation issues.

llvm-svn: 12770

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

llvm-svn: 10135

llvm-svn: 9903

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

functions.  GRR

llvm-svn: 9641

Header files will be on the way.

llvm-svn: 9298

  * Separate the policy decisions into a derived class [InlineSimple]
  * Move the inlining mechanics into a base class [Inliner]
  * Change the inliner to be an SCCPass, making it more structured and
    eventually pipelinable with other SCC passes

llvm-svn: 8257