4 Commits

Author	SHA1	Message	Date
Chris Lattner	55186e7abf	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	4c6e9cda3f	* Implement DSNode::removeAllIncomingEdges ... * Implement Critical Shadow node handling * Implement routines to determine whether an allocation node is a malloc or alloca llvm-svn: 2003	2002-03-27 19:46:05 +00:00
Chris Lattner	ae0192e2f6	Fix long line ... llvm-svn: 1998	2002-03-27 00:54:31 +00:00
Chris Lattner	d5b115e687	Initial checkin of Datastructure analysis. ... Has bugs, but shouldn't crash in theory. llvm-svn: 1994	2002-03-26 22:39:06 +00:00