OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:GraphT
(Results
1 - 8
of
8
) sorted by null
/external/llvm/include/llvm/Support/
GenericDomTreeConstruction.h
33
template<class
GraphT
>
34
unsigned DFSPass(DominatorTreeBase<typename
GraphT
::NodeType>& DT,
35
typename
GraphT
::NodeType* V, unsigned N) {
56
SmallVector<std::pair<typename
GraphT
::NodeType*,
57
typename
GraphT
::ChildIteratorType>, 32> Worklist;
58
Worklist.push_back(std::make_pair(V,
GraphT
::child_begin(V)));
60
typename
GraphT
::NodeType* BB = Worklist.back().first;
61
typename
GraphT
::ChildIteratorType NextSucc = Worklist.back().second;
63
typename DominatorTreeBase<typename
GraphT
::NodeType>::InfoRec &BBInfo =
67
if (NextSucc ==
GraphT
::child_begin(BB))
[
all
...]
GenericDomTree.h
232
template<class N, class
GraphT
>
233
void Split(DominatorTreeBase<typename
GraphT
::NodeType>& DT,
234
typename
GraphT
::NodeType* NewBB) {
235
assert(std::distance(
GraphT
::child_begin(NewBB),
236
GraphT
::child_end(NewBB)) == 1 &&
238
typename
GraphT
::NodeType* NewBBSucc = *
GraphT
::child_begin(NewBB);
240
std::vector<typename
GraphT
::NodeType*> PredBlocks;
591
template<class
GraphT
>
592
friend typename
GraphT
::NodeType* Eval
[
all
...]
/external/llvm/include/llvm/Analysis/
DOTGraphTraitsPass.h
25
/// This assumes that '
GraphT
' is 'AnalysisT *' and so just passes it through.
26
template <typename AnalysisT, typename
GraphT
= AnalysisT *>
28
static
GraphT
getGraph(AnalysisT *A) { return A; }
32
typename AnalysisT, bool IsSimple, typename
GraphT
= AnalysisT *,
40
GraphT
Graph = AnalysisGraphTraitsT::getGraph(&getAnalysis<AnalysisT>());
41
std::string GraphName = DOTGraphTraits<
GraphT
>::getGraphName(Graph);
59
typename AnalysisT, bool IsSimple, typename
GraphT
= AnalysisT *,
67
GraphT
Graph = AnalysisGraphTraitsT::getGraph(&getAnalysis<AnalysisT>());
74
std::string GraphName = DOTGraphTraits<
GraphT
>::getGraphName(Graph);
96
typename AnalysisT, bool IsSimple, typename
GraphT
= AnalysisT *
[
all
...]
/external/llvm/include/llvm/CodeGen/PBQP/
ReductionRules.h
27
template <typename
GraphT
>
28
void applyR1(
GraphT
&G, typename
GraphT
::NodeId NId) {
29
typedef typename
GraphT
::NodeId NodeId;
30
typedef typename
GraphT
::EdgeId EdgeId;
31
typedef typename
GraphT
::Vector Vector;
32
typedef typename
GraphT
::Matrix Matrix;
33
typedef typename
GraphT
::RawVector RawVector;
71
template <typename
GraphT
>
72
void applyR2(
GraphT
&G, typename GraphT::NodeId NId)
[
all
...]
/external/llvm/include/llvm/ADT/
SCCIterator.h
39
template <class
GraphT
, class GT = GraphTraits<
GraphT
>>
42
scc_iterator<
GraphT
, GT>, std::forward_iterator_tag,
100
static scc_iterator begin(const
GraphT
&G) {
103
static scc_iterator end(const
GraphT
&) { return scc_iterator(); }
141
template <class
GraphT
, class GT>
142
void scc_iterator<
GraphT
, GT>::DFSVisitOne(NodeType *N) {
153
template <class
GraphT
, class GT>
154
void scc_iterator<
GraphT
, GT>::DFSVisitChildren() {
173
template <class
GraphT
, class GT> void scc_iterator<GraphT, GT>::GetNextSCC()
[
all
...]
PostOrderIterator.h
87
template<class
GraphT
,
88
class SetType = llvm::SmallPtrSet<typename GraphTraits<
GraphT
>::NodeType*, 8>,
90
class GT = GraphTraits<
GraphT
> >
133
typedef po_iterator<
GraphT
, SetType, ExtStorage, GT> _Self;
136
static inline _Self begin(
GraphT
G) { return _Self(GT::getEntryNode(G)); }
137
static inline _Self end (
GraphT
G) { return _Self(); }
139
static inline _Self begin(
GraphT
G, SetType &S) {
142
static inline _Self end (
GraphT
G, SetType &S) { return _Self(S); }
258
template<class
GraphT
, class GT = GraphTraits<
GraphT
> >
[
all
...]
DepthFirstIterator.h
63
template<class
GraphT
,
64
class SetType = llvm::SmallPtrSet<typename GraphTraits<
GraphT
>::NodeType*, 8>,
65
bool ExtStorage = false, class GT = GraphTraits<
GraphT
> >
132
typedef df_iterator<
GraphT
, SetType, ExtStorage, GT> _Self;
135
static inline _Self begin(const
GraphT
& G) {
138
static inline _Self end(const
GraphT
& G) { return _Self(); }
141
static inline _Self begin(const
GraphT
& G, SetType &S) {
144
static inline _Self end(const
GraphT
& G, SetType &S) { return _Self(S); }
/external/llvm/lib/Analysis/
BlockFrequencyInfoImpl.cpp
576
typedef bfi_detail::IrreducibleGraph
GraphT
;
578
typedef const
GraphT
::IrrNode NodeType;
579
typedef
GraphT
::IrrNode::iterator ChildIteratorType;
581
static const NodeType *getEntryNode(const
GraphT
&G) {
Completed in 193 milliseconds