| /netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/Analysis/ |
| H A D | DOTGraphTraitsPass.h | 23 template <typename AnalysisT, typename GraphT = AnalysisT *>
25 static GraphT getGraph(AnalysisT *A) { return A; } in getGraph()
29 typename AnalysisT, bool IsSimple, typename GraphT = AnalysisT *,
30 typename AnalysisGraphTraitsT = DefaultAnalysisGraphTraits<AnalysisT, GraphT> >
52 GraphT Graph = AnalysisGraphTraitsT::getGraph(&Analysis); in runOnFunction()
53 std::string GraphName = DOTGraphTraits<GraphT>::getGraphName(Graph); in runOnFunction()
71 typename AnalysisT, bool IsSimple, typename GraphT = AnalysisT *,
72 typename AnalysisGraphTraitsT = DefaultAnalysisGraphTraits<AnalysisT, GraphT> >
94 GraphT Graph = AnalysisGraphTraitsT::getGraph(&Analysis); in runOnFunction()
101 std::string GraphName = DOTGraphTraits<GraphT>::getGraphName(Graph); in runOnFunction()
[all …]
|
| /netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/CodeGen/PBQP/ |
| H A D | ReductionRules.h | 29 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 …]
|
| /netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/ADT/ |
| H A D | SCCIterator.h | 41 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 …]
|
| H A D | PostOrderIterator.h | 92 template <class GraphT,
93 class SetType = SmallPtrSet<typename GraphTraits<GraphT>::NodeRef, 8>,
94 bool ExtStorage = false, class GT = GraphTraits<GraphT>>
143 static po_iterator begin(const GraphT &G) { in begin()
146 static po_iterator end(const GraphT &G) { return po_iterator(); } in end()
148 static po_iterator begin(const GraphT &G, SetType &S) { in begin()
151 static po_iterator end(const GraphT &G, SetType &S) { return po_iterator(S); } in end()
289 template<class GraphT, class GT = GraphTraits<GraphT>>
295 void Initialize(const GraphT &G) { in Initialize()
303 ReversePostOrderTraversal(const GraphT &G) { Initialize(G); } in ReversePostOrderTraversal()
|
| H A D | BreadthFirstIterator.h | 43 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 D | DepthFirstIterator.h | 81 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()
|
| /netbsd-src/external/apache2/llvm/dist/llvm/lib/Target/X86/ |
| H A D | ImmutableGraph.h | 294 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 D | X86LoadValueInjectionLoadHardening.cpp | 119 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()
|
| /netbsd-src/external/apache2/llvm/dist/llvm/tools/llvm-xray/ |
| H A D | xray-graph-diff.h | 34 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 D | xray-graph-diff.cpp | 231 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 __anon59b846d90102()
|
| H A D | xray-graph.h | 83 class GraphT : public Graph<FunctionStats, CallStats, int32_t> {
89 GraphT G;
162 const GraphT &getGraph() { return G; } in getGraph()
|
| /netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/XRay/ |
| H A D | Graph.h | 202 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()
|
| /netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/Support/ |
| H A D | GenericDomTree.h | 834 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);
|
| /netbsd-src/external/apache2/llvm/dist/llvm/lib/Analysis/ |
| H A D | BlockFrequencyInfoImpl.cpp | 684 using GraphT = bfi_detail::IrreducibleGraph; typedef
685 using NodeRef = const GraphT::IrrNode *;
686 using ChildIteratorType = GraphT::IrrNode::iterator;
688 static NodeRef getEntryNode(const GraphT &G) { return G.StartIrr; } in getEntryNode()
|