reference, declarationdefinition
definition → references, declarations, derived classes, virtual overrides
reference to multiple definitions → definitions
unreferenced

References

include/llvm/Analysis/LazyCallGraph.h
  940   EdgeSequence::iterator begin() { return EntryEdges.begin(); }
 1244   static ChildIteratorType child_begin(NodeRef N) { return (*N)->begin(); }
 1252   static ChildIteratorType child_begin(NodeRef N) { return (*N)->begin(); }
lib/Analysis/CGSCCPassManager.cpp
  505   for (Edge &E : *N) {
lib/Analysis/LazyCallGraph.cpp
  244     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) {
 1211     DFSStack.push_back({RootN, (*RootN)->begin()});
 1232           I = ChildN->begin();
 1720         return N->begin();
 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.cpp
  266   for (LazyCallGraph::Edge &E : A1.populate())
  275   EXPECT_EQ(A2->end(), std::next(A2->begin()));
  276   EXPECT_EQ("a3", A2->begin()->getFunction().getName());
  278   EXPECT_EQ(A3->end(), std::next(A3->begin()));
  279   EXPECT_EQ("a1", A3->begin()->getFunction().getName());
  281   for (LazyCallGraph::Edge &E : B1.populate())
  289   EXPECT_EQ(B2->end(), std::next(B2->begin()));
  290   EXPECT_EQ("b3", B2->begin()->getFunction().getName());
  292   EXPECT_EQ(B3->end(), std::next(B3->begin()));
  293   EXPECT_EQ("b1", B3->begin()->getFunction().getName());
  295   for (LazyCallGraph::Edge &E : C1.populate())
  303   EXPECT_EQ(C2->end(), std::next(C2->begin()));
  304   EXPECT_EQ("c3", C2->begin()->getFunction().getName());
  306   EXPECT_EQ(C3->end(), std::next(C3->begin()));
  307   EXPECT_EQ("c1", C3->begin()->getFunction().getName());
  310   EXPECT_EQ(D1->end(), std::next(D1->begin()));
  311   EXPECT_EQ("d2", D1->begin()->getFunction().getName());
  313   EXPECT_EQ(D2->end(), std::next(D2->begin()));
  314   EXPECT_EQ("d3", D2->begin()->getFunction().getName());
  316   EXPECT_EQ(D3->end(), std::next(D3->begin()));
  317   EXPECT_EQ("d1", D3->begin()->getFunction().getName());
  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()));
  435   EXPECT_EQ(&B, &C->begin()->getNode());
  438   EXPECT_EQ(2, std::distance(C->begin(), C->end()));
  439   EXPECT_EQ(&B, &C->begin()->getNode());
  440   EXPECT_EQ(&C, &std::next(C->begin())->getNode());
  443   EXPECT_EQ(1, std::distance(C->begin(), C->end()));
  444   EXPECT_EQ(&C, &C->begin()->getNode());
  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());
  973   EXPECT_EQ(&A, &D->begin()->getNode());
 1046   EXPECT_NE(D->begin(), D->end());
 1047   EXPECT_EQ(&A, &D->begin()->getNode());
 1119   ASSERT_EQ(1, std::distance(D2->begin(), D2->end()));
 1254   EXPECT_EQ(2, std::distance(A->begin(), A->end()));