reference, declaration → definition definition → references, declarations, derived classes, virtual overrides reference to multiple definitions → definitions unreferenced |
941 EdgeSequence::iterator end() { return EntryEdges.end(); } 1245 static ChildIteratorType child_end(NodeRef N) { return (*N)->end(); } 1253 static ChildIteratorType child_end(NodeRef N) { return (*N)->end(); }lib/Analysis/CGSCCPassManager.cpp
505 for (Edge &E : *N) {
lib/Analysis/LazyCallGraph.cpp244 for (Edge &E : **N) 337 for (Edge &E : *N) { 358 for (Edge &E : *N) 380 for (Edge &E : *N) { 604 for (Edge &E : *N) { 1000 for (Edge &E : *N) 1025 for (Edge &E : *N) { 1216 auto E = (*N)->end(); 1233 E = ChildN->end(); 1722 [](Node &N) { return N->end(); }, 1747 for (LazyCallGraph::Edge &E : N.populate()) 1793 for (LazyCallGraph::Edge &E : N.populate()) {lib/Transforms/IPO/Inliner.cpp
1156 for (LazyCallGraph::Edge &E : *CalleeN)
unittests/Analysis/LazyCallGraphTest.cpp266 for (LazyCallGraph::Edge &E : A1.populate()) 275 EXPECT_EQ(A2->end(), std::next(A2->begin())); 278 EXPECT_EQ(A3->end(), std::next(A3->begin())); 281 for (LazyCallGraph::Edge &E : B1.populate()) 289 EXPECT_EQ(B2->end(), std::next(B2->begin())); 292 EXPECT_EQ(B3->end(), std::next(B3->begin())); 295 for (LazyCallGraph::Edge &E : C1.populate()) 303 EXPECT_EQ(C2->end(), std::next(C2->begin())); 306 EXPECT_EQ(C3->end(), std::next(C3->begin())); 310 EXPECT_EQ(D1->end(), std::next(D1->begin())); 313 EXPECT_EQ(D2->end(), std::next(D2->begin())); 316 EXPECT_EQ(D3->end(), std::next(D3->begin())); 423 EXPECT_EQ(2, std::distance(A->begin(), A->end())); 425 EXPECT_EQ(0, std::distance(B->begin(), B->end())); 430 EXPECT_EQ(1, std::distance(B->begin(), B->end())); 431 EXPECT_EQ(0, std::distance(C->begin(), C->end())); 434 EXPECT_EQ(1, std::distance(C->begin(), C->end())); 438 EXPECT_EQ(2, std::distance(C->begin(), C->end())); 443 EXPECT_EQ(1, std::distance(C->begin(), C->end())); 447 EXPECT_EQ(0, std::distance(C->begin(), C->end())); 450 EXPECT_EQ(0, std::distance(B->begin(), B->end())); 640 EXPECT_EQ(2, std::distance(A->begin(), A->end())); 642 EXPECT_EQ(3, std::distance(A->begin(), A->end())); 710 EXPECT_EQ(2, std::distance(A->begin(), A->end())); 781 ASSERT_EQ(1, std::distance(D2->begin(), D2->end())); 798 for (LazyCallGraph::Edge E : *D2) { 873 ASSERT_EQ(1, std::distance(D2->begin(), D2->end())); 890 for (LazyCallGraph::Edge E : *D2) { 972 EXPECT_NE(D->begin(), D->end()); 1046 EXPECT_NE(D->begin(), D->end()); 1119 ASSERT_EQ(1, std::distance(D2->begin(), D2->end())); 1254 EXPECT_EQ(2, std::distance(A->begin(), A->end()));