summaryrefslogtreecommitdiff
path: root/lib/Analysis
Commit message (Expand)AuthorAge
* [LCG] Add the really, *really* boring edge insertion case: adding anChandler Carruth2014-04-30
* [LCG] Actually test the *basic* edge removal bits (IE, the non-SCCChandler Carruth2014-04-30
* raw_ostream: Forward declare OpenFlags and include FileSystem.h only where ne...Benjamin Kramer2014-04-29
* blockfreq: Defer to BranchProbability::scale()Duncan P. N. Exon Smith2014-04-29
* blockfreq: Remove more extra typenames from r207438Duncan P. N. Exon Smith2014-04-28
* Reapply "blockfreq: Approximate irreducible control flow"Duncan P. N. Exon Smith2014-04-28
* [LCG] Add the most basic of edge insertion to the lazy call graph. ThisChandler Carruth2014-04-28
* [LCG] Make the return of the IntraSCC removal method actually match itsChandler Carruth2014-04-28
* [inliner] Significantly improve the compile time in cases like PR19499Chandler Carruth2014-04-28
* [C++] Use 'nullptr'.Craig Topper2014-04-28
* [LCG] Re-organize the methods for mutating a call graph to make theirChandler Carruth2014-04-27
* [LCG] Rather than removing nodes from the SCC entry set when we processChandler Carruth2014-04-26
* [LCG] Rotate the full SCC finding algorithm to avoid round-trips throughChandler Carruth2014-04-26
* [LCG] Hoist the main DFS loop out of the edge removal function. ThisChandler Carruth2014-04-26
* [LCG] In the incremental SCC re-formation, lift the node currently beingChandler Carruth2014-04-26
* [LCG] Special case the removal of self edges. These don't impact the SCCChandler Carruth2014-04-26
* [LCG] Refactor the duplicated code I added in my last commit here intoChandler Carruth2014-04-26
* Revert "blockfreq: Approximate irreducible control flow"Duncan P. N. Exon Smith2014-04-25
* blockfreq: Approximate irreducible control flowDuncan P. N. Exon Smith2014-04-25
* blockfreq: Further shift logic to LoopDataDuncan P. N. Exon Smith2014-04-25
* SCC: Change clients to use const, NFCDuncan P. N. Exon Smith2014-04-25
* [LCG] During the incremental update of an SCC, switch to using theChandler Carruth2014-04-25
* [LCG] During the incremental re-build of an SCC after removing an edge,Chandler Carruth2014-04-25
* [LCG] Rather than doing a linear time SmallSetVector removal of eachChandler Carruth2014-04-25
* [LCG] Remove a completely unnecessary loop. It wasn't even doing anyChandler Carruth2014-04-25
* [LCG] Now that the loop structure of the core SCC finding routine isChandler Carruth2014-04-25
* blockfreq: Only one mass distribution per nodeDuncan P. N. Exon Smith2014-04-25
* blockfreq: Document assertionDuncan P. N. Exon Smith2014-04-25
* blockfreq: Document high-level functionsDuncan P. N. Exon Smith2014-04-25
* blockfreq: Scale LoopData::Scale on the way downDuncan P. N. Exon Smith2014-04-25
* blockfreq: unwrapLoopPackage() => unwrapLoop()Duncan P. N. Exon Smith2014-04-25
* blockfreq: Pass the Loop directly into unwrapLoopPackage()Duncan P. N. Exon Smith2014-04-25
* blockfreq: Unwrap from LoopsDuncan P. N. Exon Smith2014-04-25
* blockfreq: Separate unwrapLoops() from finalizeMetrics()Duncan P. N. Exon Smith2014-04-25
* blockfreq: Expose getPackagedNode()Duncan P. N. Exon Smith2014-04-25
* blockfreq: Store the header with the membersDuncan P. N. Exon Smith2014-04-25
* blockfreq: Encapsulate LoopData::HeaderDuncan P. N. Exon Smith2014-04-25
* blockfreq: Use LoopData directlyDuncan P. N. Exon Smith2014-04-25
* blockfreq: Use a std::list for LoopsDuncan P. N. Exon Smith2014-04-25
* [LCG] Switch a weird do/while loop that actually couldn't fail itsChandler Carruth2014-04-24
* [LCG] Incorporate the core trick of improvements on the naive Tarjan'sChandler Carruth2014-04-24
* [LCG] Rotate logic applied to the top of the DFSStack to instead beChandler Carruth2014-04-24
* [LCG] Switch the parent SCC tracking from a SmallSetVector toChandler Carruth2014-04-24
* [LCG] We don't actually need a set in each SCC to track the nodes. WeChandler Carruth2014-04-24
* [C++] Use 'nullptr'.Craig Topper2014-04-24
* [LCG] Normalize the post-order SCC iterator to just iterate over the SCCChandler Carruth2014-04-23
* [LCG] Switch the primary node iterator to be a *much* more normal C++Chandler Carruth2014-04-23
* [LCG] Make the insertion and query paths into the LCG which cannot failChandler Carruth2014-04-23
* [LCG] Switch the SCC lookup to be in terms of call graph nodes ratherChandler Carruth2014-04-23
* [LCG] Switch the primary SCC building code to use the negative low-linkChandler Carruth2014-04-23
generated by cgit v1.2.3 (git 2.25.1) at 2024-05-02 22:33:04 +0000