Lines Matching defs:SUnits

143   /// AvailableQueue - The priority queue to use for the available SUnits.
180   /// Topo - A topological ordering for SUnits which permits fast IsReachable
193         AvailableQueue(availqueue), Topo(SUnits, nullptr) {
277     unsigned NumSUnits = SUnits.size();
287     unsigned NumSUnits = SUnits.size();
378   AvailableQueue->initNodes(SUnits);
589         SUnit *Def = &SUnits[N->getNodeId()];
1002     LoadSU = &SUnits[LoadNode->getNodeId()];
1020     NewSU = &SUnits[N->getNodeId()];
1609   if (!SUnits.empty()) {
1610     SUnit *RootSU = &SUnits[DAG->getRoot().getNode()->getNodeId()];
1618   Sequence.reserve(SUnits.size());
1739   // SUnits - The SUnits for the current graph.
1740   std::vector<SUnit> *SUnits = nullptr;
1794     SUnits = nullptr;
2020   SethiUllmanNumbers.assign(SUnits->size(), 0);
2022   for (const SUnit &SU : *SUnits)
2028   if (SUnits->size() > SUSize)
2228   // materialize as SUnits, so they don't appear to generate liveness.
2815   SUnits = &sunits;
2845             Op->OrigNode == &(*SUnits)[DU->getNodeId()])
2958   for (SUnit &SU : *SUnits) {
3068   for (SUnit &SU : *SUnits) {
3087       const SUnit *DUSU = &(*SUnits)[DU->getNodeId()];