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
30
) 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
235
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
256
static NodeType *
getEntryNode
(NodeType* N) { return N; } \
267
static NodeType *
getEntryNode
(NodeType* N) { return N; } \
280
static NodeType *
getEntryNode
(RegionT* R) { \
284
return nodes_iterator::begin(
getEntryNode
(R)); \
287
return nodes_iterator::end(
getEntryNode
(R)); \
294
static NodeType *
getEntryNode
(RegionT* R) { \
298
return nodes_iterator::begin(
getEntryNode
(R)); \
301
return nodes_iterator::end(
getEntryNode
(R)); \
316
static NodeType *
getEntryNode
(RegionInfo *RI) {
317
return GraphTraits<FlatIt<Region*> >::
getEntryNode
(RI->getTopLevelRegion())
[
all
...]
CallGraph.h
410
static NodeType *
getEntryNode
(CallGraphNode *CGN) { return CGN; }
431
static NodeType *
getEntryNode
(const CallGraphNode *CGN) { return CGN; }
448
static NodeType *
getEntryNode
(CallGraph *CGN) {
471
static NodeType *
getEntryNode
(const CallGraph *CGN) {
LazyCallGraph.h
524
static NodeType *
getEntryNode
(NodeType *N) { return N; }
532
static NodeType *
getEntryNode
(NodeType *N) { return N; }
LoopInfo.h
779
static NodeType *
getEntryNode
(const Loop *L) { return L; }
792
static NodeType *
getEntryNode
(Loop *L) { return L; }
/external/llvm/include/llvm/CodeGen/
MachineLoopInfo.h
162
static NodeType *
getEntryNode
(const MachineLoop *L) { return L; }
175
static NodeType *
getEntryNode
(MachineLoop *L) { return L; }
MachineDominators.h
254
static NodeType *
getEntryNode
(NodeType *N) { return N; }
276
static NodeType *
getEntryNode
(MachineDominatorTree *DT) {
MachineRegionInfo.h
148
static NodeType *
getEntryNode
(MachineRegionInfo *RI) {
149
return GraphTraits<FlatIt<MachineRegion*> >::
getEntryNode
(RI->getTopLevelRegion());
152
return nodes_iterator::begin(
getEntryNode
(RI));
155
return nodes_iterator::end(
getEntryNode
(RI));
164
static NodeType *
getEntryNode
(MachineRegionInfoPass *RI) {
165
return GraphTraits<MachineRegionInfo*>::
getEntryNode
(&RI->getRegionInfo());
MachineFunction.h
535
static NodeType *
getEntryNode
(MachineFunction *F) {
547
static NodeType *
getEntryNode
(const MachineFunction *F) {
572
static NodeType *
getEntryNode
(Inverse<MachineFunction*> G) {
578
static NodeType *
getEntryNode
(Inverse<const MachineFunction *> G) {
MachineBasicBlock.h
[
all
...]
ScheduleDAG.h
666
static inline NodeType *
getEntryNode
(SUnit *N) { return N; }
SelectionDAG.h
339
SDValue
getEntryNode
() const {
[
all
...]
/external/clang/include/clang/Analysis/Analyses/
Dominators.h
173
static NodeType *
getEntryNode
(NodeType *N) {
186
return df_begin(
getEntryNode
(N));
190
return df_end(
getEntryNode
(N));
196
static NodeType *
getEntryNode
(::clang::DominatorTree *DT) {
201
return df_begin(
getEntryNode
(N));
205
return df_end(
getEntryNode
(N));
/external/llvm/include/llvm/IR/
Dominators.h
149
static NodeType *
getEntryNode
(NodeType *N) { return N; }
156
return df_begin(
getEntryNode
(N));
160
return df_end(
getEntryNode
(N));
175
static NodeType *
getEntryNode
(DominatorTree *DT) {
180
return df_begin(
getEntryNode
(N));
184
return df_end(
getEntryNode
(N));
CFG.h
160
static NodeType *
getEntryNode
(BasicBlock *BB) { return BB; }
173
static NodeType *
getEntryNode
(const BasicBlock *BB) { return BB; }
191
static NodeType *
getEntryNode
(Inverse<BasicBlock *> G) { return G.Graph; }
203
static NodeType *
getEntryNode
(Inverse<const BasicBlock*> G) {
225
static NodeType *
getEntryNode
(Function *F) { return &F->getEntryBlock(); }
235
static NodeType *
getEntryNode
(const Function *F) {return &F->getEntryBlock();}
252
static NodeType *
getEntryNode
(Inverse<Function*> G) {
258
static NodeType *
getEntryNode
(Inverse<const Function *> G) {
/external/llvm/lib/Analysis/
BlockFrequencyInfo.cpp
57
static inline const NodeType *
getEntryNode
(const BlockFrequencyInfo *G) {
BlockFrequencyInfoImpl.cpp
602
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) {
/external/llvm/lib/Transforms/IPO/
FunctionAttrs.cpp
306
ArgumentGraphNode *
getEntryNode
() { return &SyntheticRoot; }
383
static inline NodeType *
getEntryNode
(NodeType *A) { return A; }
393
static NodeType *
getEntryNode
(ArgumentGraph *AG) {
394
return AG->
getEntryNode
();
[
all
...]
/external/clang/include/clang/StaticAnalyzer/Core/PathSensitive/
ExplodedGraph.h
448
static inline NodeType*
getEntryNode
(NodeType* N) {
474
static inline NodeType*
getEntryNode
(NodeType* N) {
Completed in 658 milliseconds
1
2