Home
last modified time | relevance | path

Searched refs:CurrentSCC (Results 1 – 2 of 2) sorted by relevance

/freebsd/contrib/llvm-project/llvm/include/llvm/ADT/
H A DSCCIterator.h82 SccTy CurrentSCC; variable
114 assert(!CurrentSCC.empty() || VisitStack.empty()); in isAtEnd()
115 return CurrentSCC.empty(); in isAtEnd()
119 return VisitStack == x.VisitStack && CurrentSCC == x.CurrentSCC;
128 assert(!CurrentSCC.empty() && "Dereferencing END SCC iterator!");
129 return CurrentSCC;
183 CurrentSCC.clear(); // Prepare to compute the next SCC in GetNextSCC()
211 CurrentSCC.push_back(SCCNodeStack.back()); in GetNextSCC()
213 nodeVisitNumbers[CurrentSCC.back()] = ~0U; in GetNextSCC()
214 } while (CurrentSCC.back() != visitingN); in GetNextSCC()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Coroutines/
H A DCoroSplit.cpp2044 auto *CurrentSCC = &C; in updateCallGraphAfterCoroutineSplit() local
2064 CurrentSCC = &updateCGAndAnalysisManagerForCGSCCPass(CG, *CurrentSCC, N, AM, in updateCallGraphAfterCoroutineSplit()
2071 CurrentSCC = &updateCGAndAnalysisManagerForFunctionPass(CG, *CurrentSCC, N, in updateCallGraphAfterCoroutineSplit()
2073 return *CurrentSCC; in updateCallGraphAfterCoroutineSplit()
2226 auto *CurrentSCC = &C; in run() local
2249 CurrentSCC = &updateCallGraphAfterCoroutineSplit( in run()
2250 *N, Shape, Clones, *CurrentSCC, CG, AM, UR, FAM); in run()
2262 UR.CWorklist.insert(CurrentSCC); in run()
2269 replaceAllPrepares(PrepareFn, CG, *CurrentSCC); in run()