Lines Matching refs:NodeSet
638 llvm::stable_sort(NodeSets, std::greater<NodeSet>()); in schedule()
1611 for (NodeSet &Nodes : NodeSets) { in calculateRecMII()
1722 NodeSets.push_back(NodeSet(Stack.begin(), Stack.end())); in circuit()
1928 for (NodeSet &I : NodeSets) in computeNodeFunctions()
1950 const NodeSet *S = nullptr) { in pred_L()
1979 const NodeSet *S = nullptr) { in succ_L()
2034 NodeSet &NS) { in computeLiveOuts()
2119 NodeSet &N1 = NodeSets[i]; in colocateNodeSets()
2124 NodeSet &N2 = NodeSets[j]; in colocateNodeSets()
2166 for (NodeSet &I : NodeSets) { in groupRemainingNodes()
2194 NodeSet NewSet; in groupRemainingNodes()
2224 void SwingSchedulerDAG::addConnectedNodes(SUnit *SU, NodeSet &NewSet, in addConnectedNodes()
2243 static bool isIntersect(SmallSetVector<SUnit *, 8> &Set1, const NodeSet &Set2, in isIntersect()
2257 NodeSet &NI = *I; in fuseRecs()
2259 NodeSet &NJ = *J; in fuseRecs()
3332 Circuits, [SU](const NodeSet &Circuit) { return Circuit.count(SU); }); in checkValidNodeOrder()
3457 void NodeSet::print(raw_ostream &os) const { in print()
3483 LLVM_DUMP_METHOD void NodeSet::dump() const { print(dbgs()); } in dump()