| /freebsd-12.1/contrib/llvm/include/llvm/Analysis/ |
| H A D | DOTGraphTraitsPass.h | 26 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()
126 typename AnalysisT, bool IsSimple, typename GraphT = AnalysisT *,
135 std::string Title = DOTGraphTraits<GraphT>::getGraphName(Graph); in runOnModule()
152 typename AnalysisT, bool IsSimple, typename GraphT = AnalysisT *,
[all …]
|
| /freebsd-12.1/contrib/llvm/include/llvm/CodeGen/PBQP/ |
| H A D | ReductionRules.h | 30 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()
74 template <typename GraphT>
75 void applyR2(GraphT &G, typename GraphT::NodeId NId) { in applyR2()
76 using NodeId = typename GraphT::NodeId; in applyR2()
77 using EdgeId = typename GraphT::EdgeId; in applyR2()
[all …]
|
| /freebsd-12.1/contrib/llvm/include/llvm/ADT/ |
| H A D | SCCIterator.h | 42 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 …]
|
| H A D | PostOrderIterator.h | 92 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()
|
| H A D | BreadthFirstIterator.h | 44 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()
|
| H A D | DepthFirstIterator.h | 82 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()
|
| /freebsd-12.1/contrib/llvm/tools/llvm-xray/ |
| H A D | xray-graph-diff.h | 35 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()
|
| H A D | xray-graph-diff.cpp | 245 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 __anon25b2bc730102()
|
| H A D | xray-graph.h | 85 class GraphT : public Graph<FunctionStats, CallStats, int32_t> {
91 GraphT G;
164 const GraphT &getGraph() { return G; } in getGraph()
|
| /freebsd-12.1/contrib/llvm/include/llvm/XRay/ |
| H A D | Graph.h | 203 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()
|
| /freebsd-12.1/contrib/llvm/include/llvm/Support/ |
| H A D | GenericDomTree.h | 776 using GraphT = GraphTraits<N>;
777 using NodeRef = typename GraphT::NodeRef;
778 assert(std::distance(GraphT::child_begin(NewBB),
779 GraphT::child_end(NewBB)) == 1 &&
781 NodeRef NewBBSucc = *GraphT::child_begin(NewBB);
|
| /freebsd-12.1/contrib/llvm/lib/Analysis/ |
| H A D | BlockFrequencyInfoImpl.cpp | 665 using GraphT = bfi_detail::IrreducibleGraph; typedef
666 using NodeRef = const GraphT::IrrNode *;
667 using ChildIteratorType = GraphT::IrrNode::iterator;
669 static NodeRef getEntryNode(const GraphT &G) { return G.StartIrr; } in getEntryNode()
|