/external/llvm/lib/Analysis/IPA/ |
H A D | CallGraphSCCPass.cpp | 57 bool doInitialization(CallGraph &CG); 58 bool doFinalization(CallGraph &CG); 94 bool RunAllPassesOnSCC(CallGraphSCC &CurSCC, CallGraph &CG, 98 CallGraph &CG, bool &CallGraphUpToDate, 100 bool RefreshCallGraph(CallGraphSCC &CurSCC, CallGraph &CG, 110 CallGraph &CG, bool &CallGraphUpToDate, 118 DevirtualizedCall |= RefreshCallGraph(CurSCC, CG, false); 131 RefreshCallGraph(CurSCC, CG, true); 174 CallGraph &CG, bool CheckingMode) { 286 CalleeNode = CG 173 RefreshCallGraph(CallGraphSCC &CurSCC, CallGraph &CG, bool CheckingMode) argument 366 RunAllPassesOnSCC(CallGraphSCC &CurSCC, CallGraph &CG, bool &DevirtualizedCall) argument 427 CallGraph &CG = getAnalysis<CallGraph>(); local 477 doInitialization(CallGraph &CG) argument 492 doFinalization(CallGraph &CG) argument [all...] |
H A D | GlobalsModRef.cpp | 100 AnalyzeCallGraph(getAnalysis<CallGraph>(), M); // Propagate on CG 180 void AnalyzeCallGraph(CallGraph &CG, Module &M); 363 void GlobalsModRef::AnalyzeCallGraph(CallGraph &CG, Module &M) { argument 366 for (scc_iterator<CallGraph*> I = scc_begin(&CG), E = scc_end(&CG); I != E; 428 CallGraphNode *CalleeNode = CG[Callee];
|
/external/clang/include/clang/Analysis/ |
H A D | CallGraph.h | 159 void addCallee(CallGraphNode *N, CallGraph *CG) { argument 210 static nodes_iterator nodes_begin(clang::CallGraph *CG) { argument 211 return map_iterator(CG->begin(), DerefFun(CGdereference)); 213 static nodes_iterator nodes_end (clang::CallGraph *CG) { argument 214 return map_iterator(CG->end(), DerefFun(CGdereference)); 220 static unsigned size(clang::CallGraph *CG) { argument 221 return CG->size(); 236 static nodes_iterator nodes_begin(const clang::CallGraph *CG) { argument 237 return map_iterator(CG->begin(), DerefFun(CGdereference)); 239 static nodes_iterator nodes_end(const clang::CallGraph *CG) { argument 246 size(const clang::CallGraph *CG) argument [all...] |
/external/llvm/include/llvm/Transforms/IPO/ |
H A D | InlinerPass.h | 48 virtual bool doFinalization(CallGraph &CG); 75 bool removeDeadFunctions(CallGraph &CG, bool AlwaysInlineOnly = false);
|
/external/clang/lib/StaticAnalyzer/Checkers/ |
H A D | DebugCheckers.cpp | 119 CallGraph CG; local 120 CG.addToCallGraph(const_cast<TranslationUnitDecl*>(TU)); 121 CG.viewGraph(); 139 CallGraph CG; local 140 CG.addToCallGraph(const_cast<TranslationUnitDecl*>(TU)); 141 CG.dump();
|
H A D | RetainCountChecker.cpp | 1157 // For CoreGraphics ('CG') types. 1158 if (cocoa::isRefType(RetTy, "CG", FName)) { 3195 // Handle: (CF|CG)Retain 3199 cocoa::isRefType(ResultTy, "CG", FName)) {
|
/external/llvm/include/llvm/Analysis/ |
H A D | CallGraph.h | 350 static nodes_iterator nodes_begin(CallGraph *CG) { argument 351 return map_iterator(CG->begin(), DerefFun(CGdereference)); 353 static nodes_iterator nodes_end (CallGraph *CG) { argument 354 return map_iterator(CG->end(), DerefFun(CGdereference)); 369 static nodes_iterator nodes_begin(const CallGraph *CG) { return CG->begin(); } argument 370 static nodes_iterator nodes_end (const CallGraph *CG) { return CG->end(); } argument
|
H A D | CallGraphSCCPass.h | 47 virtual bool doInitialization(CallGraph &CG) { argument 63 virtual bool doFinalization(CallGraph &CG) { argument
|
/external/llvm/lib/Transforms/IPO/ |
H A D | InlineAlways.cpp | 56 virtual bool doFinalization(CallGraph &CG) { argument 57 return removeDeadFunctions(CG, /*AlwaysInlineOnly=*/ true);
|
H A D | Inliner.cpp | 398 CallGraph &CG = getAnalysis<CallGraph>(); local 459 InlineFunctionInfo InlineInfo(&CG, TD); 483 CG[Caller]->removeCallEdgeFor(CS); 537 CG[Callee]->getNumReferences() == 0) { 540 CallGraphNode *CalleeNode = CG[Callee]; 546 delete CG.removeFunctionFromModule(CalleeNode); 572 bool Inliner::doFinalization(CallGraph &CG) { argument 573 return removeDeadFunctions(CG); 578 bool Inliner::removeDeadFunctions(CallGraph &CG, bool AlwaysInlineOnly) { argument 583 for (CallGraph::iterator I = CG [all...] |
H A D | Internalize.cpp | 113 CallGraph *CG = getAnalysisIfAvailable<CallGraph>(); local 114 CallGraphNode *ExternalNode = CG ? CG->getExternalCallingNode() : 0; 150 if (ExternalNode) ExternalNode->removeOneAbstractEdgeTo((*CG)[I]);
|
H A D | PruneEH.cpp | 63 CallGraph &CG = getAnalysis<CallGraph>(); local 119 CallGraphNode *CalleeNode = CG[Callee]; 237 CallGraph &CG = getAnalysis<CallGraph>(); local 239 CallGraphNode *CGN = CG[BB->getParent()];
|
H A D | ArgumentPromotion.cpp | 622 CallGraph &CG = getAnalysis<CallGraph>(); local 625 CallGraphNode *NF_CGN = CG.getOrInsertFunction(NF); 749 CallGraphNode *CalleeNode = CG[Call->getParent()->getParent()]; 880 NF_CGN->stealCalledFunctionsFrom(CG[F]); 885 CallGraphNode *CGN = CG[F]; 887 delete CG.removeFunctionFromModule(CGN);
|
/external/llvm/include/llvm/Transforms/Utils/ |
H A D | Cloning.h | 163 : CG(cg), TD(td) {} 165 /// CG - If non-null, InlineFunction will update the callgraph to reflect the 167 CallGraph *CG; member in class:llvm::InlineFunctionInfo 175 /// inlined from the callee. This is only filled in if CG is non-null.
|
/external/clang/lib/Analysis/ |
H A D | CallGraph.cpp | 226 const CallGraph *CG) { 227 if (CG->getRoot() == Node) { 225 getNodeLabel(const CallGraphNode *Node, const CallGraph *CG) argument
|
/external/llvm/lib/Transforms/Utils/ |
H A D | InlineFunction.cpp | 282 CallGraph &CG = *IFI.CG; local 285 CallGraphNode *CalleeNode = CG[Callee]; 286 CallGraphNode *CallerNode = CG[Caller]; 325 CallerNode->addCalledFunction(CallSite(NewCall), CG[F]); local 621 if (IFI.CG)
|
/external/clang/lib/StaticAnalyzer/Frontend/ |
H A D | AnalysisConsumer.cpp | 433 // We rely on random access to add the initially processed Decls to CG. 434 CallGraph CG; local 436 CG.addToCallGraph(LocalTUDecls[i]); 447 llvm::ReversePostOrderTraversal<clang::CallGraph*> RPOT(&CG);
|
/external/mdnsresponder/mDNSCore/ |
H A D | mDNSEmbeddedAPI.h | 1957 #define FORALL_CACHERECORDS(SLOT,CG,CR) \ 1959 for ((CG)=m->rrcache_hash[(SLOT)]; (CG); (CG)=(CG)->next) \ 1960 for ((CR) = (CG)->members; (CR); (CR)=(CR)->next)
|
/external/chromium_org/third_party/tcmalloc/chromium/src/ |
H A D | pprof | 1232 open(CG, ">$filename"); 1233 printf CG ("events: Hits\n\n"); 1249 printf CG CompressedCGName("fl", $caller_file, \%filename_to_index_map); 1250 printf CG CompressedCGName("fn", $caller_function, \%fnname_to_index_map); 1252 printf CG CompressedCGName("cfl", $callee_file, \%filename_to_index_map); 1253 printf CG CompressedCGName("cfn", $callee_function, \%fnname_to_index_map); 1254 printf CG ("calls=$count $callee_line\n"); 1256 printf CG ("$caller_line $count\n\n");
|
/external/chromium_org/third_party/tcmalloc/vendor/src/ |
H A D | pprof | 1232 open(CG, ">$filename"); 1233 printf CG ("events: Hits\n\n"); 1249 printf CG CompressedCGName("fl", $caller_file, \%filename_to_index_map); 1250 printf CG CompressedCGName("fn", $caller_function, \%fnname_to_index_map); 1252 printf CG CompressedCGName("cfl", $callee_file, \%filename_to_index_map); 1253 printf CG CompressedCGName("cfn", $callee_function, \%fnname_to_index_map); 1254 printf CG ("calls=$count $callee_line\n"); 1256 printf CG ("$caller_line $count\n\n");
|
/external/chromium_org/third_party/libjingle/source/talk/media/testdata/ |
H A D | h264-svc-99-640x360.rtpdump | 280 �,�e6��Jv=�~\��!�i�7���q���6S|��mr"�F�R剗�8���+�4�v��X`�~߈�E�[��5��7g��#�80\S�`'=E�}M��"��XԽ��o�b?�:���� =��?�l�gAF?O�@����h<�R�&�]~�m�.��Q�t� .k�^!'(*X5z b������CG�8<���Wi�*�f䣘x�RZf:�c�����hY�e���[�&�� @3�h�����CQF��k|��v^ �
�!�Rg\n/)���|�2��)�3��Ҩ��2_NI�nJ���!�?���:dd��*�Y����0��,�f
{)�E,?�j0�:�VlY�0��|�@�|���(�K������ 8�c%a��'��f�� f �̐r 8 >��� � .�� �%v� ��;1�:��� ��LLp[�?;�����Q�#�`@| ���\�GE��N������'��En�\��C�m �gL�> |