HomeSort by: relevance | last modified time | path
    Searched defs:CG (Results 1 - 19 of 19) sorted by relevancy

  /src/external/apache2/llvm/dist/llvm/tools/opt/
PrintSCC.cpp 94 CallGraph &CG = getAnalysis<CallGraphWrapperPass>().getCallGraph();
97 for (scc_iterator<CallGraph*> SCCI = scc_begin(&CG); !SCCI.isAtEnd();
  /src/external/apache2/llvm/dist/llvm/include/llvm/Transforms/Utils/
CallGraphUpdater.h 42 CallGraph *CG = nullptr;
62 void initialize(CallGraph &CG, CallGraphSCC &SCC) {
63 this->CG = &CG;
77 /// Finalizer that will trigger actions like function removal from the CG.
Cloning.h 196 CallGraph *cg = nullptr,
201 : CG(cg), GetAssumptionCache(GetAssumptionCache), PSI(PSI),
207 CallGraph *CG;
217 /// callee. This is only filled in if CG is non-null.
223 /// only if CG is null. If CG is non-null, instead the value handle
  /src/external/apache2/llvm/dist/llvm/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) {}
115 const CallGraph &getCallGraph() { return CG; }
MLInlineAdvisor.h 29 CallGraph *callGraph() const { return CG.get(); }
58 std::unique_ptr<CallGraph> CG;
CallGraph.h 185 inline CallGraphNode(CallGraph *CG, Function *F) : CG(CG), F(F) {}
284 CallGraph *CG;
484 static nodes_iterator nodes_begin(CallGraph *CG) {
485 return nodes_iterator(CG->begin(), &CGGetValuePtr);
488 static nodes_iterator nodes_end(CallGraph *CG) {
489 return nodes_iterator(CG->end(), &CGGetValuePtr);
511 static nodes_iterator nodes_begin(const CallGraph *CG) {
512 return nodes_iterator(CG->begin(), &CGGetValuePtr)
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/IPO/
Internalize.cpp 150 bool InternalizePass::internalizeModule(Module &M, CallGraph *CG) {
152 CallGraphNode *ExternalNode = CG ? CG->getExternalCallingNode() : nullptr;
189 ExternalNode->removeOneAbstractEdgeTo((*CG)[&I]);
269 CallGraph *CG = CGPass ? &CGPass->getCallGraph() : nullptr;
270 return internalizeModule(M, MustPreserveGV, CG);
PruneEH.cpp 174 CallGraph &CG = getAnalysis<CallGraphWrapperPass>().getCallGraph();
176 CGU.initialize(CG, SCC);
Inliner.cpp 285 bool LegacyInlinerBase::doInitialization(CallGraph &CG) {
287 ImportedFunctionsStats.setModuleInfo(CG.getModule());
298 inlineCallsImpl(CallGraphSCC &SCC, CallGraph &CG,
377 InlineFunctionInfo InlineInfo(&CG, GetAssumptionCache, PSI);
434 CG[Caller]->removeCallEdgeFor(CB);
500 CG[Callee]->getNumReferences() == 0) {
503 CallGraphNode *CalleeNode = CG[Callee];
509 delete CG.removeFunctionFromModule(CalleeNode);
534 CallGraph &CG = getAnalysis<CallGraphWrapperPass>().getCallGraph();
544 SCC, CG, GetAssumptionCache, PSI, GetTLI, InsertLifetime
    [all...]
SampleProfile.cpp 362 ProfileSummaryInfo *_PSI, CallGraph *CG);
397 std::vector<Function *> buildFunctionOrder(Module &M, CallGraph *CG);
398 std::unique_ptr<ProfiledCallGraph> buildProfiledCallGraph(CallGraph &CG);
1626 SampleProfileLoader::buildProfiledCallGraph(CallGraph &CG) {
1636 for (auto &Node : CG) {
1647 SampleProfileLoader::buildFunctionOrder(Module &M, CallGraph *CG) {
1655 if (!ProfileTopDownLoad || CG == nullptr) {
1671 assert(&CG->getModule() == &M);
1723 std::unique_ptr<ProfiledCallGraph> ProfiledCG = buildProfiledCallGraph(*CG);
1734 scc_iterator<CallGraph *> CGI = scc_begin(CG);
    [all...]
  /src/external/apache2/llvm/dist/clang/lib/StaticAnalyzer/Checkers/
DebugCheckers.cpp 215 CallGraph CG;
216 CG.addToCallGraph(const_cast<TranslationUnitDecl*>(TU));
217 CG.viewGraph();
239 CallGraph CG;
240 CG.addToCallGraph(const_cast<TranslationUnitDecl*>(TU));
241 CG.dump();
  /src/external/apache2/llvm/dist/clang/tools/clang-import-test/
clang-import-test.cpp 320 auto &CG = *static_cast<CodeGenerator *>(ASTConsumers.back().get());
337 CG.GetModule()->print(llvm::outs(), nullptr);
  /src/external/apache2/llvm/dist/llvm/lib/Analysis/
CallPrinter.cpp 53 CallGraph *CG;
60 CallGraphDOTInfo(Module *M, CallGraph *CG,
62 : M(M), CG(CG), LookupBFI(LookupBFI) {
83 CallGraph *getCallGraph() const { return CG; }
91 for (auto &I : (*CG)) {
237 CallGraph CG(M);
238 CallGraphDOTInfo CFGInfo(&M, &CG, LookupBFI);
279 CallGraph CG(M);
280 CallGraphDOTInfo CFGInfo(&M, &CG, LookupBFI)
    [all...]
CGSCCPassManager.cpp 152 LazyCallGraph &CG = AM.getResult<LazyCallGraphAnalysis>(M);
181 CG.buildRefSCCs();
182 for (auto RCI = CG.postorder_ref_scc_begin(),
183 RCE = CG.postorder_ref_scc_end();
248 CGAM.getResult<FunctionAnalysisManagerCGSCCProxy>(*C, CG).updateFAM(
288 PassPA = Pass->run(*C, CGAM, CG, UR);
303 CGAM.getResult<FunctionAnalysisManagerCGSCCProxy>(*C, CG).updateFAM(
370 LazyCallGraph &CG,
374 AM.getResult<PassInstrumentationAnalysis>(InitialC, CG);
421 PreservedAnalyses PassPA = Pass->run(*C, AM, CG, UR)
    [all...]
CallGraphSCCPass.cpp 73 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,
127 Module &M = CG.getModule();
132 DevirtualizedCall |= RefreshCallGraph(CurSCC, CG, false);
164 RefreshCallGraph(CurSCC, CG, true);
205 bool CGPassManager::RefreshCallGraph(const CallGraphSCC &CurSCC, CallGraph &CG,
    [all...]
LoopAccessAnalysis.cpp 484 const auto &CG = CheckingGroups[I];
486 OS.indent(Depth + 2) << "Group " << &CG << ":\n";
487 OS.indent(Depth + 4) << "(Low: " << *CG.Low << " High: " << *CG.High
489 for (unsigned J = 0; J < CG.Members.size(); ++J) {
490 OS.indent(Depth + 6) << "Member: " << *Pointers[CG.Members[J]].Expr
  /src/external/apache2/llvm/dist/clang/lib/StaticAnalyzer/Frontend/
AnalysisConsumer.cpp 437 // We rely on random access to add the initially processed Decls to CG.
438 CallGraph CG;
440 CG.addToCallGraph(LocalTUDecls[i]);
451 llvm::ReversePostOrderTraversal<clang::CallGraph*> RPOT(&CG);
  /src/external/apache2/llvm/dist/llvm/tools/lto/
lto.cpp 151 static void lto_add_attrs(lto_code_gen_t cg) {
152 LTOCodeGenerator *CG = unwrap(cg);
153 CG->setAttrs(codegen::getMAttrs());
157 CG->setOptLevel(OptLevel - '0');
158 CG->setFreestanding(EnableFreestanding);
159 CG->setDisableVerify(DisableVerify);
289 lto_code_gen_t cg) {
294 unwrap(cg)->getContext(), mem, length, Options, StringRef(path));
346 void lto_codegen_set_diagnostic_handler(lto_code_gen_t cg,
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/Utils/
InlineFunction.cpp 1311 CallGraph &CG = *IFI.CG;
1314 CallGraphNode *CalleeNode = CG[Callee];
1315 CallGraphNode *CallerNode = CG[Caller];
1365 CallerNode->addCalledFunction(NewCall, CG[F]);
2024 if (IFI.CG)
2440 if (InlinedFunctionInfo.ContainsCalls && !IFI.CG) {

Completed in 55 milliseconds