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

12

/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/Transforms/IPO/
H A DInternalize.h61 /// If the CallGraph \p CG is supplied, it will be updated when
63 bool internalizeModule(Module &TheModule, CallGraph *CG = nullptr);
72 CallGraph *CG = nullptr) {
74 .internalizeModule(TheModule, CG);
H A DArgumentPromotion.h30 LazyCallGraph &CG, CGSCCUpdateResult &UR);
H A DInliner.h39 bool doInitialization(CallGraph &CG) override;
49 bool doFinalization(CallGraph &CG) override;
62 bool removeDeadFunctions(CallGraph &CG, bool AlwaysInlineOnly = false);
104 LazyCallGraph &CG, CGSCCUpdateResult &UR);
H A DFunctionAttrs.h52 LazyCallGraph &CG, CGSCCUpdateResult &UR);
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DCallGraphSCCPass.h48 virtual bool doInitialization(CallGraph &CG) { argument
63 virtual bool doFinalization(CallGraph &CG) { argument
88 const CallGraph &CG; // The call graph for this SCC. member in class:llvm::CallGraphSCC
93 CallGraphSCC(CallGraph &cg, void *context) : CG(cg), Context(context) {}
111 const CallGraph &getCallGraph() { return CG; }
H A DGlobalsModRef.h89 CallGraph &CG);
115 void AnalyzeCallGraph(CallGraph &CG, Module &M);
121 void CollectSCCMembership(CallGraph &CG);
H A DSyntheticCountsUtils.h43 static void propagate(const CallGraphType &CG, GetProfCountTy GetProfCount,
H A DCGSCCPassManager.h160 LazyCallGraph &CG, CGSCCUpdateResult &) {
161 (void)AM.template getResult<AnalysisT>(C, CG);
227 /// update result struct and use it to reflect the results of any CG updates
298 /// (changing both the CG structure and the function IR itself). However,
312 /// infinite inlining. See the comments in the inliner's CG update logic.
415 /// including returning whether any changes were made and populating a CG
456 LazyCallGraph &CG, CGSCCUpdateResult &UR) {
459 AM.getResult<FunctionAnalysisManagerCGSCCProxy>(C, CG).getManager();
478 if (CG.lookupSCC(*N) != CurrentC)
505 CurrentC = &updateCGAndAnalysisManagerForFunctionPass(CG, *Current
159 run(LazyCallGraph::SCC &C, CGSCCAnalysisManager &AM, LazyCallGraph &CG, CGSCCUpdateResult &) argument
455 run(LazyCallGraph::SCC &C, CGSCCAnalysisManager &AM, LazyCallGraph &CG, CGSCCUpdateResult &UR) argument
561 run(LazyCallGraph::SCC &InitialC, CGSCCAnalysisManager &AM, LazyCallGraph &CG, CGSCCUpdateResult &UR) argument
742 LazyCallGraph &CG = AM.getResult<LazyCallGraphAnalysis>(M); local
[all...]
H A DCallGraph.h471 static nodes_iterator nodes_begin(CallGraph *CG) { argument
472 return nodes_iterator(CG->begin(), &CGGetValuePtr);
475 static nodes_iterator nodes_end(CallGraph *CG) { argument
476 return nodes_iterator(CG->end(), &CGGetValuePtr);
498 static nodes_iterator nodes_begin(const CallGraph *CG) { argument
499 return nodes_iterator(CG->begin(), &CGGetValuePtr);
502 static nodes_iterator nodes_end(const CallGraph *CG) { argument
503 return nodes_iterator(CG->end(), &CGGetValuePtr);
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/IPO/
H A DPruneEH.cpp51 static bool SimplifyFunction(Function *F, CallGraph &CG);
52 static void DeleteBasicBlock(BasicBlock *BB, CallGraph &CG);
63 static bool runImpl(CallGraphSCC &SCC, CallGraph &CG) { argument
76 MadeChange |= SimplifyFunction(F, CG);
128 CallGraphNode *CalleeNode = CG[Callee];
171 MadeChange |= SimplifyFunction(F, CG);
181 CallGraph &CG = getAnalysis<CallGraphWrapperPass>().getCallGraph();
182 return runImpl(SCC, CG);
189 static bool SimplifyFunction(Function *F, CallGraph &CG) { argument
199 DeleteBasicBlock(UnwindBlock, CG); // Delet
232 DeleteBasicBlock(BasicBlock *BB, CallGraph &CG) argument
[all...]
H A DInliner.cpp495 bool LegacyInlinerBase::doInitialization(CallGraph &CG) { argument
497 ImportedFunctionsStats.setModuleInfo(CG.getModule());
528 inlineCallsImpl(CallGraphSCC &SCC, CallGraph &CG, argument
607 InlineFunctionInfo InlineInfo(&CG, &GetAssumptionCache, PSI);
676 CG[Caller]->removeCallEdgeFor(*cast<CallBase>(CS.getInstruction()));
725 CG[Callee]->getNumReferences() == 0) {
728 CallGraphNode *CalleeNode = CG[Callee];
734 delete CG.removeFunctionFromModule(CalleeNode);
759 CallGraph &CG = getAnalysis<CallGraphWrapperPass>().getCallGraph(); local
769 SCC, CG, GetAssumptionCach
[all...]
H A DInternalize.cpp150 bool InternalizePass::internalizeModule(Module &M, CallGraph *CG) { argument
152 CallGraphNode *ExternalNode = CG ? CG->getExternalCallingNode() : nullptr;
189 ExternalNode->removeOneAbstractEdgeTo((*CG)[&I]);
269 CallGraph *CG = CGPass ? &CGPass->getCallGraph() : nullptr; variable
270 return internalizeModule(M, MustPreserveGV, CG);
H A DSyntheticCountsPropagation.cpp128 CallGraph CG(M);
131 &CG, GetCallSiteProfCount, [&](const CallGraphNode *N, Scaled64 New) {
H A DAlwaysInliner.cpp122 bool doFinalization(CallGraph &CG) override {
123 return removeDeadFunctions(CG, /*AlwaysInlineOnly=*/true);
H A DArgumentPromotion.cpp1023 LazyCallGraph &CG,
1035 AM.getResult<FunctionAnalysisManagerCGSCCProxy>(C, CG).getManager();
1093 bool doInitialization(CallGraph &CG) override;
1123 CallGraph &CG = getAnalysis<CallGraphWrapperPass>().getCallGraph();
1141 CG.getOrInsertFunction(NewCS.getCalledFunction());
1142 CallGraphNode *CallerNode = CG[Caller];
1155 CallGraphNode *NewNode = CG.getOrInsertFunction(NewF);
1158 delete CG.removeFunctionFromModule(OldNode);
1173 bool ArgPromotion::doInitialization(CallGraph &CG) { argument
1174 return CallGraphSCCPass::doInitialization(CG);
1021 run(LazyCallGraph::SCC &C, CGSCCAnalysisManager &AM, LazyCallGraph &CG, CGSCCUpdateResult &UR) argument
[all...]
/freebsd-11-stable/contrib/llvm-project/clang/include/clang/Analysis/
H A DCallGraph.h220 static nodes_iterator nodes_begin(clang::CallGraph *CG) { argument
221 return nodes_iterator(CG->begin(), &CGGetValue);
224 static nodes_iterator nodes_end (clang::CallGraph *CG) { argument
225 return nodes_iterator(CG->end(), &CGGetValue);
228 static unsigned size(clang::CallGraph *CG) { return CG->size(); } argument
246 static nodes_iterator nodes_begin(const clang::CallGraph *CG) { argument
247 return nodes_iterator(CG->begin(), &CGGetValue);
250 static nodes_iterator nodes_end(const clang::CallGraph *CG) { argument
251 return nodes_iterator(CG
254 size(const clang::CallGraph *CG) argument
[all...]
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Analysis/
H A DCallGraphSCCPass.cpp69 bool doInitialization(CallGraph &CG);
70 bool doFinalization(CallGraph &CG);
104 bool RunAllPassesOnSCC(CallGraphSCC &CurSCC, CallGraph &CG,
108 CallGraph &CG, bool &CallGraphUpToDate,
110 bool RefreshCallGraph(const CallGraphSCC &CurSCC, CallGraph &CG,
119 CallGraph &CG, bool &CallGraphUpToDate,
123 Module &M = CG.getModule();
128 DevirtualizedCall |= RefreshCallGraph(CurSCC, CG, false);
160 RefreshCallGraph(CurSCC, CG, true);
201 bool CGPassManager::RefreshCallGraph(const CallGraphSCC &CurSCC, CallGraph &CG, argument
403 RunAllPassesOnSCC(CallGraphSCC &CurSCC, CallGraph &CG, bool &DevirtualizedCall) argument
464 CallGraph &CG = getAnalysis<CallGraphWrapperPass>().getCallGraph(); local
512 doInitialization(CallGraph &CG) argument
527 doFinalization(CallGraph &CG) argument
[all...]
H A DSyntheticCountsUtils.cpp78 /// Propgate synthetic entry counts on a callgraph \p CG.
87 void SyntheticCountsUtils<CallGraphType>::propagate(const CallGraphType &CG, argument
93 for (auto I = scc_begin(CG); !I.isAtEnd(); ++I)
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/Coroutines/
H A DCoroutines.cpp189 static void buildCGN(CallGraph &CG, CallGraphNode *Node) { argument
200 Node->addCalledFunction(Call, CG.getCallsExternalNode());
202 Node->addCalledFunction(Call, CG.getOrInsertFunction(Callee));
209 CallGraph &CG, CallGraphSCC &SCC) {
211 auto *ParentNode = CG[&ParentFunc];
213 buildCGN(CG, ParentNode);
218 CallGraphNode *Callee = CG.getOrInsertFunction(F);
220 buildCGN(CG, Callee);
494 static void addCallToCallGraph(CallGraph *CG, CallInst *Call, Function *Callee){ argument
495 if (CG)
208 updateCallGraph(Function &ParentFunc, ArrayRef<Function *> NewFuncs, CallGraph &CG, CallGraphSCC &SCC) argument
[all...]
H A DCoroSplit.cpp163 CallGraph *CG) {
169 Shape.emitDealloc(Builder, FramePtr, CG);
175 bool InResume, CallGraph *CG) {
193 maybeFreeRetconStorage(Builder, Shape, FramePtr, CG);
200 maybeFreeRetconStorage(Builder, Shape, FramePtr, CG);
224 Value *FramePtr, bool InResume, CallGraph *CG){
237 maybeFreeRetconStorage(Builder, Shape, FramePtr, CG);
251 Value *FramePtr, bool InResume, CallGraph *CG) {
253 replaceUnwindCoroEnd(End, Shape, FramePtr, InResume, CG);
255 replaceFallthroughCoroEnd(End, Shape, FramePtr, InResume, CG);
161 maybeFreeRetconStorage(IRBuilder< &Builder, const coro::Shape &Shape, Value *FramePtr, CallGraph *CG) argument
173 replaceFallthroughCoroEnd(CoroEndInst *End, const coro::Shape &Shape, Value *FramePtr, bool InResume, CallGraph *CG) argument
223 replaceUnwindCoroEnd(CoroEndInst *End, const coro::Shape &Shape, Value *FramePtr, bool InResume, CallGraph *CG) argument
250 replaceCoroEnd(CoroEndInst *End, const coro::Shape &Shape, Value *FramePtr, bool InResume, CallGraph *CG) argument
786 removeCoroEnds(const coro::Shape &Shape, CallGraph *CG) argument
1360 splitCoroutine(Function &F, CallGraph &CG, CallGraphSCC &SCC) argument
1399 prepareForSplit(Function &F, CallGraph &CG) argument
1431 createDevirtTriggerFunc(CallGraph &CG, CallGraphSCC &SCC) argument
1454 replacePrepare(CallInst *Prepare, CallGraph &CG) argument
1514 replaceAllPrepares(Function *PrepareFn, CallGraph &CG) argument
[all...]
H A DCoroInternal.h52 CallGraph &CG, CallGraphSCC &SCC);
226 /// \param CG - if non-null, will be updated for the new call
227 Value *emitAlloc(IRBuilder<> &Builder, Value *Size, CallGraph *CG) const;
231 /// \param CG - if non-null, will be updated for the new call
232 void emitDealloc(IRBuilder<> &Builder, Value *Ptr, CallGraph *CG) const;
/freebsd-11-stable/contrib/llvm-project/llvm/tools/opt/
H A DPrintSCC.cpp93 CallGraph &CG = getAnalysis<CallGraphWrapperPass>().getCallGraph(); local
96 for (scc_iterator<CallGraph*> SCCI = scc_begin(&CG); !SCCI.isAtEnd();
/freebsd-11-stable/contrib/llvm-project/clang/lib/StaticAnalyzer/Checkers/
H A DDebugCheckers.cpp215 CallGraph CG; local
216 CG.addToCallGraph(const_cast<TranslationUnitDecl*>(TU));
217 CG.viewGraph();
239 CallGraph CG; local
240 CG.addToCallGraph(const_cast<TranslationUnitDecl*>(TU));
241 CG.dump();
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/Transforms/Utils/
H A DCloning.h181 : CG(cg), GetAssumptionCache(GetAssumptionCache), PSI(PSI),
186 CallGraph *CG; member in class:llvm::InlineFunctionInfo
196 /// callee. This is only filled in if CG is non-null.
202 /// only if CG is null. If CG is non-null, instead the value handle
/freebsd-11-stable/contrib/llvm-project/clang/lib/Analysis/
H A DCallGraph.cpp267 const CallGraph *CG) {
268 if (CG->getRoot() == Node) {
266 getNodeLabel(const CallGraphNode *Node, const CallGraph *CG) argument

Completed in 487 milliseconds

12