108   class SCC;  variable
196     friend class LazyCallGraph::SCC;
349   class SCC {
357     SCC(RefSCC &OuterRefSCC, NodeRangeT &&Nodes)  in SCC()  function
372     friend raw_ostream &operator<<(raw_ostream &OS, const SCC &C) {
447     SmallVector<SCC *, 4> SCCs;
450     SmallDenseMap<SCC *, int, 4> SCCIndices;
466       for (LazyCallGraph::SCC &C : RC) {
498     typedef pointee_iterator<SmallVectorImpl<SCC *>::const_iterator> iterator;
508     SCC &operator[](int Idx) { return *SCCs[Idx]; }
510     iterator find(SCC &C) const {  in find()
568     SmallVector<SCC *, 1> switchInternalEdgeToCall(Node &SourceN,
782   SCC *lookupSCC(Node &N) const { return SCCMap.lookup(&N); }  in lookupSCC()
789     if (SCC *C = lookupSCC(N))  in lookupRefSCC()
853   SpecificBumpPtrAllocator<SCC> SCCBPA;
856   DenseMap<Node *, SCC *> SCCMap;
888   template <typename... Ts> SCC *createSCC(Ts &&... Args) {  in createSCC()
889     return new (SCCBPA.Allocate()) SCC(std::forward<Ts>(Args)...);  in createSCC()