From b0015735153741b6f0978127976002fda9503a3c Mon Sep 17 00:00:00 2001 From: Chandler Carruth Date: Wed, 23 Apr 2014 06:09:03 +0000 Subject: [LCG] Hoist the logic for forming a new SCC from the top of the DFSStack into a helper function. I plan to re-use it for doing incremental DFS-based updates to the SCCs when we mutate the call graph. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@206948 91177308-0d34-0410-b5e6-96231b3b80d8 --- include/llvm/Analysis/LazyCallGraph.h | 5 +++++ 1 file changed, 5 insertions(+) (limited to 'include/llvm') diff --git a/include/llvm/Analysis/LazyCallGraph.h b/include/llvm/Analysis/LazyCallGraph.h index 60f4955ae9..26eac3180d 100644 --- a/include/llvm/Analysis/LazyCallGraph.h +++ b/include/llvm/Analysis/LazyCallGraph.h @@ -364,6 +364,11 @@ private: /// \brief Helper to update pointers back to the graph object during moves. void updateGraphPtrs(); + /// \brief Helper to form a new SCC out of the top of a DFSStack-like + /// structure. + SCC *formSCCFromDFSStack( + SmallVectorImpl> &DFSStack); + /// \brief Retrieve the next node in the post-order SCC walk of the call graph. SCC *getNextSCCInPostOrder(); }; -- cgit v1.2.3