Lines Matching refs:NodeSet
545 llvm::stable_sort(NodeSets, std::greater<NodeSet>()); in schedule()
1173 for (NodeSet &Nodes : NodeSets) { in calculateRecMII()
1284 NodeSets.push_back(NodeSet(Stack.begin(), Stack.end())); in circuit()
1490 for (NodeSet &I : NodeSets) in computeNodeFunctions()
1512 const NodeSet *S = nullptr) { in pred_L()
1541 const NodeSet *S = nullptr) { in succ_L()
1596 NodeSet &NS) { in computeLiveOuts()
1684 NodeSet &N1 = NodeSets[i]; in colocateNodeSets()
1689 NodeSet &N2 = NodeSets[j]; in colocateNodeSets()
1731 for (NodeSet &I : NodeSets) { in groupRemainingNodes()
1759 NodeSet NewSet; in groupRemainingNodes()
1789 void SwingSchedulerDAG::addConnectedNodes(SUnit *SU, NodeSet &NewSet, in addConnectedNodes()
1808 static bool isIntersect(SmallSetVector<SUnit *, 8> &Set1, const NodeSet &Set2, in isIntersect()
1822 NodeSet &NI = *I; in fuseRecs()
1824 NodeSet &NJ = *J; in fuseRecs()
2874 Circuits, [SU](const NodeSet &Circuit) { return Circuit.count(SU); }); in checkValidNodeOrder()
2994 void NodeSet::print(raw_ostream &os) const { in print()
3020 LLVM_DUMP_METHOD void NodeSet::dump() const { print(dbgs()); } in dump()