Lines Matching defs:SU
81 bool isResourceAvailable(SUnit *SU, bool IsTop);
82 bool reserveResources(SUnit *SU, bool IsTop);
84 bool isInPacket(SUnit *SU) const { return is_contained(Packet, SU); }
115 SUnit *SU = nullptr;
185 for (auto &SU : DAG->SUnits)
186 MaxPath = std::max(MaxPath, isTop() ? SU.getHeight() : SU.getDepth());
195 bool checkHazard(SUnit *SU);
197 void releaseNode(SUnit *SU, unsigned ReadyCycle);
201 void bumpNode(SUnit *SU);
205 void removeReady(SUnit *SU);
209 bool isLatencyBound(SUnit *SU) {
212 unsigned PathLength = isTop() ? SU->getHeight() : SU->getDepth();
241 void schedNode(SUnit *SU, bool IsTopNode) override;
243 void releaseTopNode(SUnit *SU) override;
245 void releaseBottomNode(SUnit *SU) override;
255 int pressureChange(const SUnit *SU, bool isBotUp);
258 SUnit *SU, SchedCandidate &Candidate,
265 void traceCandidate(const char *Label, const ReadyQueue &Q, SUnit *SU,