OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:GraphTraits
(Results
1 - 25
of
38
) sorted by null
1
2
/external/llvm/include/llvm/ADT/
GraphTraits.h
1
//===-- llvm/ADT/
GraphTraits
.h - Graph traits template ----------*- C++ -*-===//
10
// This file defines the little
GraphTraits
<X> template class that should be
23
//
GraphTraits
- This class should be specialized by different graph types...
27
struct
GraphTraits
{
55
// need to include the appropriate specialization of
GraphTraits
<> for your
84
// Provide a partial specialization of
GraphTraits
so that the inverse of an
87
struct
GraphTraits
<Inverse<Inverse<T> > > {
88
typedef typename
GraphTraits
<T>::NodeType NodeType;
89
typedef typename
GraphTraits
<T>::ChildIteratorType ChildIteratorType;
92
return
GraphTraits
<T>::getEntryNode(G->Graph.Graph)
[
all
...]
PostOrderIterator.h
10
// This file builds on the ADT/
GraphTraits
.h file to build a generic graph
12
//
GraphTraits
specialization.
19
#include "llvm/ADT/
GraphTraits
.h"
88
class SetType = llvm::SmallPtrSet<typename
GraphTraits
<GraphT>::NodeType*, 8>,
90
class GT =
GraphTraits
<GraphT> >
180
template<class T, class SetType=std::set<typename
GraphTraits
<T>::NodeType*> >
198
class SetType = std::set<typename
GraphTraits
<T>::NodeType*>,
217
class SetType = std::set<typename
GraphTraits
<T>::NodeType*> >
258
template<class GraphT, class GT =
GraphTraits
<GraphT> >
DepthFirstIterator.h
10
// This file builds on the ADT/
GraphTraits
.h file to build generic depth
36
#include "llvm/ADT/
GraphTraits
.h"
63
class SetType = llvm::SmallPtrSet<typename
GraphTraits
<GraphT>::NodeType*, 8>,
64
bool ExtStorage = false, class GT =
GraphTraits
<GraphT> >
211
template <class T, class SetTy = std::set<typename
GraphTraits
<T>::NodeType*> >
230
class SetTy = llvm::SmallPtrSet<typename
GraphTraits
<T>::NodeType*, 8>,
248
template <class T, class SetTy = std::set<typename
GraphTraits
<T>::NodeType*> >
/external/llvm/include/llvm/Support/
DataFlow.h
10
// This file defines specializations of
GraphTraits
that allows Use-Def and
17
#include "llvm/ADT/
GraphTraits
.h"
23
// Provide specializations of
GraphTraits
to be able to treat def-use/use-def
26
template <> struct
GraphTraits
<const Value*> {
43
template <> struct
GraphTraits
<Value*> {
60
template <> struct
GraphTraits
<Inverse<const User*> > {
81
template <> struct
GraphTraits
<Inverse<User*> > {
CFG.h
10
// This file defines specializations of
GraphTraits
that allow Function and
18
#include "llvm/ADT/
GraphTraits
.h"
242
//
GraphTraits
specializations for basic block graphs (CFGs)
245
// Provide specializations of
GraphTraits
to be able to treat a function as a
248
template <> struct
GraphTraits
<BasicBlock*> {
261
template <> struct
GraphTraits
<const BasicBlock*> {
275
// Provide specializations of
GraphTraits
to be able to treat a function as a
280
template <> struct
GraphTraits
<Inverse<BasicBlock*> > {
292
template <> struct
GraphTraits
<Inverse<const BasicBlock*> > {
309
//
GraphTraits
specializations for function basic block graphs (CFGs
[
all
...]
/external/llvm/include/llvm/Analysis/
RegionIterator.h
14
#include "llvm/ADT/
GraphTraits
.h"
259
// RegionNode
GraphTraits
specialization so the bbs in the region can be
266
template<> struct
GraphTraits
<NodeT*> { \
277
template<> struct
GraphTraits
<FlatIt<NodeT*> > { \
290
template<> struct
GraphTraits
<RegionT*> \
291
: public
GraphTraits
<NodeT*> { \
303
template<> struct
GraphTraits
<FlatIt<RegionT*> > \
304
: public
GraphTraits
<FlatIt<NodeT*> > { \
306
GraphTraits
<FlatIt<NodeType*> > > nodes_iterator; \
324
template <> struct
GraphTraits
<RegionInfo*
[
all
...]
BlockFrequencyImpl.h
49
typedef
GraphTraits
< Inverse<BlockT *> > GT;
157
PI =
GraphTraits
< Inverse<BlockT *> >::child_begin(BB),
158
PE =
GraphTraits
< Inverse<BlockT *> >::child_end(BB);
194
PI =
GraphTraits
< Inverse<BlockT *> >::child_begin(BB),
195
PE =
GraphTraits
< Inverse<BlockT *> >::child_end(BB);
238
PI =
GraphTraits
< Inverse<BlockT *> >::child_begin(Head),
239
PE =
GraphTraits
< Inverse<BlockT *> >::child_end(Head);
290
PI =
GraphTraits
< Inverse<BlockT *> >::child_begin(BB),
291
PE =
GraphTraits
< Inverse<BlockT *> >::child_end(BB);
325
for (typename
GraphTraits
<BlockT *>::ChildIteratorTyp
[
all
...]
PostDominators.h
86
template <> struct
GraphTraits
<PostDominatorTree*>
87
: public
GraphTraits
<DomTreeNode*> {
CallGraph.h
54
#include "llvm/ADT/
GraphTraits
.h"
303
//
GraphTraits
specializations for call graphs so that they can be treated as
309
template <> struct
GraphTraits
<CallGraphNode*> {
332
template <> struct
GraphTraits
<const CallGraphNode*> {
341
template<> struct
GraphTraits
<CallGraph*> : public
GraphTraits
<CallGraphNode*> {
362
template<> struct
GraphTraits
<const CallGraph*> :
363
public
GraphTraits
<const CallGraphNode*> {
Interval.h
23
#include "llvm/ADT/
GraphTraits
.h"
124
template <> struct
GraphTraits
<Interval*> {
139
template <> struct
GraphTraits
<Inverse<Interval*> > {
LoopInfoImpl.h
39
typedef
GraphTraits
<BlockT*> BlockTraits;
73
typedef
GraphTraits
<BlockT*> BlockTraits;
103
typedef
GraphTraits
<BlockT*> BlockTraits;
127
typedef
GraphTraits
<BlockT*> BlockTraits;
149
typedef
GraphTraits
<Inverse<BlockT*> > InvBlockTraits;
171
typedef
GraphTraits
<Inverse<BlockT*> > InvBlockTraits;
265
typedef
GraphTraits
<BlockT*> BlockTraits;
273
typedef
GraphTraits
<Inverse<BlockT*> > InvBlockTraits;
368
typedef
GraphTraits
<Inverse<BlockT*> > InvBlockTraits;
428
typedef
GraphTraits
<BlockT*> BlockTraits
[
all
...]
DominatorInternals.h
151
void Calculate(DominatorTreeBase<typename
GraphTraits
<NodeT>::NodeType>& DT,
153
typedef
GraphTraits
<NodeT> GraphT;
174
MultipleRoots |= (DT.isPostDominator() && N !=
GraphTraits
<FuncT*>::size(&F));
207
typedef
GraphTraits
<Inverse<NodeT> > InvTraits;
Dominators.h
20
#include "llvm/ADT/
GraphTraits
.h"
183
void Calculate(DominatorTreeBase<typename
GraphTraits
<N>::NodeType>& DT,
247
typedef
GraphTraits
<Inverse<N> > InvTraits;
539
this->Split<Inverse<NodeT*>,
GraphTraits
<Inverse<NodeT*> > >(*this, NewBB);
541
this->Split<NodeT*,
GraphTraits
<NodeT*> >(*this, NewBB);
574
friend void Calculate(DominatorTreeBase<typename
GraphTraits
<N>::NodeType>& DT,
650
typedef
GraphTraits
<FT*> TraitsTy;
874
/// DominatorTree
GraphTraits
specialization so the DominatorTree can be
877
template <> struct
GraphTraits
<DomTreeNode*> {
902
template <> struct
GraphTraits
<DominatorTree*
[
all
...]
LoopInfo.h
35
#include "llvm/ADT/
GraphTraits
.h"
150
typedef
GraphTraits
<const BlockT*> BlockTraits;
166
typedef
GraphTraits
<Inverse<BlockT*> > InvBlockTraits;
682
template <> struct
GraphTraits
<const Loop*> {
695
template <> struct
GraphTraits
<Loop*> {
IntervalIterator.h
88
template<class NodeTy, class OrigContainer_t, class GT =
GraphTraits
<NodeTy*>,
89
class IGT =
GraphTraits
<Inverse<NodeTy*> > >
/external/clang/include/clang/AST/
StmtGraphTraits.h
10
// This file defines a template specialization of llvm::
GraphTraits
to
20
#include "llvm/ADT/
GraphTraits
.h"
24
//template <typename T> struct
GraphTraits
;
27
template <> struct
GraphTraits
<clang::Stmt*> {
54
template <> struct
GraphTraits
<const clang::Stmt*> {
/external/llvm/include/llvm/CodeGen/
MachineDominators.h
175
/// DominatorTree
GraphTraits
specialization so the DominatorTree can be
179
template<class T> struct
GraphTraits
;
181
template <> struct
GraphTraits
<MachineDomTreeNode *> {
196
template <> struct
GraphTraits
<MachineDominatorTree*>
197
: public
GraphTraits
<MachineDomTreeNode *> {
MachineFunction.h
464
//
GraphTraits
specializations for function basic block graphs (CFGs)
467
// Provide specializations of
GraphTraits
to be able to treat a
472
template <> struct
GraphTraits
<MachineFunction*> :
473
public
GraphTraits
<MachineBasicBlock*> {
484
template <> struct
GraphTraits
<const MachineFunction*> :
485
public
GraphTraits
<const MachineBasicBlock*> {
504
// Provide specializations of
GraphTraits
to be able to treat a function as a
509
template <> struct
GraphTraits
<Inverse<MachineFunction*> > :
510
public
GraphTraits
<Inverse<MachineBasicBlock*> > {
515
template <> struct
GraphTraits
<Inverse<const MachineFunction*> >
[
all
...]
MachineLoopInfo.h
162
template <> struct
GraphTraits
<const MachineLoop*> {
175
template <> struct
GraphTraits
<MachineLoop*> {
MachineBasicBlock.h
17
#include "llvm/ADT/
GraphTraits
.h"
661
//
GraphTraits
specializations for machine basic block graphs (machine-CFGs)
664
// Provide specializations of
GraphTraits
to be able to treat a
668
template <> struct
GraphTraits
<MachineBasicBlock *> {
681
template <> struct
GraphTraits
<const MachineBasicBlock *> {
694
// Provide specializations of
GraphTraits
to be able to treat a
700
template <> struct
GraphTraits
<Inverse<MachineBasicBlock*> > {
714
template <> struct
GraphTraits
<Inverse<const MachineBasicBlock*> > {
ScheduleDAG.h
20
#include "llvm/ADT/
GraphTraits
.h"
667
template <> struct
GraphTraits
<SUnit*> {
679
template <> struct
GraphTraits
<ScheduleDAG*> : public
GraphTraits
<SUnit*> {
/external/clang/include/clang/Analysis/
CallGraph.h
23
#include "llvm/ADT/
GraphTraits
.h"
173
template <> struct
GraphTraits
<clang::CallGraphNode*> {
191
template <> struct
GraphTraits
<const clang::CallGraphNode*> {
199
template <> struct
GraphTraits
<clang::CallGraph*>
200
: public
GraphTraits
<clang::CallGraphNode*> {
225
template <> struct
GraphTraits
<const clang::CallGraph*> :
226
public
GraphTraits
<const clang::CallGraphNode*> {
CFG.h
22
#include "llvm/ADT/
GraphTraits
.h"
837
//
GraphTraits
specializations for CFG basic block graphs (source-level CFGs)
860
template <> struct
GraphTraits
< ::clang::CFGBlock *> {
874
template <> struct
GraphTraits
< const ::clang::CFGBlock *> {
888
template <> struct
GraphTraits
<Inverse< ::clang::CFGBlock*> > {
902
template <> struct
GraphTraits
<Inverse<const ::clang::CFGBlock*> > {
918
template <> struct
GraphTraits
< ::clang::CFG* >
919
: public
GraphTraits
< ::clang::CFGBlock *> {
[
all
...]
/external/clang/include/clang/Analysis/Analyses/
Dominators.h
19
#include "llvm/ADT/
GraphTraits
.h"
166
/// DominatorTree
GraphTraits
specialization so the DominatorTree can be
170
template <> struct
GraphTraits
< ::clang::DomTreeNode* > {
195
template <> struct
GraphTraits
< ::clang::DominatorTree* >
196
: public
GraphTraits
< ::clang::DomTreeNode* > {
/external/llvm/include/llvm/IR/
Type.h
32
template<class GraphType> struct
GraphTraits
;
440
// Provide specializations of
GraphTraits
to be able to treat a type as a
444
template <> struct
GraphTraits
<Type*> {
457
template <> struct
GraphTraits
<const Type*> {
Completed in 462 milliseconds
1
2