Home
last modified time | relevance | path

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

/third_party/skia/third_party/externals/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 …]
/third_party/skia/third_party/externals/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 …]
/third_party/skia/third_party/externals/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()
/third_party/boost/boost/graph/detail/
Dcompressed_sparse_row_struct.hpp666 template < typename GraphT, typename VertexIndexMap >
669 typedef typename boost::graph_traits< GraphT >::vertices_size_type
671 typedef typename boost::graph_traits< GraphT >::edge_descriptor
678 edge_to_index_pair(const GraphT& g, const VertexIndexMap& index) in edge_to_index_pair()
690 const GraphT* g;
694 template < typename GraphT, typename VertexIndexMap >
695 edge_to_index_pair< GraphT, VertexIndexMap > make_edge_to_index_pair( in make_edge_to_index_pair()
696 const GraphT& g, const VertexIndexMap& index) in make_edge_to_index_pair()
698 return edge_to_index_pair< GraphT, VertexIndexMap >(g, index); in make_edge_to_index_pair()
701 template < typename GraphT >
[all …]
/third_party/skia/third_party/externals/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()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/Support/
DGenericDomTree.h773 using GraphT = GraphTraits<N>;
774 using NodeRef = typename GraphT::NodeRef;
775 assert(std::distance(GraphT::child_begin(NewBB),
776 GraphT::child_end(NewBB)) == 1 &&
778 NodeRef NewBBSucc = *GraphT::child_begin(NewBB);
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Analysis/
DBlockFrequencyInfoImpl.cpp667 using GraphT = bfi_detail::IrreducibleGraph; typedef
668 using NodeRef = const GraphT::IrrNode *;
669 using ChildIteratorType = GraphT::IrrNode::iterator;
671 static NodeRef getEntryNode(const GraphT &G) { return G.StartIrr; } in getEntryNode()
/third_party/boost/libs/graph/test/
Dcsr_graph_test.cpp38 typedef boost::adjacency_list<> GraphT; typedef
39 typedef boost::erdos_renyi_iterator< boost::minstd_rand, GraphT > ERGen;
371 GraphT g(ERGen(gen, nnodes, density), ERGen(), nnodes); in graph_test()
/third_party/boost/boost/polygon/
Dpolygon_90_set_data.hpp982 template <class GraphT>
983 inline void extract(GraphT& graph) { in extract()
Dpolygon_set_data.hpp973 template <class GraphT>
974 inline void extract(GraphT& graph) { in extract()
Dpolygon_45_set_data.hpp1872 template <class GraphT>
1873 inline void extract(GraphT& graph) { in extract()