aboutsummaryrefslogtreecommitdiffstats
path: root/lib/Analysis/DataStructure/BottomUpClosure.cpp
Commit message (Expand)AuthorAgeFilesLines
* Only clone global nodes between graphs if both graphs have the global.Chris Lattner2004-02-271-0/+3
* Instead of cloning the globals for main into the globals graph at the end ofChris Lattner2004-02-211-17/+11
* There is no need to merge the globals graph into the function graphs at theChris Lattner2004-02-201-5/+1
* When we complete the bottom-up pass, make sure to merge the globals in 'main'...Chris Lattner2004-02-171-0/+17
* Instead of callign removeTriviallyDeadNodes on the global graph every timeChris Lattner2004-02-081-0/+1
* Avoid referencing deleted DSgraphs when merging an SCC into a larger SCC. ThisChris Lattner2004-01-311-9/+11
* Get clone flags right, so we don't build InlinedGlobals only to clear themChris Lattner2004-01-271-5/+3
* Initial support for implementing clonePartiallyInto in terms of cloneReachabl...Chris Lattner2004-01-231-1/+2
* Minor code cleanupChris Lattner2003-11-131-2/+2
* Fine-grainify namespaces for this libraryChris Lattner2003-11-121-4/+1
* Put all LLVM code into the llvm namespace, as per bug 109.Brian Gaeke2003-11-111-0/+3
* Added LLVM project notice to the top of every C++ source file.John Criswell2003-10-201-0/+7
* Functions reachable from the arguments of unresolvable call nodes shouldChris Lattner2003-09-201-1/+4
* The Globals graph must become complete at the end of the BU phase!Chris Lattner2003-09-201-0/+5
* Switch from using CallInst's to represent call sites to using the LLVMChris Lattner2003-09-201-1/+2
* DEBUG got moved to Support/Debug.hChris Lattner2003-08-011-0/+1
* Rematerialize nodes from the globals graph into the current graphVikram S. Adve2003-07-161-3/+9
* Fix how we are handling unreachable functions. This DRAMATICALLY improves ef...Chris Lattner2003-07-021-0/+3
* Keep track of how many inlinings are performedChris Lattner2003-07-021-0/+2
* Make the BU closure keep track of which actual calls happenChris Lattner2003-07-021-2/+6
* Minor cleanupsChris Lattner2003-07-011-4/+5
* Split CallSiteIterator out into DSCallSiteIterator.h, and generalize it a bitChris Lattner2003-06-301-101/+7
* Reimplement the BU closure to collapse all SCC graphs into a single graph.Chris Lattner2003-06-301-242/+52
* Revamp DSGraphs so that they can support multiple functions in the sameChris Lattner2003-06-301-11/+11
* Propagate globals graph from the local to bu to td globals graphs. ThisChris Lattner2003-06-281-2/+3
* * Changes to make NodeType be private to DSNode.Chris Lattner2003-06-191-1/+1
* Implement optimization for direct function call case. This dramaticallyChris Lattner2003-02-051-16/+28
* Add better debug outputChris Lattner2003-02-031-12/+20
* Change DSGraph stuff to use hash_(set|map) instead of std::(set|map)Chris Lattner2003-02-011-8/+9
* Remove using declarationsChris Lattner2003-02-011-2/+1
* Add functions to the ban listChris Lattner2003-01-311-1/+2
* * Eliminate boolean arguments in favor of using enumsChris Lattner2003-01-231-6/+6
* Fix logical error in TD pass: we should clear Mod/Ref bits of each callerVikram S. Adve2002-11-271-4/+7
* Add MaxSCC statisticsChris Lattner2002-11-171-6/+25
* Inline graphs from outside the SCC into the SCC before SCC resolution startsChris Lattner2002-11-121-4/+104
* Complete rewrite of BU code to use Tarjan's SCC finding algorithm to driveChris Lattner2002-11-111-265/+351
* Fix infinite loop in the BU algorithm. Unfortunately this dies a seriousChris Lattner2002-11-111-30/+177
* * Bottom-Up graphs print the Aux call vectorChris Lattner2002-11-101-16/+42
* eliminate the ability to remove global nodes from deadNodeElminate... for now.Chris Lattner2002-11-091-1/+1
* Add globals graphs to all three passesChris Lattner2002-11-091-11/+15
* Clean up DSGraph::removeDeadNodes interfaceChris Lattner2002-11-091-7/+1
* Make removeTriviallyDeadNodes a private interface of DSGraphChris Lattner2002-11-091-1/+2
* ONLY merge in the aux call sites, this causes a HUGE speedupChris Lattner2002-11-081-1/+2
* Remove gunk used by broken TD passChris Lattner2002-11-081-12/+4
* Instead of using a bool that constant has to be explained, use a selfChris Lattner2002-11-071-2/+2
* Implement a new mergeInGraph method, which basically factors code out ofChris Lattner2002-11-071-44/+4
* Rename DataStructureAnalysis namespace to DSChris Lattner2002-11-071-7/+1
* Delete "StripScalars" argument to cloneInto methodChris Lattner2002-11-061-1/+0
* Give a better error message in an unhandled caseChris Lattner2002-11-041-1/+8
* Rename ValueMap to ScalarMapChris Lattner2002-11-031-3/+3
generated by cgit v1.1 at 2025-01-19 17:51:14 +0000