| Commit message (Collapse) | Author | Age | Files | Lines |
|
|
|
|
|
|
|
|
| |
* 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
|
|
|
|
|
|
| |
be 'Argument' instead of FunctionArgument.
llvm-svn: 2216
|
|
|
|
| |
llvm-svn: 2174
|
|
|
|
|
|
| |
Shadow nodes are never critical.
llvm-svn: 2102
|
|
|
|
| |
llvm-svn: 2084
|
|
|
|
|
|
|
| |
someplace nicer in the file though.
* Add new dump method for debugging
llvm-svn: 2064
|
|
|
|
|
|
|
|
|
|
|
|
|
| |
* 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
|
|
|
|
|
|
|
|
| |
* Implement Critical Shadow node handling
* Implement routines to determine whether an allocation node is a malloc
or alloca
llvm-svn: 2003
|
|
|
|
| |
llvm-svn: 1998
|
|
Has bugs, but shouldn't crash in theory.
llvm-svn: 1994
|