OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:CallGraphNode
(Results
1 - 15
of
15
) sorted by null
/external/llvm/include/llvm/Analysis/
CallGraph.h
67
class
CallGraphNode
;
76
typedef std::map<const Function *,
CallGraphNode
*> FunctionMapTy;
98
inline const
CallGraphNode
*operator[](const Function *F) const {
103
inline
CallGraphNode
*operator[](const Function *F) {
109
/// Returns the
CallGraphNode
which is used to represent undetermined calls
111
virtual
CallGraphNode
* getExternalCallingNode() const { return 0; }
112
virtual
CallGraphNode
* getCallsExternalNode() const { return 0; }
117
virtual
CallGraphNode
* getRoot() { return 0; }
118
virtual const
CallGraphNode
* getRoot() const { return 0; }
131
Function *removeFunctionFromModule(
CallGraphNode
*CGN)
[
all
...]
/external/clang/include/clang/Analysis/
CallGraph.h
27
class
CallGraphNode
;
35
friend class
CallGraphNode
;
37
typedef llvm::DenseMap<const Decl *,
CallGraphNode
*> FunctionMapTy;
44
CallGraphNode
*Root;
49
llvm::SetVector<
CallGraphNode
*> ParentlessNodes;
67
CallGraphNode
*getNode(const Decl *) const;
71
CallGraphNode
*getOrInsertNode(Decl *);
87
CallGraphNode
*getRoot() const { return Root; }
92
typedef llvm::SetVector<
CallGraphNode
*>::iterator nodes_iterator;
93
typedef llvm::SetVector<
CallGraphNode
*>::const_iterator const_nodes_iterator
[
all
...]
/external/llvm/include/llvm/
CallGraphSCCPass.h
29
class
CallGraphNode
;
82
std::vector<
CallGraphNode
*> Nodes;
86
void initialize(
CallGraphNode
*const*I,
CallGraphNode
*const*E) {
95
void ReplaceNode(
CallGraphNode
*Old,
CallGraphNode
*New);
97
typedef std::vector<
CallGraphNode
*>::const_iterator iterator;
/external/llvm/lib/Analysis/IPA/
CallGraph.cpp
33
CallGraphNode
*Root;
37
CallGraphNode
*ExternalCallingNode;
41
CallGraphNode
*CallsExternalNode;
55
CallsExternalNode = new
CallGraphNode
(0);
97
CallGraphNode
* getExternalCallingNode() const { return ExternalCallingNode; }
98
CallGraphNode
* getCallsExternalNode() const { return CallsExternalNode; }
103
CallGraphNode
*getRoot() { return Root; }
104
const
CallGraphNode
*getRoot() const { return Root; }
115
CallGraphNode
*Node = getOrInsertFunction(F);
215
Function *CallGraph::removeFunctionFromModule(
CallGraphNode
*CGN)
[
all
...]
CallGraphSCCPass.cpp
172
DenseMap<Value*,
CallGraphNode
*> CallSites;
188
CallGraphNode
*CGN = *SCCIdx;
200
for (
CallGraphNode
::iterator I = CGN->begin(), E = CGN->end(); I != E; ) {
253
DenseMap<Value*,
CallGraphNode
*>::iterator ExistingIt =
256
CallGraphNode
*ExistingNode = ExistingIt->second;
279
CallGraphNode
*CalleeNode;
303
CallGraphNode
*CalleeNode;
432
std::vector<
CallGraphNode
*> &NodeVec = *CGI;
507
void CallGraphSCC::ReplaceNode(
CallGraphNode
*Old,
CallGraphNode
*New)
[
all
...]
GlobalsModRef.cpp
375
std::vector<
CallGraphNode
*> &SCC = *I;
419
for (
CallGraphNode
::iterator CI = SCC[i]->begin(), E = SCC[i]->end();
435
CallGraphNode
*CalleeNode = CG[Callee];
/external/clang/lib/Analysis/
CallGraph.cpp
29
CallGraphNode
*CallerNode;
32
CGBuilder(CallGraph *g, const Decl *D,
CallGraphNode
*N)
41
CallGraphNode
*CalleeNode = G->getOrInsertNode(CalleeDecl);
97
CallGraphNode
*Node = getOrInsertNode(D);
107
CallGraphNode
*CallGraph::getNode(const Decl *F) const {
113
CallGraphNode
*CallGraph::getOrInsertNode(Decl *F) {
114
CallGraphNode
*&Node = FunctionMap[F];
118
Node = new
CallGraphNode
(F);
134
for (
CallGraphNode
::iterator CI = I->second->begin(),
153
StringRef
CallGraphNode
::getName() const
[
all
...]
/external/llvm/tools/opt/
PrintSCC.cpp
95
CallGraphNode
* rootNode = getAnalysis<CallGraph>().getRoot();
98
for (scc_iterator<
CallGraphNode
*> SCCI = scc_begin(rootNode),
100
const std::vector<
CallGraphNode
*> &nextSCC = *SCCI;
102
for (std::vector<
CallGraphNode
*>::const_iterator I = nextSCC.begin(),
GraphPrinters.cpp
61
static std::string getNodeLabel(
CallGraphNode
*Node, CallGraph *Graph) {
/external/clang/lib/StaticAnalyzer/Frontend/
AnalysisConsumer.cpp
324
llvm::SmallVector<
CallGraphNode
*, 24> TopLevelFunctions;
330
CallGraphNode
*Entry = CG.getRoot();
331
for (
CallGraphNode
::iterator I = Entry->begin(),
341
std::queue<
CallGraphNode
*> BFSQueue;
342
for (llvm::SmallVector<
CallGraphNode
*, 24>::reverse_iterator
350
SmallPtrSet<
CallGraphNode
*,24> Visited;
352
CallGraphNode
*N = BFSQueue.front();
370
CallGraphNode
*VN = CG.getNode(*I);
377
for (
CallGraphNode
::const_iterator CI = N->begin(),
/external/llvm/lib/Transforms/IPO/
PruneEH.cpp
62
SmallPtrSet<
CallGraphNode
*, 8> SCCNodes;
67
// looking up whether a given
CallGraphNode
is in this SCC.
119
CallGraphNode
*CalleeNode = CG[Callee];
237
CallGraphNode
*CGN = CG[BB->getParent()];
ArgumentPromotion.cpp
77
CallGraphNode
*PromoteArguments(
CallGraphNode
*CGN);
79
CallGraphNode
*DoPromotion(Function *F,
106
if (
CallGraphNode
*CGN = PromoteArguments(*I)) {
122
CallGraphNode
*ArgPromotion::PromoteArguments(
CallGraphNode
*CGN) {
491
CallGraphNode
*ArgPromotion::DoPromotion(Function *F,
635
CallGraphNode
*NF_CGN = CG.getOrInsertFunction(NF);
755
CallGraphNode
*CalleeNode = CG[Call->getParent()->getParent()];
[
all
...]
Inliner.cpp
478
CallGraphNode
*CalleeNode = CG[Callee];
517
SmallVector<
CallGraphNode
*, 16> FunctionsToRemove;
522
CallGraphNode
*CGN = I->second;
565
for (SmallVectorImpl<
CallGraphNode
*>::iterator I = FunctionsToRemove.begin(),
Internalize.cpp
105
CallGraphNode
*ExternalNode = CG ? CG->getExternalCallingNode() : 0;
/external/llvm/lib/Transforms/Utils/
InlineFunction.cpp
275
CallGraphNode
*CalleeNode = CG[Callee];
276
CallGraphNode
*CallerNode = CG[Caller];
280
CallGraphNode
::iterator I = CalleeNode->begin(), E = CalleeNode->end();
283
CallGraphNode
::CalledFunctionsVector CallCache;
[
all
...]
Completed in 566 milliseconds