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

/freebsd-10.0-release/contrib/llvm/lib/Analysis/IPA/
H A DCallGraphSCCPass.cpp57 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) {
286 CalleeNode = CG
173 RefreshCallGraph(CallGraphSCC &CurSCC, CallGraph &CG, bool CheckingMode) argument
366 RunAllPassesOnSCC(CallGraphSCC &CurSCC, CallGraph &CG, bool &DevirtualizedCall) argument
427 CallGraph &CG = getAnalysis<CallGraph>(); local
477 doInitialization(CallGraph &CG) argument
492 doFinalization(CallGraph &CG) argument
[all...]
H A DGlobalsModRef.cpp100 AnalyzeCallGraph(getAnalysis<CallGraph>(), M); // Propagate on CG
180 void AnalyzeCallGraph(CallGraph &CG, Module &M);
363 void GlobalsModRef::AnalyzeCallGraph(CallGraph &CG, Module &M) { argument
366 for (scc_iterator<CallGraph*> I = scc_begin(&CG), E = scc_end(&CG); I != E;
428 CallGraphNode *CalleeNode = CG[Callee];
/freebsd-10.0-release/contrib/llvm/tools/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...]
/freebsd-10.0-release/contrib/llvm/include/llvm/Transforms/IPO/
H A DInlinerPass.h48 virtual bool doFinalization(CallGraph &CG);
75 bool removeDeadFunctions(CallGraph &CG, bool AlwaysInlineOnly = false);
/freebsd-10.0-release/contrib/llvm/tools/clang/lib/StaticAnalyzer/Checkers/
H A DDebugCheckers.cpp117 CallGraph CG; local
118 CG.addToCallGraph(const_cast<TranslationUnitDecl*>(TU));
119 CG.viewGraph();
137 CallGraph CG; local
138 CG.addToCallGraph(const_cast<TranslationUnitDecl*>(TU));
139 CG.dump();
H A DRetainCountChecker.cpp1157 // For CoreGraphics ('CG') types.
1158 if (cocoa::isRefType(RetTy, "CG", FName)) {
3195 // Handle: (CF|CG)Retain
3199 cocoa::isRefType(ResultTy, "CG", FName)) {
/freebsd-10.0-release/contrib/llvm/include/llvm/Analysis/
H A DCallGraph.h350 static nodes_iterator nodes_begin(CallGraph *CG) { argument
351 return map_iterator(CG->begin(), DerefFun(CGdereference));
353 static nodes_iterator nodes_end (CallGraph *CG) { argument
354 return map_iterator(CG->end(), DerefFun(CGdereference));
369 static nodes_iterator nodes_begin(const CallGraph *CG) { return CG->begin(); } argument
370 static nodes_iterator nodes_end (const CallGraph *CG) { return CG->end(); } argument
H A DCallGraphSCCPass.h47 virtual bool doInitialization(CallGraph &CG) { argument
63 virtual bool doFinalization(CallGraph &CG) { argument
/freebsd-10.0-release/contrib/llvm/lib/Transforms/IPO/
H A DInlineAlways.cpp56 virtual bool doFinalization(CallGraph &CG) { argument
57 return removeDeadFunctions(CG, /*AlwaysInlineOnly=*/ true);
H A DInliner.cpp375 CallGraph &CG = getAnalysis<CallGraph>(); local
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) { argument
550 return removeDeadFunctions(CG);
555 bool Inliner::removeDeadFunctions(CallGraph &CG, bool AlwaysInlineOnly) { argument
560 for (CallGraph::iterator I = CG
[all...]
H A DInternalize.cpp111 CallGraph *CG = getAnalysisIfAvailable<CallGraph>(); local
112 CallGraphNode *ExternalNode = CG ? CG->getExternalCallingNode() : 0;
130 if (ExternalNode) ExternalNode->removeOneAbstractEdgeTo((*CG)[I]);
H A DPruneEH.cpp63 CallGraph &CG = getAnalysis<CallGraph>(); local
119 CallGraphNode *CalleeNode = CG[Callee];
239 CallGraph &CG = getAnalysis<CallGraph>(); local
241 CallGraphNode *CGN = CG[BB->getParent()];
H A DArgumentPromotion.cpp627 CallGraph &CG = getAnalysis<CallGraph>(); local
630 CallGraphNode *NF_CGN = CG.getOrInsertFunction(NF);
754 CallGraphNode *CalleeNode = CG[Call->getParent()->getParent()];
885 NF_CGN->stealCalledFunctionsFrom(CG[F]);
890 CallGraphNode *CGN = CG[F];
892 delete CG.removeFunctionFromModule(CGN);
/freebsd-10.0-release/contrib/llvm/include/llvm/Transforms/Utils/
H A DCloning.h162 : CG(cg), TD(td) {}
164 /// CG - If non-null, InlineFunction will update the callgraph to reflect the
166 CallGraph *CG; member in class:llvm::InlineFunctionInfo
174 /// inlined from the callee. This is only filled in if CG is non-null.
/freebsd-10.0-release/contrib/llvm/tools/clang/lib/Analysis/
H A DCallGraph.cpp226 const CallGraph *CG) {
227 if (CG->getRoot() == Node) {
225 getNodeLabel(const CallGraphNode *Node, const CallGraph *CG) argument
/freebsd-10.0-release/contrib/llvm/lib/Transforms/Utils/
H A DInlineFunction.cpp282 CallGraph &CG = *IFI.CG; local
285 CallGraphNode *CalleeNode = CG[Callee];
286 CallGraphNode *CallerNode = CG[Caller];
325 CallerNode->addCalledFunction(CallSite(NewCall), CG[F]); local
621 if (IFI.CG)
/freebsd-10.0-release/contrib/llvm/tools/clang/lib/StaticAnalyzer/Frontend/
H A DAnalysisConsumer.cpp432 // We rely on random access to add the initially processed Decls to CG.
433 CallGraph CG; local
435 CG.addToCallGraph(LocalTUDecls[i]);
446 llvm::ReversePostOrderTraversal<clang::CallGraph*> RPOT(&CG);
/freebsd-10.0-release/sys/contrib/dev/uath/
H A Dar5523.bin.uu1730 M@Q@J`%(0(:Q&```48/_A)C$`'!:@``J/OP`8CG`<$(X"```80``&``"@(8X#
2681 M$$``!P``("&N(E7TC[\`"(^Q``2/L````^``"">]`!`,`'CG`````!``__@`
2711 M``D`````K&)5](^_`!"/LP`,C[(`"(^Q``2/L````^``"">]`"`,`'CG```@
2717 M`````*QB5?2/OP```^``"">]`!`,`'CG```@(1``__H`````$`#_[B0"``,G
2781 M)&+_Z``#$`H01``*)`,``3P"@`.L0ZO8/`*``HQ$5?0,`'CG)(3__X^_```#
2828 M#JQB``".`E7T)$+__Q!```8``"`AK@)5](^_``2/L````^``"">]`!`,`'CG
2835 M`!"/LP`,C[(`"(^Q``2/L````^``"">]`"`,`'CG```@(1``__4`````4$``
2845 M`^``"">]`!`,`'CG`````!``__@`````#`!YD8RE`!`0`/_N`````">]__"O
2849 M`````*QB5?2/OP`,C[(`"(^Q``2/L````^``"">]`!`,`'CG```@(1``__<`
2920 M&(^Q`!2/L``0`^``"">]`#`,`'CG```
[all...]
/freebsd-10.0-release/sys/dev/hptmv/
H A Di386-elf.raid.o.uu744 MQ!#K*8M-#,9!%06#[`11_W$@_W4(Z/S____K$8/L"/]U#/]U".CG\?__@\00
877 M$(7`=2N#[`1J`?]U#/]U".CG````@\00ZQ:)]H/L!&H!_W4,_W4(Z-````"#
1064 MM@-0_W,HZ/S___^#Q!"%P'0,1CG^<J:)]K@`````C67T6UY?R<.-=@!5B>53
/freebsd-10.0-release/sys/contrib/dev/ipw/
H A Dipw2100-1.3.fw.uu4771 M:%`3CG!`<4("#@YD%P`%S#1D"687``?,Y%#E4@$1Y$#E0@(/F(X5W9Z.HHZ0
/freebsd-10.0-release/sys/dev/hptrr/
H A Di386-elf.hptrr_lib.o.uu629 M_W,<Z/S___^#Q!"%P'0*1CG^<JBX`````(/$#%M>7UW#C78`BU0D!(M"'(M(
1652 M__^#?"0,`'5$@'PD&0!U/8/L#&CG````:D!J`&H`:@!J`&H`:@!J`&H`:@`/
1759 MN@`````#%CG:=P6#QA#K]0,>*=.+;@B_`````(M$)!B#.`)U/9`Y'G<+@\80
1865 M````4^CG[___@\00@\0$6U[#B?964XMT)`P/MEPD$%/HZ^+__X/$!(G"@<(`
1932 MZRR-=@"#[`Q5Z/S___^#Q`@/M@-0_W,DZ/S___^#Q!"%P'0*1CG^<JBX````
2304 M&0!U/8/L#&CG````:D!J`&H`:@!J`&H`:@!J`&H`:@`/MD0D2U#_="10Z/S_
2410 M@WX$`'4+@\80`Q:#?@0`=/6+7"08BW,,BT,0T>")TRG#N@`````#%CG:=P6#
2516 MPE#H*N/__X/L"(E#+(ES),>#R`D```````#'@S`"````````4^CG[___@\00
2584 M__^#Q`@/M@-0_W,DZ/S___^#Q!"%P'0*1CG^<JBX`````(/$#%M>7UW#C78`
3657 M#/____^#?"0,`'5$@'PD&0!U/8/L#&CG````
[all...]
H A Damd64-elf.hptrr_lib.o.uu3350 MML"%PG1U00^V504/MG0D5\=$)#CG````QT0D,$````#'1"0H`````,=$)"``
4200 MMNU(BWTP2(U$)"!(B00D10^WQHM4)!1$B>Y!_U0D&$B)WDB)[^CG#P``@[U@
5614 M2(M+&#'2#[9!0(/X`'Z$B<;K"O_".=8/CG;___](8\)(.5S!4'7L2,=$P5``
6903 MR4B)_5-(@^P(2(M?&&8/ME-`9H/Z`'879F:09F:0#[?!2#ELPU!T!__!9CG*
6912 M#[;'9CG(=[>02(.[\`````!U&DB+0QA(A<!U18M+,(7)>&TQ]DB)W^@`````

Completed in 474 milliseconds