aboutsummaryrefslogtreecommitdiff
path: root/lib/Analysis/DataStructure/ComputeClosure.cpp
AgeCommit message (Collapse)Author
2002-04-09Add explicit #includes of Function.h to make up for the removed #includeChris Lattner
in iOther.h git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@2209 91177308-0d34-0410-b5e6-96231b3b80d8
2002-04-08Play around with #includesChris Lattner
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@2174 91177308-0d34-0410-b5e6-96231b3b80d8
2002-04-04* Eliminate commented out codeChris Lattner
* Do not demand a shadow node when resolving * Raise arbitrary inline limit git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@2100 91177308-0d34-0410-b5e6-96231b3b80d8
2002-04-01Support resolving function arguments/return values to pointers that indexChris Lattner
into other objects. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@2094 91177308-0d34-0410-b5e6-96231b3b80d8
2002-04-01Increase limit for perimeterChris Lattner
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@2081 91177308-0d34-0410-b5e6-96231b3b80d8
2002-03-31* Convert CallMap to be a vector, because the keys can change, and the mapChris Lattner
doesn't resort! * Be more generous with the cached matches that we allow now. * Recursive calls should all work now! git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@2061 91177308-0d34-0410-b5e6-96231b3b80d8
2002-03-28* Rename UnlinkUndistinguishableShadowNodes & RemoveUnreachableShadowNodesChris Lattner
to reflect that they can eliminate arbitrary nodes. * Rename the ShadowNodeEliminate.cpp file to EliminateNodes.cpp for the same reason git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@2020 91177308-0d34-0410-b5e6-96231b3b80d8
2002-03-28Many changesChris Lattner
* 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 git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@2010 91177308-0d34-0410-b5e6-96231b3b80d8
2002-03-27* Destroy alloca nodes when a graph gets inlinedChris Lattner
* Add links to all subtrees when a shadow node gets resolved * Add critical node handling git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@2001 91177308-0d34-0410-b5e6-96231b3b80d8
2002-03-27* Because of optimization, the shadow nodes between arguments might getChris Lattner
removed. Check to see if they are there. * Repeat optimizations while changing git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@1997 91177308-0d34-0410-b5e6-96231b3b80d8
2002-03-26Initial checkin of Datastructure analysis.Chris Lattner
Has bugs, but shouldn't crash in theory. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@1994 91177308-0d34-0410-b5e6-96231b3b80d8