aboutsummaryrefslogtreecommitdiff
path: root/lib/Analysis/DataStructure
AgeCommit message (Expand)Author
2002-07-11* Nodes now keep track of any global variables in themChris Lattner
2002-07-10New implementation of data structure analysis. Only local analysis has beenChris Lattner
2002-07-10Reimplement data structure analysisChris Lattner
2002-06-30Fix anand's last checkinChris Lattner
2002-06-25changes to make it compatible with 64bit gccAnand Shukla
2002-06-25changes to make it compatible with 64bit gccAnand Shukla
2002-06-25*** empty log message ***Chris Lattner
2002-04-28Split ConstantVals.h into Constant.h and Constants.hChris Lattner
2002-04-28Fix signed/unsigned comparison warningChris Lattner
2002-04-27Add support for tracking array allocationsChris Lattner
2002-04-27Allow the inline limit to be modified on the commandline for debuggingChris Lattner
2002-04-18Print argument scalars as ellipses instead of boxesChris Lattner
2002-04-17Inline indirect function calls that are only capable of calling one functionChris Lattner
2002-04-17Make data structure acurately get ALL edges, even loads of null fields ofChris Lattner
2002-04-16* Remove the concept of a critical shadow nodeChris Lattner
2002-04-16* Eliminate ArgDSNode's completely, now rely on scalar mapChris Lattner
2002-04-09Move FunctionArgument out of iOther.h into Argument.h and rename class toChris Lattner
2002-04-09Add explicit #includes of Function.h to make up for the removed #includeChris Lattner
2002-04-09Add #includes to make up for #includes pruned out of header files.Chris Lattner
2002-04-08Play around with #includesChris Lattner
2002-04-04Call nodes are never equivalentChris Lattner
2002-04-04Add hack to get timing of analysisChris Lattner
2002-04-04* Eliminate commented out codeChris Lattner
2002-04-01Support resolving function arguments/return values to pointers that indexChris Lattner
2002-04-01Avoid incorrectly adding null values to the scalar map!Chris Lattner
2002-04-01Critical shadow nodes no do not know their parent explictly.Chris Lattner
2002-04-01Minor cleanups (use dyn_cast instead of testing manually)Chris Lattner
2002-04-01Allow merging of identical call nodes. Make the shadow node pointed toChris Lattner
2002-04-01Increase limit for perimeterChris Lattner
2002-03-31Unify the destruction code used for node pairs vs normal nodes. This wasChris Lattner
2002-03-31* Move the isEquivalentTo implementations here. They can probably be putChris Lattner
2002-03-31Print out the instruction instead of just the address!Chris Lattner
2002-03-31* Move isEquivalentTo implementations to NodeImplChris Lattner
2002-03-31* Convert CallMap to be a vector, because the keys can change, and the mapChris Lattner
2002-03-28Implement getEscapingAllocations & getNonEscapingAllocationsChris Lattner
2002-03-28* Rename UnlinkUndistinguishableShadowNodes & RemoveUnreachableShadowNodesChris Lattner
2002-03-28Ooops, I did such a great job pruning nodes, that I accidentally deletedChris Lattner
2002-03-28Many changesChris Lattner
2002-03-27* Add #define to enabled debug messagesChris Lattner
2002-03-27* Implement DSNode::removeAllIncomingEdgesChris Lattner
2002-03-27* Add critical node supportChris Lattner
2002-03-27* Destroy alloca nodes when a graph gets inlinedChris Lattner
2002-03-27* Optimizers return true on changeChris Lattner
2002-03-27Fix long lineChris Lattner
2002-03-27* Because of optimization, the shadow nodes between arguments might getChris Lattner
2002-03-26Initial checkin of Datastructure analysis.Chris Lattner
generated by cgit v1.2.3-70-g09d2 (git 2.46.0) at 2026-02-04 10:31:52 +0000