Home
last modified time | relevance | path

Searched refs:CallGraphNode (Results 1 – 21 of 21) sorted by relevance

/freebsd-12.1/contrib/llvm/include/llvm/Analysis/
H A DCallGraph.h65 class CallGraphNode; variable
85 CallGraphNode *ExternalCallingNode;
139 CallGraphNode *getCallsExternalNode() const { in getCallsExternalNode()
165 class CallGraphNode {
175 inline CallGraphNode(Function *F) : F(F) {} in CallGraphNode() function
177 CallGraphNode(const CallGraphNode &) = delete;
178 CallGraphNode &operator=(const CallGraphNode &) = delete;
180 ~CallGraphNode() { in ~CallGraphNode()
202 CallGraphNode *operator[](unsigned i) const {
408 using NodeRef = CallGraphNode *;
[all …]
H A DCallGraphSCCPass.h31 class CallGraphNode; variable
91 std::vector<CallGraphNode *> Nodes;
96 void initialize(ArrayRef<CallGraphNode *> NewNodes) { in initialize()
105 void ReplaceNode(CallGraphNode *Old, CallGraphNode *New);
107 using iterator = std::vector<CallGraphNode *>::const_iterator;
/freebsd-12.1/contrib/llvm/tools/clang/include/clang/Analysis/
H A DCallGraph.h32 class CallGraphNode; variable
43 friend class CallGraphNode; variable
52 CallGraphNode *Root;
74 CallGraphNode *getOrInsertNode(Decl *);
144 class CallGraphNode {
146 using CallRecord = CallGraphNode *;
156 CallGraphNode(Decl *D) : FD(D) {} in CallGraphNode() function
170 void addCallee(CallGraphNode *N) { in addCallee()
186 using NodeType = clang::CallGraphNode;
211 static clang::CallGraphNode *
[all …]
/freebsd-12.1/contrib/llvm/lib/Analysis/
H A DCallGraph.cpp34 CallsExternalNode(llvm::make_unique<CallGraphNode>(nullptr)) { in CallGraph()
62 CallGraphNode *Node = getOrInsertFunction(F); in addToCallGraph()
94 SmallVector<CallGraphNode *, 16> Nodes; in print()
100 llvm::sort(Nodes, [](CallGraphNode *LHS, CallGraphNode *RHS) { in print()
108 for (CallGraphNode *CN : Nodes) in print()
149 CallGraphNode *CallGraph::getOrInsertFunction(const Function *F) { in getOrInsertFunction()
163 void CallGraphNode::print(raw_ostream &OS) const { in print()
188 void CallGraphNode::removeCallEdgeFor(CallSite CS) { in removeCallEdgeFor()
203 void CallGraphNode::removeAnyCallEdgeTo(CallGraphNode *Callee) { in removeAnyCallEdgeTo()
215 void CallGraphNode::removeOneAbstractEdgeTo(CallGraphNode *Callee) { in removeOneAbstractEdgeTo()
[all …]
H A DCallGraphSCCPass.cpp173 for (CallGraphNode *CGN : CurSCC) { in RunPassOnSCC()
205 DenseMap<Value*, CallGraphNode*> CallSites; in RefreshCallGraph()
209 for (CallGraphNode *CGN in RefreshCallGraph()
219 CallGraphNode *CGN = *SCCIdx; in RefreshCallGraph()
301 CallGraphNode *ExistingNode = ExistingIt->second; in RefreshCallGraph()
324 CallGraphNode *CalleeNode; in RefreshCallGraph()
348 CallGraphNode *CalleeNode; in RefreshCallGraph()
389 for (CallGraphNode *CGN : CurSCC) in RefreshCallGraph()
475 const std::vector<CallGraphNode *> &NodeVec = *CGI; in runOnModule()
548 void CallGraphSCC::ReplaceNode(CallGraphNode *Old, CallGraphNode *New) { in ReplaceNode()
[all …]
H A DCallPrinter.cpp30 std::string getNodeLabel(CallGraphNode *Node, CallGraph *Graph) { in getNodeLabel()
H A DGlobalsModRef.cpp472 const std::vector<CallGraphNode *> &SCC = *I; in CollectSCCMembership()
490 const std::vector<CallGraphNode *> &SCC = *I; in AnalyzeCallGraph()
536 for (CallGraphNode::iterator CI = SCC[i]->begin(), E = SCC[i]->end(); in AnalyzeCallGraph()
545 CallGraphNode *CalleeNode = CG[Callee]; in AnalyzeCallGraph()
/freebsd-12.1/contrib/llvm/tools/clang/lib/Analysis/
H A DCallGraph.cpp49 CallGraphNode *CallerNode;
72 CallGraphNode *CalleeNode = G->getOrInsertNode(D); in addCalledDecl()
148 CallGraphNode *Node = getOrInsertNode(D); in addNodeForDecl()
156 CallGraphNode *CallGraph::getNode(const Decl *F) const { in getNode()
162 CallGraphNode *CallGraph::getOrInsertNode(Decl *F) { in getOrInsertNode()
166 std::unique_ptr<CallGraphNode> &Node = FunctionMap[F]; in getOrInsertNode()
170 Node = llvm::make_unique<CallGraphNode>(F); in getOrInsertNode()
185 const CallGraphNode *N = *I; in print()
194 for (CallGraphNode::const_iterator CI = N->begin(), in print()
213 void CallGraphNode::print(raw_ostream &os) const { in print()
[all …]
/freebsd-12.1/contrib/llvm/lib/Transforms/IPO/
H A DPruneEH.cpp64 SmallPtrSet<CallGraphNode *, 8> SCCNodes; in runImpl()
69 for (CallGraphNode *I : SCC) in runImpl()
74 for (CallGraphNode *I : SCC) in runImpl()
128 CallGraphNode *CalleeNode = CG[Callee]; in runImpl()
152 for (CallGraphNode *I : SCC) { in runImpl()
166 for (CallGraphNode *I : SCC) { in runImpl()
236 CallGraphNode *CGN = CG[BB->getParent()]; in DeleteBasicBlock()
H A DSyntheticCountsPropagation.cpp109 auto GetCallSiteProfCount = [&](const CallGraphNode *, in run()
110 const CallGraphNode::CallRecord &Edge) { in run()
132 &CG, GetCallSiteProfCount, [&](const CallGraphNode *N, Scaled64 New) { in run() argument
H A DInliner.cpp538 for (CallGraphNode *Node : SCC) { in inlineCallsImpl()
556 for (CallGraphNode *Node : SCC) { in inlineCallsImpl()
727 CallGraphNode *CalleeNode = CG[Callee]; in inlineCallsImpl()
782 SmallVector<CallGraphNode *, 16> FunctionsToRemove; in removeDeadFunctions()
785 auto RemoveCGN = [&](CallGraphNode *CGN) { in removeDeadFunctions()
801 CallGraphNode *CGN = I.second.get(); in removeDeadFunctions()
854 for (CallGraphNode *CGN : FunctionsToRemove) { in removeDeadFunctions()
H A DArgumentPromotion.cpp1094 for (CallGraphNode *OldNode : SCC) { in runOnSCC()
1101 CallGraphNode *NewCalleeNode = in runOnSCC()
1103 CallGraphNode *CallerNode = CG[Caller]; in runOnSCC()
1114 CallGraphNode *NewNode = CG.getOrInsertFunction(NewF); in runOnSCC()
H A DInternalize.cpp155 CallGraphNode *ExternalNode = CG ? CG->getExternalCallingNode() : nullptr; in internalizeModule()
H A DFunctionAttrs.cpp1442 for (CallGraphNode *I : SCC) { in runImpl()
/freebsd-12.1/contrib/llvm/tools/opt/
H A DPrintSCC.cpp99 const std::vector<CallGraphNode*> &nextSCC = *SCCI; in runOnModule()
101 for (std::vector<CallGraphNode*>::const_iterator I = nextSCC.begin(), in runOnModule()
/freebsd-12.1/contrib/llvm/lib/Transforms/Coroutines/
H A DCoroutines.cpp175 static void buildCGN(CallGraph &CG, CallGraphNode *Node) { in buildCGN()
201 SmallVector<CallGraphNode *, 8> Nodes(SCC.begin(), SCC.end()); in updateCallGraph()
204 CallGraphNode *Callee = CG.getOrInsertFunction(F); in updateCallGraph()
H A DCoroSplit.cpp874 SmallVector<CallGraphNode *, 8> Nodes(SCC.begin(), SCC.end()); in createDevirtTriggerFunc()
907 for (CallGraphNode *CGN : SCC) in runOnSCC()
/freebsd-12.1/contrib/llvm/lib/IR/
H A DOptBisect.cpp80 for (CallGraphNode *CGN : SCC) { in getDescription()
/freebsd-12.1/contrib/llvm/lib/Target/AMDGPU/
H A DAMDGPUAnnotateKernelFeatures.cpp300 for (CallGraphNode *I : SCC) { in runOnSCC()
/freebsd-12.1/contrib/llvm/lib/Transforms/Utils/
H A DInlineFunction.cpp1194 CallGraphNode *CalleeNode = CG[Callee]; in UpdateCallGraphAfterInlining()
1195 CallGraphNode *CallerNode = CG[Caller]; in UpdateCallGraphAfterInlining()
1199 CallGraphNode::iterator I = CalleeNode->begin(), E = CalleeNode->end(); in UpdateCallGraphAfterInlining()
1202 CallGraphNode::CalledFunctionsVector CallCache; in UpdateCallGraphAfterInlining()
/freebsd-12.1/contrib/llvm/tools/clang/lib/StaticAnalyzer/Frontend/
H A DAnalysisConsumer.cpp492 CallGraphNode *N = *I; in HandleDeclsCallGraph()