Home
last modified time | relevance | path

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

123

/freebsd/contrib/llvm-project/llvm/lib/Transforms/Utils/
H A DCallGraphUpdater.cpp31 if (CG) { in finalize()
36 CallGraphNode *DeadCGN = (*CG)[DeadFn]; in finalize()
90 if (CG) { in reanalyzeFunction()
93 CG->populateCallGraphNode(OldCGN); in reanalyzeFunction()
103 if (CG) in registerOutlinedFunction()
104 CG->addToCallGraph(&NewFn); in registerOutlinedFunction()
119 CallGraphNode *DeadCGN = (*CG)[&DeadFn]; in removeFunction()
130 if (CG) { in replaceFunctionWith()
132 CallGraphNode *OldCGN = (*CG)[&OldFn]; in replaceFunctionWith()
149 if (!CG) in replaceCallSite()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Analysis/
H A DCallGraphSCCPass.cpp73 bool doInitialization(CallGraph &CG);
74 bool doFinalization(CallGraph &CG);
127 Module &M = CG.getModule(); in RunPassOnSCC()
164 RefreshCallGraph(CurSCC, CG, true); in RunPassOnSCC()
358 CalleeNode = CG.getCallsExternalNode(); in RefreshCallGraph()
376 CalleeNode = CG.getCallsExternalNode(); in RefreshCallGraph()
503 bool Changed = doInitialization(CG); in runOnModule()
506 scc_iterator<CallGraph*> CGI = scc_begin(&CG); in runOnModule()
508 CallGraphSCC CurSCC(CG, &CGI); in runOnModule()
545 Changed |= doFinalization(CG); in runOnModule()
[all …]
H A DCallPrinter.cpp58 CallGraph *CG; member in llvm::CallGraphDOTInfo
65 CallGraphDOTInfo(Module *M, CallGraph *CG, in CallGraphDOTInfo() argument
67 : M(M), CG(CG), LookupBFI(LookupBFI) { in CallGraphDOTInfo()
88 CallGraph *getCallGraph() const { return CG; } in getCallGraph()
96 for (auto &I : (*CG)) { in removeParallelEdges()
233 CallGraph CG(M); in doCallGraphDOTPrinting() local
234 CallGraphDOTInfo CFGInfo(&M, &CG, LookupBFI); in doCallGraphDOTPrinting()
245 CallGraph CG(M); in viewCallGraph() local
246 CallGraphDOTInfo CFGInfo(&M, &CG, LookupBFI); in viewCallGraph()
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 DCGSCCPassManager.cpp142 LazyCallGraph &CG = AM.getResult<LazyCallGraphAnalysis>(M); in run() local
171 CG.buildRefSCCs(); in run()
173 llvm::make_early_inc_range(CG.postorder_ref_sccs())) { in run()
275 PreservedAnalyses PassPA = Pass->run(*C, CGAM, CG, UR); in run()
354 LazyCallGraph &CG, in run() argument
358 AM.getResult<PassInstrumentationAnalysis>(InitialC, CG); in run()
405 PreservedAnalyses PassPA = Pass->run(*C, AM, CG, UR); in run()
501 LazyCallGraph &CG, in run() argument
523 if (CG.lookupSCC(*N) != CurrentC) in run()
555 assert(CG.lookupSCC(*N) == CurrentC && in run()
[all …]
H A DGlobalsModRef.cpp468 void GlobalsAAResult::CollectSCCMembership(CallGraph &CG) { in CollectSCCMembership() argument
472 for (scc_iterator<CallGraph *> I = scc_begin(&CG); !I.isAtEnd(); ++I) { in CollectSCCMembership()
487 void GlobalsAAResult::AnalyzeCallGraph(CallGraph &CG, Module &M) { in AnalyzeCallGraph() argument
490 for (scc_iterator<CallGraph *> I = scc_begin(&CG); !I.isAtEnd(); ++I) { in AnalyzeCallGraph()
561 CallGraphNode *CalleeNode = CG[Callee]; in AnalyzeCallGraph()
971 CallGraph &CG) { in analyzeModule() argument
975 Result.CollectSCCMembership(CG); in analyzeModule()
981 Result.AnalyzeCallGraph(CG, M); in analyzeModule()
1001 auto &CG = AM.getResult<CallGraphAnalysis>(M); in run() local
1009 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.cpp131 CG(MAM.getResult<LazyCallGraphAnalysis>(M)), in MLInlineAdvisor()
152 auto Pos = FunctionLevels.find(&CG.get(*Called)); in MLInlineAdvisor()
165 FunctionLevels[&CG.get(*F)] = Level; in MLInlineAdvisor()
176 return CG.lookup(F) ? FunctionLevels.at(CG.lookup(F)) : 0; in getInitialFunctionLevel()
/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.cpp204 AM.getResult<ModuleAnalysisManagerCGSCCProxy>(InitialC, CG); in run()
212 AM.getResult<FunctionAnalysisManagerCGSCCProxy>(InitialC, CG) in run()
307 LazyCallGraph::Node &N = *CG.lookup(F); in run()
308 if (CG.lookupSCC(N) != C) in run()
345 LazyCallGraph::SCC *CalleeSCC = CG.lookupSCC(*CG.lookup(Callee)); in run()
423 CalleeSCC == CG.lookupSCC(CG.get(*NewCallee))) { in run()
442 !CG.isLibFunction(Callee)) { in run()
490 C = &updateCGAndAnalysisManagerForCGSCCPass(CG, *C, N, AM, UR, FAM); in run()
515 return CG.lookupSCC(*CG.lookup(*Callee)) == OldC; in run()
547 auto &DeadC = *CG.lookupSCC(*CG.lookup(*DeadF)); 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/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->begin(), &CGGetValuePtr);
527 static nodes_iterator nodes_end(const CallGraph *CG) {
528 return nodes_iterator(CG->end(), &CGGetValuePtr);
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);
485 LazyCallGraph &CG, CGSCCUpdateResult &UR);
572 LazyCallGraph &CG, CGSCCUpdateResult &UR);
/freebsd/contrib/llvm-project/llvm/include/llvm/Transforms/Utils/
H A DCallGraphUpdater.h43 CallGraph *CG = nullptr; variable
63 void initialize(CallGraph &CG, CallGraphSCC &SCC) { in initialize() argument
64 this->CG = &CG; in initialize()
/freebsd/contrib/llvm-project/clang/lib/StaticAnalyzer/Checkers/
H A DDebugCheckers.cpp215 CallGraph CG; in checkASTDecl() local
216 CG.addToCallGraph(const_cast<TranslationUnitDecl*>(TU)); in checkASTDecl()
217 CG.viewGraph(); in checkASTDecl()
239 CallGraph CG; in checkASTDecl() local
240 CG.addToCallGraph(const_cast<TranslationUnitDecl*>(TU)); in checkASTDecl()
241 CG.dump(); in checkASTDecl()
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Coroutines/
H A DCoroutines.cpp444 static void addCallToCallGraph(CallGraph *CG, CallInst *Call, Function *Callee){ in addCallToCallGraph() argument
445 if (CG) in addCallToCallGraph()
446 (*CG)[Call->getFunction()]->addCalledFunction(Call, (*CG)[Callee]); in addCallToCallGraph()
450 CallGraph *CG) const { in emitAlloc()
463 addCallToCallGraph(CG, Call, Alloc); in emitAlloc()
473 CallGraph *CG) const { in emitDealloc()
485 addCallToCallGraph(CG, Call, Dealloc); in emitDealloc()
H A DCoroSplit.cpp172 CallGraph *CG) { in maybeFreeRetconStorage() argument
178 Shape.emitDealloc(Builder, FramePtr, CG); in maybeFreeRetconStorage()
257 maybeFreeRetconStorage(Builder, Shape, FramePtr, CG); in replaceFallthroughCoroEnd()
295 maybeFreeRetconStorage(Builder, Shape, FramePtr, CG); in replaceFallthroughCoroEnd()
361 CallGraph *CG) { in replaceUnwindCoroEnd() argument
384 maybeFreeRetconStorage(Builder, Shape, FramePtr, CG); in replaceUnwindCoroEnd()
2091 CG.addSplitFunction(N.getFunction(), *Clone); in updateCallGraphAfterCoroutineSplit()
2156 replacePrepare(Prepare, CG, C); in replaceAllPrepares()
2201 replaceAllPrepares(PrepareFn, CG, C); in run()
2230 UR.CWorklist.insert(CG.lookupSCC(CG.get(*Clone))); in run()
[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()
407 CodeGenerator *CG = getCodeGen(); in GetMangledName() local
408 assert(CG); in GetMangledName()
409 return CG->GetMangledName(GD); in GetMangledName()
/freebsd/contrib/llvm-project/llvm/lib/Target/AMDGPU/
H A DAMDGPUAnnotateKernelFeatures.cpp40 bool doInitialization(CallGraph &CG) override;
128 bool AMDGPUAnnotateKernelFeatures::doInitialization(CallGraph &CG) { in doInitialization() argument
H A DAMDGPULowerModuleLDSPass.cpp337 static void getUsesOfLDSByFunction(CallGraph const &CG, Module &M, in getUsesOfLDSByFunction() argument
375 getUsesOfLDSByFunction(CG, M, direct_map_kernel, direct_map_function); in getTransitiveUsesOfLDS()
393 for (const CallGraphNode::CallRecord &R : *CG[F]) { in getTransitiveUsesOfLDS()
431 for (const CallGraphNode::CallRecord &R : *CG[F]) { in getTransitiveUsesOfLDS()
451 for (const CallGraphNode::CallRecord &R : *CG[&Func]) { in getTransitiveUsesOfLDS()
1035 SmallVector<Function *> Tmp({CG[KernelRoot]->getFunction()}); in removeNoLdsKernelIdFromReachable()
1045 for (auto &N : *CG[F]) { in removeNoLdsKernelIdFromReachable()
1057 for (auto &N : *CG.getExternalCallingNode()) { in removeNoLdsKernelIdFromReachable()
1136 CallGraph CG = CallGraph(M); in runOnModule() local
1145 LDSUsesInfoTy LDSUsesInfo = getTransitiveUsesOfLDS(CG, M); in runOnModule()
[all …]
/freebsd/contrib/llvm-project/llvm/include/llvm/Transforms/IPO/
H A DArgumentPromotion.h30 LazyCallGraph &CG, CGSCCUpdateResult &UR);
/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