| /external/llvm/include/llvm/Analysis/ |
| H A D | CallGraph.h | 68 class CallGraphNode;
78 typedef std::map<const Function *, CallGraphNode *> FunctionMapTy;
80 /// \brief A map from \c Function* to \c CallGraphNode*.
85 CallGraphNode *Root;
89 CallGraphNode *ExternalCallingNode;
93 CallGraphNode *CallsExternalNode;
125 inline const CallGraphNode *operator[](const Function *F) const {
132 inline CallGraphNode *operator[](const Function *F) {
138 /// \brief Returns the \c CallGraphNode which is used to represent
140 CallGraphNode *getExternalCallingNod
166 class CallGraphNode { class in namespace:llvm
176 inline CallGraphNode(Function *F) : F(F), NumReferences(0) {} function in class:llvm::CallGraphNode
[all...] |
| H A D | CallGraphSCCPass.h | 29 class CallGraphNode;
85 std::vector<CallGraphNode*> Nodes;
89 void initialize(CallGraphNode*const*I, CallGraphNode*const*E) {
98 void ReplaceNode(CallGraphNode *Old, CallGraphNode *New);
100 typedef std::vector<CallGraphNode*>::const_iterator iterator;
|
| /external/clang/include/clang/Analysis/ |
| H A D | CallGraph.h | 27 class CallGraphNode;
35 friend class CallGraphNode;
37 typedef llvm::DenseMap<const Decl *, CallGraphNode *> FunctionMapTy;
43 CallGraphNode *Root;
61 CallGraphNode *getNode(const Decl *) const;
65 CallGraphNode *getOrInsertNode(Decl *);
81 CallGraphNode *getRoot() const { return Root; }
86 typedef llvm::SetVector<CallGraphNode *>::iterator nodes_iterator;
87 typedef llvm::SetVector<CallGraphNode *>::const_iterator const_nodes_iterator;
130 CallGraphNode *allocateNewNod
133 class CallGraphNode { class in namespace:clang
145 CallGraphNode(Decl *D) : FD(D) {} function in class:clang::CallGraphNode
[all...] |
| /external/llvm/lib/Analysis/IPA/ |
| H A D | CallGraph.cpp | 25 CallsExternalNode(new CallGraphNode(nullptr)) {
53 CallGraphNode *Node = getOrInsertFunction(F);
115 Function *CallGraph::removeFunctionFromModule(CallGraphNode *CGN) {
132 assert(FunctionMap.count(From) && "No CallGraphNode for function!");
134 "Pointing CallGraphNode at a function that already exists");
142 // it will insert a new CallGraphNode for the specified function if one does
144 CallGraphNode *CallGraph::getOrInsertFunction(const Function *F) {
145 CallGraphNode *&CGN = FunctionMap[F];
150 return CGN = new CallGraphNode(const_cast<Function*>(F));
154 // Implementations of the CallGraphNode clas
[all...] |
| H A D | CallPrinter.cpp | 30 std::string getNodeLabel(CallGraphNode *Node, CallGraph *Graph) {
|
| H A D | CallGraphSCCPass.cpp | 180 DenseMap<Value*, CallGraphNode*> CallSites;
196 CallGraphNode *CGN = *SCCIdx;
208 for (CallGraphNode::iterator I = CGN->begin(), E = CGN->end(); I != E; ) {
263 DenseMap<Value*, CallGraphNode*>::iterator ExistingIt =
266 CallGraphNode *ExistingNode = ExistingIt->second;
289 CallGraphNode *CalleeNode;
313 CallGraphNode *CalleeNode;
442 const std::vector<CallGraphNode *> &NodeVec = *CGI;
517 void CallGraphSCC::ReplaceNode(CallGraphNode *Old, CallGraphNode *Ne
[all...] |
| H A D | GlobalsModRef.cpp | 362 const std::vector<CallGraphNode *> &SCC = *I;
406 for (CallGraphNode::iterator CI = SCC[i]->begin(), E = SCC[i]->end();
420 CallGraphNode *CalleeNode = CG[Callee];
|
| /external/clang/lib/Analysis/ |
| H A D | CallGraph.cpp | 33 CallGraphNode *CallerNode;
36 CGBuilder(CallGraph *g, CallGraphNode *N)
57 CallGraphNode *CalleeNode = G->getOrInsertNode(D);
140 CallGraphNode *Node = getOrInsertNode(D);
148 CallGraphNode *CallGraph::getNode(const Decl *F) const {
154 CallGraphNode *CallGraph::getOrInsertNode(Decl *F) {
155 CallGraphNode *&Node = FunctionMap[F];
159 Node = new CallGraphNode(F);
174 const CallGraphNode *N = *I;
183 for (CallGraphNode
[all...] |
| /external/llvm/tools/opt/ |
| H A D | PrintSCC.cpp | 99 const std::vector<CallGraphNode*> &nextSCC = *SCCI;
101 for (std::vector<CallGraphNode*>::const_iterator I = nextSCC.begin(),
|
| /external/llvm/lib/Transforms/IPO/ |
| H A D | PruneEH.cpp | 63 SmallPtrSet<CallGraphNode *, 8> SCCNodes;
68 // looking up whether a given CallGraphNode is in this SCC.
120 CallGraphNode *CalleeNode = CG[Callee];
240 CallGraphNode *CGN = CG[BB->getParent()];
|
| H A D | ArgumentPromotion.cpp | 81 CallGraphNode *PromoteArguments(CallGraphNode *CGN);
83 CallGraphNode *DoPromotion(Function *F,
115 if (CallGraphNode *CGN = PromoteArguments(*I)) {
131 CallGraphNode *ArgPromotion::PromoteArguments(CallGraphNode *CGN) {
495 CallGraphNode *ArgPromotion::DoPromotion(Function *F,
641 CallGraphNode *NF_CGN = CG.getOrInsertFunction(NF);
766 CallGraphNode *CalleeNode = CG[Call->getParent()->getParent()];
911 CallGraphNode *CG
[all...] |
| H A D | Inliner.cpp | 604 CallGraphNode *CalleeNode = CG[Callee];
643 SmallVector<CallGraphNode*, 16> FunctionsToRemove;
648 CallGraphNode *CGN = I->second;
693 for (SmallVectorImpl<CallGraphNode *>::iterator I = FunctionsToRemove.begin(),
|
| H A D | Internalize.cpp | 136 CallGraphNode *ExternalNode = CG ? CG->getExternalCallingNode() : nullptr;
|
| /external/llvm/lib/Transforms/Utils/ |
| H A D | InlineFunction.cpp | 274 CallGraphNode *CalleeNode = CG[Callee];
275 CallGraphNode *CallerNode = CG[Caller];
279 CallGraphNode::iterator I = CalleeNode->begin(), E = CalleeNode->end();
282 CallGraphNode::CalledFunctionsVector CallCache;
|
| /external/clang/lib/StaticAnalyzer/Frontend/ |
| H A D | AnalysisConsumer.cpp | 476 CallGraphNode *N = *I;
|
| /external/owasp/sanitizer/tools/findbugs/lib/ |
| H A D | findbugs.jar | META-INF/ META-INF/MANIFEST.MF default.xsl edu/ edu/umd/ edu/umd/cs/ edu/ ... |