Home
last modified time | relevance | path

Searched refs:CG (Results 1 – 25 of 73) sorted by relevance

123

/freebsd/contrib/llvm-project/llvm/lib/Analysis/
H A DCallGraphSCCPass.cpp73 bool doInitialization(CallGraph &CG);
74 bool doFinalization(CallGraph &CG);
108 bool RunAllPassesOnSCC(CallGraphSCC &CurSCC, CallGraph &CG,
112 CallGraph &CG, bool &CallGraphUpToDate,
114 bool RefreshCallGraph(const CallGraphSCC &CurSCC, CallGraph &CG,
123 CallGraph &CG, bool &CallGraphUpToDate, in RunPassOnSCC() argument
127 Module &M = CG.getModule(); in RunPassOnSCC()
132 DevirtualizedCall |= RefreshCallGraph(CurSCC, CG, false); in RunPassOnSCC()
164 RefreshCallGraph(CurSCC, CG, true); in RunPassOnSCC()
205 bool CGPassManager::RefreshCallGraph(const CallGraphSCC &CurSCC, CallGraph &CG, in RefreshCallGraph() argument
[all …]
H A DCallPrinter.cpp59 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 DCGSCCPassManager.cpp142 LazyCallGraph &CG = AM.getResult<LazyCallGraphAnalysis>(M); in run() local
175 CG.buildRefSCCs(); in run()
177 llvm::make_early_inc_range(CG.postorder_ref_sccs())) { in run()
240 CGAM.getResult<FunctionAnalysisManagerCGSCCProxy>(*C, CG).updateFAM( in run()
274 PreservedAnalyses PassPA = Pass->run(*C, CGAM, CG, UR); in run()
282 CGAM.getResult<FunctionAnalysisManagerCGSCCProxy>(*C, CG).updateFAM( in run()
342 CG.removeDeadFunctions(DeadFunctions); in run()
348 CG.verify(); in run()
362 LazyCallGraph &CG, in run() argument
366 AM.getResult<PassInstrumentationAnalysis>(InitialC, CG); in run()
[all …]
H A DCallGraph.cpp49 CallsExternalNode->CG = this; in CallGraph()
51 P.second->CG = this; in CallGraph()
219 removeOneAbstractEdgeTo(CG->getOrInsertFunction(CB)); in removeCallEdgeFor()
272 OldCBs.push_back(CG->getOrInsertFunction(CB)); in replaceCallEdge()
275 NewCBs.push_back(CG->getOrInsertFunction(CB)); in replaceCallEdge()
314 auto &CG = AM.getResult<CallGraphAnalysis>(M); in run() local
317 for (scc_iterator<CallGraph *> SCCI = scc_begin(&CG); !SCCI.isAtEnd(); in run()
H A DGlobalsModRef.cpp476 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()
979 CallGraph &CG) { in analyzeModule() argument
983 Result.CollectSCCMembership(CG); in analyzeModule()
989 Result.AnalyzeCallGraph(CG, M); in analyzeModule()
1009 auto &CG = AM.getResult<CallGraphAnalysis>(M); in run() local
1017 G->CollectSCCMembership(CG); in run()
[all …]
H A DSyntheticCountsUtils.cpp83 void SyntheticCountsUtils<CallGraphType>::propagate(const CallGraphType &CG, in propagate() argument
89 for (auto I = scc_begin(CG); !I.isAtEnd(); ++I) in propagate()
H A DMLInlineAdvisor.cpp146 CG(MAM.getResult<LazyCallGraphAnalysis>(M)), in MLInlineAdvisor()
168 auto Pos = FunctionLevels.find(&CG.get(*Called)); in MLInlineAdvisor()
181 FunctionLevels[&CG.get(*F)] = Level; in MLInlineAdvisor()
192 return CG.lookup(F) ? FunctionLevels.at(CG.lookup(F)) : 0; in getInitialFunctionLevel()
315 NodesInLastSCC.erase(CG.lookup(*Callee)); in onSuccessfulInlining()
/freebsd/contrib/llvm-project/clang/include/clang/Analysis/
H A DCallGraph.h278 static nodes_iterator nodes_begin(clang::CallGraph *CG) {
279 return nodes_iterator(CG->begin(), &CGGetValue);
282 static nodes_iterator nodes_end (clang::CallGraph *CG) {
283 return nodes_iterator(CG->end(), &CGGetValue);
286 static unsigned size(clang::CallGraph *CG) { return CG->size(); }
304 static nodes_iterator nodes_begin(const clang::CallGraph *CG) {
305 return nodes_iterator(CG->begin(), &CGGetValue);
308 static nodes_iterator nodes_end(const clang::CallGraph *CG) {
309 return nodes_iterator(CG->end(), &CGGetValue);
312 static unsigned size(const clang::CallGraph *CG) { return CG->size(); }
/freebsd/contrib/llvm-project/llvm/lib/Transforms/IPO/
H A DInliner.cpp209 CGSCCAnalysisManager &AM, LazyCallGraph &CG, in run() argument
212 AM.getResult<ModuleAnalysisManagerCGSCCProxy>(InitialC, CG); in run()
220 AM.getResult<FunctionAnalysisManagerCGSCCProxy>(InitialC, CG) in run()
316 LazyCallGraph::Node &N = *CG.lookup(F); in run()
317 if (CG.lookupSCC(N) != C) in run()
354 LazyCallGraph::SCC *CalleeSCC = CG.lookupSCC(*CG.lookup(Callee)); in run()
432 CalleeSCC == CG.lookupSCC(CG.get(*NewCallee))) { in run()
451 !CG.isLibFunction(Callee)) { in run()
497 C = &updateCGAndAnalysisManagerForCGSCCPass(CG, *C, N, AM, UR, FAM); in run()
522 return CG.lookupSCC(*CG.lookup(*Callee)) == OldC; in run()
[all …]
H A DSyntheticCountsPropagation.cpp121 CallGraph CG(M); in run() local
124 &CG, GetCallSiteProfCount, [&](const CallGraphNode *N, Scaled64 New) { in run()
/freebsd/contrib/llvm-project/llvm/lib/Target/AMDGPU/Utils/
H A DAMDGPUMemoryUtils.cpp86 void getUsesOfLDSByFunction(const CallGraph &CG, Module &M, in getUsesOfLDSByFunction() argument
117 LDSUsesInfoTy getTransitiveUsesOfLDS(const CallGraph &CG, Module &M) { in getTransitiveUsesOfLDS() argument
121 getUsesOfLDSByFunction(CG, M, DirectMapKernel, DirectMapFunction); in getTransitiveUsesOfLDS()
139 for (const CallGraphNode::CallRecord &R : *CG[F]) { in getTransitiveUsesOfLDS()
176 for (const CallGraphNode::CallRecord &R : *CG[F]) { in getTransitiveUsesOfLDS()
196 for (const CallGraphNode::CallRecord &R : *CG[&Func]) { in getTransitiveUsesOfLDS()
240 void removeFnAttrFromReachable(CallGraph &CG, Function *KernelRoot, in removeFnAttrFromReachable() argument
245 SmallVector<Function *> WorkList = {CG[KernelRoot]->getFunction()}; in removeFnAttrFromReachable()
252 for (auto &CallRecord : *CG[F]) { in removeFnAttrFromReachable()
264 for (auto &ExternalCallRecord : *CG.getExternalCallingNode()) { in removeFnAttrFromReachable()
H A DAMDGPUMemoryUtils.h47 void getUsesOfLDSByFunction(const CallGraph &CG, Module &M,
53 LDSUsesInfoTy getTransitiveUsesOfLDS(const CallGraph &CG, Module &M);
57 void removeFnAttrFromReachable(CallGraph &CG, Function *KernelRoot,
/freebsd/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DCallGraph.h184 inline CallGraphNode(CallGraph *CG, Function *F) : CG(CG), F(F) {} in CallGraphNode() argument
281 CallGraph *CG; variable
496 static nodes_iterator nodes_begin(CallGraph *CG) {
497 return nodes_iterator(CG->begin(), &CGGetValuePtr);
500 static nodes_iterator nodes_end(CallGraph *CG) {
501 return nodes_iterator(CG->end(), &CGGetValuePtr);
523 static nodes_iterator nodes_begin(const CallGraph *CG) {
524 return nodes_iterator(CG
[all...]
H A DCallGraphSCCPass.h48 virtual bool doInitialization(CallGraph &CG) { in doInitialization() argument
63 virtual bool doFinalization(CallGraph &CG) { in doFinalization() argument
88 const CallGraph &CG; // The call graph for this SCC. variable
93 CallGraphSCC(CallGraph &cg, void *context) : CG(cg), Context(context) {} in CallGraphSCC()
115 const CallGraph &getCallGraph() { return CG; } in getCallGraph()
H A DGlobalsModRef.h91 CallGraph &CG);
113 void AnalyzeCallGraph(CallGraph &CG, Module &M);
119 void CollectSCCMembership(CallGraph &CG);
H A DCGSCCPassManager.h154 LazyCallGraph &CG, CGSCCUpdateResult &) {
155 (void)AM.template getResult<AnalysisT>(C, CG);
470 LazyCallGraph &CG, CGSCCUpdateResult &UR);
556 LazyCallGraph &CG, CGSCCUpdateResult &UR);
/freebsd/contrib/llvm-project/llvm/lib/Target/AMDGPU/
H A DAMDGPUSplitModule.cpp310 static void addAllDependencies(SplitModuleLogger &SML, const CallGraph &CG, in addAllDependencies() argument
326 for (auto &CGEntry : *CG[&CurFn]) { in addAllDependencies()
338 if (CGNode != CG.getCallsExternalNode()) in addAllDependencies()
365 FunctionWithDependencies(SplitModuleLogger &SML, CallGraph &CG, in FunctionWithDependencies()
372 addAllDependencies(SML, CG, *Fn, Dependencies, in FunctionWithDependencies()
625 CallGraph CG(M); in splitAMDGPUModule() local
667 WorkList.emplace_back(SML, CG, FnCosts, &Fn); in splitAMDGPUModule()
685 WorkList.emplace_back(SML, CG, FnCosts, &Fn); in splitAMDGPUModule()
H A DAMDGPUAnnotateKernelFeatures.cpp40 bool doInitialization(CallGraph &CG) override;
128 bool AMDGPUAnnotateKernelFeatures::doInitialization(CallGraph &CG) { in doInitialization() argument
/freebsd/contrib/llvm-project/llvm/include/llvm/Transforms/IPO/
H A DSampleProfileMatcher.h29 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 DArgumentPromotion.h30 LazyCallGraph &CG, CGSCCUpdateResult &UR);
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Coroutines/
H A DCoroutines.cpp451 static void addCallToCallGraph(CallGraph *CG, CallInst *Call, Function *Callee){ in addCallToCallGraph() argument
452 if (CG) in addCallToCallGraph()
453 (*CG)[Call->getFunction()]->addCalledFunction(Call, (*CG)[Callee]); in addCallToCallGraph()
457 CallGraph *CG) const { in emitAlloc()
470 addCallToCallGraph(CG, Call, Alloc); in emitAlloc()
480 CallGraph *CG) const { in emitDealloc()
492 addCallToCallGraph(CG, Call, Dealloc); in emitDealloc()
H A DCoroSplit.cpp251 CallGraph *CG) { in maybeFreeRetconStorage() argument
256 Shape.emitDealloc(Builder, FramePtr, CG); in maybeFreeRetconStorage()
307 bool InResume, CallGraph *CG) { in replaceFallthroughCoroEnd() argument
335 maybeFreeRetconStorage(Builder, Shape, FramePtr, CG); in replaceFallthroughCoroEnd()
374 maybeFreeRetconStorage(Builder, Shape, FramePtr, CG); in replaceFallthroughCoroEnd()
440 CallGraph *CG) { in replaceUnwindCoroEnd() argument
463 maybeFreeRetconStorage(Builder, Shape, FramePtr, CG); in replaceUnwindCoroEnd()
477 Value *FramePtr, bool InResume, CallGraph *CG) { in replaceCoroEnd() argument
479 replaceUnwindCoroEnd(End, Shape, FramePtr, InResume, CG); in replaceCoroEnd()
481 replaceFallthroughCoroEnd(End, Shape, FramePtr, InResume, CG); in replaceCoroEnd()
[all …]
/freebsd/contrib/llvm-project/clang/lib/Interpreter/
H A DIncrementalParser.cpp367 if (CodeGenerator *CG = getCodeGen()) { in GenModule() local
381 std::unique_ptr<llvm::Module> M(CG->ReleaseModule()); in GenModule()
382 CG->StartModule("incr_module_" + std::to_string(ID++), M->getContext()); in GenModule()
423 CodeGenerator *CG = getCodeGen(); in GetMangledName() local
424 assert(CG); in GetMangledName()
425 return CG->GetMangledName(GD); in GetMangledName()
/freebsd/contrib/llvm-project/llvm/include/llvm/Transforms/Coroutines/
H A DCoroSplit.h34 LazyCallGraph &CG, CGSCCUpdateResult &UR);
/freebsd/contrib/llvm-project/llvm/lib/Target/MSP430/
H A DMSP430RegisterInfo.td58 def CG : MSP430RegWithSubregs<3, "r3", [CGB], ["cg"]>, DwarfRegNum<[3]>;
87 PC, SP, SR, CG)>;

123