summaryrefslogtreecommitdiffstats
path: root/llvm/lib/Analysis/DataStructure/NodeImpl.cpp
Commit message (Collapse)AuthorAgeFilesLines
* Reimplement data structure analysisChris Lattner2002-07-101-470/+0
| | | | llvm-svn: 2868
* Fix anand's last checkinChris Lattner2002-06-301-2/+1
| | | | llvm-svn: 2804
* changes to make it compatible with 64bit gccAnand Shukla2002-06-251-16/+19
| | | | llvm-svn: 2789
* *** empty log message ***Chris Lattner2002-06-251-6/+5
| | | | llvm-svn: 2777
* Add support for tracking array allocationsChris Lattner2002-04-271-2/+12
| | | | llvm-svn: 2328
* Print argument scalars as ellipses instead of boxesChris Lattner2002-04-181-1/+2
| | | | llvm-svn: 2293
* Inline indirect function calls that are only capable of calling one functionChris Lattner2002-04-171-1/+1
| | | | llvm-svn: 2275
* Make data structure acurately get ALL edges, even loads of null fields ofChris Lattner2002-04-171-15/+8
| | | | | | | | nodes that are not shadow nodes This fixes em3d to be _correct_ if not optimial llvm-svn: 2274
* * Remove the concept of a critical shadow nodeChris Lattner2002-04-161-15/+11
| | | | | | | | * Make the function pointer argument explicit for a call nodes * Eliminate unreachable global values * Merge call nodes that are identical llvm-svn: 2266
* * Eliminate ArgDSNode's completely, now rely on scalar mapChris Lattner2002-04-161-41/+52
| | | | | | | | | * 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
* Move FunctionArgument out of iOther.h into Argument.h and rename class toChris Lattner2002-04-091-1/+2
| | | | | | be 'Argument' instead of FunctionArgument. llvm-svn: 2216
* Play around with #includesChris Lattner2002-04-081-1/+1
| | | | llvm-svn: 2174
* Call nodes are never equivalentChris Lattner2002-04-041-3/+4
| | | | | | Shadow nodes are never critical. llvm-svn: 2102
* Critical shadow nodes no do not know their parent explictly.Chris Lattner2002-04-011-4/+2
| | | | llvm-svn: 2084
* * Move the isEquivalentTo implementations here. They can probably be putChris Lattner2002-03-311-1/+39
| | | | | | | someplace nicer in the file though. * Add new dump method for debugging llvm-svn: 2064
* Many changesChris Lattner2002-03-281-20/+72
| | | | | | | | | | | | | * 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 DSNode::removeAllIncomingEdgesChris Lattner2002-03-271-6/+20
| | | | | | | | * Implement Critical Shadow node handling * Implement routines to determine whether an allocation node is a malloc or alloca llvm-svn: 2003
* Fix long lineChris Lattner2002-03-271-3/+5
| | | | llvm-svn: 1998
* Initial checkin of Datastructure analysis.Chris Lattner2002-03-261-0/+352
Has bugs, but shouldn't crash in theory. llvm-svn: 1994
OpenPOWER on IntegriCloud