|
|
reference, declaration → definition
definition → references, declarations, derived classes, virtual overrides
reference to multiple definitions → definitions
unreferenced
|
Derived Classes
include/llvm/IR/PassManagerInternal.h 137 template <typename T> struct Checker : CheckerBase, T {};
Declarations
include/llvm/Analysis/CallGraphSCCPass.h 29 class CallGraph;
include/llvm/Analysis/SyntheticCountsUtils.h 22 class CallGraph;
include/llvm/Transforms/IPO/Inliner.h 24 class CallGraph;
include/llvm/Transforms/IPO/Internalize.h 32 class CallGraph;
include/llvm/Transforms/Utils/Cloning.h 38 class CallGraph;
lib/Transforms/Coroutines/CoroInternal.h 20 class CallGraph;
References
include/llvm/Analysis/CallGraph.h 103 CallGraph(CallGraph &&Arg);
299 using Result = CallGraph;
304 CallGraph run(Module &M, ModuleAnalysisManager &) { return CallGraph(M); }
325 std::unique_ptr<CallGraph> G;
335 const CallGraph &getCallGraph() const { return *G; }
336 CallGraph &getCallGraph() { return *G; }
338 using iterator = CallGraph::iterator;
339 using const_iterator = CallGraph::const_iterator;
459 static NodeRef getEntryNode(CallGraph *CGN) {
469 mapped_iterator<CallGraph::iterator, decltype(&CGGetValuePtr)>;
471 static nodes_iterator nodes_begin(CallGraph *CG) {
475 static nodes_iterator nodes_end(CallGraph *CG) {
486 static NodeRef getEntryNode(const CallGraph *CGN) {
496 mapped_iterator<CallGraph::const_iterator, decltype(&CGGetValuePtr)>;
498 static nodes_iterator nodes_begin(const CallGraph *CG) {
502 static nodes_iterator nodes_end(const CallGraph *CG) {
include/llvm/Analysis/CallGraphSCCPass.h 48 virtual bool doInitialization(CallGraph &CG) {
63 virtual bool doFinalization(CallGraph &CG) {
88 const CallGraph &CG; // The call graph for this SCC.
93 CallGraphSCC(CallGraph &cg, void *context) : CG(cg), Context(context) {}
111 const CallGraph &getCallGraph() { return CG; }
include/llvm/Analysis/GlobalsModRef.h 86 CallGraph &CG);
112 void AnalyzeCallGraph(CallGraph &CG, Module &M);
118 void CollectSCCMembership(CallGraph &CG);
include/llvm/IR/PassManagerInternal.h 137 template <typename T> struct Checker : CheckerBase, T {};
139 static decltype(NonceFunction(&Checker<T>::invalidate)) check(rank<1>);
147 enum { Value = sizeof(check<ResultT>(rank<2>())) == sizeof(EnabledType) };
169 explicit AnalysisResultModel(ResultT Result) : Result(std::move(Result)) {}
198 ResultT Result;
include/llvm/Transforms/IPO/Attributor.h 602 CallGraph *CG = AG.getAnalysis<CallGraphAnalysis>(M);
607 for (scc_iterator<CallGraph *> I = scc_begin(CG); !I.isAtEnd(); ++I) {
include/llvm/Transforms/IPO/Inliner.h 39 bool doInitialization(CallGraph &CG) override;
49 bool doFinalization(CallGraph &CG) override;
62 bool removeDeadFunctions(CallGraph &CG, bool AlwaysInlineOnly = false);
include/llvm/Transforms/IPO/Internalize.h 63 bool internalizeModule(Module &TheModule, CallGraph *CG = nullptr);
72 CallGraph *CG = nullptr) {
include/llvm/Transforms/Utils/Cloning.h 175 explicit InlineFunctionInfo(CallGraph *cg = nullptr,
186 CallGraph *CG;
lib/Analysis/CallGraph.cpp 38 CallGraph::CallGraph(CallGraph &&Arg)
272 G.reset(new CallGraph(M));
lib/Analysis/CallGraphSCCPass.cpp 69 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,
201 bool CGPassManager::RefreshCallGraph(const CallGraphSCC &CurSCC, CallGraph &CG,
403 bool CGPassManager::RunAllPassesOnSCC(CallGraphSCC &CurSCC, CallGraph &CG,
464 CallGraph &CG = getAnalysis<CallGraphWrapperPass>().getCallGraph();
468 scc_iterator<CallGraph*> CGI = scc_begin(&CG);
512 bool CGPassManager::doInitialization(CallGraph &CG) {
527 bool CGPassManager::doFinalization(CallGraph &CG) {
558 scc_iterator<CallGraph*> *CGI = (scc_iterator<CallGraph*>*)Context;
lib/Analysis/CallPrinter.cpp 27 static std::string getGraphName(CallGraph *Graph) { return "Call graph"; }
29 std::string getNodeLabel(CallGraphNode *Node, CallGraph *Graph) {
38 static CallGraph *getGraph(CallGraphWrapperPass *P) {
48 : public DOTGraphTraitsModuleViewer<CallGraphWrapperPass, true, CallGraph *,
61 CallGraphWrapperPass, true, CallGraph *,
lib/Analysis/GlobalsModRef.cpp 467 void GlobalsAAResult::CollectSCCMembership(CallGraph &CG) {
471 for (scc_iterator<CallGraph *> I = scc_begin(&CG); !I.isAtEnd(); ++I) {
486 void GlobalsAAResult::AnalyzeCallGraph(CallGraph &CG, Module &M) {
489 for (scc_iterator<CallGraph *> I = scc_begin(&CG); !I.isAtEnd(); ++I) {
965 CallGraph &CG) {
lib/Target/AMDGPU/AMDGPUAnnotateKernelFeatures.cpp 59 bool doInitialization(CallGraph &CG) override;
365 bool AMDGPUAnnotateKernelFeatures::doInitialization(CallGraph &CG) {
lib/Transforms/Coroutines/CoroInternal.h 51 CallGraph &CG, CallGraphSCC &SCC);
226 Value *emitAlloc(IRBuilder<> &Builder, Value *Size, CallGraph *CG) const;
231 void emitDealloc(IRBuilder<> &Builder, Value *Ptr, CallGraph *CG) const;
lib/Transforms/Coroutines/CoroSplit.cpp 161 Value *FramePtr, CallGraph *CG) {
173 CallGraph *CG) {
222 Value *FramePtr, bool InResume, CallGraph *CG){
249 Value *FramePtr, bool InResume, CallGraph *CG) {
784 static void removeCoroEnds(coro::Shape &Shape, CallGraph *CG) {
1343 static void splitCoroutine(Function &F, CallGraph &CG, CallGraphSCC &SCC) {
1382 static void prepareForSplit(Function &F, CallGraph &CG) {
1413 static void createDevirtTriggerFunc(CallGraph &CG, CallGraphSCC &SCC) {
1436 static void replacePrepare(CallInst *Prepare, CallGraph &CG) {
1496 static bool replaceAllPrepares(Function *PrepareFn, CallGraph &CG) {
1526 bool doInitialization(CallGraph &CG) override {
1553 CallGraph &CG = getAnalysis<CallGraphWrapperPass>().getCallGraph();
lib/Transforms/Coroutines/Coroutines.cpp 188 static void buildCGN(CallGraph &CG, CallGraphNode *Node) {
208 CallGraph &CG, CallGraphSCC &SCC) {
493 static void addCallToCallGraph(CallGraph *CG, CallInst *Call, Function *Callee){
499 CallGraph *CG) const {
520 CallGraph *CG) const {
lib/Transforms/IPO/ArgumentPromotion.cpp 1092 bool doInitialization(CallGraph &CG) override;
1122 CallGraph &CG = getAnalysis<CallGraphWrapperPass>().getCallGraph();
1172 bool ArgPromotion::doInitialization(CallGraph &CG) {
lib/Transforms/IPO/FunctionAttrs.cpp 1584 static bool deduceFunctionAttributeInRPO(Module &M, CallGraph &CG) {
1593 for (scc_iterator<CallGraph *> I = scc_begin(&CG); !I.isAtEnd(); ++I) {
1614 auto &CG = getAnalysis<CallGraphWrapperPass>().getCallGraph();
1621 auto &CG = AM.getResult<CallGraphAnalysis>(M);
lib/Transforms/IPO/Inliner.cpp 495 bool LegacyInlinerBase::doInitialization(CallGraph &CG) {
528 inlineCallsImpl(CallGraphSCC &SCC, CallGraph &CG,
759 CallGraph &CG = getAnalysis<CallGraphWrapperPass>().getCallGraph();
776 bool LegacyInlinerBase::doFinalization(CallGraph &CG) {
784 bool LegacyInlinerBase::removeDeadFunctions(CallGraph &CG,
lib/Transforms/IPO/Internalize.cpp 149 bool InternalizePass::internalizeModule(Module &M, CallGraph *CG) {
268 CallGraph *CG = CGPass ? &CGPass->getCallGraph() : nullptr;
lib/Transforms/IPO/PruneEH.cpp 50 static bool SimplifyFunction(Function *F, CallGraph &CG);
51 static void DeleteBasicBlock(BasicBlock *BB, CallGraph &CG);
62 static bool runImpl(CallGraphSCC &SCC, CallGraph &CG) {
180 CallGraph &CG = getAnalysis<CallGraphWrapperPass>().getCallGraph();
188 static bool SimplifyFunction(Function *F, CallGraph &CG) {
231 static void DeleteBasicBlock(BasicBlock *BB, CallGraph &CG) {
lib/Transforms/IPO/SyntheticCountsPropagation.cpp 128 CallGraph CG(M);
130 SyntheticCountsUtils<const CallGraph *>::propagate(
lib/Transforms/Utils/InlineFunction.cpp 1183 CallGraph &CG = *IFI.CG;
tools/opt/PrintSCC.cpp 93 CallGraph &CG = getAnalysis<CallGraphWrapperPass>().getCallGraph();
96 for (scc_iterator<CallGraph*> SCCI = scc_begin(&CG); !SCCI.isAtEnd();
tools/polly/lib/Transform/ScopInliner.cpp 37 bool doInitialization(CallGraph &CG) override {
unittests/Analysis/CallGraphTest.cpp 18 template <typename Ty> void canSpecializeGraphTraitsIterators(Ty *G) {
19 typedef typename GraphTraits<Ty *>::NodeRef NodeRef;
21 auto I = GraphTraits<Ty *>::nodes_begin(G);
22 auto E = GraphTraits<Ty *>::nodes_end(G);
33 NodeRef N = GraphTraits<Ty *>::getEntryNode(G);
48 CallGraph CG(M);
56 CallGraph CG(M);
unittests/Analysis/GlobalsModRefTest.cpp 48 llvm::CallGraph CG(*M);
usr/include/c++/7.4.0/bits/move.h 72 constexpr _Tp&&
73 forward(typename std::remove_reference<_Tp>::type& __t) noexcept
83 constexpr _Tp&&
84 forward(typename std::remove_reference<_Tp>::type&& __t) noexcept
98 move(_Tp&& __t) noexcept
usr/include/c++/7.4.0/bits/unique_ptr.h 68 default_delete(const default_delete<_Up>&) noexcept { }
72 operator()(_Tp* __ptr) const
74 static_assert(!is_void<_Tp>::value,
76 static_assert(sizeof(_Tp)>0,
122 using type = _Up*;
137 using pointer = typename _Ptr<_Tp, _Dp>::type;
161 typename __uniq_ptr_impl<_Tp, _Up>::_DeleterConstraint::type;
163 __uniq_ptr_impl<_Tp, _Dp> _M_t;
166 using pointer = typename __uniq_ptr_impl<_Tp, _Dp>::pointer;
167 using element_type = _Tp;
825 { return unique_ptr<_Tp>(new _Tp(std::forward<_Args>(__args)...)); }
usr/include/c++/7.4.0/type_traits 215 : public __is_void_helper<typename remove_cv<_Tp>::type>::type
581 : public __or_<is_lvalue_reference<_Tp>,
582 is_rvalue_reference<_Tp>>::type
601 : public __not_<__or_<is_function<_Tp>, is_reference<_Tp>,
601 : public __not_<__or_<is_function<_Tp>, is_reference<_Tp>,
602 is_void<_Tp>>>::type
638 : public __or_<is_object<_Tp>, is_reference<_Tp>>::type
638 : public __or_<is_object<_Tp>, is_reference<_Tp>>::type
1554 { typedef _Tp type; };
1563 { typedef _Tp type; };
1574 remove_const<typename remove_volatile<_Tp>::type>::type type;
1629 { typedef _Tp type; };
1633 { typedef _Tp type; };
1645 { typedef _Tp& type; };
1650 : public __add_lvalue_reference_helper<_Tp>
1659 { typedef _Tp&& type; };
1664 : public __add_rvalue_reference_helper<_Tp>
2253 inline typename add_rvalue_reference<_Tp>::type