200   if (any_isa<const LazyCallGraph::SCC *>(IR)) {  in unwrapModule()
201     const LazyCallGraph::SCC *C = any_cast<const LazyCallGraph::SCC *>(IR);  in unwrapModule()
202     for (const LazyCallGraph::Node &N : *C) {  in unwrapModule()
239 void printIR(raw_ostream &OS, const LazyCallGraph::SCC *C) {  in printIR()
240   for (const LazyCallGraph::Node &N : *C) {  in printIR()
264   if (any_isa<const LazyCallGraph::SCC *>(IR)) {  in getIRName()
265     const LazyCallGraph::SCC *C = any_cast<const LazyCallGraph::SCC *>(IR);  in getIRName()
288 bool sccContainsFilterPrintFunc(const LazyCallGraph::SCC &C) {  in sccContainsFilterPrintFunc()
290                 [](const LazyCallGraph::Node &N) {  in sccContainsFilterPrintFunc()
307   if (any_isa<const LazyCallGraph::SCC *>(IR)) {  in shouldPrintIR()
308     const LazyCallGraph::SCC *C = any_cast<const LazyCallGraph::SCC *>(IR);  in shouldPrintIR()
344   if (any_isa<const LazyCallGraph::SCC *>(IR)) {  in unwrapAndPrint()
345     const LazyCallGraph::SCC *C = any_cast<const LazyCallGraph::SCC *>(IR);  in unwrapAndPrint()
384   if (any_isa<const LazyCallGraph::SCC *>(IR))  in getModuleForComparison()
385     return any_cast<const LazyCallGraph::SCC *>(IR)  in getModuleForComparison()
892     } else if (any_isa<const LazyCallGraph::SCC *>(IR)) {  in registerCallbacks()
893       int Count = any_cast<const LazyCallGraph::SCC *>(IR)->size();  in registerCallbacks()
1155                    any_isa<const LazyCallGraph::SCC *>(IR)) {  in registerCallbacks()
1157           if (any_isa<const LazyCallGraph::SCC *>(IR))  in registerCallbacks()
1158             M = any_cast<const LazyCallGraph::SCC *>(IR)  in registerCallbacks()