HomeSort by: relevance | last modified time | path
    Searched refs:CallGraphNode (Results 1 - 25 of 25) sorted by relevancy

  /src/external/apache2/llvm/dist/clang/include/clang/Analysis/
CallGraph.h 32 class CallGraphNode;
43 friend class CallGraphNode;
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; }
101 using nodes_iterator = llvm::SetVector<CallGraphNode *>::iterator;
102 using const_nodes_iterator = llvm::SetVector<CallGraphNode *>::const_iterator;
147 class CallGraphNode {
    [all...]
  /src/external/apache2/llvm/dist/llvm/include/llvm/Analysis/
CallGraph.h 64 class CallGraphNode;
77 std::map<const Function *, std::unique_ptr<CallGraphNode>>;
79 /// A map from \c Function* to \c 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) {
126 /// Returns the \c CallGraphNode which is used to represent
128 CallGraphNode *getExternalCallingNode() const { return ExternalCallingNode; }
130 CallGraphNode *getCallsExternalNode() const
    [all...]
CallGraphSCCPass.h 30 class CallGraphNode;
90 std::vector<CallGraphNode *> Nodes;
95 void initialize(ArrayRef<CallGraphNode *> NewNodes) {
104 void ReplaceNode(CallGraphNode *Old, CallGraphNode *New);
108 void DeleteNode(CallGraphNode *Old);
110 using iterator = std::vector<CallGraphNode *>::const_iterator;
  /src/external/apache2/llvm/dist/llvm/lib/Analysis/
CallGraph.cpp 35 CallsExternalNode(std::make_unique<CallGraphNode>(this, nullptr)) {
78 CallGraphNode *Node = getOrInsertFunction(F);
91 void CallGraph::populateCallGraphNode(CallGraphNode *Node) {
124 SmallVector<CallGraphNode *, 16> Nodes;
130 llvm::sort(Nodes, [](CallGraphNode *LHS, CallGraphNode *RHS) {
138 for (CallGraphNode *CN : Nodes)
146 void CallGraph::ReplaceExternalCallEdge(CallGraphNode *Old,
147 CallGraphNode *New) {
162 Function *CallGraph::removeFunctionFromModule(CallGraphNode *CGN)
    [all...]
CallPrinter.cpp 92 CallGraphNode *Node = I.second.get();
112 : public GraphTraits<const CallGraphNode *> {
118 typedef std::pair<const Function *const, std::unique_ptr<CallGraphNode>>
120 static const CallGraphNode *CGGetValuePtr(const PairTy &P) {
146 static bool isNodeHidden(const CallGraphNode *Node,
153 std::string getNodeLabel(const CallGraphNode *Node,
164 static const CallGraphNode *CGGetValuePtr(CallGraphNode::CallRecord P) {
169 typedef mapped_iterator<CallGraphNode::const_iterator,
173 std::string getEdgeAttributes(const CallGraphNode *Node, nodes_iterator I
    [all...]
CallGraphSCCPass.cpp 175 for (CallGraphNode *CGN : CurSCC) {
207 DenseMap<Value *, CallGraphNode *> Calls;
211 for (CallGraphNode *CGN
221 CallGraphNode *CGN = *SCCIdx;
232 CallGraphNode::iterator CGNEnd = CGN->end();
234 auto RemoveAndCheckForDone = [&](CallGraphNode::iterator I) {
251 for (CallGraphNode::iterator I = CGN->begin(); I != CGNEnd;) {
329 DenseMap<Value *, CallGraphNode *>::iterator ExistingIt =
332 CallGraphNode *ExistingNode = ExistingIt->second;
355 CallGraphNode *CalleeNode
    [all...]
GlobalsModRef.cpp 477 const std::vector<CallGraphNode *> &SCC = *I;
495 const std::vector<CallGraphNode *> &SCC = *I;
544 for (CallGraphNode::iterator CI = SCC[i]->begin(), E = SCC[i]->end();
553 CallGraphNode *CalleeNode = CG[Callee];
MLInlineAdvisor.cpp 81 const std::vector<CallGraphNode *> &CGNodes = *I;
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/Utils/
CallGraphUpdater.cpp 34 CallGraphNode *DeadCGN = (*CG)[DeadFn];
42 CallGraphNode *DeadCGN = CG->getOrInsertFunction(DeadFn);
89 CallGraphNode *OldCGN = CG->getOrInsertFunction(&Fn);
117 CallGraphNode *DeadCGN = (*CG)[&DeadFn];
128 CallGraphNode *OldCGN = (*CG)[&OldFn];
129 CallGraphNode *NewCGN = CG->getOrInsertFunction(&NewFn);
149 CallGraphNode *NewCalleeNode =
151 CallGraphNode *CallerNode = (*CG)[Caller];
152 if (llvm::none_of(*CallerNode, [&OldCS](const CallGraphNode::CallRecord &CR) {
166 CallGraphNode *CallerNode = (*CG)[Caller]
    [all...]
InlineFunction.cpp 1314 CallGraphNode *CalleeNode = CG[Callee];
1315 CallGraphNode *CallerNode = CG[Caller];
1319 CallGraphNode::iterator I = CalleeNode->begin(), E = CalleeNode->end();
1322 CallGraphNode::CalledFunctionsVector CallCache;
  /src/external/apache2/llvm/dist/clang/lib/Analysis/
CallGraph.cpp 48 CallGraphNode *CallerNode;
51 CGBuilder(CallGraph *g, CallGraphNode *N) : G(g), CallerNode(N) {}
71 CallGraphNode *CalleeNode = G->getOrInsertNode(D);
182 CallGraphNode *Node = getOrInsertNode(D);
197 CallGraphNode *CallGraph::getNode(const Decl *F) const {
203 CallGraphNode *CallGraph::getOrInsertNode(Decl *F) {
207 std::unique_ptr<CallGraphNode> &Node = FunctionMap[F];
211 Node = std::make_unique<CallGraphNode>(F);
226 const CallGraphNode *N = *I;
235 for (CallGraphNode::const_iterator CI = N->begin()
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/IPO/
SyntheticCountsPropagation.cpp 108 auto GetCallSiteProfCount = [&](const CallGraphNode *,
109 const CallGraphNode::CallRecord &Edge) {
130 &CG, GetCallSiteProfCount, [&](const CallGraphNode *N, Scaled64 New) {
Inliner.cpp 308 for (CallGraphNode *Node : SCC) {
326 for (CallGraphNode *Node : SCC) {
503 CallGraphNode *CalleeNode = CG[Callee];
561 SmallVector<CallGraphNode *, 16> FunctionsToRemove;
564 auto RemoveCGN = [&](CallGraphNode *CGN) {
580 CallGraphNode *CGN = I.second.get();
633 for (CallGraphNode *CGN : FunctionsToRemove) {
ArgumentPromotion.cpp 1125 for (CallGraphNode *OldNode : SCC) {
1132 CallGraphNode *NewCalleeNode =
1134 CallGraphNode *CallerNode = CG[Caller];
1146 CallGraphNode *NewNode = CG.getOrInsertFunction(NewF);
Internalize.cpp 152 CallGraphNode *ExternalNode = CG ? CG->getExternalCallingNode() : nullptr;
FunctionAttrs.cpp 1689 for (CallGraphNode *I : SCC) {
SampleProfile.cpp 1736 for (CallGraphNode *Node : *CGI) {
Attributor.cpp 2568 for (CallGraphNode *CGN : SCC)
OpenMPOpt.cpp 2584 for (CallGraphNode *CGN : CGSCC) {
  /src/external/apache2/llvm/dist/llvm/tools/opt/
PrintSCC.cpp 99 const std::vector<CallGraphNode*> &nextSCC = *SCCI;
101 for (std::vector<CallGraphNode*>::const_iterator I = nextSCC.begin(),
  /src/external/apache2/llvm/dist/llvm/lib/Target/AMDGPU/
AMDGPUAnnotateKernelFeatures.cpp 39 SmallVector<CallGraphNode*, 8> NodeList;
396 for (CallGraphNode *I : SCC) {
AMDGPUPerfHintAnalysis.cpp 371 for (CallGraphNode *I : SCC) {
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/Coroutines/
Coroutines.cpp 196 static void buildCGN(CallGraph &CG, CallGraphNode *Node) {
222 SmallVector<CallGraphNode *, 8> Nodes(SCC.begin(), SCC.end());
225 CallGraphNode *Callee = CG.getOrInsertFunction(F);
CoroSplit.cpp 1922 SmallVector<CallGraphNode *, 8> Nodes(SCC.begin(), SCC.end());
1969 CallGraphNode *PrepareUserNode = nullptr, *FnNode = nullptr;
2174 for (CallGraphNode *CGN : SCC)
  /src/external/apache2/llvm/dist/clang/lib/StaticAnalyzer/Frontend/
AnalysisConsumer.cpp 456 CallGraphNode *N = *I;

Completed in 82 milliseconds