summaryrefslogtreecommitdiffstats
path: root/llvm/lib/Analysis/DataStructure
Commit message (Collapse)AuthorAgeFilesLines
...
* Keep track of the number of typed/untyped memory accesses theyre are in the ↵Chris Lattner2003-09-201-30/+62
| | | | | | | | program VS: ---------------------------------------------------------------------- llvm-svn: 8611
* Fixed spelling and grammar.Misha Brukman2003-09-113-5/+5
| | | | llvm-svn: 8478
* Add more verbose commentChris Lattner2003-08-051-10/+9
| | | | llvm-svn: 7610
* Added function mergeInGlobalsGraph which merges in the entire globals graph ↵Sumant Kowshik2003-08-051-0/+29
| | | | | | with the graph of a function llvm-svn: 7606
* DEBUG got moved to Support/Debug.hChris Lattner2003-08-015-3/+6
| | | | llvm-svn: 7492
* Fix another minor bugChris Lattner2003-07-261-2/+2
| | | | llvm-svn: 7340
* Dont' try to parse the colonChris Lattner2003-07-251-2/+2
| | | | llvm-svn: 7323
* Add a more general check-flags which can be used to ensure arbitrary flags ↵Chris Lattner2003-07-251-11/+35
| | | | | | are set llvm-svn: 7322
* Fix comment.Vikram S. Adve2003-07-221-3/+3
| | | | llvm-svn: 7227
* Fix typo in call to isUnresolvableFunc, which was breaking the build.Brian Gaeke2003-07-171-1/+1
| | | | llvm-svn: 7194
* Rematerialize nodes from the globals graph into the current graphVikram S. Adve2003-07-161-3/+9
| | | | | | | | | | after all callees are inlined into the current graph. NOTE: There's also a major bug fix for the BU pass in DataStructure.cpp, which ensures that resolvable indirect calls are not moved out to the globals graph, so that they are eventually inlined (if possible). llvm-svn: 7189
* (1) Rematerialize nodes from the globals graph into the current graphVikram S. Adve2003-07-161-57/+84
| | | | | | | | | | | | after all callers are inlined into the current graph. (2) Optimize the way a graph is inlined into its callees in the TD phase: (a) Use DSGraph::cloneReachableSubgraph to clone only a subgraph at each call site, for faster inlining. (b) Clone separately for the same callee at different call sites, since only the reachable subgraph is being cloned, not the entire caller graph. llvm-svn: 7188
* Implement 2 important changes: (1) rematerialization from the globals graph,Vikram S. Adve2003-07-161-65/+250
| | | | | | | | | | | | | | | | | | | | | | | and (2) faster inlining by cloning only reachable nodes. In particular: (1) Added DSGraph::cloneReachableSubgraph and DSGraph::cloneReachableNodes to clone the subgraph reachable from a set of root nodes, into the current graph, merging the global nodes into thos in the current graph. The TD pass now uses this for faster inlining, and so does the next function. (2) Added DSGraph::updateFromGlobalGraph() to rematerialize nodes from the globals graph into the current graph in both BU and TD passes. (3) `I' flags are removed from all nodes in the globals graph, because they are difficult to maintain correctly and are not needed anyway. (4) Aux. function calls are only removed to the globals graph if they will never be resovled. (This is what fixed gap.) The immediate reason is that if we took these out of a function (and moved them to the globals graph) we would need to rematerialize these nodes into the function graph for every function in the BU pass. The longer term problem is that we would need to find a way to remove them from the globals graph iff they have been resolved on all paths through the call graph. llvm-svn: 7187
* Factor out the test for unresolvable external functions intoVikram S. Adve2003-07-161-14/+19
| | | | | | | isUnresolvableFunc() (I thought I needed this externally. I don't, but it's still nicer this way.) llvm-svn: 7186
* Remove globals more aggressively from graphs.Chris Lattner2003-07-031-11/+32
| | | | | | Fix a bug where we removed nodes that were marked U. llvm-svn: 7090
* INCLUDE_PARENT_GRAPH is required!Chris Lattner2003-07-021-21/+4
| | | | llvm-svn: 7088
* Disable incorrect mustalias codeChris Lattner2003-07-021-1/+4
| | | | llvm-svn: 7087
* Remove space at end of lineChris Lattner2003-07-021-1/+1
| | | | llvm-svn: 7084
* Fix how we are handling unreachable functions. This DRAMATICALLY improves ↵Chris Lattner2003-07-022-36/+38
| | | | | | efficiency llvm-svn: 7082
* Keep track of how many inlinings are performedChris Lattner2003-07-021-0/+2
| | | | llvm-svn: 7076
* Try using trivially dead deletionChris Lattner2003-07-021-0/+1
| | | | llvm-svn: 7075
* Remove dead Nodes listChris Lattner2003-07-021-6/+4
| | | | llvm-svn: 7065
* Complete rewrite of td passChris Lattner2003-07-021-103/+101
| | | | llvm-svn: 7064
* Print collapsed to match the paperChris Lattner2003-07-021-1/+1
| | | | llvm-svn: 7063
* Reduce amount of work we do calculating mustaliases if the arg is a globalChris Lattner2003-07-021-11/+16
| | | | llvm-svn: 7062
* Add support for ParentGraph only when building in debug modeChris Lattner2003-07-021-8/+48
| | | | | | Minor cleanups, reenable folding of call nodes to external functions llvm-svn: 7061
* Add some functions to the blacklistChris Lattner2003-07-021-1/+2
| | | | llvm-svn: 7060
* Make the BU closure keep track of which actual calls happenChris Lattner2003-07-021-2/+6
| | | | | | Minor cleanups llvm-svn: 7059
* Make local pass print out its progressChris Lattner2003-07-021-0/+3
| | | | llvm-svn: 7058
* Rework TD pass to work with the precise call graph constructed by the BU phaseChris Lattner2003-07-012-113/+150
| | | | llvm-svn: 7031
* Do not treat global variables as functions! (and assert failing)Chris Lattner2003-07-011-3/+5
| | | | llvm-svn: 7030
* Dont' print scalar nodes for ConstantPointerRefsChris Lattner2003-07-011-1/+2
| | | | llvm-svn: 7029
* Minor cleanupsChris Lattner2003-07-011-4/+5
| | | | llvm-svn: 7027
* Use the getFunctionNames methodChris Lattner2003-06-301-8/+3
| | | | llvm-svn: 7008
* Add new methodChris Lattner2003-06-301-0/+17
| | | | llvm-svn: 7007
* Split CallSiteIterator out into DSCallSiteIterator.h, and generalize it a bitChris Lattner2003-06-302-101/+125
| | | | llvm-svn: 7006
* Be more const-correctChris Lattner2003-06-301-2/+2
| | | | llvm-svn: 7005
* Fix bug in last checkinChris Lattner2003-06-301-1/+1
| | | | llvm-svn: 7003
* Reimplement the BU closure to collapse all SCC graphs into a single graph.Chris Lattner2003-06-301-242/+52
| | | | | | Look at all of the code that gets deleted! llvm-svn: 7001
* Handle the case where OldNodeMap == &ScalarMap correctlyChris Lattner2003-06-301-12/+7
| | | | llvm-svn: 7000
* Remove dead methodChris Lattner2003-06-301-27/+0
| | | | llvm-svn: 6999
* Do not delete the same graph multiple times when freeing memory if graphs ↵Chris Lattner2003-06-301-3/+6
| | | | | | are sharing llvm-svn: 6998
* Do not multiply delete graphs if functions are sharing graphsChris Lattner2003-06-301-4/+6
| | | | llvm-svn: 6997
* Move usages of explicit hash_* datastructures to use typedefsChris Lattner2003-06-303-17/+15
| | | | llvm-svn: 6996
* Revamp DSGraphs so that they can support multiple functions in the sameChris Lattner2003-06-306-94/+121
| | | | | | DSGraph at one time llvm-svn: 6994
* Abstract out the predicate which decides whether a function gets completeChris Lattner2003-06-291-13/+23
| | | | | | arguments or not... llvm-svn: 6987
* Fix minor bug in previous checkinChris Lattner2003-06-291-3/+1
| | | | llvm-svn: 6986
* Add support for ensuring that nodes are not incompleteChris Lattner2003-06-291-12/+25
| | | | llvm-svn: 6985
* Add support for "physical subtyping", which fixes:Chris Lattner2003-06-291-5/+140
| | | | | | DSGraph/2003-06-29-NodeCollapsing2.ll & DSGraph/PhysicalSubtyping.ll llvm-svn: 6982
* Add print method to not get silly warning from analyzeChris Lattner2003-06-291-0/+1
| | | | llvm-svn: 6981
OpenPOWER on IntegriCloud