Searched refs:CG (Results 1 - 25 of 30) sorted by relevance

12

/external/llvm/unittests/Analysis/
H A DLazyCallGraphTest.cpp1 //===- 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
[all...]
/external/llvm/lib/Analysis/IPA/
H A DCallGraphSCCPass.cpp59 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);
179 CallGraph &CG, bool CheckingMode) {
291 CalleeNode = CG
178 RefreshCallGraph(CallGraphSCC &CurSCC, CallGraph &CG, bool CheckingMode) argument
371 RunAllPassesOnSCC(CallGraphSCC &CurSCC, CallGraph &CG, bool &DevirtualizedCall) argument
432 CallGraph &CG = getAnalysis<CallGraphWrapperPass>().getCallGraph(); local
482 doInitialization(CallGraph &CG) argument
497 doFinalization(CallGraph &CG) argument
[all...]
H A DGlobalsModRef.cpp104 // Propagate on CG.
185 void AnalyzeCallGraph(CallGraph &CG, Module &M);
358 void GlobalsModRef::AnalyzeCallGraph(CallGraph &CG, Module &M) { argument
361 for (scc_iterator<CallGraph*> I = scc_begin(&CG); !I.isAtEnd(); ++I) {
420 CallGraphNode *CalleeNode = CG[Callee];
/external/clang/include/clang/Analysis/
H A DCallGraph.h159 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 DInlinerPass.h48 bool doFinalization(CallGraph &CG) override;
75 bool removeDeadFunctions(CallGraph &CG, bool AlwaysInlineOnly = false);
/external/clang/lib/StaticAnalyzer/Checkers/
H A DDebugCheckers.cpp124 CallGraph CG; local
125 CG.addToCallGraph(const_cast<TranslationUnitDecl*>(TU));
126 CG.viewGraph();
144 CallGraph CG; local
145 CG.addToCallGraph(const_cast<TranslationUnitDecl*>(TU));
146 CG.dump();
/external/llvm/include/llvm/Analysis/
H A DCallGraphSCCPass.h48 virtual bool doInitialization(CallGraph &CG) { argument
64 virtual bool doFinalization(CallGraph &CG) { argument
H A DCallGraph.h440 static nodes_iterator nodes_begin(CallGraph *CG) { argument
441 return map_iterator(CG->begin(), DerefFun(CGdereference));
443 static nodes_iterator nodes_end(CallGraph *CG) { argument
444 return map_iterator(CG->end(), DerefFun(CGdereference));
458 static nodes_iterator nodes_begin(const CallGraph *CG) { return CG->begin(); } argument
459 static nodes_iterator nodes_end(const CallGraph *CG) { return CG->end(); } argument
H A DCGSCCPassManager.h334 LazyCallGraph &CG = AM->getResult<LazyCallGraphAnalysis>(M); local
337 for (LazyCallGraph::SCC &C : CG.postorder_sccs()) {
344 // pass updated the CG, particularly some child of the current SCC, and
/external/llvm/lib/Transforms/IPO/
H A DInlineAlways.cpp58 bool doFinalization(CallGraph &CG) override {
59 return removeDeadFunctions(CG, /*AlwaysInlineOnly=*/ true);
H A DInternalize.cpp135 CallGraph *CG = CGPass ? &CGPass->getCallGraph() : nullptr; local
136 CallGraphNode *ExternalNode = CG ? CG->getExternalCallingNode() : nullptr;
167 ExternalNode->removeOneAbstractEdgeTo((*CG)[I]);
H A DInliner.cpp442 CallGraph &CG = getAnalysis<CallGraphWrapperPass>().getCallGraph(); local
504 InlineFunctionInfo InlineInfo(&CG, DL);
528 CG[Caller]->removeCallEdgeFor(CS);
601 CG[Callee]->getNumReferences() == 0) {
604 CallGraphNode *CalleeNode = CG[Callee];
610 delete CG.removeFunctionFromModule(CalleeNode);
636 bool Inliner::doFinalization(CallGraph &CG) { argument
637 return removeDeadFunctions(CG);
642 bool Inliner::removeDeadFunctions(CallGraph &CG, bool AlwaysInlineOnly) { argument
647 for (CallGraph::iterator I = CG
[all...]
H A DPruneEH.cpp64 CallGraph &CG = getAnalysis<CallGraphWrapperPass>().getCallGraph(); local
120 CallGraphNode *CalleeNode = CG[Callee];
238 CallGraph &CG = getAnalysis<CallGraphWrapperPass>().getCallGraph(); local
240 CallGraphNode *CGN = CG[BB->getParent()];
H A DArgumentPromotion.cpp86 bool doInitialization(CallGraph &CG) override;
638 CallGraph &CG = getAnalysis<CallGraphWrapperPass>().getCallGraph(); local
641 CallGraphNode *NF_CGN = CG.getOrInsertFunction(NF);
766 CallGraphNode *CalleeNode = CG[Call->getParent()->getParent()];
906 NF_CGN->stealCalledFunctionsFrom(CG[F]);
911 CallGraphNode *CGN = CG[F];
913 delete CG.removeFunctionFromModule(CGN);
920 bool ArgPromotion::doInitialization(CallGraph &CG) { argument
921 FunctionDIs = makeSubprogramMap(CG.getModule());
922 return CallGraphSCCPass::doInitialization(CG);
[all...]
/external/llvm/tools/opt/
H A DPrintSCC.cpp94 CallGraph &CG = getAnalysis<CallGraphWrapperPass>().getCallGraph(); local
97 for (scc_iterator<CallGraph*> SCCI = scc_begin(&CG); !SCCI.isAtEnd();
/external/llvm/include/llvm/Transforms/Utils/
H A DCloning.h161 : CG(cg), DL(DL) {}
163 /// CG - If non-null, InlineFunction will update the callgraph to reflect the
165 CallGraph *CG; member in class:llvm::InlineFunctionInfo
173 /// inlined from the callee. This is only filled in if CG is non-null.
/external/clang/lib/Analysis/
H A DCallGraph.cpp220 const CallGraph *CG) {
221 if (CG->getRoot() == Node) {
219 getNodeLabel(const CallGraphNode *Node, const CallGraph *CG) argument
/external/llvm/tools/lto/
H A Dlto.cpp64 LTOCodeGenerator *CG = unwrap(cg); local
73 CG->setAttr(attrs.c_str());
/external/pdfium/fpdfsdk/src/
H A Dfpdfeditpage.cpp271 CPDF_PageContentGenerate CG(pPage);
272 CG.GenerateContent();
/external/llvm/lib/Transforms/Utils/
H A DInlineFunction.cpp271 CallGraph &CG = *IFI.CG; local
274 CallGraphNode *CalleeNode = CG[Callee];
275 CallGraphNode *CallerNode = CG[Caller];
314 CallerNode->addCalledFunction(CallSite(NewCall), CG[F]); local
646 if (IFI.CG)
/external/clang/lib/StaticAnalyzer/Frontend/
H A DAnalysisConsumer.cpp457 // We rely on random access to add the initially processed Decls to CG.
458 CallGraph CG; local
460 CG.addToCallGraph(LocalTUDecls[i]);
471 llvm::ReversePostOrderTraversal<clang::CallGraph*> RPOT(&CG);
/external/ceres-solver/scripts/
H A Dceres-solver.spec43 - Line search solvers (L-BFGS and Nonlinear CG)
/external/chromium_org/third_party/libaddressinput/src/java/src/com/android/i18n/addressinput/
H A DRegionDataConstants.java231 CG(new String[]{ enum constant in enum:RegionDataConstants.RegionDataEnum
/external/mdnsresponder/mDNSCore/
H A DmDNSEmbeddedAPI.h1957 #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 Dpprof1232 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");

Completed in 621 milliseconds

12