OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:GraphT
(Results
1 - 9
of
9
) sorted by null
/external/llvm/include/llvm/Support/
GenericDomTreeConstruction.h
32
template<class
GraphT
>
33
unsigned DFSPass(DominatorTreeBase<typename
GraphT
::NodeType>& DT,
34
typename
GraphT
::NodeType* V, unsigned N) {
55
SmallVector<std::pair<typename
GraphT
::NodeType*,
56
typename
GraphT
::ChildIteratorType>, 32> Worklist;
57
Worklist.push_back(std::make_pair(V,
GraphT
::child_begin(V)));
59
typename
GraphT
::NodeType* BB = Worklist.back().first;
60
typename
GraphT
::ChildIteratorType NextSucc = Worklist.back().second;
62
typename DominatorTreeBase<typename
GraphT
::NodeType>::InfoRec &BBInfo =
66
if (NextSucc ==
GraphT
::child_begin(BB))
[
all
...]
GenericDomTree.h
252
template <class N, class
GraphT
>
253
void Split(DominatorTreeBase<typename
GraphT
::NodeType> &DT,
254
typename
GraphT
::NodeType *NewBB) {
255
assert(std::distance(
GraphT
::child_begin(NewBB),
256
GraphT
::child_end(NewBB)) == 1 &&
258
typename
GraphT
::NodeType *NewBBSucc = *
GraphT
::child_begin(NewBB);
260
std::vector<typename
GraphT
::NodeType *> PredBlocks;
631
template <class
GraphT
>
632
friend typename
GraphT
::NodeType
[
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 *,
55
GraphT
Graph = AnalysisGraphTraitsT::getGraph(&Analysis);
56
std::string GraphName = DOTGraphTraits<
GraphT
>::getGraphName(Graph);
74
typename AnalysisT, bool IsSimple, typename
GraphT
= AnalysisT *,
97
GraphT
Graph = AnalysisGraphTraitsT::getGraph(&Analysis);
104
std::string GraphName = DOTGraphTraits<
GraphT
>::getGraphName(Graph);
126
typename AnalysisT, bool IsSimple, typename
GraphT
= AnalysisT *
[
all
...]
/external/llvm/include/llvm/CodeGen/PBQP/
ReductionRules.h
28
template <typename
GraphT
>
29
void applyR1(
GraphT
&G, typename
GraphT
::NodeId NId) {
30
typedef typename
GraphT
::NodeId NodeId;
31
typedef typename
GraphT
::EdgeId EdgeId;
32
typedef typename
GraphT
::Vector Vector;
33
typedef typename
GraphT
::Matrix Matrix;
34
typedef typename
GraphT
::RawVector RawVector;
72
template <typename
GraphT
>
73
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
89
template<class
GraphT
,
90
class SetType = llvm::SmallPtrSet<typename GraphTraits<
GraphT
>::NodeType*, 8>,
92
class GT = GraphTraits<
GraphT
> >
137
static po_iterator begin(
GraphT
G) {
140
static po_iterator end(
GraphT
G) { return po_iterator(); }
142
static po_iterator begin(
GraphT
G, SetType &S) {
145
static po_iterator end(
GraphT
G, SetType &S) { return po_iterator(S); }
281
template<class
GraphT
, class GT = GraphTraits<
GraphT
> >
291
ReversePostOrderTraversal(
GraphT
G) { Initialize(GT::getEntryNode(G));
[
all
...]
DepthFirstIterator.h
62
template<class
GraphT
,
63
class SetType = llvm::SmallPtrSet<typename GraphTraits<
GraphT
>::NodeType*, 8>,
64
bool ExtStorage = false, class GT = GraphTraits<
GraphT
> >
133
static df_iterator begin(const
GraphT
&G) {
136
static df_iterator end(const
GraphT
&G) { return df_iterator(); }
139
static df_iterator begin(const
GraphT
&G, SetType &S) {
142
static df_iterator end(const
GraphT
&G, SetType &S) { return df_iterator(S); }
/external/llvm/lib/Analysis/
CFLAliasAnalysis.cpp
631
typedef WeightedBidirectionalGraph<std::pair<EdgeType, StratifiedAttrs>>
GraphT
;
632
typedef DenseMap<Value *,
GraphT
::Node> NodeMapT;
661
SmallVectorImpl<Value *> &, NodeMapT &,
GraphT
&);
677
GraphT
&);
814
NodeMapT &Map,
GraphT
&Graph) {
816
auto Pair = Map.insert(std::make_pair(Val,
GraphT
::Node()));
877
NodeMapT &Map,
GraphT
&Graph) {
908
GraphT
Graph;
[
all
...]
BlockFrequencyInfoImpl.cpp
597
typedef bfi_detail::IrreducibleGraph
GraphT
;
599
typedef const
GraphT
::IrrNode NodeType;
600
typedef
GraphT
::IrrNode::iterator ChildIteratorType;
602
static const NodeType *getEntryNode(const
GraphT
&G) {
Completed in 647 milliseconds