llvm-project

Author	SHA1	Message	Date
Chris Lattner	79db55028c	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 llvm-svn: 2274	2002-04-17 03:24:59 +00:00
Chris Lattner	46b08cdc7c	* 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. llvm-svn: 2257	2002-04-16 03:44:03 +00:00
Chris Lattner	49c3ea8c1e	Print out the instruction instead of just the address! llvm-svn: 2063	2002-03-31 07:15:20 +00:00
Chris Lattner	b1782d0c90	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 llvm-svn: 2010	2002-03-28 17:56:03 +00:00
Chris Lattner	e604d8ec65	Initial checkin of Datastructure analysis. Has bugs, but shouldn't crash in theory. llvm-svn: 1994	2002-03-26 22:39:06 +00:00