the algorithm instead of hand coded depth first iteration

llvm-svn: 4694

 values.
X86InstrInfo.def: add LEAVE instruction.

llvm-svn: 4691

llvm-svn: 4690

death when handling moderately sized SCC's, but what can you do

llvm-svn: 4689

llvm-svn: 4688

llvm-svn: 4687

llvm-svn: 4683

* Implement the first step of the Globals graph: Deleting nodes from function
  graphs.  In practice, these nodes need to be moved to the globals graph, but
  this will be taken care of later.  Note that the graphs computed right now are
  not strictly correct!

llvm-svn: 4681

llvm-svn: 4678

llvm-svn: 4677

* Significantly improve DEBUG output
* Aggressively fold calls together if we inlined a graph that provides
  call nodes.
* Add a bailout if the current graph has over 200 call nodes in it, this is
  a really whacky case that should never happen.

llvm-svn: 4675

llvm-svn: 4668

This slows stuff down a bit, but it should get much better before it gets any
worse.

llvm-svn: 4666

llvm-svn: 4665

llvm-svn: 4664

llvm-svn: 4663

llvm-svn: 4661

llvm-svn: 4660

llvm-svn: 4659

llvm-svn: 4657

llvm-svn: 4656

llvm-svn: 4655

llvm-svn: 4654

llvm-svn: 4649

llvm-svn: 4648

llvm-svn: 4645

for example: 197.parser (64M->14M), 164.gzip (14M->2.7M).  The actual graphs
represented should not change at all.

llvm-svn: 4643

llvm-svn: 4640

the aux call sites should be copied

llvm-svn: 4639

llvm-svn: 4638

llvm-svn: 4637

llvm-svn: 4635

llvm-svn: 4634

  are marked DEAD.  This helped track down some bugs
- Fix a bunch of bugs where we were doing work on nodes after they became dead
- Add support for aux function call sites
- Add support for not cloning call sites

llvm-svn: 4633

llvm-svn: 4632

llvm-svn: 4630

llvm-svn: 4629

llvm-svn: 4628

llvm-svn: 4627

llvm-svn: 4622