HomeSort by relevance Sort by last modified time
    Searched defs:CG (Results 1 - 9 of 9) sorted by null

  /external/llvm/include/llvm/Transforms/Utils/
Cloning.h 161 explicit InlineFunctionInfo(CallGraph *cg = 0, const DataLayout *td = 0)
162 : CG(cg), TD(td) {}
164 /// CG - If non-null, InlineFunction will update the callgraph to reflect the
166 CallGraph *CG;
174 /// inlined from the callee. This is only filled in if CG is non-null.
  /external/llvm/lib/Transforms/IPO/
Internalize.cpp 111 CallGraph *CG = getAnalysisIfAvailable<CallGraph>();
112 CallGraphNode *ExternalNode = CG ? CG->getExternalCallingNode() : 0;
130 if (ExternalNode) ExternalNode->removeOneAbstractEdgeTo((*CG)[I]);
PruneEH.cpp 63 CallGraph &CG = getAnalysis<CallGraph>();
119 CallGraphNode *CalleeNode = CG[Callee];
239 CallGraph &CG = getAnalysis<CallGraph>();
241 CallGraphNode *CGN = CG[BB->getParent()];
Inliner.cpp 375 CallGraph &CG = getAnalysis<CallGraph>();
436 InlineFunctionInfo InlineInfo(&CG, TD);
460 CG[Caller]->removeCallEdgeFor(CS);
514 CG[Callee]->getNumReferences() == 0) {
517 CallGraphNode *CalleeNode = CG[Callee];
523 delete CG.removeFunctionFromModule(CalleeNode);
549 bool Inliner::doFinalization(CallGraph &CG) {
550 return removeDeadFunctions(CG);
555 bool Inliner::removeDeadFunctions(CallGraph &CG, bool AlwaysInlineOnly) {
560 for (CallGraph::iterator I = CG.begin(), E = CG.end(); I != E; ++I)
    [all...]
ArgumentPromotion.cpp 627 CallGraph &CG = getAnalysis<CallGraph>();
630 CallGraphNode *NF_CGN = CG.getOrInsertFunction(NF);
754 CallGraphNode *CalleeNode = CG[Call->getParent()->getParent()];
    [all...]
  /external/clang/lib/StaticAnalyzer/Checkers/
DebugCheckers.cpp 117 CallGraph CG;
118 CG.addToCallGraph(const_cast<TranslationUnitDecl*>(TU));
119 CG.viewGraph();
137 CallGraph CG;
138 CG.addToCallGraph(const_cast<TranslationUnitDecl*>(TU));
139 CG.dump();
  /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...]
  /external/clang/lib/StaticAnalyzer/Frontend/
AnalysisConsumer.cpp 435 // We rely on random access to add the initially processed Decls to CG.
436 CallGraph CG;
438 CG.addToCallGraph(LocalTUDecls[i]);
449 llvm::ReversePostOrderTraversal<clang::CallGraph*> RPOT(&CG);
  /external/llvm/lib/Transforms/Utils/
InlineFunction.cpp 272 CallGraph &CG = *IFI.CG;
275 CallGraphNode *CalleeNode = CG[Callee];
276 CallGraphNode *CallerNode = CG[Caller];
315 CallerNode->addCalledFunction(CallSite(NewCall), CG[F]);
611 if (IFI.CG)
    [all...]

Completed in 876 milliseconds