/external/llvm/include/llvm/Transforms/Utils/ |
H A D | Cloning.h | 180 : CG(cg), ACT(ACT) {} 182 /// CG - If non-null, InlineFunction will update the callgraph to reflect the 184 CallGraph *CG; member in class:llvm::InlineFunctionInfo 192 /// inlined from the callee. This is only filled in if CG is non-null.
|
/external/llvm/tools/opt/ |
H A D | PrintSCC.cpp | 94 CallGraph &CG = getAnalysis<CallGraphWrapperPass>().getCallGraph(); local 97 for (scc_iterator<CallGraph*> SCCI = scc_begin(&CG); !SCCI.isAtEnd();
|
/external/swiftshader/third_party/LLVM/include/llvm/Transforms/Utils/ |
H A D | Cloning.h | 176 : CG(cg), TD(td) {} 178 /// CG - If non-null, InlineFunction will update the callgraph to reflect the 180 CallGraph *CG; member in class:llvm::InlineFunctionInfo 188 /// inlined from the callee. This is only filled in if CG is non-null.
|
/external/swiftshader/third_party/LLVM/include/llvm/ |
H A D | CallGraphSCCPass.h | 44 virtual bool doInitialization(CallGraph &CG) { argument 60 virtual bool doFinalization(CallGraph &CG) { argument
|
/external/swiftshader/third_party/LLVM/lib/Transforms/IPO/ |
H A D | InlineAlways.cpp | 56 virtual bool doFinalization(CallGraph &CG) { argument 57 return removeDeadFunctions(CG, &NeverInline); 59 virtual bool doInitialization(CallGraph &CG); 77 bool AlwaysInliner::doInitialization(CallGraph &CG) { argument 80 Module &M = CG.getModule();
|
H A D | Internalize.cpp | 104 CallGraph *CG = getAnalysisIfAvailable<CallGraph>(); local 105 CallGraphNode *ExternalNode = CG ? CG->getExternalCallingNode() : 0; 135 if (ExternalNode) ExternalNode->removeOneAbstractEdgeTo((*CG)[I]);
|
H A D | InlineSimple.cpp | 56 virtual bool doInitialization(CallGraph &CG); 78 bool SimpleInliner::doInitialization(CallGraph &CG) { argument 81 Module &M = CG.getModule();
|
H A D | PruneEH.cpp | 63 CallGraph &CG = getAnalysis<CallGraph>(); local 120 CallGraphNode *CalleeNode = CG[Callee]; 236 CallGraph &CG = getAnalysis<CallGraph>(); local 238 CallGraphNode *CGN = CG[BB->getParent()];
|
H A D | Inliner.cpp | 331 CallGraph &CG = getAnalysis<CallGraph>(); local 391 InlineFunctionInfo InlineInfo(&CG, TD); 415 CG[Caller]->removeCallEdgeFor(CS); 474 CG[Callee]->getNumReferences() == 0) { 477 CallGraphNode *CalleeNode = CG[Callee]; 485 delete CG.removeFunctionFromModule(CalleeNode); 511 bool Inliner::doFinalization(CallGraph &CG) { argument 512 return removeDeadFunctions(CG); 517 bool Inliner::removeDeadFunctions(CallGraph &CG, argument 523 for (CallGraph::iterator I = CG [all...] |
/external/autotest/client/tests/cgroup/ |
H A D | cgroup.py | 7 from cgroup_common import Cgroup as CG namespace 95 item = CG('memory', self._client) 342 item = CG('cpuset', self._client)
|
/external/llvm/include/llvm/Analysis/ |
H A D | CallGraphSCCPass.h | 49 virtual bool doInitialization(CallGraph &CG) { argument 65 virtual bool doFinalization(CallGraph &CG) { argument 90 const CallGraph &CG; // The call graph for this SCC. member in class:llvm::CallGraphSCC 95 CallGraphSCC(CallGraph &cg, void *context) : CG(cg), Context(context) {} 112 const CallGraph &getCallGraph() { return CG; }
|
H A D | CGSCCPassManager.h | 98 LazyCallGraph &CG = AM.getResult<LazyCallGraphAnalysis>(M); local 101 for (LazyCallGraph::RefSCC &RC : CG.postorder_ref_sccs()) { 114 // pass updated the CG, particularly some child of the current SCC, and
|
H A D | CallGraph.h | 466 static nodes_iterator nodes_begin(CallGraph *CG) { argument 467 return map_iterator(CG->begin(), DerefFun(CGdereference)); 469 static nodes_iterator nodes_end(CallGraph *CG) { argument 470 return map_iterator(CG->end(), DerefFun(CGdereference)); 489 static nodes_iterator nodes_begin(const CallGraph *CG) { argument 490 return map_iterator(CG->begin(), DerefFun(CGdereference)); 492 static nodes_iterator nodes_end(const CallGraph *CG) { argument 493 return map_iterator(CG->end(), DerefFun(CGdereference));
|
/external/llvm/lib/Transforms/IPO/ |
H A D | Internalize.cpp | 153 bool InternalizePass::internalizeModule(Module &M, CallGraph *CG) { argument 155 CallGraphNode *ExternalNode = CG ? CG->getExternalCallingNode() : nullptr; 192 ExternalNode->removeOneAbstractEdgeTo((*CG)[&I]); 272 CallGraph *CG = CGPass ? &CGPass->getCallGraph() : nullptr; variable 273 return internalizeModule(M, MustPreserveGV, CG);
|
H A D | PruneEH.cpp | 52 static bool SimplifyFunction(Function *F, CallGraph &CG); 53 static void DeleteBasicBlock(BasicBlock *BB, CallGraph &CG); 64 static bool runImpl(CallGraphSCC &SCC, CallGraph &CG) { argument 77 MadeChange |= SimplifyFunction(F, CG); 132 CallGraphNode *CalleeNode = CG[Callee]; 175 MadeChange |= SimplifyFunction(F, CG); 185 CallGraph &CG = getAnalysis<CallGraphWrapperPass>().getCallGraph(); 186 return runImpl(SCC, CG); 193 static bool SimplifyFunction(Function *F, CallGraph &CG) { argument 203 DeleteBasicBlock(UnwindBlock, CG); // Delet 235 DeleteBasicBlock(BasicBlock *BB, CallGraph &CG) argument [all...] |
H A D | Inliner.cpp | 377 CallGraph &CG = getAnalysis<CallGraphWrapperPass>().getCallGraph(); local 379 PSI = getAnalysis<ProfileSummaryInfoWrapperPass>().getPSI(CG.getModule()); 440 InlineFunctionInfo InlineInfo(&CG, ACT); 465 CG[Caller]->removeCallEdgeFor(CS); 535 CG[Callee]->getNumReferences() == 0) { 538 CallGraphNode *CalleeNode = CG[Callee]; 544 delete CG.removeFunctionFromModule(CalleeNode); 570 bool Inliner::doFinalization(CallGraph &CG) { argument 571 return removeDeadFunctions(CG); 575 bool Inliner::removeDeadFunctions(CallGraph &CG, boo argument [all...] |
/external/clang/lib/Analysis/ |
H A D | CallGraph.cpp | 217 const CallGraph *CG) { 218 if (CG->getRoot() == Node) { 216 getNodeLabel(const CallGraphNode *Node, const CallGraph *CG) argument
|
/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/clang/lib/StaticAnalyzer/Checkers/ |
H A D | DebugCheckers.cpp | 127 CallGraph CG; local 128 CG.addToCallGraph(const_cast<TranslationUnitDecl*>(TU)); 129 CG.viewGraph(); 147 CallGraph CG; local 148 CG.addToCallGraph(const_cast<TranslationUnitDecl*>(TU)); 149 CG.dump();
|
/external/llvm/lib/Analysis/ |
H A D | CallGraphSCCPass.cpp | 60 bool doInitialization(CallGraph &CG); 61 bool doFinalization(CallGraph &CG); 97 bool RunAllPassesOnSCC(CallGraphSCC &CurSCC, CallGraph &CG, 101 CallGraph &CG, bool &CallGraphUpToDate, 103 bool RefreshCallGraph(CallGraphSCC &CurSCC, CallGraph &CG, 113 CallGraph &CG, bool &CallGraphUpToDate, 121 DevirtualizedCall |= RefreshCallGraph(CurSCC, CG, false); 134 RefreshCallGraph(CurSCC, CG, true); 179 CallGraph &CG, bool CheckingMode) { 302 CalleeNode = CG 178 RefreshCallGraph(CallGraphSCC &CurSCC, CallGraph &CG, bool CheckingMode) argument 381 RunAllPassesOnSCC(CallGraphSCC &CurSCC, CallGraph &CG, bool &DevirtualizedCall) argument 442 CallGraph &CG = getAnalysis<CallGraphWrapperPass>().getCallGraph(); local 492 doInitialization(CallGraph &CG) argument 507 doFinalization(CallGraph &CG) argument [all...] |
H A D | GlobalsModRef.cpp | 448 void GlobalsAAResult::CollectSCCMembership(CallGraph &CG) { argument 452 for (scc_iterator<CallGraph *> I = scc_begin(&CG); !I.isAtEnd(); ++I) { 467 void GlobalsAAResult::AnalyzeCallGraph(CallGraph &CG, Module &M) { argument 470 for (scc_iterator<CallGraph *> I = scc_begin(&CG); !I.isAtEnd(); ++I) { 523 CallGraphNode *CalleeNode = CG[Callee]; 925 CallGraph &CG) { 929 Result.CollectSCCMembership(CG); 934 // Propagate on CG. 935 Result.AnalyzeCallGraph(CG, M); 924 analyzeModule(Module &M, const TargetLibraryInfo &TLI, CallGraph &CG) argument
|
/external/spirv-llvm/lib/SPIRV/ |
H A D | SPIRVLowerOCLBlocks.cpp | 341 auto CG = &getAnalysis<CallGraphWrapperPass>().getCallGraph(); local 344 //InlineFunctionInfo IFI(CG, M->getDataLayout(), AA, ACT); 345 InlineFunctionInfo IFI(CG, ACT); 427 auto &CG = getAnalysis<CallGraphWrapperPass>().getCallGraph(); local 428 CG.removeFunctionFromModule(new CallGraphNode(F));
|
/external/swiftshader/third_party/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
|
/external/swiftshader/third_party/LLVM/lib/Analysis/IPA/ |
H A D | CallGraphSCCPass.cpp | 54 bool doInitialization(CallGraph &CG); 55 bool doFinalization(CallGraph &CG); 91 bool RunAllPassesOnSCC(CallGraphSCC &CurSCC, CallGraph &CG, 95 CallGraph &CG, bool &CallGraphUpToDate, 97 bool RefreshCallGraph(CallGraphSCC &CurSCC, CallGraph &CG, 107 CallGraph &CG, bool &CallGraphUpToDate, 115 DevirtualizedCall |= RefreshCallGraph(CurSCC, CG, false); 128 RefreshCallGraph(CurSCC, CG, true); 171 CallGraph &CG, bool CheckingMode) { 281 CalleeNode = CG 170 RefreshCallGraph(CallGraphSCC &CurSCC, CallGraph &CG, bool CheckingMode) argument 361 RunAllPassesOnSCC(CallGraphSCC &CurSCC, CallGraph &CG, bool &DevirtualizedCall) argument 422 CallGraph &CG = getAnalysis<CallGraph>(); local 472 doInitialization(CallGraph &CG) argument 487 doFinalization(CallGraph &CG) argument [all...] |
H A D | GlobalsModRef.cpp | 99 AnalyzeCallGraph(getAnalysis<CallGraph>(), M); // Propagate on CG 179 void AnalyzeCallGraph(CallGraph &CG, Module &M); 369 void GlobalsModRef::AnalyzeCallGraph(CallGraph &CG, Module &M) { argument 372 for (scc_iterator<CallGraph*> I = scc_begin(&CG), E = scc_end(&CG); I != E; 434 CallGraphNode *CalleeNode = CG[Callee];
|