/netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/Analysis/ |
H A D | CallGraph.h | 64 class CallGraphNode; variable 77 std::map<const Function *, std::unique_ptr<CallGraphNode>>; 84 CallGraphNode *ExternalCallingNode; 88 std::unique_ptr<CallGraphNode> CallsExternalNode; 113 inline const CallGraphNode *operator[](const Function *F) const { 120 inline CallGraphNode *operator[](const Function *F) { 128 CallGraphNode *getExternalCallingNode() const { return ExternalCallingNode; } in getExternalCallingNode() 130 CallGraphNode *getCallsExternalNode() const { in getCallsExternalNode() 136 void ReplaceExternalCallEdge(CallGraphNode *Old, CallGraphNode *New); 149 Function *removeFunctionFromModule(CallGraphNode *CGN); [all …]
|
H A D | CallGraphSCCPass.h | 30 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;
|
/netbsd-src/external/apache2/llvm/dist/clang/include/clang/Analysis/ |
H A D | CallGraph.h | 32 class CallGraphNode; variable 43 friend class CallGraphNode; variable 46 llvm::DenseMap<const Decl *, std::unique_ptr<CallGraphNode>>; 52 CallGraphNode *Root; 75 CallGraphNode *getNode(const Decl *) const; 79 CallGraphNode *getOrInsertNode(Decl *); 96 CallGraphNode *getRoot() const { return Root; } in getRoot() 101 using nodes_iterator = llvm::SetVector<CallGraphNode *>::iterator; 102 using const_nodes_iterator = llvm::SetVector<CallGraphNode *>::const_iterator; 147 class CallGraphNode { [all …]
|
/netbsd-src/external/apache2/llvm/dist/llvm/lib/Analysis/ |
H A D | CallGraph.cpp | 35 CallsExternalNode(std::make_unique<CallGraphNode>(this, nullptr)) { in CallGraph() 78 CallGraphNode *Node = getOrInsertFunction(F); in addToCallGraph() 91 void CallGraph::populateCallGraphNode(CallGraphNode *Node) { in populateCallGraphNode() 124 SmallVector<CallGraphNode *, 16> Nodes; in print() 130 llvm::sort(Nodes, [](CallGraphNode *LHS, CallGraphNode *RHS) { in print() 138 for (CallGraphNode *CN : Nodes) in print() 146 void CallGraph::ReplaceExternalCallEdge(CallGraphNode *Old, in ReplaceExternalCallEdge() 147 CallGraphNode *New) { in ReplaceExternalCallEdge() 162 Function *CallGraph::removeFunctionFromModule(CallGraphNode *CGN) { in removeFunctionFromModule() 175 CallGraphNode *CallGraph::getOrInsertFunction(const Function *F) { in getOrInsertFunction() [all …]
|
H A D | CallGraphSCCPass.cpp | 175 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() 234 auto RemoveAndCheckForDone = [&](CallGraphNode::iterator I) { in RefreshCallGraph() 251 for (CallGraphNode::iterator I = CGN->begin(); I != CGNEnd;) { in RefreshCallGraph() 329 DenseMap<Value *, CallGraphNode *>::iterator ExistingIt = in RefreshCallGraph() 332 CallGraphNode *ExistingNode = ExistingIt->second; in RefreshCallGraph() 355 CallGraphNode *CalleeNode; in RefreshCallGraph() [all …]
|
H A D | CallPrinter.cpp | 92 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 D | GlobalsModRef.cpp | 477 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 D | MLInlineAdvisor.cpp | 81 const std::vector<CallGraphNode *> &CGNodes = *I; in MLInlineAdvisor()
|
/netbsd-src/external/apache2/llvm/dist/clang/lib/Analysis/ |
H A D | CallGraph.cpp | 48 CallGraphNode *CallerNode; 51 CGBuilder(CallGraph *g, CallGraphNode *N) : G(g), CallerNode(N) {} in CGBuilder() 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() [all …]
|
/netbsd-src/external/apache2/llvm/dist/llvm/lib/Transforms/Utils/ |
H A D | CallGraphUpdater.cpp | 34 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 D | InlineFunction.cpp | 1314 CallGraphNode *CalleeNode = CG[Callee]; in UpdateCallGraphAfterInlining() 1315 CallGraphNode *CallerNode = CG[Caller]; in UpdateCallGraphAfterInlining() 1319 CallGraphNode::iterator I = CalleeNode->begin(), E = CalleeNode->end(); in UpdateCallGraphAfterInlining() 1322 CallGraphNode::CalledFunctionsVector CallCache; in UpdateCallGraphAfterInlining()
|
/netbsd-src/external/apache2/llvm/dist/llvm/lib/Transforms/IPO/ |
H A D | SyntheticCountsPropagation.cpp | 108 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 D | Inliner.cpp | 308 for (CallGraphNode *Node : SCC) { in inlineCallsImpl() 326 for (CallGraphNode *Node : SCC) { in inlineCallsImpl() 503 CallGraphNode *CalleeNode = CG[Callee]; in inlineCallsImpl() 561 SmallVector<CallGraphNode *, 16> FunctionsToRemove; in removeDeadFunctions() 564 auto RemoveCGN = [&](CallGraphNode *CGN) { in removeDeadFunctions() 580 CallGraphNode *CGN = I.second.get(); in removeDeadFunctions() 633 for (CallGraphNode *CGN : FunctionsToRemove) { in removeDeadFunctions()
|
H A D | ArgumentPromotion.cpp | 1125 for (CallGraphNode *OldNode : SCC) { in runOnSCC() 1132 CallGraphNode *NewCalleeNode = in runOnSCC() 1134 CallGraphNode *CallerNode = CG[Caller]; in runOnSCC() 1146 CallGraphNode *NewNode = CG.getOrInsertFunction(NewF); in runOnSCC()
|
H A D | Internalize.cpp | 152 CallGraphNode *ExternalNode = CG ? CG->getExternalCallingNode() : nullptr; in internalizeModule()
|
H A D | FunctionAttrs.cpp | 1689 for (CallGraphNode *I : SCC) { in runImpl()
|
H A D | SampleProfile.cpp | 1736 for (CallGraphNode *Node : *CGI) { in buildFunctionOrder()
|
H A D | OpenMPOpt.cpp | 2584 for (CallGraphNode *CGN : CGSCC) { in runOnSCC()
|
H A D | Attributor.cpp | 2568 for (CallGraphNode *CGN : SCC) in runOnSCC()
|
/netbsd-src/external/apache2/llvm/dist/llvm/tools/opt/ |
H A D | PrintSCC.cpp | 99 const std::vector<CallGraphNode*> &nextSCC = *SCCI; in runOnModule() 101 for (std::vector<CallGraphNode*>::const_iterator I = nextSCC.begin(), in runOnModule()
|
/netbsd-src/external/apache2/llvm/dist/llvm/lib/Target/AMDGPU/ |
H A D | AMDGPUAnnotateKernelFeatures.cpp | 39 SmallVector<CallGraphNode*, 8> NodeList; 396 for (CallGraphNode *I : SCC) { in runOnSCC()
|
H A D | AMDGPUPerfHintAnalysis.cpp | 371 for (CallGraphNode *I : SCC) { in runOnSCC()
|
/netbsd-src/external/apache2/llvm/dist/llvm/lib/Transforms/Coroutines/ |
H A D | Coroutines.cpp | 196 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 D | CoroSplit.cpp | 1922 SmallVector<CallGraphNode *, 8> Nodes(SCC.begin(), SCC.end()); in createDevirtTriggerFunc() 1969 CallGraphNode *PrepareUserNode = nullptr, *FnNode = nullptr; in replacePrepare() 2174 for (CallGraphNode *CGN : SCC) in runOnSCC()
|
/netbsd-src/external/apache2/llvm/dist/clang/lib/StaticAnalyzer/Frontend/ |
H A D | AnalysisConsumer.cpp | 456 CallGraphNode *N = *I; in HandleDeclsCallGraph()
|