reference, declaration → definition definition → references, declarations, derived classes, virtual overrides reference to multiple definitions → definitions unreferenced |
578 for (LazyCallGraph::SCC &C : RC) {
lib/Analysis/CGSCCPassManager.cpp166 for (auto &C : RC) { 629 auto InitialSCCIndex = RC->find(*C) - RC->begin(); 670 auto NewSCCIndex = RC->find(*C) - RC->begin(); 688 for (SCC &MovedC : llvm::reverse(make_range(RC->begin() + InitialSCCIndex, 689 RC->begin() + NewSCCIndex))) {lib/Analysis/LazyCallGraph.cpp
356 for (SCC &C : *this) 378 for (SCC &C : DescendantRC) 998 for (SCC &C : RC) 1023 for (SCC &C : RC) 1065 for (SCC &InnerC : *RC) { 1083 for (SCC &InnerC : *this) 1764 for (LazyCallGraph::SCC &InnerC : C)unittests/Analysis/LazyCallGraphTest.cpp
325 for (LazyCallGraph::Node &N : *D.begin()) 341 for (LazyCallGraph::Node &N : *C.begin()) 357 for (LazyCallGraph::Node &N : *B.begin()) 375 for (LazyCallGraph::Node &N : *A.begin()) 477 auto J = RC.begin(); 574 LazyCallGraph::SCC &C = *RC.begin(); 1248 EXPECT_EQ(&*RC.begin(), CG.lookupSCC(A)); 1249 EXPECT_EQ(&*RC.begin(), CG.lookupSCC(B)); 1250 EXPECT_EQ(&*RC.begin(), CG.lookupSCC(C)); 1259 EXPECT_EQ(&*RC.begin(), CG.lookupSCC(A)); 1260 EXPECT_EQ(&*RC.begin(), CG.lookupSCC(B)); 1261 EXPECT_EQ(&*RC.begin(), CG.lookupSCC(C)); 1270 auto J = RC.begin(); 1280 EXPECT_EQ(RC.begin(), NewCs.begin()); 1296 J = RC.begin(); 1366 EXPECT_EQ(1, std::distance(ARC.begin(), ARC.end())); 1432 EXPECT_EQ(1, std::distance(BRC.begin(), BRC.end())); 1480 LazyCallGraph::SCC &C = *RC.begin(); 1481 EXPECT_EQ(RC.end(), std::next(RC.begin())); 1558 LazyCallGraph::SCC &AC = *RC.begin(); 1590 EXPECT_EQ(RC.begin(), J); 1609 EXPECT_EQ(RC.begin(), J);usr/include/c++/7.4.0/bits/range_access.h
48 begin(_Container& __cont) -> decltype(__cont.begin()) 49 { return __cont.begin(); } 58 begin(const _Container& __cont) -> decltype(__cont.begin())