Home
last modified time | relevance | path

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

/freebsd-14.2/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DDOTGraphTraitsPass.h28 template <typename Result, typename GraphT = Result *>
30 static GraphT getGraph(Result R) { return &R; } in getGraph()
33 template <typename GraphT>
43 typename GraphT = typename AnalysisT::Result *,
67 GraphT Graph = AnalysisGraphTraitsT::getGraph(Result); in run()
105 template <typename GraphT>
127 typename GraphT = typename AnalysisT::Result *,
151 GraphT Graph = AnalysisGraphTraitsT::getGraph(Result); in run()
179 static GraphT getGraph(AnalysisT *A) { return A; } in getGraph()
323 template <typename GraphT>
[all …]
/freebsd-14.2/contrib/llvm-project/llvm/include/llvm/CodeGen/PBQP/
H A 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()
73 template <typename GraphT>
74 void applyR2(GraphT &G, typename GraphT::NodeId NId) { in applyR2()
75 using NodeId = typename GraphT::NodeId; in applyR2()
76 using EdgeId = typename GraphT::EdgeId; in applyR2()
[all …]
/freebsd-14.2/contrib/llvm-project/llvm/include/llvm/ADT/
H A DSCCIterator.h46 template <class GraphT, class GT = GraphTraits<GraphT>>
106 static scc_iterator begin(const GraphT &G) { in begin()
150 template <class GraphT, class GT>
162 template <class GraphT, class GT>
163 void scc_iterator<GraphT, GT>::DFSVisitChildren() { in DFSVisitChildren()
182 template <class GraphT, class GT> void scc_iterator<GraphT, GT>::GetNextSCC() { in GetNextSCC()
219 template <class GraphT, class GT>
220 bool scc_iterator<GraphT, GT>::hasCycle() const { in hasCycle()
252 template <class GraphT, class GT = GraphTraits<GraphT>>
305 template <class GraphT, class GT>
[all …]
H A DPostOrderIterator.h93 template <class GraphT,
94 class SetType = SmallPtrSet<typename GraphTraits<GraphT>::NodeRef, 8>,
95 bool ExtStorage = false, class GT = GraphTraits<GraphT>>
148 static po_iterator begin(const GraphT &G) { in begin()
151 static po_iterator end(const GraphT &G) { return po_iterator(); } in end()
153 static po_iterator begin(const GraphT &G, SetType &S) { in begin()
156 static po_iterator end(const GraphT &G, SetType &S) { return po_iterator(S); } in end()
294 template<class GraphT, class GT = GraphTraits<GraphT>>
301 void Initialize(const GraphT &G) { in Initialize()
309 ReversePostOrderTraversal(const GraphT &G) { Initialize(G); } in ReversePostOrderTraversal()
H A DBreadthFirstIterator.h43 template <class GraphT,
45 bf_iterator_default_set<typename GraphTraits<GraphT>::NodeRef>,
46 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 DDepthFirstIterator.h81 template <class GraphT,
83 df_iterator_default_set<typename GraphTraits<GraphT>::NodeRef>,
84 bool ExtStorage = false, class GT = GraphTraits<GraphT>>
152 static df_iterator begin(const GraphT &G) { in begin()
155 static df_iterator end(const GraphT &G) { return df_iterator(); } in end()
158 static df_iterator begin(const GraphT &G, SetType &S) { in begin()
161 static df_iterator end(const GraphT &G, SetType &S) { return df_iterator(S); } in end()
/freebsd-14.2/contrib/llvm-project/llvm/lib/Target/X86/
H A DImmutableGraph.h299 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;
354 static std::unique_ptr<GraphT> trim(const GraphT &G, const NodeSet &TrimNodes, in trim()
407 using NodeRef = typename GraphT::Node const *;
408 using EdgeRef = typename GraphT::Edge const &;
428 static nodes_iterator nodes_end(GraphT *G) {
[all …]
H A DX86LoadValueInjectionLoadHardening.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-14.2/contrib/llvm-project/llvm/tools/llvm-xray/
H A Dxray-graph-diff.h33 using GREdgeValueType = GraphRenderer::GraphT::EdgeValueType;
34 using GRVertexValueType = GraphRenderer::GraphT::VertexValueType;
44 using GraphT = Graph<VertexAttribute, EdgeAttribute, StringRef>; variable
47 std::array<std::reference_wrapper<const GraphRenderer::GraphT>, N> G;
56 GraphT G;
67 const GraphT &getGraph() { return G; } in getGraph()
H A 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()
300 static std::string getLabel(const GraphDiffRenderer::GraphT::EdgeValueType &E, in getLabel()
318 static std::string getLabel(const GraphDiffRenderer::GraphT::VertexValueType &V, in getLabel()
340 static double getLineWidth(const GraphDiffRenderer::GraphT::EdgeValueType &E, in getLineWidth()
430 std::array<GraphRenderer::GraphT, 2> Graphs; in __anon903d60640102()
H A Dxray-graph.h83 class GraphT : public Graph<FunctionStats, CallStats, int32_t> {
89 GraphT G;
162 const GraphT &getGraph() { return G; } in getGraph()
/freebsd-14.2/contrib/llvm-project/llvm/include/llvm/XRay/
H A 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()
/freebsd-14.2/contrib/llvm-project/llvm/lib/Analysis/
H A DBlockFrequencyInfoImpl.cpp689 using GraphT = bfi_detail::IrreducibleGraph; typedef
690 using NodeRef = const GraphT::IrrNode *;
691 using ChildIteratorType = GraphT::IrrNode::iterator;
693 static NodeRef getEntryNode(const GraphT &G) { return G.StartIrr; } in getEntryNode()
/freebsd-14.2/contrib/llvm-project/llvm/include/llvm/Support/
H A DGenericDomTree.h851 using GraphT = GraphTraits<N>;
852 using NodeRef = typename GraphT::NodeRef;
855 NodeRef NewBBSucc = *GraphT::child_begin(NewBB);