| /freebsd/contrib/llvm-project/llvm/lib/Analysis/ |
| H A D | CallGraphSCCPass.cpp | 72 bool doInitialization(CallGraph &CG);
73 bool doFinalization(CallGraph &CG);
107 bool RunAllPassesOnSCC(CallGraphSCC &CurSCC, CallGraph &CG,
111 CallGraph &CG, bool &CallGraphUpToDate,
113 bool RefreshCallGraph(const CallGraphSCC &CurSCC, CallGraph &CG,
122 CallGraph &CG, bool &CallGraphUpToDate, in RunPassOnSCC() argument
126 Module &M = CG.getModule(); in RunPassOnSCC()
131 DevirtualizedCall |= RefreshCallGraph(CurSCC, CG, false); in RunPassOnSCC()
163 RefreshCallGraph(CurSCC, CG, true); in RunPassOnSCC()
204 bool CGPassManager::RefreshCallGraph(const CallGraphSCC &CurSCC, CallGraph &CG, in RefreshCallGraph() argument
[all …]
|
| H A D | CallPrinter.cpp | 59 CallGraph *CG; member in llvm::CallGraphDOTInfo
66 CallGraphDOTInfo(Module *M, CallGraph *CG, in CallGraphDOTInfo() argument
68 : M(M), CG(CG), LookupBFI(LookupBFI) { in CallGraphDOTInfo()
89 CallGraph *getCallGraph() const { return CG; } in getCallGraph()
97 for (auto &I : (*CG)) { in removeParallelEdges()
234 CallGraph CG(M); in doCallGraphDOTPrinting() local
235 CallGraphDOTInfo CFGInfo(&M, &CG, LookupBFI); in doCallGraphDOTPrinting()
246 CallGraph CG(M); in viewCallGraph() local
247 CallGraphDOTInfo CFGInfo(&M, &CG, LookupBFI); in viewCallGraph()
|
| H A D | CGSCCPassManager.cpp | 149 LazyCallGraph &CG = AM.getResult<LazyCallGraphAnalysis>(M); in run() local
182 CG.buildRefSCCs(); in run()
184 llvm::make_early_inc_range(CG.postorder_ref_sccs())) { in run()
247 CGAM.getResult<FunctionAnalysisManagerCGSCCProxy>(*C, CG).updateFAM( in run()
281 PreservedAnalyses PassPA = Pass->run(*C, CGAM, CG, UR); in run()
289 CGAM.getResult<FunctionAnalysisManagerCGSCCProxy>(*C, CG).updateFAM( in run()
349 CG.removeDeadFunctions(DeadFunctions); in run()
355 CG.verify(); in run()
369 LazyCallGraph &CG, in run() argument
373 AM.getResult<PassInstrumentationAnalysis>(InitialC, CG); in run()
[all …]
|
| H A D | CallGraph.cpp | 47 CallsExternalNode->CG = this; in CallGraph()
49 P.second->CG = this; in CallGraph()
227 OldCBs.push_back(CG->getOrInsertFunction(CB)); in replaceCallEdge()
230 NewCBs.push_back(CG->getOrInsertFunction(CB)); in replaceCallEdge()
269 auto &CG = AM.getResult<CallGraphAnalysis>(M); in run() local
272 for (scc_iterator<CallGraph *> SCCI = scc_begin(&CG); !SCCI.isAtEnd(); in run()
|
| H A D | GlobalsModRef.cpp | 476 void GlobalsAAResult::CollectSCCMembership(CallGraph &CG) { in CollectSCCMembership() argument
480 for (scc_iterator<CallGraph *> I = scc_begin(&CG); !I.isAtEnd(); ++I) { in CollectSCCMembership()
495 void GlobalsAAResult::AnalyzeCallGraph(CallGraph &CG, Module &M) { in AnalyzeCallGraph() argument
498 for (scc_iterator<CallGraph *> I = scc_begin(&CG); !I.isAtEnd(); ++I) { in AnalyzeCallGraph()
569 CallGraphNode *CalleeNode = CG[Callee]; in AnalyzeCallGraph()
994 CallGraph &CG) { in analyzeModule() argument
998 Result.CollectSCCMembership(CG); in analyzeModule()
1004 Result.AnalyzeCallGraph(CG, M); in analyzeModule()
1024 auto &CG = AM.getResult<CallGraphAnalysis>(M); in run() local
1032 G->CollectSCCMembership(CG); in run()
[all …]
|
| H A D | SyntheticCountsUtils.cpp | 80 void SyntheticCountsUtils<CallGraphType>::propagate(const CallGraphType &CG, in propagate() argument
86 for (auto I = scc_begin(CG); !I.isAtEnd(); ++I) in propagate()
|
| H A D | MLInlineAdvisor.cpp | 146 CG(MAM.getResult<LazyCallGraphAnalysis>(M)), in MLInlineAdvisor()
169 auto Pos = FunctionLevels.find(&CG.get(*Called)); in MLInlineAdvisor()
182 FunctionLevels[&CG.get(*F)] = Level; in MLInlineAdvisor()
206 return CG.lookup(F) ? FunctionLevels.at(CG.lookup(F)) : 0; in getInitialFunctionLevel()
328 NodesInLastSCC.erase(CG.lookup(*Callee)); in onSuccessfulInlining()
|
| /freebsd/contrib/llvm-project/clang/include/clang/Analysis/ |
| H A D | CallGraph.h | 275 static nodes_iterator nodes_begin(clang::CallGraph *CG) {
276 return nodes_iterator(CG->begin(), &CGGetValue);
279 static nodes_iterator nodes_end (clang::CallGraph *CG) {
280 return nodes_iterator(CG->end(), &CGGetValue);
283 static unsigned size(clang::CallGraph *CG) { return CG->size(); }
301 static nodes_iterator nodes_begin(const clang::CallGraph *CG) {
302 return nodes_iterator(CG->begin(), &CGGetValue);
305 static nodes_iterator nodes_end(const clang::CallGraph *CG) {
306 return nodes_iterator(CG->end(), &CGGetValue);
309 static unsigned size(const clang::CallGraph *CG) { return CG->size(); }
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/AMDGPU/ |
| H A D | AMDGPUMemoryUtils.cpp | 107 void getUsesOfLDSByFunction(const CallGraph &CG, Module &M, in getUsesOfLDSByFunction() argument
131 LDSUsesInfoTy getTransitiveUsesOfLDS(const CallGraph &CG, Module &M) { in getTransitiveUsesOfLDS() argument
135 getUsesOfLDSByFunction(CG, M, DirectMapKernel, DirectMapFunction); in getTransitiveUsesOfLDS()
158 for (const CallGraphNode::CallRecord &R : *CG[F]) { in getTransitiveUsesOfLDS()
195 for (const CallGraphNode::CallRecord &R : *CG[F]) { in getTransitiveUsesOfLDS()
222 for (const CallGraphNode::CallRecord &R : *CG[&Func]) { in getTransitiveUsesOfLDS()
232 SmallVector<Function *> WorkList = {CG[&Func]->getFunction()}; in getTransitiveUsesOfLDS()
238 for (const CallGraphNode::CallRecord &CallRecord : *CG[F]) { in getTransitiveUsesOfLDS()
299 void removeFnAttrFromReachable(CallGraph &CG, Function *KernelRoot, in removeFnAttrFromReachable() argument
304 SmallVector<Function *> WorkList = {CG[KernelRoot]->getFunction()}; in removeFnAttrFromReachable()
[all …]
|
| H A D | AMDGPUMemoryUtils.h | 52 void getUsesOfLDSByFunction(const CallGraph &CG, Module &M,
58 LDSUsesInfoTy getTransitiveUsesOfLDS(const CallGraph &CG, Module &M);
62 void removeFnAttrFromReachable(CallGraph &CG, Function *KernelRoot,
|
| H A D | AMDGPUPerfHintAnalysis.cpp | 443 LazyCallGraph &CG) { in run() argument
446 CG.buildRefSCCs(); in run()
448 for (LazyCallGraph::RefSCC &RC : CG.postorder_ref_sccs()) { in run()
484 auto &CG = AM.getResult<LazyCallGraphAnalysis>(M); in run() local
486 bool Changed = Impl->run(TM, CG); in run()
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/IPO/ |
| H A D | Inliner.cpp | 207 CGSCCAnalysisManager &AM, LazyCallGraph &CG, in run() argument
210 AM.getResult<ModuleAnalysisManagerCGSCCProxy>(InitialC, CG); in run()
218 AM.getResult<FunctionAnalysisManagerCGSCCProxy>(InitialC, CG) in run()
314 LazyCallGraph::Node &N = *CG.lookup(F); in run()
315 if (CG.lookupSCC(N) != C) in run()
352 LazyCallGraph::SCC *CalleeSCC = CG.lookupSCC(*CG.lookup(Callee)); in run()
434 CalleeSCC == CG.lookupSCC(CG.get(*NewCallee))) { in run()
453 !CG.isLibFunction(Callee)) { in run()
499 C = &updateCGAndAnalysisManagerForCGSCCPass(CG, *C, N, AM, UR, FAM); in run()
524 return CG.lookupSCC(*CG.lookup(*Callee)) == OldC; in run()
[all …]
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/Analysis/ |
| H A D | CallGraph.h | 180 inline CallGraphNode(CallGraph *CG, Function *F) : CG(CG), F(F) {} in CallGraphNode() argument
265 CallGraph *CG; variable
480 static nodes_iterator nodes_begin(CallGraph *CG) {
481 return nodes_iterator(CG->begin(), &CGGetValuePtr);
484 static nodes_iterator nodes_end(CallGraph *CG) {
485 return nodes_iterator(CG->end(), &CGGetValuePtr);
507 static nodes_iterator nodes_begin(const CallGraph *CG) {
508 return nodes_iterator(CG->begin(), &CGGetValuePtr);
511 static nodes_iterator nodes_end(const CallGraph *CG) {
512 return nodes_iterator(CG->end(), &CGGetValuePtr);
|
| H A D | CallGraphSCCPass.h | 49 virtual bool doInitialization(CallGraph &CG) { in doInitialization() argument
64 virtual bool doFinalization(CallGraph &CG) { in doFinalization() argument
84 const CallGraph &CG; // The call graph for this SCC. variable
89 CallGraphSCC(CallGraph &cg, void *context) : CG(cg), Context(context) {} in CallGraphSCC()
111 const CallGraph &getCallGraph() { return CG; } in getCallGraph()
|
| H A D | GlobalsModRef.h | 92 CallGraph &CG);
116 void AnalyzeCallGraph(CallGraph &CG, Module &M);
122 void CollectSCCMembership(CallGraph &CG);
|
| H A D | CGSCCPassManager.h | 155 LazyCallGraph &CG, CGSCCUpdateResult &) {
156 (void)AM.template getResult<AnalysisT>(C, CG);
473 CGSCCAnalysisManager &AM, LazyCallGraph &CG,
560 CGSCCAnalysisManager &AM, LazyCallGraph &CG,
|
| H A D | SyntheticCountsUtils.h | 42 static void propagate(const CallGraphType &CG, GetProfCountTy GetProfCount,
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Coroutines/ |
| H A D | CoroAnnotationElide.cpp | 109 LazyCallGraph &CG, in run() argument
113 CGUpdater.initialize(CG, C, AM, UR); in run()
116 AM.getResult<FunctionAnalysisManagerCGSCCProxy>(C, CG).getManager(); in run()
148 auto *CallerN = CG.lookup(*Caller); in run()
149 auto *CallerC = CallerN ? CG.lookupSCC(*CallerN) : nullptr; in run()
165 updateCGAndAnalysisManagerForCGSCCPass(CG, *CallerC, *CallerN, AM, UR, in run()
|
| H A D | Coroutines.cpp | 500 static void addCallToCallGraph(CallGraph *CG, CallInst *Call, Function *Callee){ in addCallToCallGraph() argument
501 if (CG) in addCallToCallGraph()
502 (*CG)[Call->getFunction()]->addCalledFunction(Call, (*CG)[Callee]); in addCallToCallGraph()
506 CallGraph *CG) const { in emitAlloc()
519 addCallToCallGraph(CG, Call, Alloc); in emitAlloc()
529 CallGraph *CG) const { in emitDealloc()
541 addCallToCallGraph(CG, Call, Dealloc); in emitDealloc()
|
| H A D | CoroSplit.cpp | 160 CallGraph *CG) { in maybeFreeRetconStorage() argument
165 Shape.emitDealloc(Builder, FramePtr, CG); in maybeFreeRetconStorage()
216 bool InResume, CallGraph *CG) { in replaceFallthroughCoroEnd() argument
244 maybeFreeRetconStorage(Builder, Shape, FramePtr, CG); in replaceFallthroughCoroEnd()
283 maybeFreeRetconStorage(Builder, Shape, FramePtr, CG); in replaceFallthroughCoroEnd()
349 CallGraph *CG) { in replaceUnwindCoroEnd() argument
372 maybeFreeRetconStorage(Builder, Shape, FramePtr, CG); in replaceUnwindCoroEnd()
386 Value *FramePtr, bool InResume, CallGraph *CG) { in replaceCoroEnd() argument
388 replaceUnwindCoroEnd(End, Shape, FramePtr, InResume, CG); in replaceCoroEnd()
390 replaceFallthroughCoroEnd(End, Shape, FramePtr, InResume, CG); in replaceCoroEnd()
[all …]
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/Transforms/IPO/ |
| H A D | SampleProfileMatcher.h | 29 LazyCallGraph &CG; variable
121 Module &M, SampleProfileReader &Reader, LazyCallGraph &CG, in SampleProfileMatcher() argument
127 : M(M), Reader(Reader), CG(CG), ProbeManager(ProbeManager), in SampleProfileMatcher()
|
| H A D | ArgumentPromotion.h | 30 LazyCallGraph &CG, CGSCCUpdateResult &UR);
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/Transforms/Coroutines/ |
| H A D | CoroAnnotationElide.h | 30 LazyCallGraph &CG, CGSCCUpdateResult &UR);
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/MSP430/ |
| H A D | MSP430RegisterInfo.td | 58 def CG : MSP430RegWithSubregs<3, "r3", [CGB], ["cg"]>, DwarfRegNum<[3]>;
87 PC, SP, SR, CG)>;
|
| /freebsd/crypto/openssl/test/recipes/04-test_pem_reading_data/ |
| H A D | beermug.pem | 18 - (Q@*0CG*O() ___
|