Lines Matching defs:SUnits

842   for (auto &SU : SUnits) {
939   for (SUnit &I : SUnits) {
1021   for (SUnit &I : SUnits) {
1630 static void swapAntiDependences(std::vector<SUnit> &SUnits) {
1632   for (SUnit &SU : SUnits) {
1654   BitVector Added(SUnits.size());
1656   for (int i = 0, e = SUnits.size(); i != e; ++i) {
1659     for (auto &SI : SUnits[i].Succs) {
1685     for (auto &PI : SUnits[i].Preds) {
1686       if (!SUnits[i].getInstr()->mayStore() ||
1687           !DAG->isLoopCarriedDep(&SUnits[i], PI, false))
1710   SUnit *SV = &SUnits[V];
1765   swapAntiDependences(SUnits);
1767   Circuits Cir(SUnits, Topo);
1770   for (int i = 0, e = SUnits.size(); i != e; ++i) {
1776   swapAntiDependences(SUnits);
1798   for (SUnit &SU : DAG->SUnits) {
1875   ScheduleInfo.resize(SUnits.size());
1879       const SUnit &SU = SUnits[I];
1889     SUnit *SU = &SUnits[I];
1909     SUnit *SU = &SUnits[I];
1932     for (unsigned i = 0; i < SUnits.size(); i++) {
1934       dbgs() << "\t   ASAP = " << getASAP(&SUnits[i]) << "\n";
1935       dbgs() << "\t   ALAP = " << getALAP(&SUnits[i]) << "\n";
1936       dbgs() << "\t   MOV  = " << getMOV(&SUnits[i]) << "\n";
1937       dbgs() << "\t   D    = " << getDepth(&SUnits[i]) << "\n";
1938       dbgs() << "\t   H    = " << getHeight(&SUnits[i]) << "\n";
1939       dbgs() << "\t   ZLD  = " << getZeroLatencyDepth(&SUnits[i]) << "\n";
1940       dbgs() << "\t   ZLH  = " << getZeroLatencyHeight(&SUnits[i]) << "\n";
2083     std::vector<SUnit *> SUnits(NS.begin(), NS.end());
2084     llvm::sort(SUnits, [](const SUnit *A, const SUnit *B) {
2088     for (auto &SU : SUnits) {
2213   for (SUnit &SU : SUnits) {
3173   for (auto &SU : SSD->SUnits)
3200   for (SUnit &SU : SSD->SUnits) {
3238   for (SUnit &SU : SSD->SUnits) {
3443   for (const SUnit &SU : SSD->SUnits)
3647   for (SUnit &SU : DAG->SUnits)
3652   for (SUnit &SU : DAG->SUnits)
3713   for (SUnit &SU : DAG->SUnits) {