Home
last modified time | relevance | path

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

12

/freebsd-13.1/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DCallGraph.h64 class CallGraphNode; variable
84 CallGraphNode *ExternalCallingNode;
130 CallGraphNode *getCallsExternalNode() const { in getCallsExternalNode()
136 void ReplaceExternalCallEdge(CallGraphNode *Old, CallGraphNode *New);
167 class CallGraphNode {
187 CallGraphNode(const CallGraphNode &) = delete;
188 CallGraphNode &operator=(const CallGraphNode &) = delete;
190 ~CallGraphNode() { in ~CallGraphNode()
212 CallGraphNode *operator[](unsigned i) const {
421 using NodeRef = CallGraphNode *;
[all …]
H A DCallGraphSCCPass.h30 class CallGraphNode; variable
90 std::vector<CallGraphNode *> Nodes;
95 void initialize(ArrayRef<CallGraphNode *> NewNodes) { in initialize()
104 void ReplaceNode(CallGraphNode *Old, CallGraphNode *New);
108 void DeleteNode(CallGraphNode *Old);
110 using iterator = std::vector<CallGraphNode *>::const_iterator;
/freebsd-13.1/contrib/llvm-project/clang/include/clang/Analysis/
H A DCallGraph.h32 class CallGraphNode; variable
43 friend class CallGraphNode; variable
52 CallGraphNode *Root;
79 CallGraphNode *getOrInsertNode(Decl *);
147 class CallGraphNode {
150 CallGraphNode *Callee;
171 CallGraphNode(Decl *D) : FD(D) {} in CallGraphNode() function
244 using NodeType = clang::CallGraphNode;
245 using NodeRef = clang::CallGraphNode *;
269 static clang::CallGraphNode *
[all …]
/freebsd-13.1/contrib/llvm-project/llvm/lib/Analysis/
H A DCallGraph.cpp78 CallGraphNode *Node = getOrInsertFunction(F); in addToCallGraph()
124 SmallVector<CallGraphNode *, 16> Nodes; in print()
130 llvm::sort(Nodes, [](CallGraphNode *LHS, CallGraphNode *RHS) { in print()
138 for (CallGraphNode *CN : Nodes) in print()
189 void CallGraphNode::print(raw_ostream &OS) const { in print()
234 void CallGraphNode::removeAnyCallEdgeTo(CallGraphNode *Callee) { in removeAnyCallEdgeTo()
246 void CallGraphNode::removeOneAbstractEdgeTo(CallGraphNode *Callee) { in removeOneAbstractEdgeTo()
274 SmallVector<CallGraphNode *, 4u> OldCBs; in replaceCallEdge()
275 SmallVector<CallGraphNode *, 4u> NewCBs; in replaceCallEdge()
284 CallGraphNode *OldNode = OldCBs[N]; in replaceCallEdge()
[all …]
H A DCallGraphSCCPass.cpp175 for (CallGraphNode *CGN : CurSCC) { in RunPassOnSCC()
207 DenseMap<Value *, CallGraphNode *> Calls; in RefreshCallGraph()
211 for (CallGraphNode *CGN in RefreshCallGraph()
221 CallGraphNode *CGN = *SCCIdx; in RefreshCallGraph()
232 CallGraphNode::iterator CGNEnd = CGN->end(); in RefreshCallGraph()
355 CallGraphNode *CalleeNode; in RefreshCallGraph()
379 CallGraphNode *CalleeNode; in RefreshCallGraph()
420 for (CallGraphNode *CGN : CurSCC) in RefreshCallGraph()
593 void CallGraphSCC::ReplaceNode(CallGraphNode *Old, CallGraphNode *New) { in ReplaceNode()
703 for (CallGraphNode *CGN : SCC) { in runOnSCC()
[all …]
H A DCallPrinter.cpp92 CallGraphNode *Node = I.second.get(); in removeParallelEdges()
112 : public GraphTraits<const CallGraphNode *> {
118 typedef std::pair<const Function *const, std::unique_ptr<CallGraphNode>>
120 static const CallGraphNode *CGGetValuePtr(const PairTy &P) { in CGGetValuePtr()
146 static bool isNodeHidden(const CallGraphNode *Node, in isNodeHidden()
153 std::string getNodeLabel(const CallGraphNode *Node, in getNodeLabel()
164 static const CallGraphNode *CGGetValuePtr(CallGraphNode::CallRecord P) { in CGGetValuePtr()
169 typedef mapped_iterator<CallGraphNode::const_iterator,
173 std::string getEdgeAttributes(const CallGraphNode *Node, nodes_iterator I, in getEdgeAttributes()
194 std::string getNodeAttributes(const CallGraphNode *Node, in getNodeAttributes()
H A DGlobalsModRef.cpp477 const std::vector<CallGraphNode *> &SCC = *I; in CollectSCCMembership()
495 const std::vector<CallGraphNode *> &SCC = *I; in AnalyzeCallGraph()
544 for (CallGraphNode::iterator CI = SCC[i]->begin(), E = SCC[i]->end(); in AnalyzeCallGraph()
553 CallGraphNode *CalleeNode = CG[Callee]; in AnalyzeCallGraph()
H A DMLInlineAdvisor.cpp89 const std::vector<CallGraphNode *> &CGNodes = *I; in MLInlineAdvisor()
/freebsd-13.1/contrib/llvm-project/clang/lib/Analysis/
H A DCallGraph.cpp48 CallGraphNode *CallerNode;
71 CallGraphNode *CalleeNode = G->getOrInsertNode(D); in addCalledDecl()
182 CallGraphNode *Node = getOrInsertNode(D); in addNodeForDecl()
197 CallGraphNode *CallGraph::getNode(const Decl *F) const { in getNode()
203 CallGraphNode *CallGraph::getOrInsertNode(Decl *F) { in getOrInsertNode()
207 std::unique_ptr<CallGraphNode> &Node = FunctionMap[F]; in getOrInsertNode()
211 Node = std::make_unique<CallGraphNode>(F); in getOrInsertNode()
226 const CallGraphNode *N = *I; in print()
235 for (CallGraphNode::const_iterator CI = N->begin(), in print()
254 void CallGraphNode::print(raw_ostream &os) const { in print()
[all …]
/freebsd-13.1/contrib/llvm-project/llvm/lib/Transforms/Utils/
H A DCallGraphUpdater.cpp34 CallGraphNode *DeadCGN = (*CG)[DeadFn]; in finalize()
42 CallGraphNode *DeadCGN = CG->getOrInsertFunction(DeadFn); in finalize()
89 CallGraphNode *OldCGN = CG->getOrInsertFunction(&Fn); in reanalyzeFunction()
117 CallGraphNode *DeadCGN = (*CG)[&DeadFn]; in removeFunction()
128 CallGraphNode *OldCGN = (*CG)[&OldFn]; in replaceFunctionWith()
129 CallGraphNode *NewCGN = CG->getOrInsertFunction(&NewFn); in replaceFunctionWith()
149 CallGraphNode *NewCalleeNode = in replaceCallSite()
151 CallGraphNode *CallerNode = (*CG)[Caller]; in replaceCallSite()
152 if (llvm::none_of(*CallerNode, [&OldCS](const CallGraphNode::CallRecord &CR) { in replaceCallSite()
166 CallGraphNode *CallerNode = (*CG)[Caller]; in removeCallSite()
H A DInlineFunction.cpp1315 CallGraphNode *CalleeNode = CG[Callee]; in UpdateCallGraphAfterInlining()
1316 CallGraphNode *CallerNode = CG[Caller]; in UpdateCallGraphAfterInlining()
1320 CallGraphNode::iterator I = CalleeNode->begin(), E = CalleeNode->end(); in UpdateCallGraphAfterInlining()
1323 CallGraphNode::CalledFunctionsVector CallCache; in UpdateCallGraphAfterInlining()
/freebsd-13.1/contrib/llvm-project/llvm/lib/Transforms/IPO/
H A DSyntheticCountsPropagation.cpp108 auto GetCallSiteProfCount = [&](const CallGraphNode *, in run()
109 const CallGraphNode::CallRecord &Edge) { in run()
130 &CG, GetCallSiteProfCount, [&](const CallGraphNode *N, Scaled64 New) { in run() argument
H A DInliner.cpp312 for (CallGraphNode *Node : SCC) { in inlineCallsImpl()
330 for (CallGraphNode *Node : SCC) { in inlineCallsImpl()
507 CallGraphNode *CalleeNode = CG[Callee]; in inlineCallsImpl()
565 SmallVector<CallGraphNode *, 16> FunctionsToRemove; in removeDeadFunctions()
568 auto RemoveCGN = [&](CallGraphNode *CGN) { in removeDeadFunctions()
584 CallGraphNode *CGN = I.second.get(); in removeDeadFunctions()
637 for (CallGraphNode *CGN : FunctionsToRemove) { in removeDeadFunctions()
H A DArgumentPromotion.cpp1124 for (CallGraphNode *OldNode : SCC) { in runOnSCC()
1131 CallGraphNode *NewCalleeNode = in runOnSCC()
1133 CallGraphNode *CallerNode = CG[Caller]; in runOnSCC()
1145 CallGraphNode *NewNode = CG.getOrInsertFunction(NewF); in runOnSCC()
H A DInternalize.cpp175 CallGraphNode *ExternalNode = CG ? CG->getExternalCallingNode() : nullptr; in internalizeModule()
H A DFunctionAttrs.cpp1689 for (CallGraphNode *I : SCC) { in runImpl()
H A DSampleProfile.cpp1740 for (CallGraphNode *Node : *CGI) { in buildFunctionOrder()
/freebsd-13.1/contrib/llvm-project/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-13.1/contrib/llvm-project/llvm/lib/Target/AMDGPU/Utils/
H A DAMDGPULDSUtils.cpp32 SmallPtrSet<CallGraphNode *, 8> AddressTakenFunctions;
63 SmallVector<CallGraphNode *, 8> CGNStack(df_begin(KCGN), df_end(KCGN)); in collectReachableCallees()
64 SmallPtrSet<CallGraphNode *, 8> VisitedCGNodes; in collectReachableCallees()
/freebsd-13.1/contrib/llvm-project/llvm/lib/Target/AMDGPU/
H A DAMDGPUAnnotateKernelFeatures.cpp39 SmallVector<CallGraphNode*, 8> NodeList;
396 for (CallGraphNode *I : SCC) { in runOnSCC()
H A DAMDGPUPerfHintAnalysis.cpp374 for (CallGraphNode *I : SCC) { in runOnSCC()
H A DAMDGPUResourceUsageAnalysis.cpp100 for (CallGraphNode *I : SCC) { in runOnSCC()
/freebsd-13.1/contrib/llvm-project/llvm/lib/Transforms/Coroutines/
H A DCoroutines.cpp196 static void buildCGN(CallGraph &CG, CallGraphNode *Node) { in buildCGN()
222 SmallVector<CallGraphNode *, 8> Nodes(SCC.begin(), SCC.end()); in updateCallGraph()
225 CallGraphNode *Callee = CG.getOrInsertFunction(F); in updateCallGraph()
H A DCoroSplit.cpp1963 SmallVector<CallGraphNode *, 8> Nodes(SCC.begin(), SCC.end()); in createDevirtTriggerFunc()
2010 CallGraphNode *PrepareUserNode = nullptr, *FnNode = nullptr; in replacePrepare()
2208 for (CallGraphNode *CGN : SCC) in runOnSCC()
/freebsd-13.1/contrib/llvm-project/clang/lib/StaticAnalyzer/Frontend/
H A DAnalysisConsumer.cpp468 CallGraphNode *N = *I; in HandleDeclsCallGraph()

12