Home
last modified time | relevance | path

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

/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/Analysis/
HDDOTGraphTraitsPass.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 …]
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/CodeGen/PBQP/
HDReductionRules.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 …]
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/ADT/
HDSCCIterator.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 …]
HDPostOrderIterator.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()
HDBreadthFirstIterator.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()
HDDepthFirstIterator.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()
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/X86/
HDImmutableGraph.h295 template <typename GraphT> class ImmutableGraphBuilder {
296 using node_value_type = typename GraphT::node_value_type;
297 using edge_value_type = typename GraphT::edge_value_type;
300 GraphT>::value,
303 using size_type = typename GraphT::size_type;
304 using NodeSet = typename GraphT::NodeSet;
305 using Node = typename GraphT::Node;
306 using EdgeSet = typename GraphT::EdgeSet;
307 using Edge = typename GraphT::Edge;
328 template <typename... ArgT> std::unique_ptr<GraphT> get(ArgT &&... Args) { in get()
[all …]
HDX86LoadValueInjectionLoadHardening.cpp118 using GraphT = ImmutableGraph<MachineInstr *, int>; typedef
119 using Node = typename GraphT::Node;
120 using Edge = typename GraphT::Edge;
121 using size_type = typename GraphT::size_type;
125 : GraphT(std::move(Nodes), std::move(Edges), NodesSize, EdgesSize), in MachineGadgetGraph()
/freebsd-11-stable/contrib/llvm-project/llvm/tools/llvm-xray/
HDxray-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()
HDxray-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()
341 static double getLineWidth(const GraphDiffRenderer::GraphT::EdgeValueType &E, in getLineWidth()
431 std::array<GraphRenderer::GraphT, 2> Graphs; in __anon90f4b3e50102()
HDxray-graph.h83 class GraphT : public Graph<FunctionStats, CallStats, int32_t> {
89 GraphT G;
162 const GraphT &getGraph() { return G; } in getGraph()
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/XRay/
HDGraph.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()
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/Support/
HDGenericDomTree.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);
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Analysis/
HDBlockFrequencyInfoImpl.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()