Home
last modified time | relevance | path

Searched refs:GraphT (Results 1 – 25 of 26) sorted by relevance

12

/external/swiftshader/third_party/LLVM/include/llvm/Analysis/
DDominatorInternals.h33 template<class GraphT>
34 unsigned DFSPass(DominatorTreeBase<typename GraphT::NodeType>& DT, in DFSPass()
35 typename GraphT::NodeType* V, unsigned N) { in DFSPass()
56 SmallVector<std::pair<typename GraphT::NodeType*, in DFSPass()
57 typename GraphT::ChildIteratorType>, 32> Worklist; in DFSPass()
58 Worklist.push_back(std::make_pair(V, GraphT::child_begin(V))); in DFSPass()
60 typename GraphT::NodeType* BB = Worklist.back().first; in DFSPass()
61 typename GraphT::ChildIteratorType NextSucc = Worklist.back().second; in DFSPass()
63 typename DominatorTreeBase<typename GraphT::NodeType>::InfoRec &BBInfo = in DFSPass()
67 if (NextSucc == GraphT::child_begin(BB)) { in DFSPass()
[all …]
DDominators.h226 template<class N, class GraphT>
227 void Split(DominatorTreeBase<typename GraphT::NodeType>& DT, in Split()
228 typename GraphT::NodeType* NewBB) { in Split()
229 assert(std::distance(GraphT::child_begin(NewBB), in Split()
230 GraphT::child_end(NewBB)) == 1 && in Split()
232 typename GraphT::NodeType* NewBBSucc = *GraphT::child_begin(NewBB); in Split()
234 std::vector<typename GraphT::NodeType*> PredBlocks; in Split()
566 template<class GraphT>
567 friend typename GraphT::NodeType* Eval(
568 DominatorTreeBase<typename GraphT::NodeType>& DT,
[all …]
/external/llvm/include/llvm/Support/
DGenericDomTreeConstruction.h32 template<class GraphT>
33 unsigned DFSPass(DominatorTreeBase<typename GraphT::NodeType>& DT, in DFSPass()
34 typename GraphT::NodeType* V, unsigned N) { in DFSPass()
55 SmallVector<std::pair<typename GraphT::NodeType*, in DFSPass()
56 typename GraphT::ChildIteratorType>, 32> Worklist; in DFSPass()
57 Worklist.push_back(std::make_pair(V, GraphT::child_begin(V))); in DFSPass()
59 typename GraphT::NodeType* BB = Worklist.back().first; in DFSPass()
60 typename GraphT::ChildIteratorType NextSucc = Worklist.back().second; in DFSPass()
62 typename DominatorTreeBase<typename GraphT::NodeType>::InfoRec &BBInfo = in DFSPass()
66 if (NextSucc == GraphT::child_begin(BB)) { in DFSPass()
[all …]
DGenericDomTree.h253 template <class N, class GraphT>
254 void Split(DominatorTreeBase<typename GraphT::NodeType> &DT, in Split()
255 typename GraphT::NodeType *NewBB) { in Split()
256 assert(std::distance(GraphT::child_begin(NewBB), in Split()
257 GraphT::child_end(NewBB)) == 1 && in Split()
259 typename GraphT::NodeType *NewBBSucc = *GraphT::child_begin(NewBB); in Split()
261 std::vector<typename GraphT::NodeType *> PredBlocks; in Split()
629 template <class GraphT>
630 friend typename GraphT::NodeType *
631 Eval(DominatorTreeBase<typename GraphT::NodeType> &DT,
[all …]
/external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/Analysis/
DDOTGraphTraitsPass.h26 template <typename AnalysisT, typename GraphT = AnalysisT *>
28 static GraphT getGraph(AnalysisT *A) { return A; } in getGraph()
32 typename AnalysisT, bool IsSimple, typename GraphT = AnalysisT *,
33 typename AnalysisGraphTraitsT = DefaultAnalysisGraphTraits<AnalysisT, GraphT> >
55 GraphT Graph = AnalysisGraphTraitsT::getGraph(&Analysis); in runOnFunction()
56 std::string GraphName = DOTGraphTraits<GraphT>::getGraphName(Graph); in runOnFunction()
74 typename AnalysisT, bool IsSimple, typename GraphT = AnalysisT *,
75 typename AnalysisGraphTraitsT = DefaultAnalysisGraphTraits<AnalysisT, GraphT> >
97 GraphT Graph = AnalysisGraphTraitsT::getGraph(&Analysis); in runOnFunction()
104 std::string GraphName = DOTGraphTraits<GraphT>::getGraphName(Graph); in runOnFunction()
[all …]
/external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/CodeGen/PBQP/
DReductionRules.h30 template <typename GraphT>
31 void applyR1(GraphT &G, typename GraphT::NodeId NId) { in applyR1()
32 using NodeId = typename GraphT::NodeId; in applyR1()
33 using EdgeId = typename GraphT::EdgeId; in applyR1()
34 using Vector = typename GraphT::Vector; in applyR1()
35 using Matrix = typename GraphT::Matrix; in applyR1()
36 using RawVector = typename GraphT::RawVector; in applyR1()
74 template <typename GraphT>
75 void applyR2(GraphT &G, typename GraphT::NodeId NId) { in applyR2()
76 using NodeId = typename GraphT::NodeId; in applyR2()
[all …]
/external/llvm/include/llvm/CodeGen/PBQP/
DReductionRules.h28 template <typename GraphT>
29 void applyR1(GraphT &G, typename GraphT::NodeId NId) { in applyR1()
30 typedef typename GraphT::NodeId NodeId; in applyR1()
31 typedef typename GraphT::EdgeId EdgeId; in applyR1()
32 typedef typename GraphT::Vector Vector; in applyR1()
33 typedef typename GraphT::Matrix Matrix; in applyR1()
34 typedef typename GraphT::RawVector RawVector; in applyR1()
72 template <typename GraphT>
73 void applyR2(GraphT &G, typename GraphT::NodeId NId) { in applyR2()
74 typedef typename GraphT::NodeId NodeId; in applyR2()
[all …]
/external/llvm/include/llvm/Analysis/
DDOTGraphTraitsPass.h26 template <typename AnalysisT, typename GraphT = AnalysisT *>
28 static GraphT getGraph(AnalysisT *A) { return A; } in getGraph()
32 typename AnalysisT, bool IsSimple, typename GraphT = AnalysisT *,
55 GraphT Graph = AnalysisGraphTraitsT::getGraph(&Analysis); in runOnFunction()
56 std::string GraphName = DOTGraphTraits<GraphT>::getGraphName(Graph); in runOnFunction()
74 typename AnalysisT, bool IsSimple, typename GraphT = AnalysisT *,
97 GraphT Graph = AnalysisGraphTraitsT::getGraph(&Analysis); in runOnFunction()
104 std::string GraphName = DOTGraphTraits<GraphT>::getGraphName(Graph); in runOnFunction()
126 typename AnalysisT, bool IsSimple, typename GraphT = AnalysisT *,
134 GraphT Graph = AnalysisGraphTraitsT::getGraph(&getAnalysis<AnalysisT>()); in runOnModule()
[all …]
/external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/ADT/
DSCCIterator.h42 template <class GraphT, class GT = GraphTraits<GraphT>>
44 scc_iterator<GraphT, GT>, std::forward_iterator_tag,
102 static scc_iterator begin(const GraphT &G) { in begin()
105 static scc_iterator end(const GraphT &) { return scc_iterator(); } in end() argument
143 template <class GraphT, class GT>
144 void scc_iterator<GraphT, GT>::DFSVisitOne(NodeRef N) { in DFSVisitOne()
155 template <class GraphT, class GT>
156 void scc_iterator<GraphT, GT>::DFSVisitChildren() { in DFSVisitChildren()
175 template <class GraphT, class GT> void scc_iterator<GraphT, GT>::GetNextSCC() { in GetNextSCC()
212 template <class GraphT, class GT>
[all …]
DPostOrderIterator.h92 template <class GraphT,
94 SmallPtrSet<typename GraphTraits<GraphT>::NodeRef, 8>,
95 bool ExtStorage = false, class GT = GraphTraits<GraphT>>
141 static po_iterator begin(GraphT G) { in begin()
144 static po_iterator end(GraphT G) { return po_iterator(); } in end()
146 static po_iterator begin(GraphT G, SetType &S) { in begin()
149 static po_iterator end(GraphT G, SetType &S) { return po_iterator(S); } in end()
287 template<class GraphT, class GT = GraphTraits<GraphT>>
300 ReversePostOrderTraversal(GraphT G) { Initialize(GT::getEntryNode(G)); } in ReversePostOrderTraversal()
DBreadthFirstIterator.h44 template <class GraphT,
46 bf_iterator_default_set<typename GraphTraits<GraphT>::NodeRef>,
47 class GT = GraphTraits<GraphT>>
114 static bf_iterator begin(const GraphT &G) { in begin()
118 static bf_iterator end(const GraphT &G) { return bf_iterator(); } in end()
DDepthFirstIterator.h82 template <class GraphT,
84 df_iterator_default_set<typename GraphTraits<GraphT>::NodeRef>,
85 bool ExtStorage = false, class GT = GraphTraits<GraphT>>
151 static df_iterator begin(const GraphT &G) { in begin()
154 static df_iterator end(const GraphT &G) { return df_iterator(); } in end()
157 static df_iterator begin(const GraphT &G, SetType &S) { in begin()
160 static df_iterator end(const GraphT &G, SetType &S) { return df_iterator(S); } in end()
/external/llvm/include/llvm/ADT/
DSCCIterator.h39 template <class GraphT, class GT = GraphTraits<GraphT>>
42 scc_iterator<GraphT, GT>, std::forward_iterator_tag,
100 static scc_iterator begin(const GraphT &G) { in begin()
103 static scc_iterator end(const GraphT &) { return scc_iterator(); } in end() argument
141 template <class GraphT, class GT>
142 void scc_iterator<GraphT, GT>::DFSVisitOne(NodeType *N) { in DFSVisitOne()
153 template <class GraphT, class GT>
154 void scc_iterator<GraphT, GT>::DFSVisitChildren() { in DFSVisitChildren()
173 template <class GraphT, class GT> void scc_iterator<GraphT, GT>::GetNextSCC() { in GetNextSCC()
210 template <class GraphT, class GT>
[all …]
DPostOrderIterator.h89 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) { in begin()
140 static po_iterator end(GraphT G) { return po_iterator(); } in end()
142 static po_iterator begin(GraphT G, SetType &S) { in begin()
145 static po_iterator end(GraphT G, SetType &S) { return po_iterator(S); } in end()
281 template<class GraphT, class GT = GraphTraits<GraphT> >
291 ReversePostOrderTraversal(GraphT G) { Initialize(GT::getEntryNode(G)); } in ReversePostOrderTraversal()
DDepthFirstIterator.h62 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) { in begin()
136 static df_iterator end(const GraphT &G) { return df_iterator(); } in end()
139 static df_iterator begin(const GraphT &G, SetType &S) { in begin()
142 static df_iterator end(const GraphT &G, SetType &S) { return df_iterator(S); } in end()
/external/swiftshader/third_party/llvm-7.0/llvm/tools/llvm-xray/
Dxray-graph-diff.h35 using GREdgeValueType = GraphRenderer::GraphT::EdgeValueType;
36 using GRVertexValueType = GraphRenderer::GraphT::VertexValueType;
46 using GraphT = Graph<VertexAttribute, EdgeAttribute, StringRef>; variable
49 std::array<std::reference_wrapper<const GraphRenderer::GraphT>, N> G;
58 GraphT G;
69 const GraphT &getGraph() { return G; } in getGraph()
Dxray-graph-diff.cpp245 GraphT::EdgeIdentifier ID{EdgeTailAttrOrErr->SymbolName, in getGraphDiffRenderer()
264 static std::string getColor(const GraphDiffRenderer::GraphT::EdgeValueType &E, in getColor()
265 const GraphDiffRenderer::GraphT &G, ColorHelper H, in getColor()
285 static std::string getColor(const GraphDiffRenderer::GraphT::VertexValueType &V, in getColor()
286 const GraphDiffRenderer::GraphT &G, ColorHelper H, in getColor()
317 static std::string getLabel(const GraphDiffRenderer::GraphT::EdgeValueType &E, in getLabel()
335 static std::string getLabel(const GraphDiffRenderer::GraphT::VertexValueType &V, in getLabel()
355 static double getLineWidth(const GraphDiffRenderer::GraphT::EdgeValueType &E, in getLineWidth()
445 std::array<GraphRenderer::GraphT, 2> Graphs; in __anon729aabd10102()
Dxray-graph.h85 class GraphT : public Graph<FunctionStats, CallStats, int32_t> {
91 GraphT G;
164 const GraphT &getGraph() { return G; } in getGraph()
/external/swiftshader/third_party/LLVM/include/llvm/ADT/
DPostOrderIterator.h48 template<class GraphT,
49 class SetType = llvm::SmallPtrSet<typename GraphTraits<GraphT>::NodeType*, 8>,
51 class GT = GraphTraits<GraphT> >
93 typedef po_iterator<GraphT, SetType, ExtStorage, GT> _Self;
96 static inline _Self begin(GraphT G) { return _Self(GT::getEntryNode(G)); } in begin()
97 static inline _Self end (GraphT G) { return _Self(); } in end()
99 static inline _Self begin(GraphT G, SetType &S) { in begin()
102 static inline _Self end (GraphT G, SetType &S) { return _Self(S); } in end()
219 template<class GraphT, class GT = GraphTraits<GraphT> >
229 inline ReversePostOrderTraversal(GraphT G) { in ReversePostOrderTraversal()
DDepthFirstIterator.h62 template<class GraphT,
63 class SetType = llvm::SmallPtrSet<typename GraphTraits<GraphT>::NodeType*, 8>,
64 bool ExtStorage = false, class GT = GraphTraits<GraphT> >
131 typedef df_iterator<GraphT, SetType, ExtStorage, GT> _Self;
134 static inline _Self begin(const GraphT& G) { in begin()
137 static inline _Self end(const GraphT& G) { return _Self(); } in end()
140 static inline _Self begin(const GraphT& G, SetType &S) { in begin()
143 static inline _Self end(const GraphT& G, SetType &S) { return _Self(S); } in end()
DSCCIterator.h35 template<class GraphT, class GT = GraphTraits<GraphT> >
138 typedef scc_iterator<GraphT, GT> _Self;
141 static inline _Self begin(const GraphT &G){return _Self(GT::getEntryNode(G));} in begin()
142 static inline _Self end (const GraphT &) { return _Self(); } in end() argument
/external/swiftshader/third_party/llvm-7.0/llvm/unittests/XRay/
DGraphTest.cpp26 typedef Graph<VAttr, EAttr, unsigned> GraphT; typedef
27 typedef typename GraphT::VertexIdentifier VI;
28 typedef typename GraphT::EdgeIdentifier EI;
58 typedef ::testing::Types<GraphT, const GraphT> GraphTestTypes;
60 using VVT = typename GraphT::VertexValueType;
61 using EVT = typename GraphT::EdgeValueType;
183 GraphT MG; in TEST()
184 const GraphT &G = MG; in TEST()
200 GraphT MG; in TEST()
201 const GraphT &G = MG; in TEST()
[all …]
/external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/XRay/
DGraph.h203 using GraphT = typename std::conditional<isConst, const Graph, Graph>::type; variable
254 InOutEdgeView(GraphT &G, VertexIdentifier A) in InOutEdgeView()
279 using GraphT = typename std::conditional<isConst, const Graph, Graph>::type; variable
282 GraphT &G;
293 VertexView(GraphT &_G) : G(_G) {} in VertexView()
316 using GraphT = typename std::conditional<isConst, const Graph, Graph>::type; variable
319 GraphT &G;
330 EdgeView(GraphT &_G) : G(_G) {} in EdgeView()
/external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/Support/
DGenericDomTree.h796 using GraphT = GraphTraits<N>;
797 using NodeRef = typename GraphT::NodeRef;
798 assert(std::distance(GraphT::child_begin(NewBB),
799 GraphT::child_end(NewBB)) == 1 &&
801 NodeRef NewBBSucc = *GraphT::child_begin(NewBB);
/external/swiftshader/third_party/llvm-7.0/llvm/lib/Analysis/
DBlockFrequencyInfoImpl.cpp663 using GraphT = bfi_detail::IrreducibleGraph; typedef
664 using NodeRef = const GraphT::IrrNode *;
665 using ChildIteratorType = GraphT::IrrNode::iterator;
667 static NodeRef getEntryNode(const GraphT &G) { return G.StartIrr; } in getEntryNode()

12