Lines Matching defs:LazyCallGraph
1 //===- LazyCallGraph.cpp - Analysis of a Module's call graph --------------===//
10 #include "llvm/Analysis/LazyCallGraph.h"
25 SmallVectorImpl<PointerUnion<Function *, LazyCallGraph::Node *>> &Callees,
56 LazyCallGraph::Node::Node(LazyCallGraph &G, Function &F)
78 void LazyCallGraph::Node::insertEdgeInternal(Function &Callee) {
86 void LazyCallGraph::Node::insertEdgeInternal(Node &CalleeN) {
91 void LazyCallGraph::Node::removeEdgeInternal(Function &Callee) {
100 LazyCallGraph::LazyCallGraph(Module &M) : NextDFSNumber(0) {
133 LazyCallGraph::LazyCallGraph(LazyCallGraph &&G)
144 LazyCallGraph &LazyCallGraph::operator=(LazyCallGraph &&G) {
159 void LazyCallGraph::SCC::insert(Node &N) {
165 bool LazyCallGraph::SCC::isDescendantOf(const SCC &C) const {
180 void LazyCallGraph::SCC::insertIntraSCCEdge(Node &CallerN, Node &CalleeN) {
190 void LazyCallGraph::SCC::insertOutgoingEdge(Node &CallerN, Node &CalleeN) {
205 SmallVector<LazyCallGraph::SCC *, 1>
206 LazyCallGraph::SCC::insertIncomingEdge(Node &CallerN, Node &CalleeN) {
324 void LazyCallGraph::SCC::removeInterSCCEdge(Node &CallerN, Node &CalleeN) {
377 void LazyCallGraph::SCC::internalDFS(
456 SmallVector<LazyCallGraph::SCC *, 1>
457 LazyCallGraph::SCC::removeIntraSCCEdge(Node &CallerN,
531 void LazyCallGraph::insertEdge(Node &CallerN, Function &Callee) {
538 void LazyCallGraph::removeEdge(Node &CallerN, Function &Callee) {
545 LazyCallGraph::Node &LazyCallGraph::insertInto(Function &F, Node *&MappedN) {
549 void LazyCallGraph::updateGraphPtrs() {
580 LazyCallGraph::SCC *LazyCallGraph::formSCC(Node *RootN,
614 LazyCallGraph::SCC *LazyCallGraph::getNextSCCInPostOrder() {
687 static void printNodes(raw_ostream &OS, LazyCallGraph::Node &N,
688 SmallPtrSetImpl<LazyCallGraph::Node *> &Printed) {
690 for (LazyCallGraph::Node &ChildN : N)
695 for (LazyCallGraph::iterator I = N.begin(), E = N.end(); I != E; ++I)
701 static void printSCC(raw_ostream &OS, LazyCallGraph::SCC &SCC) {
705 for (LazyCallGraph::Node *N : SCC)
713 LazyCallGraph &G = AM->getResult<LazyCallGraphAnalysis>(M);
718 SmallPtrSet<LazyCallGraph::Node *, 16> Printed;
719 for (LazyCallGraph::Node &N : G)
723 for (LazyCallGraph::SCC &SCC : G.postorder_sccs())
