reference, declaration → definition definition → references, declarations, derived classes, virtual overrides reference to multiple definitions → definitions unreferenced |
160 Node &getNode() const;
1235 return getNode().getFunction();
lib/Analysis/CGSCCPassManager.cpp506 if (RetainedEdges.count(&E.getNode())) 509 SCC &TargetC = *G.lookupSCC(E.getNode()); 514 RC->switchTrivialInternalEdgeToRef(N, E.getNode()); 517 C = incorporateNewSCCRange(RC->switchInternalEdgeToRef(N, E.getNode()), 523 DeadTargets.push_back(&E.getNode());lib/Analysis/LazyCallGraph.cpp
245 assert(E.getNode().isPopulated() && "Can't have an unpopulated node!"); 256 if (OuterRefSCC->G->lookupSCC(E.getNode()) == &C) 278 SCC *CalleeC = G.lookupSCC(E.getNode()); 340 SCC &TargetSCC = *G->lookupSCC(E.getNode()); 359 if (G->lookupRefSCC(E.getNode()) == &RC) 381 auto *ChildRC = G->lookupRefSCC(E.getNode()); 576 if (ConnectedSet.count(G->lookupSCC(E.getNode()))) 607 SCC &EdgeC = *G->lookupSCC(E.getNode()); 785 Node &ChildN = I->getNode(); 1001 if (Set.count(G->lookupRefSCC(E.getNode()))) 1026 RefSCC &EdgeRC = *G->lookupRefSCC(E.getNode()); 1222 Node &ChildN = I->getNode(); 1686 [](EdgeSequence::call_iterator I) -> Node & { return I->getNode(); }, 1709 Roots.push_back(&E.getNode()); 1723 [](EdgeSequence::iterator I) -> Node & { return I->getNode(); },lib/Transforms/IPO/Inliner.cpp
1157 RC->insertTrivialRefEdge(N, E.getNode());
unittests/Analysis/LazyCallGraphTest.cpp236 LazyCallGraph::Node &A1 = (I++)->getNode(); 238 LazyCallGraph::Node &A2 = (I++)->getNode(); 240 LazyCallGraph::Node &A3 = (I++)->getNode(); 242 LazyCallGraph::Node &B1 = (I++)->getNode(); 244 LazyCallGraph::Node &B2 = (I++)->getNode(); 246 LazyCallGraph::Node &B3 = (I++)->getNode(); 248 LazyCallGraph::Node &C1 = (I++)->getNode(); 250 LazyCallGraph::Node &C2 = (I++)->getNode(); 252 LazyCallGraph::Node &C3 = (I++)->getNode(); 254 LazyCallGraph::Node &D1 = (I++)->getNode(); 256 LazyCallGraph::Node &D2 = (I++)->getNode(); 258 LazyCallGraph::Node &D3 = (I++)->getNode(); 435 EXPECT_EQ(&B, &C->begin()->getNode()); 439 EXPECT_EQ(&B, &C->begin()->getNode()); 440 EXPECT_EQ(&C, &std::next(C->begin())->getNode()); 444 EXPECT_EQ(&C, &C->begin()->getNode()); 646 EXPECT_EQ(&D, &NewE.getNode()); 799 if (&E.getNode() == &D3) 801 EXPECT_EQ(&C2, &E.getNode()); 891 if (&E.getNode() == &D3) 893 EXPECT_EQ(&C2, &E.getNode()); 973 EXPECT_EQ(&A, &D->begin()->getNode()); 1047 EXPECT_EQ(&A, &D->begin()->getNode()); 2088 EXPECT_EQ(&DN, &(*CN)[DN].getNode()); 2089 EXPECT_EQ(&DN, &(*BN)[DN].getNode());