aboutsummaryrefslogtreecommitdiffstats
path: root/include/llvm/Analysis/DataStructure.h
Commit message (Expand)AuthorAgeFilesLines
* Add GlobalDSGraph -- a common graph that holds externally visible nodes.Vikram S. Adve2002-07-301-34/+90
* * Eliminate the Provided set. All Passes now finally just automaticallyChris Lattner2002-07-291-3/+0
* * Standardize how analysis results/passes as printed with the print() virtualChris Lattner2002-07-271-3/+3
* *** empty log message ***Chris Lattner2002-07-261-8/+0
* *** empty log message ***Chris Lattner2002-07-261-3/+0
* GCC 3.1 changesChris Lattner2002-07-241-1/+7
* Remove assert hack now that I'm using the right GDB. :)Chris Lattner2002-07-241-7/+0
* Allow comparison against nullChris Lattner2002-07-231-0/+3
* Rename removeDeadNodes to removeTriviallyDeadNodesChris Lattner2002-07-181-3/+12
* Simplify saveOrigFunctionCallsChris Lattner2002-07-181-10/+5
* Add support for a top-down propagation pass.Vikram S. Adve2002-07-181-3/+92
* First cut at implementing bottom up analysisChris Lattner2002-07-181-32/+117
* * Nodes now keep track of any global variables contained within themChris Lattner2002-07-111-4/+15
* New implementation of data structure analysisChris Lattner2002-07-101-371/+132
* changes to make it compatible with 64bit gccAnand Shukla2002-06-251-0/+1
* MEGAPATCH checkin.Chris Lattner2002-06-251-1/+1
* Add new optional getPassName() virtual function that a Pass can overrideChris Lattner2002-04-291-0/+2
* * Rename MethodPass class to FunctionPassChris Lattner2002-04-271-5/+4
* Support array allocationsChris Lattner2002-04-271-2/+7
* Make data structure acurately get ALL edges, even loads of null fields ofChris Lattner2002-04-171-10/+12
* Remove the concept of a critical shadow nodeChris Lattner2002-04-161-14/+6
* * Eliminate ArgDSNode's completely, rely now on Scalar mapChris Lattner2002-04-161-23/+7
* Move FunctionArgument out of iOther.h into Argument.h and rename class toChris Lattner2002-04-091-3/+3
* Add method to get # nodes in the graphChris Lattner2002-04-041-0/+4
* Shadow nodes don't need to know their explicit parent, they just need toChris Lattner2002-04-011-3/+2
* * Allow access to DSNode iterator as DSNode::iterator/begin/endChris Lattner2002-03-311-0/+6
* Add accessors and a method to get all the outgoing links for ALL nodesChris Lattner2002-03-301-0/+33
* Add an accessorChris Lattner2002-03-301-1/+5
* Add a hook to allow the datastructure to keep naturally up to date, evenChris Lattner2002-03-291-0/+13
* Expose more information to clientsChris Lattner2002-03-291-0/+9
* Implement getEscapingAllocations & getNonEscapingAllocationsChris Lattner2002-03-281-2/+4
* * Remove RemoveUnreachableShadowNodes & UnlinkUndistinguishableShadowNodesChris Lattner2002-03-281-3/+17
* * Define some operators on PointerVal and PVS'sChris Lattner2002-03-281-6/+39
* * Add a nice utility method to DSNodeChris Lattner2002-03-271-2/+20
* Allow isa<DSNode>(..)Chris Lattner2002-03-271-2/+3
* New header file for datastructure analysisChris Lattner2002-03-261-0/+377
generated by cgit v1.1 at 2025-02-02 08:05:42 +0000