| Commit message (Collapse) | Author | Age | Files | Lines |
|
|
|
| |
llvm-svn: 2350
|
|
|
|
| |
llvm-svn: 2327
|
|
|
|
| |
llvm-svn: 2275
|
|
|
|
|
|
|
|
| |
* Make the function pointer argument explicit for a call nodes
* Eliminate unreachable global values
* Merge call nodes that are identical
llvm-svn: 2266
|
|
|
|
|
|
|
|
|
| |
* Fold call nodes that are indistinguishable for each other. This is a big
win for external functions like sqrt, which would multiply dramatically
before.
* Global nodes with no edges to or from them are now eliminated from the graph.
llvm-svn: 2257
|
|
|
|
|
|
| |
in iOther.h
llvm-svn: 2209
|
|
|
|
| |
llvm-svn: 2174
|
|
|
|
|
|
|
| |
* Do not demand a shadow node when resolving
* Raise arbitrary inline limit
llvm-svn: 2100
|
|
|
|
|
|
| |
into other objects.
llvm-svn: 2094
|
|
|
|
| |
llvm-svn: 2081
|
|
|
|
|
|
|
|
| |
doesn't resort!
* Be more generous with the cached matches that we allow now.
* Recursive calls should all work now!
llvm-svn: 2061
|
|
|
|
|
|
|
|
| |
to reflect that they can eliminate arbitrary nodes.
* Rename the ShadowNodeEliminate.cpp file to EliminateNodes.cpp for the
same reason
llvm-svn: 2020
|
|
|
|
|
|
|
|
|
|
|
|
|
| |
* 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
|
|
|
|
|
|
|
| |
* Add links to all subtrees when a shadow node gets resolved
* Add critical node handling
llvm-svn: 2001
|
|
|
|
|
|
|
| |
removed. Check to see if they are there.
* Repeat optimizations while changing
llvm-svn: 1997
|
|
Has bugs, but shouldn't crash in theory.
llvm-svn: 1994
|