OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
defs:getEntryNode
(Results
1 - 25
of
26
) sorted by null
1
2
/external/llvm/include/llvm/ADT/
GraphTraits.h
33
// static NodeType *
getEntryNode
(const GraphType &)
91
static NodeType *
getEntryNode
(Inverse<Inverse<T> > *G) {
92
return GraphTraits<T>::
getEntryNode
(G->Graph.Graph);
/external/clang/include/clang/AST/
StmtGraphTraits.h
32
static NodeType*
getEntryNode
(clang::Stmt* S) { return S; }
59
static NodeType*
getEntryNode
(const clang::Stmt* S) { return S; }
/external/llvm/unittests/ADT/
SCCIteratorTest.cpp
237
static inline NodeType *
getEntryNode
(const Graph<N> &G) { return G.AccessNode(0); }
/external/llvm/include/llvm/Analysis/
PostDominators.h
99
static NodeType *
getEntryNode
(PostDominatorTree *DT) {
104
if (
getEntryNode
(N))
105
return df_begin(
getEntryNode
(N));
107
return df_end(
getEntryNode
(N));
111
return df_end(
getEntryNode
(N));
Interval.h
125
static NodeType *
getEntryNode
(Interval *I) { return I; }
139
static NodeType *
getEntryNode
(Inverse<Interval *> G) { return G.Graph; }
RegionIterator.h
269
static NodeType *
getEntryNode
(NodeType* N) { return N; } \
280
static NodeType *
getEntryNode
(NodeType* N) { return N; } \
293
static NodeType *
getEntryNode
(RegionT* R) { \
297
return nodes_iterator::begin(
getEntryNode
(R)); \
300
return nodes_iterator::end(
getEntryNode
(R)); \
307
static NodeType *
getEntryNode
(RegionT* R) { \
311
return nodes_iterator::begin(
getEntryNode
(R)); \
314
return nodes_iterator::end(
getEntryNode
(R)); \
329
static NodeType *
getEntryNode
(RegionInfo *RI) {
330
return GraphTraits<FlatIt<Region*> >::
getEntryNode
(RI->getTopLevelRegion())
[
all
...]
CallGraph.h
405
static NodeType *
getEntryNode
(CallGraphNode *CGN) { return CGN; }
423
static NodeType *
getEntryNode
(const CallGraphNode *CGN) { return CGN; }
432
static NodeType *
getEntryNode
(CallGraph *CGN) {
453
static NodeType *
getEntryNode
(const CallGraph *CGN) {
LazyCallGraph.h
519
static NodeType *
getEntryNode
(NodeType *N) { return N; }
527
static NodeType *
getEntryNode
(NodeType *N) { return N; }
LoopInfo.h
757
static NodeType *
getEntryNode
(const Loop *L) { return L; }
770
static NodeType *
getEntryNode
(Loop *L) { return L; }
/external/llvm/include/llvm/CodeGen/
MachineLoopInfo.h
167
static NodeType *
getEntryNode
(const MachineLoop *L) { return L; }
180
static NodeType *
getEntryNode
(MachineLoop *L) { return L; }
MachineDominators.h
185
static NodeType *
getEntryNode
(NodeType *N) {
198
static NodeType *
getEntryNode
(MachineDominatorTree *DT) {
MachineFunction.h
485
static NodeType *
getEntryNode
(MachineFunction *F) {
497
static NodeType *
getEntryNode
(const MachineFunction *F) {
522
static NodeType *
getEntryNode
(Inverse<MachineFunction*> G) {
528
static NodeType *
getEntryNode
(Inverse<const MachineFunction *> G) {
SelectionDAG.h
325
///
getEntryNode
- Return the token chain corresponding to the entry of the
327
SDValue
getEntryNode
() const {
[
all
...]
MachineBasicBlock.h
707
static NodeType *
getEntryNode
(MachineBasicBlock *BB) { return BB; }
720
static NodeType *
getEntryNode
(const MachineBasicBlock *BB) { return BB; }
738
static NodeType *
getEntryNode
(Inverse<MachineBasicBlock *> G) {
752
static NodeType *
getEntryNode
(Inverse<const MachineBasicBlock*> G) {
ScheduleDAG.h
666
static inline NodeType *
getEntryNode
(SUnit *N) { return N; }
/external/llvm/include/llvm/IR/
Dominators.h
121
static NodeType *
getEntryNode
(NodeType *N) {
134
return df_begin(
getEntryNode
(N));
138
return df_end(
getEntryNode
(N));
144
static NodeType *
getEntryNode
(DominatorTree *DT) {
149
return df_begin(
getEntryNode
(N));
153
return df_end(
getEntryNode
(N));
CFG.h
278
static NodeType *
getEntryNode
(BasicBlock *BB) { return BB; }
291
static NodeType *
getEntryNode
(const BasicBlock *BB) { return BB; }
309
static NodeType *
getEntryNode
(Inverse<BasicBlock *> G) { return G.Graph; }
321
static NodeType *
getEntryNode
(Inverse<const BasicBlock*> G) {
343
static NodeType *
getEntryNode
(Function *F) { return &F->getEntryBlock(); }
353
static NodeType *
getEntryNode
(const Function *F) {return &F->getEntryBlock();}
370
static NodeType *
getEntryNode
(Inverse<Function*> G) {
376
static NodeType *
getEntryNode
(Inverse<const Function *> G) {
/external/clang/include/clang/Analysis/Analyses/
Dominators.h
175
static NodeType *
getEntryNode
(NodeType *N) {
188
return df_begin(
getEntryNode
(N));
192
return df_end(
getEntryNode
(N));
198
static NodeType *
getEntryNode
(::clang::DominatorTree *DT) {
203
return df_begin(
getEntryNode
(N));
207
return df_end(
getEntryNode
(N));
/external/llvm/lib/Analysis/
BlockFrequencyInfo.cpp
57
static inline const NodeType *
getEntryNode
(const BlockFrequencyInfo *G) {
BlockFrequencyInfoImpl.cpp
581
static const NodeType *
getEntryNode
(const GraphT &G) {
/external/llvm/lib/CodeGen/
MachineBlockFrequencyInfo.cpp
59
const NodeType *
getEntryNode
(const MachineBlockFrequencyInfo *G) {
/external/clang/include/clang/Analysis/
CallGraph.h
178
static NodeType *
getEntryNode
(clang::CallGraphNode *CGN) { return CGN; }
194
static NodeType *
getEntryNode
(const clang::CallGraphNode *CGN) { return CGN; }
202
static NodeType *
getEntryNode
(clang::CallGraph *CGN) {
227
static NodeType *
getEntryNode
(const clang::CallGraph *CGN) {
CFG.h
[
all
...]
/external/llvm/lib/Transforms/IPO/
FunctionAttrs.cpp
329
ArgumentGraphNode *
getEntryNode
() { return &SyntheticRoot; }
387
static inline NodeType *
getEntryNode
(NodeType *A) { return A; }
397
static NodeType *
getEntryNode
(ArgumentGraph *AG) {
398
return AG->
getEntryNode
();
[
all
...]
/external/clang/include/clang/StaticAnalyzer/Core/PathSensitive/
ExplodedGraph.h
449
static inline NodeType*
getEntryNode
(NodeType* N) {
475
static inline NodeType*
getEntryNode
(NodeType* N) {
Completed in 399 milliseconds
1
2