llvm-6502/lib/Analysis/DataStructure
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
..
ComputeClosure.cpp Many changes 2002-03-28 17:56:03 +00:00
DataStructure.cpp Many changes 2002-03-28 17:56:03 +00:00
EliminateNodes.cpp Many changes 2002-03-28 17:56:03 +00:00
FunctionRepBuilder.cpp Many changes 2002-03-28 17:56:03 +00:00
FunctionRepBuilder.h Many changes 2002-03-28 17:56:03 +00:00
Makefile Initial checkin of Datastructure analysis. 2002-03-26 22:39:06 +00:00
NodeImpl.cpp Many changes 2002-03-28 17:56:03 +00:00