49 template class AllAnalysesOn<LazyCallGraph::SCC>;
50 template class AnalysisManager<LazyCallGraph::SCC, LazyCallGraph &>;
51 template class PassManager<LazyCallGraph::SCC, CGSCCAnalysisManager,
52                            LazyCallGraph &, CGSCCUpdateResult &>;
55                                          LazyCallGraph::SCC, LazyCallGraph &>;
62 PassManager<LazyCallGraph::SCC, CGSCCAnalysisManager, LazyCallGraph &,
63             CGSCCUpdateResult &>::run(LazyCallGraph::SCC &InitialC,  in run()
65                                       LazyCallGraph &G, CGSCCUpdateResult &UR) {  in run()
75   LazyCallGraph::SCC *C = &InitialC;  in run()
105       PI.runAfterPassInvalidated<LazyCallGraph::SCC>(*Pass, PassPA);  in run()
117     PI.runAfterPass<LazyCallGraph::SCC>(*Pass, *C, PassPA);  in run()
130   PA.preserveSet<AllAnalysesOn<LazyCallGraph::SCC>>();  in run()
142   LazyCallGraph &CG = AM.getResult<LazyCallGraphAnalysis>(M);  in run()
150   SmallPriorityWorklist<LazyCallGraph::RefSCC *, 1> RCWorklist;  in run()
151   SmallPriorityWorklist<LazyCallGraph::SCC *, 1> CWorklist;  in run()
155   SmallPtrSet<LazyCallGraph::SCC *, 4> InvalidSCCSet;  in run()
157   SmallDenseSet<std::pair<LazyCallGraph::Node *, LazyCallGraph::SCC *>, 4>  in run()
176   for (LazyCallGraph::RefSCC &RC :  in run()
194       LazyCallGraph::RefSCC *RC = RCWorklist.pop_back_val();  in run()
205       LazyCallGraph::SCC *LastUpdatedC = nullptr;  in run()
209       for (LazyCallGraph::SCC &C : llvm::reverse(*RC))  in run()
213         LazyCallGraph::SCC *C = CWorklist.pop_back_val();  in run()
271           if (!PI.runBeforePass<LazyCallGraph::SCC>(*Pass, *C))  in run()
296             PI.runAfterPassInvalidated<LazyCallGraph::SCC>(*Pass, PassPA);  in run()
312           PI.runAfterPass<LazyCallGraph::SCC>(*Pass, *C, PassPA);  in run()
353   PA.preserveSet<AllAnalysesOn<LazyCallGraph::SCC>>();  in run()
360 PreservedAnalyses DevirtSCCRepeatedPass::run(LazyCallGraph::SCC &InitialC,  in run()
362                                              LazyCallGraph &CG,  in run()
370   LazyCallGraph::SCC *C = &InitialC;  in run()
381   auto ScanSCC = [](LazyCallGraph::SCC &C,  in run()
387     for (LazyCallGraph::Node &N : C) {  in run()
410     if (!PI.runBeforePass<LazyCallGraph::SCC>(*Pass, *C))  in run()
420       PI.runAfterPassInvalidated<LazyCallGraph::SCC>(*Pass, PassPA);  in run()
429     PI.runAfterPass<LazyCallGraph::SCC>(*Pass, *C, PassPA);  in run()
507 PreservedAnalyses CGSCCToFunctionPassAdaptor::run(LazyCallGraph::SCC &C,  in run()
509                                                   LazyCallGraph &CG,  in run()
515   SmallVector<LazyCallGraph::Node *, 4> Nodes;  in run()
516   for (LazyCallGraph::Node &N : C)  in run()
522   LazyCallGraph::SCC *CurrentC = &C;  in run()
527   for (LazyCallGraph::Node *N : Nodes) {  in run()
611       PA.allAnalysesInSetPreserved<AllAnalysesOn<LazyCallGraph::SCC>>();  in invalidate()
668 FunctionAnalysisManagerCGSCCProxy::run(LazyCallGraph::SCC &C,  in run()
670                                        LazyCallGraph &CG) {  in run()
690     LazyCallGraph::SCC &C, const PreservedAnalyses &PA,  in invalidate()
705   if (!PAC.preserved() && !PAC.preservedSet<AllAnalysesOn<LazyCallGraph::SCC>>()) {  in invalidate()
706     for (LazyCallGraph::Node &N : C)  in invalidate()
718   for (LazyCallGraph::Node &N : C) {  in invalidate()
771 static void updateNewSCCFunctionAnalyses(LazyCallGraph::SCC &C,  in updateNewSCCFunctionAnalyses()
772                                          LazyCallGraph &G,  in updateNewSCCFunctionAnalyses()
779   for (LazyCallGraph::Node &N : C) {  in updateNewSCCFunctionAnalyses()
814 static LazyCallGraph::SCC *
815 incorporateNewSCCRange(const SCCRangeT &NewSCCRange, LazyCallGraph &G,  in incorporateNewSCCRange()
816                        LazyCallGraph::Node &N, LazyCallGraph::SCC *C,  in incorporateNewSCCRange()
818   using SCC = LazyCallGraph::SCC;  in incorporateNewSCCRange()
876 static LazyCallGraph::SCC &updateCGAndAnalysisManagerForPass(  in updateCGAndAnalysisManagerForPass()
877     LazyCallGraph &G, LazyCallGraph::SCC &InitialC, LazyCallGraph::Node &N,  in updateCGAndAnalysisManagerForPass()
880   using Node = LazyCallGraph::Node;  in updateCGAndAnalysisManagerForPass()
881   using Edge = LazyCallGraph::Edge;  in updateCGAndAnalysisManagerForPass()
882   using SCC = LazyCallGraph::SCC;  in updateCGAndAnalysisManagerForPass()
883   using RefSCC = LazyCallGraph::RefSCC;  in updateCGAndAnalysisManagerForPass()
959   LazyCallGraph::visitReferences(Worklist, Visited, VisitRef);  in updateCGAndAnalysisManagerForPass()
1178 LazyCallGraph::SCC &llvm::updateCGAndAnalysisManagerForFunctionPass(  in updateCGAndAnalysisManagerForFunctionPass()
1179     LazyCallGraph &G, LazyCallGraph::SCC &InitialC, LazyCallGraph::Node &N,  in updateCGAndAnalysisManagerForFunctionPass()
1185 LazyCallGraph::SCC &llvm::updateCGAndAnalysisManagerForCGSCCPass(  in updateCGAndAnalysisManagerForCGSCCPass()
1186     LazyCallGraph &G, LazyCallGraph::SCC &InitialC, LazyCallGraph::Node &N,  in updateCGAndAnalysisManagerForCGSCCPass()