OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
defs:CG
(Results
1 - 9
of
9
) sorted by null
/external/llvm/include/llvm/Transforms/Utils/
Cloning.h
162
explicit InlineFunctionInfo(CallGraph *
cg
= 0, const DataLayout *td = 0)
163
:
CG
(
cg
), TD(td) {}
165
///
CG
- If non-null, InlineFunction will update the callgraph to reflect the
167
CallGraph *
CG
;
175
/// inlined from the callee. This is only filled in if
CG
is non-null.
/external/llvm/lib/Transforms/IPO/
Internalize.cpp
113
CallGraph *
CG
= getAnalysisIfAvailable<CallGraph>();
114
CallGraphNode *ExternalNode =
CG
?
CG
->getExternalCallingNode() : 0;
150
if (ExternalNode) ExternalNode->removeOneAbstractEdgeTo((*
CG
)[I]);
PruneEH.cpp
63
CallGraph &
CG
= getAnalysis<CallGraph>();
119
CallGraphNode *CalleeNode =
CG
[Callee];
237
CallGraph &
CG
= getAnalysis<CallGraph>();
239
CallGraphNode *CGN =
CG
[BB->getParent()];
Inliner.cpp
398
CallGraph &
CG
= getAnalysis<CallGraph>();
459
InlineFunctionInfo InlineInfo(&
CG
, TD);
483
CG
[Caller]->removeCallEdgeFor(CS);
537
CG
[Callee]->getNumReferences() == 0) {
540
CallGraphNode *CalleeNode =
CG
[Callee];
546
delete
CG
.removeFunctionFromModule(CalleeNode);
572
bool Inliner::doFinalization(CallGraph &
CG
) {
573
return removeDeadFunctions(
CG
);
578
bool Inliner::removeDeadFunctions(CallGraph &
CG
, bool AlwaysInlineOnly) {
583
for (CallGraph::iterator I =
CG
.begin(), E = CG.end(); I != E; ++I)
[
all
...]
ArgumentPromotion.cpp
622
CallGraph &
CG
= getAnalysis<CallGraph>();
625
CallGraphNode *NF_CGN =
CG
.getOrInsertFunction(NF);
749
CallGraphNode *CalleeNode =
CG
[Call->getParent()->getParent()];
[
all
...]
/external/clang/lib/StaticAnalyzer/Checkers/
DebugCheckers.cpp
119
CallGraph
CG
;
120
CG
.addToCallGraph(const_cast<TranslationUnitDecl*>(TU));
121
CG
.viewGraph();
139
CallGraph
CG
;
140
CG
.addToCallGraph(const_cast<TranslationUnitDecl*>(TU));
141
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
433
// We rely on random access to add the initially processed Decls to
CG
.
434
CallGraph
CG
;
436
CG
.addToCallGraph(LocalTUDecls[i]);
447
llvm::ReversePostOrderTraversal<clang::CallGraph*> RPOT(&
CG
);
/external/llvm/lib/Transforms/Utils/
InlineFunction.cpp
282
CallGraph &
CG
= *IFI.
CG
;
285
CallGraphNode *CalleeNode =
CG
[Callee];
286
CallGraphNode *CallerNode =
CG
[Caller];
325
CallerNode->addCalledFunction(CallSite(NewCall),
CG
[F]);
621
if (IFI.
CG
)
[
all
...]
Completed in 665 milliseconds