llvm-svn: 2070

llvm-svn: 2069

be marked as having a Call Interference, even though it may not
be live after the call.

llvm-svn: 2068

llvm-svn: 2066

  a memory leak)
* Fix memory leak of Argument nodes on function prototypes

llvm-svn: 2065

  someplace nicer in the file though.
* Add new dump method for debugging

llvm-svn: 2064

llvm-svn: 2063

* Implement a new form of node folding to catch cases missed in Addtree
* Add removeIndistinguishableNodePairs to merge calls (todo) and globals

llvm-svn: 2062

  doesn't resort!
* Be more generous with the cached matches that we allow now.
* Recursive calls should all work now!

llvm-svn: 2061

* Add debugging "dump" method to DSNode
* Fix bugs in DSNode iterator

llvm-svn: 2060

llvm-svn: 2059

* Add more debugging output
* Fix problems refering to wrong versions of various graphs
* Build the pool descriptor map!
* Clear the nodemapping map after building pool descriptor to avoid assert
* Transform the NEw function body, not the old one...
* Matrix.ll now works!

llvm-svn: 2058

Define an iterator to operate over data structure outgoing links and
graph implementation so generic graph functions can be used.

llvm-svn: 2057

* TransformFunctionInfo now has call field form field mapping.  May be
  removed in the future.
* Moved the computation of "Scalars" into transformFunctionBody so
  transformFunction didn't have to recompute it.
* Implement the node mapping calculation in preparation to calculate
  PoolDescriptors to pass to transformFunctionBody
* Print out the node mapping [it looks right!]
* Other minor changes

llvm-svn: 2056

llvm-svn: 2055

Add an accessor

llvm-svn: 2054

the graph can be passed around.

llvm-svn: 2053

 * Converts malloc instructions to poolalloc
 * Converts free instructions to poolfree
 * Convert calls to call the new cloned hacked up versions

Note that this does not modify hacked up stuff yet, just the top level
function

llvm-svn: 2052

though it's not entirely fleshed out.

llvm-svn: 2051

* Implement a check to make sure a function is not internal and external
  at the same time

llvm-svn: 2050

to modify the function next.

This also properly recycles functions so that we don't get exponential
code blowup in the common case.

llvm-svn: 2049

llvm-svn: 2048

llvm-svn: 2047

llvm-svn: 2046

llvm-svn: 2045

Next step is to start hacking functions up.

llvm-svn: 2044

llvm-svn: 2043

llvm-svn: 2042

llvm-svn: 2041

llvm-svn: 2040

destruction of the pools.

llvm-svn: 2039

llvm-svn: 2038

llvm-svn: 2037

llvm-svn: 2036

llvm-svn: 2035

llvm-svn: 2034

llvm-svn: 2033

llvm-svn: 2032

llvm-svn: 2031

llvm-svn: 2030