Home
last modified time | relevance | path

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

12

/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/llvm-project/llvm/include/llvm/Analysis/
DDOTGraphTraitsPass.h23 template <typename AnalysisT, typename GraphT = AnalysisT *>
25 static GraphT getGraph(AnalysisT *A) { return A; } in getGraph()
29 typename AnalysisT, bool IsSimple, typename GraphT = AnalysisT *,
30 typename AnalysisGraphTraitsT = DefaultAnalysisGraphTraits<AnalysisT, GraphT> >
52 GraphT Graph = AnalysisGraphTraitsT::getGraph(&Analysis); in runOnFunction()
53 std::string GraphName = DOTGraphTraits<GraphT>::getGraphName(Graph); in runOnFunction()
71 typename AnalysisT, bool IsSimple, typename GraphT = AnalysisT *,
72 typename AnalysisGraphTraitsT = DefaultAnalysisGraphTraits<AnalysisT, GraphT> >
94 GraphT Graph = AnalysisGraphTraitsT::getGraph(&Analysis); in runOnFunction()
101 std::string GraphName = DOTGraphTraits<GraphT>::getGraphName(Graph); in runOnFunction()
[all …]
/external/swiftshader/third_party/llvm-10.0/llvm/include/llvm/Analysis/
DDOTGraphTraitsPass.h25 template <typename AnalysisT, typename GraphT = AnalysisT *>
27 static GraphT getGraph(AnalysisT *A) { return A; } in getGraph()
31 typename AnalysisT, bool IsSimple, typename GraphT = AnalysisT *,
32 typename AnalysisGraphTraitsT = DefaultAnalysisGraphTraits<AnalysisT, GraphT> >
54 GraphT Graph = AnalysisGraphTraitsT::getGraph(&Analysis); in runOnFunction()
55 std::string GraphName = DOTGraphTraits<GraphT>::getGraphName(Graph); in runOnFunction()
73 typename AnalysisT, bool IsSimple, typename GraphT = AnalysisT *,
74 typename AnalysisGraphTraitsT = DefaultAnalysisGraphTraits<AnalysisT, GraphT> >
96 GraphT Graph = AnalysisGraphTraitsT::getGraph(&Analysis); in runOnFunction()
103 std::string GraphName = DOTGraphTraits<GraphT>::getGraphName(Graph); in runOnFunction()
[all …]
/external/swiftshader/third_party/llvm-10.0/llvm/include/llvm/CodeGen/PBQP/
DReductionRules.h29 template <typename GraphT>
30 void applyR1(GraphT &G, typename GraphT::NodeId NId) { in applyR1()
31 using NodeId = typename GraphT::NodeId; in applyR1()
32 using EdgeId = typename GraphT::EdgeId; in applyR1()
33 using Vector = typename GraphT::Vector; in applyR1()
34 using Matrix = typename GraphT::Matrix; in applyR1()
35 using RawVector = typename GraphT::RawVector; in applyR1()
73 template <typename GraphT>
74 void applyR2(GraphT &G, typename GraphT::NodeId NId) { in applyR2()
75 using NodeId = typename GraphT::NodeId; in applyR2()
[all …]
/external/llvm-project/llvm/include/llvm/CodeGen/PBQP/
DReductionRules.h29 template <typename GraphT>
30 void applyR1(GraphT &G, typename GraphT::NodeId NId) { in applyR1()
31 using NodeId = typename GraphT::NodeId; in applyR1()
32 using EdgeId = typename GraphT::EdgeId; in applyR1()
33 using Vector = typename GraphT::Vector; in applyR1()
34 using Matrix = typename GraphT::Matrix; in applyR1()
35 using RawVector = typename GraphT::RawVector; in applyR1()
73 template <typename GraphT>
74 void applyR2(GraphT &G, typename GraphT::NodeId NId) { in applyR2()
75 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-10.0/llvm/include/llvm/ADT/
DSCCIterator.h41 template <class GraphT, class GT = GraphTraits<GraphT>>
43 scc_iterator<GraphT, GT>, std::forward_iterator_tag,
101 static scc_iterator begin(const GraphT &G) { in begin()
104 static scc_iterator end(const GraphT &) { return scc_iterator(); } in end() argument
145 template <class GraphT, class GT>
146 void scc_iterator<GraphT, GT>::DFSVisitOne(NodeRef N) { in DFSVisitOne()
157 template <class GraphT, class GT>
158 void scc_iterator<GraphT, GT>::DFSVisitChildren() { in DFSVisitChildren()
177 template <class GraphT, class GT> void scc_iterator<GraphT, GT>::GetNextSCC() { in GetNextSCC()
214 template <class GraphT, class GT>
[all …]
DPostOrderIterator.h91 template <class GraphT,
93 SmallPtrSet<typename GraphTraits<GraphT>::NodeRef, 8>,
94 bool ExtStorage = false, class GT = GraphTraits<GraphT>>
140 static po_iterator begin(GraphT G) { in begin()
143 static po_iterator end(GraphT G) { return po_iterator(); } in end()
145 static po_iterator begin(GraphT G, SetType &S) { in begin()
148 static po_iterator end(GraphT G, SetType &S) { return po_iterator(S); } in end()
286 template<class GraphT, class GT = GraphTraits<GraphT>>
300 ReversePostOrderTraversal(GraphT G) { Initialize(GT::getEntryNode(G)); } in ReversePostOrderTraversal()
DBreadthFirstIterator.h43 template <class GraphT,
45 bf_iterator_default_set<typename GraphTraits<GraphT>::NodeRef>,
46 class GT = GraphTraits<GraphT>>
113 static bf_iterator begin(const GraphT &G) { in begin()
117 static bf_iterator end(const GraphT &G) { return bf_iterator(); } in end()
DDepthFirstIterator.h81 template <class GraphT,
83 df_iterator_default_set<typename GraphTraits<GraphT>::NodeRef>,
84 bool ExtStorage = false, class GT = GraphTraits<GraphT>>
150 static df_iterator begin(const GraphT &G) { in begin()
153 static df_iterator end(const GraphT &G) { return df_iterator(); } in end()
156 static df_iterator begin(const GraphT &G, SetType &S) { in begin()
159 static df_iterator end(const GraphT &G, SetType &S) { return df_iterator(S); } in end()
/external/llvm-project/llvm/include/llvm/ADT/
DSCCIterator.h41 template <class GraphT, class GT = GraphTraits<GraphT>>
43 scc_iterator<GraphT, GT>, std::forward_iterator_tag,
101 static scc_iterator begin(const GraphT &G) { in begin()
104 static scc_iterator end(const GraphT &) { return scc_iterator(); } in end() argument
145 template <class GraphT, class GT>
146 void scc_iterator<GraphT, GT>::DFSVisitOne(NodeRef N) { in DFSVisitOne()
157 template <class GraphT, class GT>
158 void scc_iterator<GraphT, GT>::DFSVisitChildren() { in DFSVisitChildren()
177 template <class GraphT, class GT> void scc_iterator<GraphT, GT>::GetNextSCC() { in GetNextSCC()
214 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>>
301 ReversePostOrderTraversal(GraphT G) { Initialize(GT::getEntryNode(G)); } in ReversePostOrderTraversal()
DBreadthFirstIterator.h43 template <class GraphT,
45 bf_iterator_default_set<typename GraphTraits<GraphT>::NodeRef>,
46 class GT = GraphTraits<GraphT>>
113 static bf_iterator begin(const GraphT &G) { in begin()
117 static bf_iterator end(const GraphT &G) { return bf_iterator(); } in end()
DDepthFirstIterator.h81 template <class GraphT,
83 df_iterator_default_set<typename GraphTraits<GraphT>::NodeRef>,
84 bool ExtStorage = false, class GT = GraphTraits<GraphT>>
150 static df_iterator begin(const GraphT &G) { in begin()
153 static df_iterator end(const GraphT &G) { return df_iterator(); } in end()
156 static df_iterator begin(const GraphT &G, SetType &S) { in begin()
159 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/llvm-project/llvm/lib/Target/X86/
DImmutableGraph.h294 template <typename GraphT> class ImmutableGraphBuilder {
295 using node_value_type = typename GraphT::node_value_type;
296 using edge_value_type = typename GraphT::edge_value_type;
299 GraphT>::value,
302 using size_type = typename GraphT::size_type;
303 using NodeSet = typename GraphT::NodeSet;
304 using Node = typename GraphT::Node;
305 using EdgeSet = typename GraphT::EdgeSet;
306 using Edge = typename GraphT::Edge;
327 template <typename... ArgT> std::unique_ptr<GraphT> get(ArgT &&... Args) { in get()
[all …]
/external/llvm-project/llvm/tools/llvm-xray/
Dxray-graph-diff.h34 using GREdgeValueType = GraphRenderer::GraphT::EdgeValueType;
35 using GRVertexValueType = GraphRenderer::GraphT::VertexValueType;
45 using GraphT = Graph<VertexAttribute, EdgeAttribute, StringRef>; variable
48 std::array<std::reference_wrapper<const GraphRenderer::GraphT>, N> G;
57 GraphT G;
68 const GraphT &getGraph() { return G; } in getGraph()
Dxray-graph-diff.cpp231 GraphT::EdgeIdentifier ID{EdgeTailAttrOrErr->SymbolName, in getGraphDiffRenderer()
250 static std::string getColor(const GraphDiffRenderer::GraphT::EdgeValueType &E, in getColor()
251 const GraphDiffRenderer::GraphT &G, ColorHelper H, in getColor()
271 static std::string getColor(const GraphDiffRenderer::GraphT::VertexValueType &V, in getColor()
272 const GraphDiffRenderer::GraphT &G, ColorHelper H, in getColor()
303 static std::string getLabel(const GraphDiffRenderer::GraphT::EdgeValueType &E, in getLabel()
321 static std::string getLabel(const GraphDiffRenderer::GraphT::VertexValueType &V, in getLabel()
343 static double getLineWidth(const GraphDiffRenderer::GraphT::EdgeValueType &E, in getLineWidth()
433 std::array<GraphRenderer::GraphT, 2> Graphs; in __anon5a5c4f850102()
/external/llvm-project/llvm/unittests/XRay/
DGraphTest.cpp25 typedef Graph<VAttr, EAttr, unsigned> GraphT; typedef
26 typedef typename GraphT::VertexIdentifier VI;
27 typedef typename GraphT::EdgeIdentifier EI;
57 typedef ::testing::Types<GraphT, const GraphT> GraphTestTypes;
59 using VVT = typename GraphT::VertexValueType;
60 using EVT = typename GraphT::EdgeValueType;
182 GraphT MG; in TEST()
183 const GraphT &G = MG; in TEST()
199 GraphT MG; in TEST()
200 const GraphT &G = MG; in TEST()
[all …]
/external/llvm-project/llvm/include/llvm/XRay/
DGraph.h202 using GraphT = std::conditional_t<isConst, const Graph, Graph>; variable
253 InOutEdgeView(GraphT &G, VertexIdentifier A) in InOutEdgeView()
278 using GraphT = std::conditional_t<isConst, const Graph, Graph>; variable
281 GraphT &G;
292 VertexView(GraphT &_G) : G(_G) {} in VertexView()
315 using GraphT = std::conditional_t<isConst, const Graph, Graph>; variable
318 GraphT &G;
329 EdgeView(GraphT &_G) : G(_G) {} in EdgeView()
/external/swiftshader/third_party/llvm-10.0/llvm/include/llvm/XRay/
DGraph.h202 using GraphT = typename std::conditional<isConst, const Graph, Graph>::type; variable
253 InOutEdgeView(GraphT &G, VertexIdentifier A) in InOutEdgeView()
278 using GraphT = typename std::conditional<isConst, const Graph, Graph>::type; variable
281 GraphT &G;
292 VertexView(GraphT &_G) : G(_G) {} in VertexView()
315 using GraphT = typename std::conditional<isConst, const Graph, Graph>::type; variable
318 GraphT &G;
329 EdgeView(GraphT &_G) : G(_G) {} in EdgeView()

12