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
45
) 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
37
#include "llvm/ADT/
GraphTraits
.h"
64
class SetType = llvm::SmallPtrSet<typename
GraphTraits
<GraphT>::NodeType*, 8>,
65
bool ExtStorage = false, class GT =
GraphTraits
<GraphT> >
218
template <class T, class SetTy = std::set<typename
GraphTraits
<T>::NodeType*> >
237
class SetTy = llvm::SmallPtrSet<typename
GraphTraits
<T>::NodeType*, 8>,
261
template <class T, class SetTy = std::set<typename
GraphTraits
<T>::NodeType*> >
/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
...]
Interval.h
23
#include "llvm/ADT/
GraphTraits
.h"
121
template <> struct
GraphTraits
<Interval*> {
136
template <> struct
GraphTraits
<Inverse<Interval*> > {
PostDominators.h
97
template <> struct
GraphTraits
<PostDominatorTree*>
98
: public
GraphTraits
<DomTreeNode*> {
CallGraph.h
55
#include "llvm/ADT/
GraphTraits
.h"
392
//
GraphTraits
specializations for call graphs so that they can be treated as
398
template <> struct
GraphTraits
<CallGraphNode *> {
419
template <> struct
GraphTraits
<const CallGraphNode *> {
431
struct
GraphTraits
<CallGraph *> : public
GraphTraits
<CallGraphNode *> {
451
struct
GraphTraits
<const CallGraph *> : public
GraphTraits
<
LoopInfoImpl.h
36
typedef
GraphTraits
<BlockT*> BlockTraits;
65
typedef
GraphTraits
<BlockT*> BlockTraits;
90
typedef
GraphTraits
<BlockT*> BlockTraits;
114
typedef
GraphTraits
<BlockT*> BlockTraits;
136
typedef
GraphTraits
<Inverse<BlockT*> > InvBlockTraits;
158
typedef
GraphTraits
<Inverse<BlockT*> > InvBlockTraits;
247
typedef
GraphTraits
<BlockT*> BlockTraits;
255
typedef
GraphTraits
<Inverse<BlockT*> > InvBlockTraits;
349
typedef
GraphTraits
<Inverse<BlockT*> > InvBlockTraits;
409
typedef
GraphTraits
<BlockT*> BlockTraits
[
all
...]
IntervalIterator.h
88
template<class NodeTy, class OrigContainer_t, class GT =
GraphTraits
<NodeTy*>,
89
class IGT =
GraphTraits
<Inverse<NodeTy*> > >
LoopInfo.h
35
#include "llvm/ADT/
GraphTraits
.h"
155
typedef
GraphTraits
<const BlockT*> BlockTraits;
171
typedef
GraphTraits
<Inverse<BlockT*> > InvBlockTraits;
238
typedef
GraphTraits
<Inverse<BlockT*> > InvBlockTraits;
753
template <> struct
GraphTraits
<const Loop*> {
766
template <> struct
GraphTraits
<Loop*> {
/external/llvm/include/llvm/IR/
CFG.h
10
// This file defines specializations of
GraphTraits
that allow Function and
18
#include "llvm/ADT/
GraphTraits
.h"
268
//
GraphTraits
specializations for basic block graphs (CFGs)
271
// Provide specializations of
GraphTraits
to be able to treat a function as a
274
template <> struct
GraphTraits
<BasicBlock*> {
287
template <> struct
GraphTraits
<const BasicBlock*> {
301
// Provide specializations of
GraphTraits
to be able to treat a function as a
306
template <> struct
GraphTraits
<Inverse<BasicBlock*> > {
318
template <> struct
GraphTraits
<Inverse<const BasicBlock*> > {
335
//
GraphTraits
specializations for function basic block graphs (CFGs
[
all
...]
Dominators.h
20
#include "llvm/ADT/
GraphTraits
.h"
39
DominatorTreeBase<
GraphTraits
<BasicBlock *>::NodeType> &DT LLVM_COMMA
43
DominatorTreeBase<
GraphTraits
<Inverse<BasicBlock *> >::NodeType> &DT
114
// DominatorTree
GraphTraits
specializations so the DominatorTree can be
117
template <> struct
GraphTraits
<DomTreeNode*> {
142
template <> struct
GraphTraits
<DominatorTree*>
143
: public
GraphTraits
<DomTreeNode*> {
Type.h
35
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*> {
/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
475
//
GraphTraits
specializations for function basic block graphs (CFGs)
478
// Provide specializations of
GraphTraits
to be able to treat a
483
template <> struct
GraphTraits
<MachineFunction*> :
484
public
GraphTraits
<MachineBasicBlock*> {
495
template <> struct
GraphTraits
<const MachineFunction*> :
496
public
GraphTraits
<const MachineBasicBlock*> {
515
// Provide specializations of
GraphTraits
to be able to treat a function as a
520
template <> struct
GraphTraits
<Inverse<MachineFunction*> > :
521
public
GraphTraits
<Inverse<MachineBasicBlock*> > {
526
template <> struct
GraphTraits
<Inverse<const MachineFunction*> >
[
all
...]
MachineLoopInfo.h
163
template <> struct
GraphTraits
<const MachineLoop*> {
176
template <> struct
GraphTraits
<MachineLoop*> {
ScheduleDAG.h
20
#include "llvm/ADT/
GraphTraits
.h"
663
template <> struct
GraphTraits
<SUnit*> {
675
template <> struct
GraphTraits
<ScheduleDAG*> : public
GraphTraits
<SUnit*> {
MachineBasicBlock.h
17
#include "llvm/ADT/
GraphTraits
.h"
696
//
GraphTraits
specializations for machine basic block graphs (machine-CFGs)
699
// Provide specializations of
GraphTraits
to be able to treat a
703
template <> struct
GraphTraits
<MachineBasicBlock *> {
716
template <> struct
GraphTraits
<const MachineBasicBlock *> {
729
// Provide specializations of
GraphTraits
to be able to treat a
735
template <> struct
GraphTraits
<Inverse<MachineBasicBlock*> > {
749
template <> struct
GraphTraits
<Inverse<const MachineBasicBlock*> > {
/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"
[
all
...]
/external/clang/include/clang/Analysis/Analyses/
Dominators.h
19
#include "llvm/ADT/
GraphTraits
.h"
167
/// DominatorTree
GraphTraits
specialization so the DominatorTree can be
171
template <> struct
GraphTraits
< ::clang::DomTreeNode* > {
196
template <> struct
GraphTraits
< ::clang::DominatorTree* >
197
: public
GraphTraits
< ::clang::DomTreeNode* > {
/external/llvm/include/llvm/Support/
GenericDomTreeConstruction.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;
GenericDomTree.h
23
#include "llvm/ADT/
GraphTraits
.h"
177
void Calculate(DominatorTreeBase<typename
GraphTraits
<N>::NodeType>& DT,
241
typedef
GraphTraits
<Inverse<N> > InvTraits;
568
this->Split<Inverse<NodeT*>,
GraphTraits
<Inverse<NodeT*> > >(*this, NewBB);
570
this->Split<NodeT*,
GraphTraits
<NodeT*> >(*this, NewBB);
603
friend void Calculate(DominatorTreeBase<typename
GraphTraits
<N>::NodeType>& DT,
679
typedef
GraphTraits
<FT*> TraitsTy;
/external/llvm/lib/IR/
Dominators.cpp
69
DominatorTreeBase<
GraphTraits
<BasicBlock *>::NodeType> &DT LLVM_COMMA
73
DominatorTreeBase<
GraphTraits
<Inverse<BasicBlock *> >::NodeType> &DT
Completed in 870 milliseconds
1
2