| Commit message (Collapse) | Author | Age | Files | Lines |
| |
|
|
|
|
| |
by the call node noncritical before the call is destroyed.
llvm-svn: 2082
|
| |
|
|
|
|
|
|
| |
causing a problem before because global values with incoming edges didn't
copy the incoming edges to the node they were being merged from, causing
the poolalloc pass to die.
llvm-svn: 2079
|
| |
|
|
|
|
|
| |
* Implement a new form of node folding to catch cases missed in Addtree
* Add removeIndistinguishableNodePairs to merge calls (todo) and globals
llvm-svn: 2062
|
| |
|
|
| |
llvm-svn: 2021
|
| |
|
|
|
|
|
|
| |
to reflect that they can eliminate arbitrary nodes.
* Rename the ShadowNodeEliminate.cpp file to EliminateNodes.cpp for the
same reason
llvm-svn: 2020
|
| |
|
|
|
|
| |
ALL allocation nodes... hrm... bad.
llvm-svn: 2018
|
| |
|
|
|
|
|
|
|
|
|
|
|
| |
* Simplify a lot of the inlining stuff. There are still problems, but not
many
* Break up the Function representation to have a vector for every different
node type so it is fast to find nodes of a particular flavor.
* Do more intelligent merging of call values
* Allow elimination of unreachable shadow and allocation nodes
* Generalize indistinguishability testing to allow merging of identical calls.
* Increase shadow node merging power
llvm-svn: 2010
|
| |
|
|
|
|
|
|
|
| |
* Move removeEdgesTo to be a member of DSNode
* Implement (but #ifdef out) the new, spiffier, method of determining
shadow node equivalence. This cannot be enabled until more is
implemented.
llvm-svn: 2004
|
| |
|
|
|
|
| |
* Implement indistinguishable shadow node elimination
llvm-svn: 1999
|
|
|
Has bugs, but shouldn't crash in theory.
llvm-svn: 1994
|