summaryrefslogtreecommitdiffstats
path: root/llvm/lib/Analysis/LazyCallGraph.cpp
Commit message (Expand)AuthorAgeFilesLines
* [PM] Appease mingw32's auto-import DLL build with minimal tweaks, with fix fo...NAKAMURA Takumi2016-02-281-0/+2
* Revert r262185, "[PM] Appease mingw32's auto-import DLL build with minimal tw...NAKAMURA Takumi2016-02-281-2/+0
* [PM] Appease mingw32's auto-import DLL build with minimal tweaks.NAKAMURA Takumi2016-02-281-0/+2
* [PM] Introduce CRTP mixin base classes to help define passes andChandler Carruth2016-02-261-2/+0
* [LCG] Construct an actual call graph with call-edge SCCs nested insideChandler Carruth2016-02-171-388/+1181
* [LCG] Build an edge abstraction for the LazyCallGraph and use it toChandler Carruth2016-02-021-133/+160
* [lcg] Fix a few more formatting goofs found by clang-format. NFC.Chandler Carruth2015-12-281-4/+4
* Revert r225854: [PM] Move the LazyCallGraph printing functionality toChandler Carruth2015-01-141-38/+36
* [PM] Move the LazyCallGraph printing functionality to a print method.Chandler Carruth2015-01-131-36/+38
* [PM] Switch the new pass manager to use a reference-based API for IRChandler Carruth2015-01-051-3/+2
* Update SetVector to rely on the underlying set's insert to return a pair<iter...David Blaikie2014-11-191-5/+5
* Fix typosAlp Toker2014-05-151-2/+2
* [LCG] Add the last (and most complex) of the edge insertion mutationChandler Carruth2014-05-041-0/+119
* [LCG] Add the other simple edge insertion API to the call graph. ThisChandler Carruth2014-05-011-0/+15
* [LCG] Don't lookup the child SCC twice. Spotted this by inspection, andChandler Carruth2014-05-011-2/+2
* [LCG] Add some basic methods for querying the parent/child relationshipsChandler Carruth2014-05-011-0/+15
* [LCG] Add the really, *really* boring edge insertion case: adding anChandler Carruth2014-04-301-4/+19
* [LCG] Actually test the *basic* edge removal bits (IE, the non-SCCChandler Carruth2014-04-301-4/+8
* [LCG] Add the most basic of edge insertion to the lazy call graph. ThisChandler Carruth2014-04-281-0/+15
* [LCG] Make the return of the IntraSCC removal method actually match itsChandler Carruth2014-04-281-5/+3
* [LCG] Re-organize the methods for mutating a call graph to make theirChandler Carruth2014-04-271-76/+78
* [LCG] Rather than removing nodes from the SCC entry set when we processChandler Carruth2014-04-261-6/+7
* [LCG] Rotate the full SCC finding algorithm to avoid round-trips throughChandler Carruth2014-04-261-21/+23
* [LCG] Hoist the main DFS loop out of the edge removal function. ThisChandler Carruth2014-04-261-74/+70
* [LCG] In the incremental SCC re-formation, lift the node currently beingChandler Carruth2014-04-261-30/+38
* [LCG] Special case the removal of self edges. These don't impact the SCCChandler Carruth2014-04-261-0/+6
* [LCG] Refactor the duplicated code I added in my last commit here intoChandler Carruth2014-04-261-23/+14
* [LCG] During the incremental update of an SCC, switch to using theChandler Carruth2014-04-251-26/+26
* [LCG] During the incremental re-build of an SCC after removing an edge,Chandler Carruth2014-04-251-4/+5
* [LCG] Rather than doing a linear time SmallSetVector removal of eachChandler Carruth2014-04-251-6/+7
* [LCG] Remove a completely unnecessary loop. It wasn't even doing anyChandler Carruth2014-04-251-60/+54
* [LCG] Now that the loop structure of the core SCC finding routine isChandler Carruth2014-04-251-1/+8
* [LCG] Switch a weird do/while loop that actually couldn't fail itsChandler Carruth2014-04-241-5/+4
* [LCG] Incorporate the core trick of improvements on the naive Tarjan'sChandler Carruth2014-04-241-41/+61
* [LCG] Rotate logic applied to the top of the DFSStack to instead beChandler Carruth2014-04-241-25/+24
* [LCG] Switch the parent SCC tracking from a SmallSetVector toChandler Carruth2014-04-241-2/+2
* [LCG] We don't actually need a set in each SCC to track the nodes. WeChandler Carruth2014-04-241-7/+1
* [LCG] Normalize the post-order SCC iterator to just iterate over the SCCChandler Carruth2014-04-231-2/+2
* [LCG] Switch the primary node iterator to be a *much* more normal C++Chandler Carruth2014-04-231-39/+33
* [LCG] Make the insertion and query paths into the LCG which cannot failChandler Carruth2014-04-231-4/+4
* [LCG] Switch the SCC lookup to be in terms of call graph nodes ratherChandler Carruth2014-04-231-8/+8
* [LCG] Switch the primary SCC building code to use the negative low-linkChandler Carruth2014-04-231-2/+4
* [LCG] Add the first round of mutation support to the lazy call graph.Chandler Carruth2014-04-231-0/+233
* [LCG] Implement Tarjan's algorithm correctly this time. We have to walkChandler Carruth2014-04-231-34/+42
* [LCG] Add a unittest for the LazyCallGraph. I had a weak moment andChandler Carruth2014-04-231-0/+2
* [LCG] Hoist the logic for forming a new SCC from the top of the DFSStackChandler Carruth2014-04-231-41/+47
* [LCG] Switch the Callee sets to be DenseMaps pointing to the index intoChandler Carruth2014-04-231-7/+8
* [Modules] Fix potential ODR violations by sinking the DEBUG_TYPEChandler Carruth2014-04-221-1/+2
* [LCG] Add some basic debug output to the LCG pass.Chandler Carruth2014-04-211-2/+17
* [LCG] Fix the bugs that Ben pointed out in code review (and the MSan botChandler Carruth2014-04-181-3/+7
OpenPOWER on IntegriCloud