aboutsummaryrefslogtreecommitdiffstats
path: root/include/llvm/Analysis
Commit message (Expand)AuthorAgeFilesLines
* Changes to be GCC 3.1 friendlyChris Lattner2002-07-313-3/+3
* Add GlobalDSGraph -- a common graph that holds externally visible nodes.Vikram S. Adve2002-07-302-68/+180
* * Eliminate the Provided set. All Passes now finally just automaticallyChris Lattner2002-07-297-17/+0
* * Eliminate the Provided set. All Passes now finally just automaticallyChris Lattner2002-07-291-1/+0
* * Standardize how analysis results/passes as printed with the print() virtualChris Lattner2002-07-2710-86/+33
* *** empty log message ***Chris Lattner2002-07-269-66/+3
* *** empty log message ***Chris Lattner2002-07-269-33/+12
* Simplify analyses so that there is only one analysis per classChris Lattner2002-07-263-138/+251
* Remove dead optionsChris Lattner2002-07-251-9/+1
* Fix previous checkinChris Lattner2002-07-251-1/+3
* Add typenamesChris Lattner2002-07-251-3/+3
* *** empty log message ***Chris Lattner2002-07-253-6/+9
* GCC 3.1 changesChris Lattner2002-07-242-2/+14
* *** empty log message ***Chris Lattner2002-07-241-3/+2
* Remove assert hack now that I'm using the right GDB. :)Chris Lattner2002-07-242-14/+0
* Allow comparison against nullChris Lattner2002-07-232-0/+6
* Rename removeDeadNodes to removeTriviallyDeadNodesChris Lattner2002-07-182-6/+24
* Simplify saveOrigFunctionCallsChris Lattner2002-07-182-20/+10
* Add support for a top-down propagation pass.Vikram S. Adve2002-07-182-6/+184
* * s/method/functionChris Lattner2002-07-181-61/+73
* First cut at implementing bottom up analysisChris Lattner2002-07-182-64/+234
* * Nodes now keep track of any global variables contained within themChris Lattner2002-07-112-8/+30
* New implementation of data structure analysisChris Lattner2002-07-105-790/+294
* changes to make it compatible with 64bit gccAnand Shukla2002-06-252-0/+2
* MEGAPATCH checkin.Chris Lattner2002-06-2511-29/+25
* *** empty log message ***Chris Lattner2002-06-252-3/+4
* Allow const bb's to be checked for containment in a loopChris Lattner2002-06-031-1/+1
* Avoid #including CommandLine.hChris Lattner2002-05-221-12/+0
* Add method to check to see if two _Instructions_ dominate each otherChris Lattner2002-05-131-0/+7
* Fix misspellingChris Lattner2002-05-071-1/+1
* Remove analysis namespaceChris Lattner2002-04-291-6/+1
* Add new optional getPassName() virtual function that a Pass can overrideChris Lattner2002-04-299-0/+35
* Remove all contents of the cfg namespace to the global namespaceChris Lattner2002-04-287-82/+58
* Change the Dominator info and LoopInfo classes to keep track of BasicBlock's,...Chris Lattner2002-04-282-41/+37
* s/Method/FunctionChris Lattner2002-04-271-2/+2
* * Rename MethodPass class to FunctionPassChris Lattner2002-04-279-104/+95
* Support array allocationsChris Lattner2002-04-272-4/+14
* Make data structure acurately get ALL edges, even loads of null fields ofChris Lattner2002-04-172-20/+24
* Remove the concept of a critical shadow nodeChris Lattner2002-04-162-28/+12
* * Eliminate ArgDSNode's completely, rely now on Scalar mapChris Lattner2002-04-162-46/+14
* s/Method/FunctionChris Lattner2002-04-141-4/+4
* Move FunctionArgument out of iOther.h into Argument.h and rename class toChris Lattner2002-04-093-7/+7
* Use opaque decl instead of #includeChris Lattner2002-04-091-1/+1
* Don't leak all of the Loop objects created...Chris Lattner2002-04-091-1/+8
* Trim #includesChris Lattner2002-04-081-1/+1
* * Move include/llvm/Analysis/SlotCalculator.h to include/llvm/SlotCalculator.hChris Lattner2002-04-071-12/+16
* Change references to the Method class to be references to the FunctionChris Lattner2002-04-071-10/+10
* Add method to get # nodes in the graphChris Lattner2002-04-042-0/+8
* Shadow nodes don't need to know their explicit parent, they just need toChris Lattner2002-04-012-6/+4
* * Allow access to DSNode iterator as DSNode::iterator/begin/endChris Lattner2002-03-315-33/+66