void remove(SUnit *SU) override;
+#if !defined(NDEBUG) || defined(LLVM_ENABLE_DUMP)
+ LLVM_DUMP_METHOD void dump(ScheduleDAG *DAG) const {
+ dbgs() << "Latency Priority Queue\n";
+ dbgs() << " Number of Queue Entries: " << Queue.size() << "\n";
+ for (auto const &SU : Queue) {
+ dbgs() << " ";
+ SU->dump(DAG);
+ }
+ }
+#endif
+
// scheduledNode - As nodes are scheduled, we look to see if there are any
// successor nodes that have a single unscheduled predecessor. If so, that
// single predecessor has a higher priority, since scheduling it will make