add some comments

git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@26631 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Chris Lattner 2006-03-09 06:37:29 +00:00
parent e32178dd32
commit e87c5c8088

View File

@ -119,13 +119,14 @@ void SUnit::dump(const SelectionDAG *G, bool All) const {
}
//===----------------------------------------------------------------------===//
// SchedulingPriorityQueue - This interface is used to plug different
// priorities computation algorithms into the list scheduler. It implements the
// interface of a standard priority queue, where nodes are inserted in arbitrary
// order and returned in priority order. The computation of the priority and
// the representation of the queue are totally up to the implementation to
// decide.
//
/// SchedulingPriorityQueue - This interface is used to plug different
/// priorities computation algorithms into the list scheduler. It implements the
/// interface of a standard priority queue, where nodes are inserted in
/// arbitrary order and returned in priority order. The computation of the
/// priority and the representation of the queue are totally up to the
/// implementation to decide.
///
namespace {
class SchedulingPriorityQueue {
public:
virtual ~SchedulingPriorityQueue() {}
@ -137,11 +138,15 @@ public:
virtual void push(SUnit *U) = 0;
virtual SUnit *pop() = 0;
};
}
namespace {
/// ScheduleDAGList - List scheduler.
//===----------------------------------------------------------------------===//
/// ScheduleDAGList - The actual list scheduler implementation. This supports
/// both top-down and bottom-up scheduling.
///
class ScheduleDAGList : public ScheduleDAG {
private:
// SDNode to SUnit mapping (many to one).