Home
last modified time | relevance | path

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

/openbsd-src/gnu/llvm/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>
31 void viewGraphForFunction(Function &F, GraphT Graph, StringRef Name, in viewGraphForFunction()
33 std::string GraphName = DOTGraphTraits<GraphT *>::getGraphName(&Graph); in viewGraphForFunction()
40 typename GraphT = typename AnalysisT::Result *,
42 DefaultAnalysisGraphTraits<typename AnalysisT::Result &, GraphT>>
44 : PassInfoMixin<DOTGraphTraitsViewer<AnalysisT, IsSimple, GraphT,
64 GraphT Graph = AnalysisGraphTraitsT::getGraph(Result); in run()
86 template <typename GraphT>
[all …]
/openbsd-src/gnu/llvm/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()
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 …]
/openbsd-src/gnu/llvm/llvm/include/llvm/ADT/
H A DSCCIterator.h45 template <class GraphT, class GT = GraphTraits<GraphT>>
47 scc_iterator<GraphT, GT>, std::forward_iterator_tag,
105 static scc_iterator begin(const GraphT &G) { in begin()
108 static scc_iterator end(const GraphT &) { return scc_iterator(); } in end() argument
149 template <class GraphT, class GT>
150 void scc_iterator<GraphT, GT>::DFSVisitOne(NodeRef N) { in DFSVisitOne()
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>
[all …]
H A DPostOrderIterator.h94 template <class GraphT,
95 class SetType = SmallPtrSet<typename GraphTraits<GraphT>::NodeRef, 8>,
96 bool ExtStorage = false, class GT = GraphTraits<GraphT>>
146 static po_iterator begin(const GraphT &G) { in begin()
149 static po_iterator end(const GraphT &G) { return po_iterator(); } in end()
151 static po_iterator begin(const GraphT &G, SetType &S) { in begin()
154 static po_iterator end(const GraphT &G, SetType &S) { return po_iterator(S); } in end()
292 template<class GraphT, class GT = GraphTraits<GraphT>>
298 void Initialize(const GraphT &G) { in Initialize()
306 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()
/openbsd-src/gnu/llvm/llvm/lib/Target/X86/
H A DImmutableGraph.h294 template <typename GraphT> class ImmutableGraphBuilder {
295 using node_value_type = typename GraphT::node_value_type;
296 using edge_value_type = typename GraphT::edge_value_type;
299 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;
327 template <typename... ArgT> std::unique_ptr<GraphT> get(ArgT &&... Args) { in get()
[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()
/openbsd-src/gnu/llvm/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 __anona23076250102()
H A Dxray-graph.h83 class GraphT : public Graph<FunctionStats, CallStats, int32_t> {
89 GraphT G;
162 const GraphT &getGraph() { return G; } in getGraph()
/openbsd-src/gnu/llvm/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()
/openbsd-src/gnu/llvm/llvm/include/llvm/Support/
H A DGenericDomTree.h851 using GraphT = GraphTraits<N>;
852 using NodeRef = typename GraphT::NodeRef;
853 assert(std::distance(GraphT::child_begin(NewBB),
854 GraphT::child_end(NewBB)) == 1 &&
856 NodeRef NewBBSucc = *GraphT::child_begin(NewBB);
/openbsd-src/gnu/llvm/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()