llvm-svn: 2014

llvm-svn: 2013

llvm-svn: 2012

llvm-svn: 2011

* 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

* Nodes can determine whether they are foldable with another node
* Rename NewDSNode to AllocDSNode
* The Function graph breaks up all of the node types into individual
  vectors to alloc fast access when you are looking for a particular type
  of node.  Simplifies much code.

llvm-svn: 2009

llvm-svn: 2008

* rename constructor function
* Move stuff into anonymous namespaces

llvm-svn: 2007

llvm-svn: 2006

llvm-svn: 2005

* Move removeEdgesTo to be a member of DSNode
* Implement (but #ifdef out) the new, spiffier, method of determining
  shadow node equivalence.  This cannot be enabled until more is
  implemented.

llvm-svn: 2004

* Implement Critical Shadow node handling
* Implement routines to determine whether an allocation node is a malloc
  or alloca

llvm-svn: 2003

* Optimize graph after building it.  This should be unneccesary in the future

llvm-svn: 2002

* Add links to all subtrees when a shadow node gets resolved
* Add critical node handling

llvm-svn: 2001

* Export interface to tell whether an alloc node represent a malloc or alloca
* Add the concept of a "critical" shadow node

llvm-svn: 2000

* Implement indistinguishable shadow node elimination

llvm-svn: 1999

llvm-svn: 1998

  removed.  Check to see if they are there.
* Repeat optimizations while changing

llvm-svn: 1997

Simplification routines return true on change

llvm-svn: 1996

* Parameterize pass outputting with the printPass template, so analysis
  output can optionally take more arguments than just a stream.  The
  default output mode is just to use operator<< on the analysis.
* Remove CurrentModule hack, in favor of using printPass
* Remove special operator<<'s defined for FindUsedTypes and
  FindUnsafePointerTypes, in favor of printPass specializations
* Use std::cout instead of cout

llvm-svn: 1995

Has bugs, but shouldn't crash in theory.

llvm-svn: 1994

llvm-svn: 1993

llvm-svn: 1992

change references from MethodARgument to FunctionArgument

llvm-svn: 1991

llvm-svn: 1990

Change references to MEthodArgument to FunctionArgument

llvm-svn: 1989

Change uses of methodArgument to FunctionArgument

llvm-svn: 1988

Remove unneccesary forward declarations for classes

llvm-svn: 1987

Rename MethodArgument to FunctionArgument
Fix some _really_ out of date comments

llvm-svn: 1986

llvm-svn: 1985

from memory!  Also, separate the writing and reading routines.

llvm-svn: 1983

llvm-svn: 1982

llvm-svn: 1980

llvm-svn: 1979

llvm-svn: 1978

llvm-svn: 1977

llvm-svn: 1976

useful right now when we only do local scheduling.

llvm-svn: 1975

llvm-svn: 1974

llvm-svn: 1973