Lines Matching refs:NodeSet
545 llvm::stable_sort(NodeSets, std::greater<NodeSet>()); in schedule()
1175 for (NodeSet &Nodes : NodeSets) { in calculateRecMII()
1290 NodeSets.push_back(NodeSet(Stack.begin(), Stack.end())); in circuit()
1501 for (NodeSet &I : NodeSets) in computeNodeFunctions()
1523 const NodeSet *S = nullptr) { in pred_L()
1553 const NodeSet *S = nullptr) { in succ_L()
1607 NodeSet &NS) { in computeLiveOuts()
1695 NodeSet &N1 = NodeSets[i]; in colocateNodeSets()
1700 NodeSet &N2 = NodeSets[j]; in colocateNodeSets()
1742 for (NodeSet &I : NodeSets) { in groupRemainingNodes()
1770 NodeSet NewSet; in groupRemainingNodes()
1800 void SwingSchedulerDAG::addConnectedNodes(SUnit *SU, NodeSet &NewSet, in addConnectedNodes()
1818 static bool isIntersect(SmallSetVector<SUnit *, 8> &Set1, const NodeSet &Set2, in isIntersect()
1833 NodeSet &NI = *I; in fuseRecs()
1835 NodeSet &NJ = *J; in fuseRecs()
2811 Circuits, [SU](const NodeSet &Circuit) { return Circuit.count(SU); }); in checkValidNodeOrder()
2935 void NodeSet::print(raw_ostream &os) const { in print()
2961 LLVM_DUMP_METHOD void NodeSet::dump() const { print(dbgs()); } in dump()