Home
last modified time | relevance | path

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

/llvm-project-15.0.7/llvm/include/llvm/Analysis/
H A DDOTGraphTraitsPass.h25 template <typename Result, typename GraphT = Result *>
27 static GraphT getGraph(Result R) { return &R; } in getGraph()
30 template <typename GraphT>
40 typename GraphT = typename AnalysisT::Result *,
64 GraphT Graph = AnalysisGraphTraitsT::getGraph(Result); in run()
86 template <typename GraphT>
106 typename GraphT = typename AnalysisT::Result *,
130 GraphT Graph = AnalysisGraphTraitsT::getGraph(Result); in run()
158 static GraphT getGraph(AnalysisT *A) { return A; } in getGraph()
301 template <typename GraphT>
[all …]
/llvm-project-15.0.7/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 …]
/llvm-project-15.0.7/llvm/include/llvm/ADT/
H A DSCCIterator.h45 template <class GraphT, class GT = GraphTraits<GraphT>>
105 static scc_iterator begin(const GraphT &G) { in begin()
149 template <class GraphT, class GT>
161 template <class GraphT, class GT>
162 void scc_iterator<GraphT, GT>::DFSVisitChildren() { in DFSVisitChildren()
181 template <class GraphT, class GT> void scc_iterator<GraphT, GT>::GetNextSCC() { in GetNextSCC()
218 template <class GraphT, class GT>
219 bool scc_iterator<GraphT, GT>::hasCycle() const { in hasCycle()
251 template <class GraphT, class GT = GraphTraits<GraphT>>
303 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>>
144 static po_iterator begin(const GraphT &G) { in begin()
147 static po_iterator end(const GraphT &G) { return po_iterator(); } in end()
149 static po_iterator begin(const GraphT &G, SetType &S) { in begin()
152 static po_iterator end(const GraphT &G, SetType &S) { return po_iterator(S); } in end()
290 template<class GraphT, class GT = GraphTraits<GraphT>>
296 void Initialize(const GraphT &G) { in Initialize()
304 ReversePostOrderTraversal(const GraphT &G) { Initialize(G); } in ReversePostOrderTraversal()
H A DBreadthFirstIterator.h44 template <class GraphT,
46 bf_iterator_default_set<typename GraphTraits<GraphT>::NodeRef>,
47 class GT = GraphTraits<GraphT>>
115 static bf_iterator begin(const GraphT &G) { in begin()
119 static bf_iterator end(const GraphT &G) { return bf_iterator(); } in end()
H A DDepthFirstIterator.h82 template <class GraphT,
84 df_iterator_default_set<typename GraphTraits<GraphT>::NodeRef>,
85 bool ExtStorage = false, class GT = GraphTraits<GraphT>>
153 static df_iterator begin(const GraphT &G) { in begin()
156 static df_iterator end(const GraphT &G) { return df_iterator(); } in end()
159 static df_iterator begin(const GraphT &G, SetType &S) { in begin()
162 static df_iterator end(const GraphT &G, SetType &S) { return df_iterator(S); } in end()
/llvm-project-15.0.7/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.cpp119 using GraphT = ImmutableGraph<MachineInstr *, int>; typedef
120 using Node = typename GraphT::Node;
121 using Edge = typename GraphT::Edge;
122 using size_type = typename GraphT::size_type;
126 : GraphT(std::move(Nodes), std::move(Edges), NodesSize, EdgesSize), in MachineGadgetGraph()
/llvm-project-15.0.7/llvm/tools/llvm-xray/
H A 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()
H A Dxray-graph-diff.cpp232 GraphT::EdgeIdentifier ID{EdgeTailAttrOrErr->SymbolName, in getGraphDiffRenderer()
251 static std::string getColor(const GraphDiffRenderer::GraphT::EdgeValueType &E, in getColor()
252 const GraphDiffRenderer::GraphT &G, ColorHelper H, in getColor()
272 static std::string getColor(const GraphDiffRenderer::GraphT::VertexValueType &V, in getColor()
273 const GraphDiffRenderer::GraphT &G, ColorHelper H, in getColor()
301 static std::string getLabel(const GraphDiffRenderer::GraphT::EdgeValueType &E, in getLabel()
319 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 __anon56ae4c9e0102()
H A Dxray-graph.h83 class GraphT : public Graph<FunctionStats, CallStats, int32_t> {
89 GraphT G;
162 const GraphT &getGraph() { return G; } in getGraph()
/llvm-project-15.0.7/bolt/lib/Passes/
H A DMCF.cpp103 typedef GraphTraits<NodeT> GraphT; in computeEdgeWeights() typedef
110 for (typename GraphT::ChildIteratorType CI = GraphT::child_begin(BB), in computeEdgeWeights()
111 E = GraphT::child_end(BB); in computeEdgeWeights()
113 typename GraphT::NodeRef Child = *CI; in computeEdgeWeights()
118 } else if (GraphT::child_end(BB) - GraphT::child_begin(BB) > 1 && in computeEdgeWeights()
129 typename GraphT::NodeRef N = *II; in computeEdgeWeights()
144 for (typename GraphT::ChildIteratorType CI = GraphT::child_begin(BB), in computeEdgeWeights()
147 typename GraphT::NodeRef Child = *CI; in computeEdgeWeights()
161 for (typename GraphT::ChildIteratorType CI = GraphT::child_begin(BB), in computeEdgeWeights()
164 typename GraphT::NodeRef Child = *CI; in computeEdgeWeights()
[all …]
/llvm-project-15.0.7/llvm/unittests/XRay/
H A 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;
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()
228 GraphT MG; in TEST()
[all …]
/llvm-project-15.0.7/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()
/llvm-project-15.0.7/llvm/include/llvm/Support/
H A DGenericDomTree.h834 using GraphT = GraphTraits<N>;
835 using NodeRef = typename GraphT::NodeRef;
836 assert(std::distance(GraphT::child_begin(NewBB),
837 GraphT::child_end(NewBB)) == 1 &&
839 NodeRef NewBBSucc = *GraphT::child_begin(NewBB);
/llvm-project-15.0.7/llvm/lib/Analysis/
H A DBlockFrequencyInfoImpl.cpp697 using GraphT = bfi_detail::IrreducibleGraph; typedef
698 using NodeRef = const GraphT::IrrNode *;
699 using ChildIteratorType = GraphT::IrrNode::iterator;
701 static NodeRef getEntryNode(const GraphT &G) { return G.StartIrr; } in getEntryNode()