Searched refs:DGNode (Results 1 – 9 of 9) sorted by relevance
| /freebsd/contrib/llvm-project/llvm/include/llvm/Transforms/Vectorize/SandboxVectorizer/ |
| H A D | Scheduler.h | 33 bool operator()(const DGNode *N1, const DGNode *N2) { in operator() 61 std::priority_queue<DGNode *, std::vector<DGNode *>, PriorityCmp> List; 65 void insert(DGNode *N) { in insert() 70 DGNode *Top = ListCopy.top(); in insert() 77 DGNode *pop() { in pop() 85 void remove(DGNode *N) { in remove() 88 SmallVector<DGNode *, 8> Keep; in remove() 110 using ContainerTy = SmallVector<DGNode *, 4>; 116 void eraseFromBundle(DGNode *N) { llvm::erase(Nodes, N); } in eraseFromBundle() 117 friend void DGNode::setSchedBundle(SchedBundle &); // For eraseFromBunde(). [all …]
|
| H A D | DependencyGraph.h | 41 DGNode, enumerator 45 class DGNode; variable 57 DGNode *N = nullptr; 61 const DenseSet<MemDGNode *>::iterator &MemIt, DGNode *N, in PredIterator() 65 DGNode *N, DependencyGraph &DAG) in PredIterator() 67 friend class DGNode; // For constructor variable 78 using value_type = DGNode *; 95 class LLVM_ABI DGNode { 112 DGNode(Instruction *I, DGNodeID ID) : I(I), SubclassID(ID) {} in DGNode() function 117 DGNode(Instruction *I) : I(I), SubclassID(DGNodeID::DGNode) { in DGNode() function [all …]
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Vectorize/SandboxVectorizer/ |
| H A D | DependencyGraph.cpp | 74 void DGNode::setSchedBundle(SchedBundle &SB) { in setSchedBundle() 80 DGNode::~DGNode() { in ~DGNode() 87 void DGNode::print(raw_ostream &OS, bool PrintDeps) const { in print() 90 void DGNode::dump() const { print(dbgs()); } in dump() 92 DGNode::print(OS, false); in print() 108 while (!DGNode::isMemDepNodeCandidate(I) && I != BeforeI) in getTopMemDGNode() 110 if (!DGNode::isMemDepNodeCandidate(I)) in getTopMemDGNode() 121 while (!DGNode::isMemDepNodeCandidate(I) && I != AfterI) in getBotMemDGNode() 123 if (!DGNode::isMemDepNodeCandidate(I)) in getBotMemDGNode() 159 if (DGNode::isStackSaveOrRestoreIntrinsic(FromI) || in getRoughDepType() [all …]
|
| H A D | Scheduler.cpp | 15 DGNode *SchedBundle::getTop() const { in getTop() 16 DGNode *TopN = Nodes.front(); in getTop() 24 DGNode *SchedBundle::getBot() const { in getBot() 25 DGNode *BotN = Nodes.front(); in getBot() 79 for (DGNode *N : Bndl) { in scheduleAndUpdateReadyList() 134 SmallVector<DGNode *> Retry; in tryScheduleUntil() 146 auto TryScheduleBndl = [this, InstrsSB](DGNode *ReadyN) -> TryScheduleRes { in tryScheduleUntil()
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/ADT/ |
| H A D | DirectedGraph.h | 73 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()
|
| /freebsd/contrib/llvm-project/llvm/tools/llvm-mca/Views/ |
| H A D | BottleneckAnalysis.cpp | 169 for (DGNode &N : Nodes) { in pruneEdges() 194 const DGNode &N = Nodes[I]; in initializeRootSet() 236 const DGNode &N = Nodes[IID]; in propagateThroughEdges() 239 DGNode &To = Nodes[ToIID]; in propagateThroughEdges() 273 llvm::max_element(Nodes, [](const DGNode &Lhs, const DGNode &Rhs) { 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 D | BottleneckAnalysis.h | 224 struct DGNode { struct 236 SmallVector<DGNode, 16> Nodes; argument
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/Analysis/ |
| H A D | DDG.h | 29 using DDGNodeBase = DGNode<DDGNode, DDGEdge>; 64 DGNode::operator=(N); 70 DGNode::operator=(std::move(N));
|
| /freebsd/contrib/llvm-project/llvm/lib/Analysis/ |
| H A D | DDG.cpp | 30 template class llvm::DGNode<DDGNode, DDGEdge>; member in llvm
|