/external/llvm/unittests/Analysis/ |
LazyCallGraphTest.cpp | 1 //===- LazyCallGraphTest.cpp - Unit tests for the lazy CG analysis --------===// 125 LazyCallGraph CG(*M); 130 auto I = CG.begin(); 155 EXPECT_EQ(CG.end(), I); 206 auto SCCI = CG.postorder_scc_begin(); 268 EXPECT_EQ(CG.postorder_scc_end(), SCCI); 294 LazyCallGraph CG(*M); 296 LazyCallGraph::Node &A = CG.get(lookupFunction(*M, "a")); 297 LazyCallGraph::Node &B = CG.get(lookupFunction(*M, "b")); 301 CG.insertEdge(B, lookupFunction(*M, "c")) [all...] |
CallGraphTest.cpp | 1 //=======- CallGraphTest.cpp - Unit tests for the CG analysis -------------===// 48 CallGraph CG(M); 50 canSpecializeGraphTraitsIterators(&CG); 55 CallGraph CG(M); 57 canSpecializeGraphTraitsIterators(const_cast<const CallGraph *>(&CG));
|
/external/llvm/include/llvm/Transforms/IPO/ |
InlinerPass.h | 48 bool doFinalization(CallGraph &CG) override; 75 bool removeDeadFunctions(CallGraph &CG, bool AlwaysInlineOnly = false);
|
/external/llvm/lib/Analysis/IPA/ |
CallGraphSCCPass.cpp | 35 MaxIterations("max-cg-scc-iterations", cl::ReallyHidden, cl::init(4)); 59 bool doInitialization(CallGraph &CG); 60 bool doFinalization(CallGraph &CG); 96 bool RunAllPassesOnSCC(CallGraphSCC &CurSCC, CallGraph &CG, 100 CallGraph &CG, bool &CallGraphUpToDate, 102 bool RefreshCallGraph(CallGraphSCC &CurSCC, CallGraph &CG, 112 CallGraph &CG, bool &CallGraphUpToDate, 120 DevirtualizedCall |= RefreshCallGraph(CurSCC, CG, false); 133 RefreshCallGraph(CurSCC, CG, true); 178 CallGraph &CG, bool CheckingMode) [all...] |
GlobalsModRef.cpp | 104 // Propagate on CG. 185 void AnalyzeCallGraph(CallGraph &CG, Module &M); 359 void GlobalsModRef::AnalyzeCallGraph(CallGraph &CG, Module &M) { 362 for (scc_iterator<CallGraph*> I = scc_begin(&CG); !I.isAtEnd(); ++I) { 421 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 | 124 CallGraph CG; 125 CG.addToCallGraph(const_cast<TranslationUnitDecl*>(TU)); 126 CG.viewGraph(); 144 CallGraph CG; 145 CG.addToCallGraph(const_cast<TranslationUnitDecl*>(TU)); 146 CG.dump();
|
/external/llvm/include/llvm/Analysis/ |
CallGraphSCCPass.h | 48 virtual bool doInitialization(CallGraph &CG) { 64 virtual bool doFinalization(CallGraph &CG) {
|
CallGraph.h | 450 static nodes_iterator nodes_begin(CallGraph *CG) { 451 return map_iterator(CG->begin(), DerefFun(CGdereference)); 453 static nodes_iterator nodes_end(CallGraph *CG) { 454 return map_iterator(CG->end(), DerefFun(CGdereference)); 472 static nodes_iterator nodes_begin(const CallGraph *CG) { 473 return map_iterator(CG->begin(), DerefFun(CGdereference)); 475 static nodes_iterator nodes_end(const CallGraph *CG) { 476 return map_iterator(CG->end(), DerefFun(CGdereference));
|
CGSCCPassManager.h | 226 LazyCallGraph &CG = AM->getResult<LazyCallGraphAnalysis>(M); 229 for (LazyCallGraph::SCC &C : CG.postorder_sccs()) { 238 // pass updated the CG, particularly some child of the current SCC, and
|
/external/llvm/lib/Transforms/IPO/ |
InlineAlways.cpp | 60 bool doFinalization(CallGraph &CG) override { 61 return removeDeadFunctions(CG, /*AlwaysInlineOnly=*/ true);
|
Internalize.cpp | 135 CallGraph *CG = CGPass ? &CGPass->getCallGraph() : nullptr; 136 CallGraphNode *ExternalNode = CG ? CG->getExternalCallingNode() : nullptr; 165 ExternalNode->removeOneAbstractEdgeTo((*CG)[I]);
|
Inliner.cpp | 426 CallGraph &CG = getAnalysis<CallGraphWrapperPass>().getCallGraph(); 489 InlineFunctionInfo InlineInfo(&CG, AA, ACT); 513 CG[Caller]->removeCallEdgeFor(CS); 586 CG[Callee]->getNumReferences() == 0) { 589 CallGraphNode *CalleeNode = CG[Callee]; 595 delete CG.removeFunctionFromModule(CalleeNode); 621 bool Inliner::doFinalization(CallGraph &CG) { 622 return removeDeadFunctions(CG); 626 bool Inliner::removeDeadFunctions(CallGraph &CG, bool AlwaysInlineOnly) { 631 for (CallGraph::iterator I = CG.begin(), E = CG.end(); I != E; ++I) [all...] |
PruneEH.cpp | 66 CallGraph &CG = getAnalysis<CallGraphWrapperPass>().getCallGraph(); 122 CallGraphNode *CalleeNode = CG[Callee]; 240 CallGraph &CG = getAnalysis<CallGraphWrapperPass>().getCallGraph(); 242 CallGraphNode *CGN = CG[BB->getParent()];
|
ArgumentPromotion.cpp | 89 bool doInitialization(CallGraph &CG) override; 733 CallGraph &CG = getAnalysis<CallGraphWrapperPass>().getCallGraph(); 736 CallGraphNode *NF_CGN = CG.getOrInsertFunction(NF); [all...] |
/external/llvm/tools/opt/ |
PrintSCC.cpp | 94 CallGraph &CG = getAnalysis<CallGraphWrapperPass>().getCallGraph(); 97 for (scc_iterator<CallGraph*> SCCI = scc_begin(&CG); !SCCI.isAtEnd();
|
/external/llvm/include/llvm/Transforms/Utils/ |
Cloning.h | 194 explicit InlineFunctionInfo(CallGraph *cg = nullptr, 197 : CG(cg), AA(AA), ACT(ACT) {} 199 /// CG - If non-null, InlineFunction will update the callgraph to reflect the 201 CallGraph *CG; 210 /// inlined from the callee. This is only filled in if CG is non-null.
|
/external/llvm/tools/lto/ |
lto.cpp | 80 static void lto_add_attrs(lto_code_gen_t cg) { 81 LTOCodeGenerator *CG = unwrap(cg); 90 CG->setAttr(attrs.c_str()); 95 CG->setOptLevel(OptLevel - '0'); 181 lto_code_gen_t cg) { 185 path, &unwrap(cg)->getContext())); 227 void lto_codegen_set_diagnostic_handler(lto_code_gen_t cg, 230 unwrap(cg)->setDiagnosticHandler(diag_handler, ctxt); 254 void lto_codegen_dispose(lto_code_gen_t cg) { delete unwrap(cg); [all...] |
/external/clang/lib/Analysis/ |
CallGraph.cpp | 217 const CallGraph *CG) { 218 if (CG->getRoot() == Node) {
|
/external/pdfium/fpdfsdk/src/ |
fpdfeditpage.cpp | 264 CPDF_PageContentGenerate CG(pPage); 265 CG.GenerateContent();
|
/external/clang/lib/StaticAnalyzer/Frontend/ |
AnalysisConsumer.cpp | 457 // We rely on random access to add the initially processed Decls to CG. 458 CallGraph CG; 460 CG.addToCallGraph(LocalTUDecls[i]); 471 llvm::ReversePostOrderTraversal<clang::CallGraph*> RPOT(&CG);
|
/external/llvm/lib/Transforms/Utils/ |
InlineFunction.cpp | 667 CallGraph &CG = *IFI.CG; 670 CallGraphNode *CalleeNode = CG[Callee]; 671 CallGraphNode *CallerNode = CG[Caller]; 717 CallerNode->addCalledFunction(CallSite(NewCall), CG[F]); [all...] |
/external/ceres-solver/scripts/ |
ceres-solver.spec | 43 - Line search solvers (L-BFGS and Nonlinear CG)
|
/external/llvm/lib/Target/MSP430/ |
MSP430RegisterInfo.cpp | 86 Reserved.set(MSP430::CG);
|
/external/mdnsresponder/mDNSCore/ |
mDNSEmbeddedAPI.h | 1348 union CacheEntity_union { CacheEntity *next; CacheGroup cg; CacheRecord cr; }; member in union:CacheEntity_union [all...] |