llvm/CodeGen/VLIWMachineScheduler.h

57   virtual bool isResourceAvailable(SUnit *SU, bool IsTop);
58   virtual bool reserveResources(SUnit *SU, bool IsTop);
61   bool isInPacket(SUnit *SU) const { return is_contained(Packet, SU); }
94     SUnit *SU = nullptr;
175         for (auto &SU : DAG->SUnits)
176           MaxPath = std::max(MaxPath, isTop() ? SU.getHeight() : SU.getDepth());
185     bool checkHazard(SUnit *SU);
187     void releaseNode(SUnit *SU, unsigned ReadyCycle);
191     void bumpNode(SUnit *SU);
195     void removeReady(SUnit *SU);
199     bool isLatencyBound(SUnit *SU) {
202       unsigned PathLength = isTop() ? SU->getHeight() : SU->getDepth();
228   void schedNode(SUnit *SU, bool IsTopNode) override;
230   void releaseTopNode(SUnit *SU) override;
232   void releaseBottomNode(SUnit *SU) override;
246   int pressureChange(const SUnit *SU, bool isBotUp);
248   virtual int SchedulingCost(ReadyQueue &Q, SUnit *SU,
256   void traceCandidate(const char *Label, const ReadyQueue &Q, SUnit *SU,