Home
last modified time | relevance | path

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

12345

/llvm-project-15.0.7/llvm/unittests/Analysis/
H A DLazyCallGraphTest.cpp226 return CG; in buildCG()
237 auto I = CG.begin(); in TEST()
322 CG.buildRefSCCs(); in TEST()
473 CG.buildRefSCCs(); in TEST()
558 CG.buildRefSCCs(); in TEST()
609 CG.buildRefSCCs(); in TEST()
755 CG.buildRefSCCs(); in TEST()
847 CG.buildRefSCCs(); in TEST()
954 CG.buildRefSCCs(); in TEST()
1031 CG.buildRefSCCs(); in TEST()
[all …]
H A DCGSCCPassManagerTest.cpp167 return Func(C, AM, CG, UR); in run()
885 LazyCallGraph &CG) { in run()
941 LazyCallGraph &CG) { in run()
999 const LazyCallGraph &CG = in run() local
1006 *CGAM.getCachedResult<TestSCCAnalysis>(*CG.lookupSCC(*CG.lookup(F))); in run()
1328 Func(C, AM, CG, UR); in run()
1500 CGU.initialize(CG, C, AM, UR); in TEST_F()
1535 CGU.initialize(CG, C, AM, UR); in TEST_F()
1773 CG.addSplitFunction(F, *G); in TEST_F()
1835 CG.addSplitFunction(F, *G1); in TEST_F()
[all …]
H A DCallGraphTest.cpp48 CallGraph CG(M); in TEST() local
50 canSpecializeGraphTraitsIterators(&CG); in TEST()
56 CallGraph CG(M); in TEST() local
58 canSpecializeGraphTraitsIterators(const_cast<const CallGraph *>(&CG)); in TEST()
/llvm-project-15.0.7/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()
128 if (CG) { in replaceFunctionWith()
130 CallGraphNode *OldCGN = (*CG)[&OldFn]; in replaceFunctionWith()
147 if (!CG) in replaceCallSite()
[all …]
/llvm-project-15.0.7/llvm/lib/Analysis/
H A DCallGraphSCCPass.cpp72 bool doInitialization(CallGraph &CG);
73 bool doFinalization(CallGraph &CG);
126 Module &M = CG.getModule(); in RunPassOnSCC()
163 RefreshCallGraph(CurSCC, CG, true); in RunPassOnSCC()
365 CalleeNode = CG.getCallsExternalNode(); in RefreshCallGraph()
383 CalleeNode = CG.getCallsExternalNode(); in RefreshCallGraph()
510 bool Changed = doInitialization(CG); in runOnModule()
513 scc_iterator<CallGraph*> CGI = scc_begin(&CG); in runOnModule()
515 CallGraphSCC CurSCC(CG, &CGI); in runOnModule()
552 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()
/llvm-project-15.0.7/lldb/test/API/lang/c/blocks/
H A Dmain.c3 struct CG {int x; int y;}; struct
5 int g(int (^callback)(struct CG)) {
6 struct CG cg = {.x=1,.y=2};
13 int h(struct CG cg){return 42;} in h()
32 int (^add_struct)(struct CG) = ^int(struct CG cg) in main()
/llvm-project-15.0.7/llvm/lib/Transforms/IPO/
H A DInliner.cpp498 CG[Caller]->removeCallEdgeFor(CB); in inlineCallsImpl()
619 return removeDeadFunctions(CG); in doFinalization()
643 for (const auto &I : CG) { in removeDeadFunctions()
680 RemoveCGN(CG[F]); in removeDeadFunctions()
850 if (CG.lookupSCC(N) != C) { in run()
886 LazyCallGraph::SCC *CalleeSCC = CG.lookupSCC(*CG.lookup(Callee)); in run()
963 CalleeSCC == CG.lookupSCC(CG.get(*NewCallee))) { in run()
985 !CG.isLibFunction(Callee)) { in run()
1050 return CG.lookupSCC(*CG.lookup(*Callee)) == OldC; in run()
1082 auto &DeadC = *CG.lookupSCC(*CG.lookup(*DeadF)); in run()
[all …]
H A DInternalize.cpp186 bool InternalizePass::internalizeModule(Module &M, CallGraph *CG) { in internalizeModule() argument
188 CallGraphNode *ExternalNode = CG ? CG->getExternalCallingNode() : nullptr; in internalizeModule()
247 ExternalNode->removeOneAbstractEdgeTo((*CG)[&I]); in internalizeModule()
309 CallGraph *CG = CGPass ? &CGPass->getCallGraph() : nullptr; in runOnModule() local
310 return internalizeModule(M, MustPreserveGV, CG); in runOnModule()
/llvm-project-15.0.7/clang/test/Modules/
H A Dcodegen-flags.test7 …4-linux-gnu -emit-llvm -debug-info-kind=limited -o - %t/foo-cg.pcm | FileCheck --check-prefix=CG %s
10 …es -fmodule-file=%t/foo-cg.pcm %S/Inputs/codegen-flags/use.cpp | FileCheck --check-prefix=CG-USE %s
13 CG: define weak_odr void @_Z2f1v
14 CG: DICompileUnit
15 CG-NOT: DICompositeType
17 CG-USE: declare void @_Z2f1v
18 CG-USE: DICompileUnit
19 CG-USE: distinct !DICompositeType(tag: DW_TAG_structure_type, name: "foo"
/llvm-project-15.0.7/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(); }
/llvm-project-15.0.7/bolt/include/bolt/Passes/
H A DCallGraphWalker.h25 BinaryFunctionCallGraph &CG; variable
40 CallGraphWalker(BinaryFunctionCallGraph &CG) : CG(CG) {} in CallGraphWalker() argument
/llvm-project-15.0.7/lld/test/ELF/
H A Dcgprofile-obj.s7 # RUN: llvm-nm --no-sort %t | FileCheck %s --check-prefix=NO-CG
41 # NO-CG: 0000000000201120 t D
42 # NO-CG: 0000000000201121 T C
43 # NO-CG: 0000000000201122 T B
44 # NO-CG: 0000000000201123 T A
H A Dcgprofile-rela.test9 # RUN: llvm-nm --no-sort %t | FileCheck %s --check-prefix=NO-CG
17 # NO-CG: 0000000000201120 t D
18 # NO-CG: 0000000000201122 t C
19 # NO-CG: 0000000000201124 t B
20 # NO-CG: 0000000000201126 t A
21 # NO-CG: 0000000000201128 T _start
/llvm-project-15.0.7/lld/test/MachO/
H A Dcgprofile-obj.s7 # RUN: llvm-nm --numeric-sort %t.out | FileCheck %s --check-prefix=NO-CG
39 # NO-CG: 00000001000002c8 t D
40 # NO-CG: 00000001000002c9 T C
41 # NO-CG: 00000001000002ca T B
42 # NO-CG: 00000001000002cb T A
/llvm-project-15.0.7/lld/test/COFF/
H A Dcgprofile-obj.s7 # RUN: llvm-nm --numeric-sort %t3 | FileCheck %s --check-prefix=NO-CG
42 # NO-CG: 140001000 t D
43 # NO-CG: 140001001 T C
44 # NO-CG: 140001002 T B
45 # NO-CG: 140001003 T A
/llvm-project-15.0.7/llvm/include/llvm/Analysis/
H A DCallGraph.h184 inline CallGraphNode(CallGraph *CG, Function *F) : CG(CG), F(F) {} in CallGraphNode() argument
283 CallGraph *CG; variable
483 static nodes_iterator nodes_begin(CallGraph *CG) {
484 return nodes_iterator(CG->begin(), &CGGetValuePtr);
487 static nodes_iterator nodes_end(CallGraph *CG) {
488 return nodes_iterator(CG->end(), &CGGetValuePtr);
510 static nodes_iterator nodes_begin(const CallGraph *CG) {
511 return nodes_iterator(CG->begin(), &CGGetValuePtr);
514 static nodes_iterator nodes_end(const CallGraph *CG) {
515 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()
/llvm-project-15.0.7/bolt/lib/Passes/
H A DCallGraphWalker.cpp50 for (CallGraph::NodeId CallerID : CG.predecessors(CG.getNodeId(Func))) { in traverseCG()
51 BinaryFunction *CallerFunc = CG.nodeIdToFunc(CallerID); in traverseCG()
62 TopologicalCGOrder = CG.buildTraversalOrder(); in walk()
/llvm-project-15.0.7/llvm/tools/lto/
H A Dlto.cpp150 LTOCodeGenerator *CG = unwrap(cg); in DEFINE_SIMPLE_CONVERSION_FUNCTIONS() local
151 CG->setAttrs(codegen::getMAttrs()); in DEFINE_SIMPLE_CONVERSION_FUNCTIONS()
155 CG->setOptLevel(OptLevel - '0'); in DEFINE_SIMPLE_CONVERSION_FUNCTIONS()
156 CG->setFreestanding(EnableFreestanding); in DEFINE_SIMPLE_CONVERSION_FUNCTIONS()
157 CG->setDisableVerify(DisableVerify); in DEFINE_SIMPLE_CONVERSION_FUNCTIONS()
438 LibLTOCodeGenerator *CG = unwrap(cg); in lto_codegen_compile() local
439 CG->NativeObjectFile = CG->compile(); in lto_codegen_compile()
440 if (!CG->NativeObjectFile) in lto_codegen_compile()
453 LibLTOCodeGenerator *CG = unwrap(cg); in lto_codegen_compile_optimized() local
454 CG->NativeObjectFile = CG->compileOptimized(); in lto_codegen_compile_optimized()
[all …]
/llvm-project-15.0.7/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()
/llvm-project-15.0.7/llvm/include/llvm/Transforms/IPO/
H A DInliner.h40 bool doInitialization(CallGraph &CG) override;
50 bool doFinalization(CallGraph &CG) override;
63 bool removeDeadFunctions(CallGraph &CG, bool AlwaysInlineOnly = false);
104 LazyCallGraph &CG, CGSCCUpdateResult &UR);
H A DInternalize.h72 bool internalizeModule(Module &TheModule, CallGraph *CG = nullptr);
81 CallGraph *CG = nullptr) {
83 .internalizeModule(TheModule, CG);
/llvm-project-15.0.7/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()
/llvm-project-15.0.7/llvm/test/Other/
H A Dnew-pass-manager.ll180 ; CHECK-INVALIDATE-ALL-CG: Running pass: RequireAnalysisPass
181 ; CHECK-INVALIDATE-ALL-CG: Running analysis: NoOpModuleAnalysis
182 ; CHECK-INVALIDATE-ALL-CG: Running pass: RequireAnalysisPass
184 ; CHECK-INVALIDATE-ALL-CG: Running pass: RequireAnalysisPass
185 ; CHECK-INVALIDATE-ALL-CG: Running analysis: NoOpCGSCCAnalysis
186 ; CHECK-INVALIDATE-ALL-CG: Running pass: RequireAnalysisPass
190 ; CHECK-INVALIDATE-ALL-CG: Running pass: RequireAnalysisPass
194 ; CHECK-INVALIDATE-ALL-CG: Running pass: RequireAnalysisPass
195 ; CHECK-INVALIDATE-ALL-CG: Running analysis: NoOpCGSCCAnalysis
198 ; CHECK-INVALIDATE-ALL-CG: Running pass: RequireAnalysisPass
[all …]

12345