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

/external/llvm/lib/Analysis/IPA/
H A DCallPrinter.cpp17 #include "llvm/Analysis/CallGraph.h"
25 template <> struct DOTGraphTraits<CallGraph *> : public DefaultDOTGraphTraits {
28 static std::string getGraphName(CallGraph *Graph) { return "Call graph"; }
30 std::string getNodeLabel(CallGraphNode *Node, CallGraph *Graph) {
39 static CallGraph *getGraph(CallGraphWrapperPass *P) {
49 : public DOTGraphTraitsModuleViewer<CallGraphWrapperPass, true, CallGraph *,
54 : DOTGraphTraitsModuleViewer<CallGraphWrapperPass, true, CallGraph *,
62 CallGraphWrapperPass, true, CallGraph *,
67 : DOTGraphTraitsModulePrinter<CallGraphWrapperPass, true, CallGraph *,
H A DCallGraph.cpp1 //===- CallGraph.cpp - Build a Module's call graph ------------------------===//
10 #include "llvm/Analysis/CallGraph.h"
20 // Implementations of the CallGraph class methods.
23 CallGraph::CallGraph(Module &M) function in class:CallGraph
35 CallGraph::~CallGraph() {
52 void CallGraph::addToCallGraph(Function *F) {
93 void CallGraph::print(raw_ostream &OS) const {
94 OS << "CallGraph Roo
[all...]
H A DAndroid.mk4 CallGraph.cpp \
H A DCallGraphSCCPass.cpp21 #include "llvm/Analysis/CallGraph.h"
59 bool doInitialization(CallGraph &CG);
60 bool doFinalization(CallGraph &CG);
64 // CGPassManager walks SCC and it needs CallGraph.
70 return "CallGraph Pass Manager";
96 bool RunAllPassesOnSCC(CallGraphSCC &CurSCC, CallGraph &CG,
100 CallGraph &CG, bool &CallGraphUpToDate,
102 bool RefreshCallGraph(CallGraphSCC &CurSCC, CallGraph &CG,
112 CallGraph &CG, bool &CallGraphUpToDate,
179 CallGraph
[all...]
H A DGlobalsModRef.cpp21 #include "llvm/Analysis/CallGraph.h"
185 void AnalyzeCallGraph(CallGraph &CG, Module &M);
358 void GlobalsModRef::AnalyzeCallGraph(CallGraph &CG, Module &M) {
361 for (scc_iterator<CallGraph*> I = scc_begin(&CG); !I.isAtEnd(); ++I) {
/external/clang/lib/Analysis/
H A DCallGraph.cpp1 //== CallGraph.cpp - AST-based Call graph ----------------------*- C++ -*--==//
10 // This file defines the AST-based CallGraph.
13 #include "clang/Analysis/CallGraph.h"
23 #define DEBUG_TYPE "CallGraph"
32 CallGraph *G;
36 CGBuilder(CallGraph *g, CallGraphNode *N)
94 void CallGraph::addNodesForBlocks(DeclContext *D) {
103 CallGraph::CallGraph() { function in class:CallGraph
107 CallGraph
[all...]
H A DAndroid.mk22 CallGraph.cpp \
/external/llvm/include/llvm/Analysis/
H A DCallGraph.h1 //===- CallGraph.h - Build a Module's call graph ----------------*- C++ -*-===//
40 /// Because of these properties, the CallGraph captures a conservative superset
44 /// The CallGraph class also attempts to figure out what the root of the
45 /// CallGraph is, which it currently does by looking for a function named
75 class CallGraph { class in namespace:llvm
107 CallGraph(Module &M);
108 ~CallGraph();
195 /// \brief Returns the number of other CallGraphNodes in this CallGraph that
267 friend class CallGraph;
283 /// \brief A special function that should only be used by the CallGraph clas
[all...]
H A DCallGraphSCCPass.h24 #include "llvm/Analysis/CallGraph.h"
30 class CallGraph;
39 /// corresponding to a CallGraph.
48 virtual bool doInitialization(CallGraph &CG) {
64 virtual bool doFinalization(CallGraph &CG) {
/external/clang/include/clang/Analysis/
H A DCallGraph.h1 //== CallGraph.h - AST-based Call graph ------------------------*- C++ -*--==//
10 // This file declares the AST-based CallGraph.
34 class CallGraph : public RecursiveASTVisitor<CallGraph> { class in namespace:clang
46 CallGraph();
47 ~CallGraph();
159 void addCallee(CallGraphNode *N, CallGraph *CG) {
199 template <> struct GraphTraits<clang::CallGraph*>
202 static NodeType *getEntryNode(clang::CallGraph *CGN) {
208 typedef mapped_iterator<clang::CallGraph
[all...]
/external/llvm/include/llvm/Transforms/IPO/
H A DInlinerPass.h48 bool doFinalization(CallGraph &CG) override;
75 bool removeDeadFunctions(CallGraph &CG, bool AlwaysInlineOnly = false);
/external/llvm/include/llvm/Transforms/Utils/
H A DCloning.h41 class CallGraph;
160 explicit InlineFunctionInfo(CallGraph *cg = nullptr, const DataLayout *DL = nullptr)
165 CallGraph *CG;
/external/llvm/tools/opt/
H A DPrintSCC.cpp10 // This file provides passes to print out SCCs in a CFG or a CallGraph.
16 // (2) To print out the SCCs for a CFG or a CallGraph:
22 // analyze -print-callgraph-sccs [-stats] [-debug] to print SCCs in the CallGraph
29 #include "llvm/Analysis/CallGraph.h"
58 // getAnalysisUsage - This pass requires the CallGraph.
94 CallGraph &CG = getAnalysis<CallGraphWrapperPass>().getCallGraph();
97 for (scc_iterator<CallGraph*> SCCI = scc_begin(&CG); !SCCI.isAtEnd();
/external/llvm/lib/Transforms/IPO/
H A DInlineAlways.cpp17 #include "llvm/Analysis/CallGraph.h"
58 bool doFinalization(CallGraph &CG) override {
H A DPruneEH.cpp21 #include "llvm/Analysis/CallGraph.h"
64 CallGraph &CG = getAnalysis<CallGraphWrapperPass>().getCallGraph();
238 CallGraph &CG = getAnalysis<CallGraphWrapperPass>().getCallGraph();
H A DInliner.cpp19 #include "llvm/Analysis/CallGraph.h"
119 /// do so and update the CallGraph for this operation.
442 CallGraph &CG = getAnalysis<CallGraphWrapperPass>().getCallGraph();
636 bool Inliner::doFinalization(CallGraph &CG) {
642 bool Inliner::removeDeadFunctions(CallGraph &CG, bool AlwaysInlineOnly) {
647 for (CallGraph::iterator I = CG.begin(), E = CG.end(); I != E; ++I) {
683 // this inline, because that would invalidate our CallGraph::iterator
H A DInternalize.cpp25 #include "llvm/Analysis/CallGraph.h"
135 CallGraph *CG = CGPass ? &CGPass->getCallGraph() : nullptr;
H A DArgumentPromotion.cpp37 #include "llvm/Analysis/CallGraph.h"
86 bool doInitialization(CallGraph &CG) override;
638 CallGraph &CG = getAnalysis<CallGraphWrapperPass>().getCallGraph();
920 bool ArgPromotion::doInitialization(CallGraph &CG) {
/external/clang/lib/StaticAnalyzer/Checkers/
H A DDebugCheckers.cpp17 #include "clang/Analysis/CallGraph.h"
124 CallGraph CG;
144 CallGraph CG;
/external/clang/lib/StaticAnalyzer/Frontend/
H A DAnalysisConsumer.cpp23 #include "clang/Analysis/CallGraph.h"
455 // Note: CallGraph can trigger deserialization of more items from a pch
458 CallGraph CG;
471 llvm::ReversePostOrderTraversal<clang::CallGraph*> RPOT(&CG);
472 for (llvm::ReversePostOrderTraversal<clang::CallGraph*>::rpo_iterator
/external/llvm/unittests/IR/
H A DLegacyPassManagerTest.cpp173 struct CGPass : public PassTest<CallGraph, CallGraphSCCPass> {
/external/llvm/lib/Transforms/Utils/
H A DInlineFunction.cpp18 #include "llvm/Analysis/CallGraph.h"
197 // updates the CallGraph if present, because it uses a WeakVH.
271 CallGraph &CG = *IFI.CG;
/external/chromium_org/third_party/WebKit/Source/devtools/scripts/closure/
H A Dcompiler.jarMETA-INF/ META-INF/MANIFEST.MF com/ com/google/ com/google/javascript/ com/google/javascript/jscomp/ ...
/external/chromium_org/third_party/closure_compiler/compiler/
H A Dcompiler.jarMETA-INF/ META-INF/MANIFEST.MF com/ com/google/ com/google/debugging/ com/google/debugging/sourcemap/ ...
/external/owasp/sanitizer/tools/findbugs/lib/
H A Dfindbugs.jarMETA-INF/ META-INF/MANIFEST.MF default.xsl edu/ edu/umd/ edu/umd/cs/ edu/ ...

Completed in 1704 milliseconds