/external/llvm/include/llvm/Transforms/IPO/ |
InlinerPass.h | 48 virtual bool doFinalization(CallGraph &CG); 75 bool removeDeadFunctions(CallGraph &CG, bool AlwaysInlineOnly = false);
|
/external/llvm/lib/Analysis/IPA/ |
CallGraphSCCPass.cpp | 33 MaxIterations("max-cg-scc-iterations", cl::ReallyHidden, cl::init(4)); 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) [all...] |
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) { 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/ |
CallGraph.h | 159 void addCallee(CallGraphNode *N, CallGraph *CG) { 210 static nodes_iterator nodes_begin(clang::CallGraph *CG) { 211 return map_iterator(CG->begin(), DerefFun(CGdereference)); 213 static nodes_iterator nodes_end (clang::CallGraph *CG) { 214 return map_iterator(CG->end(), DerefFun(CGdereference)); 220 static unsigned size(clang::CallGraph *CG) { 221 return CG->size(); 236 static nodes_iterator nodes_begin(const clang::CallGraph *CG) { 237 return map_iterator(CG->begin(), DerefFun(CGdereference)); 239 static nodes_iterator nodes_end(const clang::CallGraph *CG) { [all...] |
/external/clang/lib/StaticAnalyzer/Checkers/ |
DebugCheckers.cpp | 119 CallGraph CG; 120 CG.addToCallGraph(const_cast<TranslationUnitDecl*>(TU)); 121 CG.viewGraph(); 139 CallGraph CG; 140 CG.addToCallGraph(const_cast<TranslationUnitDecl*>(TU)); 141 CG.dump();
|
RetainCountChecker.cpp | [all...] |
/external/llvm/include/llvm/Analysis/ |
CallGraph.h | 350 static nodes_iterator nodes_begin(CallGraph *CG) { 351 return map_iterator(CG->begin(), DerefFun(CGdereference)); 353 static nodes_iterator nodes_end (CallGraph *CG) { 354 return map_iterator(CG->end(), DerefFun(CGdereference)); 369 static nodes_iterator nodes_begin(const CallGraph *CG) { return CG->begin(); } 370 static nodes_iterator nodes_end (const CallGraph *CG) { return CG->end(); }
|
CallGraphSCCPass.h | 47 virtual bool doInitialization(CallGraph &CG) { 63 virtual bool doFinalization(CallGraph &CG) {
|
/external/llvm/lib/Transforms/IPO/ |
InlineAlways.cpp | 56 virtual bool doFinalization(CallGraph &CG) { 57 return removeDeadFunctions(CG, /*AlwaysInlineOnly=*/ true);
|
Inliner.cpp | 398 CallGraph &CG = getAnalysis<CallGraph>(); 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) { 573 return removeDeadFunctions(CG); 578 bool Inliner::removeDeadFunctions(CallGraph &CG, bool AlwaysInlineOnly) { 583 for (CallGraph::iterator I = CG.begin(), E = CG.end(); I != E; ++I) [all...] |
Internalize.cpp | 113 CallGraph *CG = getAnalysisIfAvailable<CallGraph>(); 114 CallGraphNode *ExternalNode = CG ? CG->getExternalCallingNode() : 0; 150 if (ExternalNode) ExternalNode->removeOneAbstractEdgeTo((*CG)[I]);
|
PruneEH.cpp | 63 CallGraph &CG = getAnalysis<CallGraph>(); 119 CallGraphNode *CalleeNode = CG[Callee]; 237 CallGraph &CG = getAnalysis<CallGraph>(); 239 CallGraphNode *CGN = CG[BB->getParent()];
|
ArgumentPromotion.cpp | 622 CallGraph &CG = getAnalysis<CallGraph>(); 625 CallGraphNode *NF_CGN = CG.getOrInsertFunction(NF); 749 CallGraphNode *CalleeNode = CG[Call->getParent()->getParent()]; [all...] |
/external/llvm/include/llvm/Transforms/Utils/ |
Cloning.h | 162 explicit InlineFunctionInfo(CallGraph *cg = 0, const DataLayout *td = 0) 163 : CG(cg), TD(td) {} 165 /// CG - If non-null, InlineFunction will update the callgraph to reflect the 167 CallGraph *CG; 175 /// inlined from the callee. This is only filled in if CG is non-null.
|
/external/clang/lib/Analysis/ |
CallGraph.cpp | 226 const CallGraph *CG) { 227 if (CG->getRoot() == Node) {
|
/external/llvm/lib/Transforms/Utils/ |
InlineFunction.cpp | 282 CallGraph &CG = *IFI.CG; 285 CallGraphNode *CalleeNode = CG[Callee]; 286 CallGraphNode *CallerNode = CG[Caller]; 325 CallerNode->addCalledFunction(CallSite(NewCall), CG[F]); 621 if (IFI.CG) [all...] |
/external/clang/lib/StaticAnalyzer/Frontend/ |
AnalysisConsumer.cpp | 433 // We rely on random access to add the initially processed Decls to CG. 434 CallGraph CG; 436 CG.addToCallGraph(LocalTUDecls[i]); 447 llvm::ReversePostOrderTraversal<clang::CallGraph*> RPOT(&CG);
|
/external/mdnsresponder/mDNSCore/ |
mDNSEmbeddedAPI.h | 1348 union CacheEntity_union { CacheEntity *next; CacheGroup cg; CacheRecord cr; }; member in union:CacheEntity_union [all...] |
/external/chromium_org/third_party/tcmalloc/chromium/src/ |
pprof | [all...] |
/external/chromium_org/third_party/tcmalloc/vendor/src/ |
pprof | [all...] |
/external/chromium_org/third_party/libjingle/source/talk/media/testdata/ |
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?> |