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

  /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/include/llvm/Transforms/Utils/
Cloning.h 168 explicit InlineFunctionInfo(CallGraph *cg = 0, const TargetData *td = 0)
169 : CG(cg), TD(td) {}
171 /// CG - If non-null, InlineFunction will update the callgraph to reflect the
173 CallGraph *CG;
181 /// inlined from the callee. This is only filled in if CG is non-null.
  /external/llvm/lib/Transforms/IPO/
Internalize.cpp 104 CallGraph *CG = getAnalysisIfAvailable<CallGraph>();
105 CallGraphNode *ExternalNode = CG ? CG->getExternalCallingNode() : 0;
140 if (ExternalNode) ExternalNode->removeOneAbstractEdgeTo((*CG)[I]);
PruneEH.cpp 63 CallGraph &CG = getAnalysis<CallGraph>();
119 CallGraphNode *CalleeNode = CG[Callee];
235 CallGraph &CG = getAnalysis<CallGraph>();
237 CallGraphNode *CGN = CG[BB->getParent()];
Inliner.cpp 341 CallGraph &CG = getAnalysis<CallGraph>();
402 InlineFunctionInfo InlineInfo(&CG, TD);
426 CG[Caller]->removeCallEdgeFor(CS);
480 CG[Callee]->getNumReferences() == 0) {
483 CallGraphNode *CalleeNode = CG[Callee];
489 delete CG.removeFunctionFromModule(CalleeNode);
515 bool Inliner::doFinalization(CallGraph &CG) {
516 return removeDeadFunctions(CG);
521 bool Inliner::removeDeadFunctions(CallGraph &CG, bool AlwaysInlineOnly) {
526 for (CallGraph::iterator I = CG.begin(), E = CG.end(); I != E; ++I)
    [all...]
ArgumentPromotion.cpp 628 CallGraph &CG = getAnalysis<CallGraph>();
631 CallGraphNode *NF_CGN = CG.getOrInsertFunction(NF);
749 CallGraphNode *CalleeNode = CG[Call->getParent()->getParent()];
    [all...]
  /external/llvm/lib/Analysis/IPA/
CallGraphSCCPass.cpp 33 MaxIterations("max-cg-scc-iterations", cl::ReallyHidden, cl::init(4));
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)
    [all...]
  /external/clang/lib/StaticAnalyzer/Frontend/
AnalysisConsumer.cpp 369 CallGraph CG;
374 // We rely on random access to add the initially processed Decls to CG.
376 CG.addToCallGraph(LocalTUDecls[i]);
382 for (CallGraph::nodes_iterator TI = CG.parentless_begin(),
383 TE = CG.parentless_end(); TI != TE; ++TI) {
387 CallGraphNode *Entry = CG.getRoot();
434 CallGraphNode *VN = CG.getNode(*I);
  /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 121 milliseconds