aboutsummaryrefslogtreecommitdiffstats
path: root/lib/Analysis/DataStructure
Commit message (Expand)AuthorAgeFilesLines
* Split ConstantVals.h into Constant.h and Constants.hChris Lattner2002-04-281-1/+1
* Fix signed/unsigned comparison warningChris Lattner2002-04-281-1/+1
* Add support for tracking array allocationsChris Lattner2002-04-272-2/+13
* Allow the inline limit to be modified on the commandline for debuggingChris Lattner2002-04-271-1/+6
* Print argument scalars as ellipses instead of boxesChris Lattner2002-04-181-1/+2
* Inline indirect function calls that are only capable of calling one functionChris Lattner2002-04-172-10/+13
* Make data structure acurately get ALL edges, even loads of null fields ofChris Lattner2002-04-173-29/+30
* * Remove the concept of a critical shadow nodeChris Lattner2002-04-165-55/+79
* * Eliminate ArgDSNode's completely, now rely on scalar mapChris Lattner2002-04-165-100/+94
* Move FunctionArgument out of iOther.h into Argument.h and rename class toChris Lattner2002-04-092-9/+12
* Add explicit #includes of Function.h to make up for the removed #includeChris Lattner2002-04-091-0/+1
* Add #includes to make up for #includes pruned out of header files.Chris Lattner2002-04-091-0/+2
* Play around with #includesChris Lattner2002-04-082-4/+1
* Call nodes are never equivalentChris Lattner2002-04-041-3/+4
* Add hack to get timing of analysisChris Lattner2002-04-041-0/+23
* * Eliminate commented out codeChris Lattner2002-04-041-10/+4
* Support resolving function arguments/return values to pointers that indexChris Lattner2002-04-011-5/+15
* Avoid incorrectly adding null values to the scalar map!Chris Lattner2002-04-011-0/+1
* Critical shadow nodes no do not know their parent explictly.Chris Lattner2002-04-011-4/+2
* Minor cleanups (use dyn_cast instead of testing manually)Chris Lattner2002-04-011-6/+7
* Allow merging of identical call nodes. Make the shadow node pointed toChris Lattner2002-04-011-4/+18
* Increase limit for perimeterChris Lattner2002-04-011-1/+1
* Unify the destruction code used for node pairs vs normal nodes. This wasChris Lattner2002-03-311-35/+36
* * Move the isEquivalentTo implementations here. They can probably be putChris Lattner2002-03-311-1/+39
* Print out the instruction instead of just the address!Chris Lattner2002-03-311-1/+3
* * Move isEquivalentTo implementations to NodeImplChris Lattner2002-03-311-56/+91
* * Convert CallMap to be a vector, because the keys can change, and the mapChris Lattner2002-03-311-8/+45
* Implement getEscapingAllocations & getNonEscapingAllocationsChris Lattner2002-03-281-24/+61
* * Rename UnlinkUndistinguishableShadowNodes & RemoveUnreachableShadowNodesChris Lattner2002-03-283-15/+16
* Ooops, I did such a great job pruning nodes, that I accidentally deletedChris Lattner2002-03-281-1/+2
* Many changesChris Lattner2002-03-286-317/+386
* * Add #define to enabled debug messagesChris Lattner2002-03-271-12/+15
* * Implement DSNode::removeAllIncomingEdgesChris Lattner2002-03-271-6/+20
* * Add critical node supportChris Lattner2002-03-271-6/+20
* * Destroy alloca nodes when a graph gets inlinedChris Lattner2002-03-271-2/+32
* * Optimizers return true on changeChris Lattner2002-03-271-9/+83
* Fix long lineChris Lattner2002-03-271-3/+5
* * Because of optimization, the shadow nodes between arguments might getChris Lattner2002-03-271-13/+14
* Initial checkin of Datastructure analysis.Chris Lattner2002-03-267-0/+1329
generated by cgit v1.1 at 2024-10-30 16:36:16 +0000