HomeSort by: relevance | last modified time | path
    Searched refs:DGNode (Results 1 - 5 of 5) sorted by relevancy

  /src/external/apache2/llvm/dist/llvm/include/llvm/ADT/
DirectedGraph.h 72 template <class NodeType, class EdgeType> class DGNode {
79 explicit DGNode(EdgeType &E) : Edges() { Edges.insert(&E); }
80 DGNode() = default;
82 explicit DGNode(const DGNode<NodeType, EdgeType> &N) : Edges(N.Edges) {}
83 DGNode(DGNode<NodeType, EdgeType> &&N) : Edges(std::move(N.Edges)) {}
85 DGNode<NodeType, EdgeType> &operator=(const DGNode<NodeType, EdgeType> &N) {
89 DGNode<NodeType, EdgeType> &operator=(const DGNode<NodeType, EdgeType> &&N)
    [all...]
  /src/external/apache2/llvm/dist/llvm/tools/llvm-mca/Views/
BottleneckAnalysis.cpp 172 for (DGNode &N : Nodes) {
197 const DGNode &N = Nodes[I];
239 const DGNode &N = Nodes[IID];
242 DGNode &To = Nodes[ToIID];
273 // predecessors starting from node N (field DGNode::CriticalPredecessor).
276 [](const DGNode &Lhs, const DGNode &Rhs) { return Lhs.Cost < Rhs.Cost; });
280 const DGNode &N = Nodes[IID];
403 for (const DGNode &Node : Nodes)
409 for (const DGNode &Node : Nodes
    [all...]
BottleneckAnalysis.h 204 // There is a node (an instance of struct DGNode) for every instruction in the
223 struct DGNode {
232 SmallVector<DGNode, 16> Nodes;
  /src/external/apache2/llvm/dist/llvm/include/llvm/Analysis/
DDG.h 26 using DDGNodeBase = DGNode<DDGNode, DDGEdge>;
61 DGNode::operator=(N);
67 DGNode::operator=(std::move(N));
  /src/external/apache2/llvm/dist/llvm/lib/Analysis/
DDG.cpp 31 template class llvm::DGNode<DDGNode, DDGEdge>;

Completed in 21 milliseconds