summaryrefslogtreecommitdiffstats
path: root/llvm/lib/Analysis/DataStructure/FunctionRepBuilder.h
Commit message (Collapse)AuthorAgeFilesLines
* Reimplement data structure analysisChris Lattner2002-07-101-135/+0
| | | | llvm-svn: 2868
* Fix anand's last checkinChris Lattner2002-06-301-1/+0
| | | | llvm-svn: 2804
* changes to make it compatible with 64bit gccAnand Shukla2002-06-251-6/+8
| | | | llvm-svn: 2789
* *** empty log message ***Chris Lattner2002-06-251-17/+15
| | | | llvm-svn: 2777
* Make data structure acurately get ALL edges, even loads of null fields ofChris Lattner2002-04-171-4/+5
| | | | | | | | nodes that are not shadow nodes This fixes em3d to be _correct_ if not optimial llvm-svn: 2274
* * Eliminate ArgDSNode's completely, now rely on scalar mapChris Lattner2002-04-161-2/+0
| | | | | | | | | * 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
* Print out the instruction instead of just the address!Chris Lattner2002-03-311-1/+3
| | | | llvm-svn: 2063
* Many changesChris Lattner2002-03-281-5/+10
| | | | | | | | | | | | | * 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
* Initial checkin of Datastructure analysis.Chris Lattner2002-03-261-0/+130
Has bugs, but shouldn't crash in theory. llvm-svn: 1994
OpenPOWER on IntegriCloud