Home
last modified time | relevance | path

Searched refs:DGNode (Results 1 – 6 of 6) sorted by relevance

/llvm-project-15.0.7/llvm/include/llvm/ADT/
H A DDirectedGraph.h73 template <class NodeType, class EdgeType> class DGNode {
80 explicit DGNode(EdgeType &E) : Edges() { Edges.insert(&E); } in DGNode() function
81 DGNode() = default;
83 explicit DGNode(const DGNode<NodeType, EdgeType> &N) : Edges(N.Edges) {} in DGNode() function
84 DGNode(DGNode<NodeType, EdgeType> &&N) : Edges(std::move(N.Edges)) {} in DGNode() function
86 DGNode<NodeType, EdgeType> &operator=(const DGNode<NodeType, EdgeType> &N) {
90 DGNode<NodeType, EdgeType> &operator=(const DGNode<NodeType, EdgeType> &&N) {
141 static_cast<const DGNode<NodeType, EdgeType> &>(*this).Edges); in getEdges()
/llvm-project-15.0.7/llvm/tools/llvm-mca/Views/
H A DBottleneckAnalysis.cpp170 for (DGNode &N : Nodes) { in pruneEdges()
195 const DGNode &N = Nodes[I]; in initializeRootSet()
237 const DGNode &N = Nodes[IID]; in propagateThroughEdges()
240 DGNode &To = Nodes[ToIID]; in propagateThroughEdges()
275 [](const DGNode &Lhs, const DGNode &Rhs) { return Lhs.Cost < Rhs.Cost; }); in getCriticalSequence()
279 const DGNode &N = Nodes[IID]; in getCriticalSequence()
402 for (const DGNode &Node : Nodes) in dump()
408 for (const DGNode &Node : Nodes) in dump()
414 for (const DGNode &Node : Nodes) in dump()
423 DGNode &NodeFrom = Nodes[From]; in addDependency()
[all …]
H A DBottleneckAnalysis.h224 struct DGNode { struct
233 SmallVector<DGNode, 16> Nodes; argument
/llvm-project-15.0.7/llvm/include/llvm/Analysis/
H A DDDG.h28 using DDGNodeBase = DGNode<DDGNode, DDGEdge>;
63 DGNode::operator=(N);
69 DGNode::operator=(std::move(N));
/llvm-project-15.0.7/llvm/unittests/ADT/
H A DDirectedGraphTest.cpp28 using DGTestNodeBase = DGNode<DGTestNode, DGTestEdge>;
/llvm-project-15.0.7/llvm/lib/Analysis/
H A DDDG.cpp30 template class llvm::DGNode<DDGNode, DDGEdge>; member in llvm