| /external/llvm/lib/Analysis/ |
| CallGraphSCCPass.cpp | 146 for (CallGraphNode *CGN : CurSCC) {
147 if (Function *F = CGN->getFunction()) {
184 for (CallGraphNode *CGN : CurSCC)
185 CGN->dump();
195 CallGraphNode *CGN = *SCCIdx;
196 Function *F = CGN->getFunction();
200 // CGN with those actually in the function.
207 for (CallGraphNode::iterator I = CGN->begin(), E = CGN->end(); I != E; ) {
237 CGN->removeCallEdge(I)
[all...] |
| /external/swiftshader/third_party/LLVM/include/llvm/Analysis/ |
| CallGraph.h | 128 /// other functions (ie, there are no edges in it's CGN). The easiest way to
131 Function *removeFunctionFromModule(CallGraphNode *CGN);
315 static NodeType *getEntryNode(CallGraphNode *CGN) { return CGN; }
336 static NodeType *getEntryNode(const CallGraphNode *CGN) { return CGN; }
342 static NodeType *getEntryNode(CallGraph *CGN) {
343 return CGN->getExternalCallingNode(); // Start at the external node!
364 static NodeType *getEntryNode(const CallGraph *CGN) {
365 return CGN->getExternalCallingNode()
[all...] |
| /external/llvm/include/llvm/Analysis/ |
| CallGraph.h | 158 /// functions (ie, there are no edges in it's CGN). The easiest way to do
160 Function *removeFunctionFromModule(CallGraphNode *CGN);
380 /// functions (ie, there are no edges in it's CGN). The easiest way to do
382 Function *removeFunctionFromModule(CallGraphNode *CGN) {
383 return G->removeFunctionFromModule(CGN);
418 static NodeType *getEntryNode(CallGraphNode *CGN) { return CGN; }
439 static NodeType *getEntryNode(const CallGraphNode *CGN) { return CGN; }
456 static NodeType *getEntryNode(CallGraph *CGN) {
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Analysis/ |
| CallGraph.h | 158 /// functions (ie, there are no edges in it's CGN). The easiest way to do
160 Function *removeFunctionFromModule(CallGraphNode *CGN);
380 /// functions (ie, there are no edges in it's CGN). The easiest way to do
382 Function *removeFunctionFromModule(CallGraphNode *CGN) {
383 return G->removeFunctionFromModule(CGN);
416 static NodeRef getEntryNode(CallGraphNode *CGN) { return CGN; }
436 static NodeRef getEntryNode(const CallGraphNode *CGN) { return CGN; }
453 static NodeRef getEntryNode(CallGraph *CGN) {
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4393122/include/llvm/Analysis/ |
| CallGraph.h | 148 /// functions (ie, there are no edges in it's CGN). The easiest way to do
150 Function *removeFunctionFromModule(CallGraphNode *CGN);
370 /// functions (ie, there are no edges in it's CGN). The easiest way to do
372 Function *removeFunctionFromModule(CallGraphNode *CGN) {
373 return G->removeFunctionFromModule(CGN);
406 static NodeRef getEntryNode(CallGraphNode *CGN) { return CGN; }
426 static NodeRef getEntryNode(const CallGraphNode *CGN) { return CGN; }
443 static NodeRef getEntryNode(CallGraph *CGN) {
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4479392/include/llvm/Analysis/ |
| CallGraph.h | 148 /// functions (ie, there are no edges in it's CGN). The easiest way to do
150 Function *removeFunctionFromModule(CallGraphNode *CGN);
370 /// functions (ie, there are no edges in it's CGN). The easiest way to do
372 Function *removeFunctionFromModule(CallGraphNode *CGN) {
373 return G->removeFunctionFromModule(CGN);
406 static NodeRef getEntryNode(CallGraphNode *CGN) { return CGN; }
426 static NodeRef getEntryNode(const CallGraphNode *CGN) { return CGN; }
443 static NodeRef getEntryNode(CallGraph *CGN) {
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4579689/include/llvm/Analysis/ |
| CallGraph.h | 152 /// functions (ie, there are no edges in it's CGN). The easiest way to do
154 Function *removeFunctionFromModule(CallGraphNode *CGN);
376 /// functions (ie, there are no edges in it's CGN). The easiest way to do
378 Function *removeFunctionFromModule(CallGraphNode *CGN) {
379 return G->removeFunctionFromModule(CGN);
411 static NodeRef getEntryNode(CallGraphNode *CGN) { return CGN; }
430 static NodeRef getEntryNode(const CallGraphNode *CGN) { return CGN; }
450 static NodeRef getEntryNode(CallGraph *CGN) {
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4630689/include/llvm/Analysis/ |
| CallGraph.h | 152 /// functions (ie, there are no edges in it's CGN). The easiest way to do
154 Function *removeFunctionFromModule(CallGraphNode *CGN);
376 /// functions (ie, there are no edges in it's CGN). The easiest way to do
378 Function *removeFunctionFromModule(CallGraphNode *CGN) {
379 return G->removeFunctionFromModule(CGN);
411 static NodeRef getEntryNode(CallGraphNode *CGN) { return CGN; }
430 static NodeRef getEntryNode(const CallGraphNode *CGN) { return CGN; }
450 static NodeRef getEntryNode(CallGraph *CGN) {
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4639204/include/llvm/Analysis/ |
| CallGraph.h | 152 /// functions (ie, there are no edges in it's CGN). The easiest way to do
154 Function *removeFunctionFromModule(CallGraphNode *CGN);
376 /// functions (ie, there are no edges in it's CGN). The easiest way to do
378 Function *removeFunctionFromModule(CallGraphNode *CGN) {
379 return G->removeFunctionFromModule(CGN);
411 static NodeRef getEntryNode(CallGraphNode *CGN) { return CGN; }
430 static NodeRef getEntryNode(const CallGraphNode *CGN) { return CGN; }
450 static NodeRef getEntryNode(CallGraph *CGN) {
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4691093/include/llvm/Analysis/ |
| CallGraph.h | 152 /// functions (ie, there are no edges in it's CGN). The easiest way to do
154 Function *removeFunctionFromModule(CallGraphNode *CGN);
376 /// functions (ie, there are no edges in it's CGN). The easiest way to do
378 Function *removeFunctionFromModule(CallGraphNode *CGN) {
379 return G->removeFunctionFromModule(CGN);
411 static NodeRef getEntryNode(CallGraphNode *CGN) { return CGN; }
430 static NodeRef getEntryNode(const CallGraphNode *CGN) { return CGN; }
450 static NodeRef getEntryNode(CallGraph *CGN) {
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Analysis/ |
| CallGraph.h | 158 /// functions (ie, there are no edges in it's CGN). The easiest way to do
160 Function *removeFunctionFromModule(CallGraphNode *CGN);
380 /// functions (ie, there are no edges in it's CGN). The easiest way to do
382 Function *removeFunctionFromModule(CallGraphNode *CGN) {
383 return G->removeFunctionFromModule(CGN);
416 static NodeRef getEntryNode(CallGraphNode *CGN) { return CGN; }
436 static NodeRef getEntryNode(const CallGraphNode *CGN) { return CGN; }
453 static NodeRef getEntryNode(CallGraph *CGN) {
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4393122/include/llvm/Analysis/ |
| CallGraph.h | 148 /// functions (ie, there are no edges in it's CGN). The easiest way to do
150 Function *removeFunctionFromModule(CallGraphNode *CGN);
370 /// functions (ie, there are no edges in it's CGN). The easiest way to do
372 Function *removeFunctionFromModule(CallGraphNode *CGN) {
373 return G->removeFunctionFromModule(CGN);
406 static NodeRef getEntryNode(CallGraphNode *CGN) { return CGN; }
426 static NodeRef getEntryNode(const CallGraphNode *CGN) { return CGN; }
443 static NodeRef getEntryNode(CallGraph *CGN) {
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4479392/include/llvm/Analysis/ |
| CallGraph.h | 148 /// functions (ie, there are no edges in it's CGN). The easiest way to do
150 Function *removeFunctionFromModule(CallGraphNode *CGN);
370 /// functions (ie, there are no edges in it's CGN). The easiest way to do
372 Function *removeFunctionFromModule(CallGraphNode *CGN) {
373 return G->removeFunctionFromModule(CGN);
406 static NodeRef getEntryNode(CallGraphNode *CGN) { return CGN; }
426 static NodeRef getEntryNode(const CallGraphNode *CGN) { return CGN; }
443 static NodeRef getEntryNode(CallGraph *CGN) {
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4579689/include/llvm/Analysis/ |
| CallGraph.h | 152 /// functions (ie, there are no edges in it's CGN). The easiest way to do
154 Function *removeFunctionFromModule(CallGraphNode *CGN);
376 /// functions (ie, there are no edges in it's CGN). The easiest way to do
378 Function *removeFunctionFromModule(CallGraphNode *CGN) {
379 return G->removeFunctionFromModule(CGN);
411 static NodeRef getEntryNode(CallGraphNode *CGN) { return CGN; }
430 static NodeRef getEntryNode(const CallGraphNode *CGN) { return CGN; }
450 static NodeRef getEntryNode(CallGraph *CGN) {
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4630689/include/llvm/Analysis/ |
| CallGraph.h | 152 /// functions (ie, there are no edges in it's CGN). The easiest way to do
154 Function *removeFunctionFromModule(CallGraphNode *CGN);
376 /// functions (ie, there are no edges in it's CGN). The easiest way to do
378 Function *removeFunctionFromModule(CallGraphNode *CGN) {
379 return G->removeFunctionFromModule(CGN);
411 static NodeRef getEntryNode(CallGraphNode *CGN) { return CGN; }
430 static NodeRef getEntryNode(const CallGraphNode *CGN) { return CGN; }
450 static NodeRef getEntryNode(CallGraph *CGN) {
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4639204/include/llvm/Analysis/ |
| CallGraph.h | 152 /// functions (ie, there are no edges in it's CGN). The easiest way to do
154 Function *removeFunctionFromModule(CallGraphNode *CGN);
376 /// functions (ie, there are no edges in it's CGN). The easiest way to do
378 Function *removeFunctionFromModule(CallGraphNode *CGN) {
379 return G->removeFunctionFromModule(CGN);
411 static NodeRef getEntryNode(CallGraphNode *CGN) { return CGN; }
430 static NodeRef getEntryNode(const CallGraphNode *CGN) { return CGN; }
450 static NodeRef getEntryNode(CallGraph *CGN) {
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4691093/include/llvm/Analysis/ |
| CallGraph.h | 152 /// functions (ie, there are no edges in it's CGN). The easiest way to do
154 Function *removeFunctionFromModule(CallGraphNode *CGN);
376 /// functions (ie, there are no edges in it's CGN). The easiest way to do
378 Function *removeFunctionFromModule(CallGraphNode *CGN) {
379 return G->removeFunctionFromModule(CGN);
411 static NodeRef getEntryNode(CallGraphNode *CGN) { return CGN; }
430 static NodeRef getEntryNode(const CallGraphNode *CGN) { return CGN; }
450 static NodeRef getEntryNode(CallGraph *CGN) {
[all...] |
| /external/clang/include/clang/Analysis/ |
| CallGraph.h | 178 static NodeType *getEntryNode(clang::CallGraphNode *CGN) { return CGN; }
194 static NodeType *getEntryNode(const clang::CallGraphNode *CGN) { return CGN; }
202 static NodeType *getEntryNode(clang::CallGraph *CGN) {
203 return CGN->getRoot(); // Start at the external node!
227 static NodeType *getEntryNode(const clang::CallGraph *CGN) {
228 return CGN->getRoot();
|
| /external/swiftshader/third_party/LLVM/lib/Analysis/IPA/ |
| CallGraph.cpp | 219 // functions (ie, there are no edges in it's CGN). The easiest way to do this
222 Function *CallGraph::removeFunctionFromModule(CallGraphNode *CGN) {
223 assert(CGN->empty() && "Cannot remove function from call "
225 Function *F = CGN->getFunction(); // Get the function for the call graph node
226 delete CGN; // Delete the call graph node for this func
252 CallGraphNode *&CGN = FunctionMap[F];
253 if (CGN) return CGN;
256 return CGN = new CallGraphNode(const_cast<Function*>(F));
|
| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/clang/include/clang/Analysis/ |
| CallGraph.h | 179 static NodeType *getEntryNode(clang::CallGraphNode *CGN) { return CGN; }
191 static NodeType *getEntryNode(const clang::CallGraphNode *CGN) { return CGN; }
199 static NodeType *getEntryNode(clang::CallGraph *CGN) {
200 return CGN->getRoot(); // Start at the external node!
226 static NodeType *getEntryNode(const clang::CallGraph *CGN) {
227 return CGN->getRoot();
|
| /prebuilts/clang/host/darwin-x86/clang-4393122/include/clang/Analysis/ |
| CallGraph.h | 179 static NodeType *getEntryNode(clang::CallGraphNode *CGN) { return CGN; }
191 static NodeType *getEntryNode(const clang::CallGraphNode *CGN) { return CGN; }
199 static NodeType *getEntryNode(clang::CallGraph *CGN) {
200 return CGN->getRoot(); // Start at the external node!
226 static NodeType *getEntryNode(const clang::CallGraph *CGN) {
227 return CGN->getRoot();
|
| /prebuilts/clang/host/darwin-x86/clang-4479392/include/clang/Analysis/ |
| CallGraph.h | 179 static NodeType *getEntryNode(clang::CallGraphNode *CGN) { return CGN; }
191 static NodeType *getEntryNode(const clang::CallGraphNode *CGN) { return CGN; }
199 static NodeType *getEntryNode(clang::CallGraph *CGN) {
200 return CGN->getRoot(); // Start at the external node!
226 static NodeType *getEntryNode(const clang::CallGraph *CGN) {
227 return CGN->getRoot();
|
| /prebuilts/clang/host/darwin-x86/clang-4579689/include/clang/Analysis/ |
| CallGraph.h | 179 static NodeType *getEntryNode(clang::CallGraphNode *CGN) { return CGN; }
191 static NodeType *getEntryNode(const clang::CallGraphNode *CGN) { return CGN; }
199 static NodeType *getEntryNode(clang::CallGraph *CGN) {
200 return CGN->getRoot(); // Start at the external node!
226 static NodeType *getEntryNode(const clang::CallGraph *CGN) {
227 return CGN->getRoot();
|
| /prebuilts/clang/host/darwin-x86/clang-4630689/include/clang/Analysis/ |
| CallGraph.h | 179 static NodeType *getEntryNode(clang::CallGraphNode *CGN) { return CGN; }
191 static NodeType *getEntryNode(const clang::CallGraphNode *CGN) { return CGN; }
199 static NodeType *getEntryNode(clang::CallGraph *CGN) {
200 return CGN->getRoot(); // Start at the external node!
226 static NodeType *getEntryNode(const clang::CallGraph *CGN) {
227 return CGN->getRoot();
|
| /prebuilts/clang/host/darwin-x86/clang-4639204/include/clang/Analysis/ |
| CallGraph.h | 179 static NodeType *getEntryNode(clang::CallGraphNode *CGN) { return CGN; }
191 static NodeType *getEntryNode(const clang::CallGraphNode *CGN) { return CGN; }
199 static NodeType *getEntryNode(clang::CallGraph *CGN) {
200 return CGN->getRoot(); // Start at the external node!
226 static NodeType *getEntryNode(const clang::CallGraph *CGN) {
227 return CGN->getRoot();
|
