5 Commits

Author	SHA1	Message	Date
Chris Lattner	fe14568a81	Make data structure acurately get ALL edges, even loads of null fields of ... nodes that are not shadow nodes This fixes em3d to be _correct_ if not optimial git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@2274 91177308-0d34-0410-b5e6-96231b3b80d8	2002-04-17 03:24:59 +00:00
Chris Lattner	212be2e569	* Eliminate ArgDSNode's completely, now rely on scalar map ... * 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. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@2257 91177308-0d34-0410-b5e6-96231b3b80d8	2002-04-16 03:44:03 +00:00
Chris Lattner	e6b552fd86	Print out the instruction instead of just the address! ... git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@2063 91177308-0d34-0410-b5e6-96231b3b80d8	2002-03-31 07:15:20 +00:00
Chris Lattner	1120c8b34a	Many changes ... * 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-28 17:56:03 +00:00
Chris Lattner	bb2a28fec5	Initial checkin of Datastructure analysis. ... 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	2002-03-26 22:39:06 +00:00