From 5a6277a2306791a62b264f1b6a05000c07053aec Mon Sep 17 00:00:00 2001 From: "Duncan P. N. Exon Smith" Date: Fri, 25 Apr 2014 18:18:46 +0000 Subject: [PATCH] SCC: Doxygen-ize comments, NFC git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@207251 91177308-0d34-0410-b5e6-96231b3b80d8 --- include/llvm/ADT/SCCIterator.h | 26 +++++++++++++------------- 1 file changed, 13 insertions(+), 13 deletions(-) diff --git a/include/llvm/ADT/SCCIterator.h b/include/llvm/ADT/SCCIterator.h index 9273cbedb58..86bef96168d 100644 --- a/include/llvm/ADT/SCCIterator.h +++ b/include/llvm/ADT/SCCIterator.h @@ -47,7 +47,7 @@ class scc_iterator typedef typename super::reference reference; typedef typename super::pointer pointer; - // Element of VisitStack during DFS. + /// Element of VisitStack during DFS. struct StackElement { NodeType *Node; ///< The current node pointer. ChildItTy NextChild; ///< The next child, modified inplace during DFS. @@ -63,30 +63,30 @@ class scc_iterator } }; - // The visit counters used to detect when a complete SCC is on the stack. - // visitNum is the global counter. - // nodeVisitNumbers are per-node visit numbers, also used as DFS flags. + /// The visit counters used to detect when a complete SCC is on the stack. + /// visitNum is the global counter. + /// + /// nodeVisitNumbers are per-node visit numbers, also used as DFS flags. unsigned visitNum; DenseMap nodeVisitNumbers; - // Stack holding nodes of the SCC. + /// Stack holding nodes of the SCC. std::vector SCCNodeStack; - // The current SCC, retrieved using operator*(). + /// The current SCC, retrieved using operator*(). SccTy CurrentSCC; - - // DFS stack, Used to maintain the ordering. The top contains the current - // node, the next child to visit, and the minimum uplink value of all child + /// DFS stack, Used to maintain the ordering. The top contains the current + /// node, the next child to visit, and the minimum uplink value of all child std::vector VisitStack; - // A single "visit" within the non-recursive DFS traversal. + /// A single "visit" within the non-recursive DFS traversal. void DFSVisitOne(NodeType *N); - // The stack-based DFS traversal; defined below. + /// The stack-based DFS traversal; defined below. void DFSVisitChildren(); - // Compute the next SCC using the DFS traversal. + /// Compute the next SCC using the DFS traversal. void GetNextSCC(); scc_iterator(NodeType *entryN) : visitNum(0) { @@ -94,7 +94,7 @@ class scc_iterator GetNextSCC(); } - // End is when the DFS stack is empty. + /// End is when the DFS stack is empty. scc_iterator() {} public: -- 2.34.1