diff options
| author | Nathan Binkert <nate@binkert.org> | 2010-06-10 23:17:07 -0700 |
|---|---|---|
| committer | Nathan Binkert <nate@binkert.org> | 2010-06-10 23:17:07 -0700 |
| commit | dd133c7b24aba128546d24e6042b0e0d46673aaf (patch) | |
| tree | 60f82f2f2b708a0fdb6967a7bf1262b435b5e6e0 /src/mem/ruby/eventqueue | |
| parent | 3df84fd8a0ce3959c0deb4c206d910fc0d050f47 (diff) | |
| download | gem5-dd133c7b24aba128546d24e6042b0e0d46673aaf.tar.xz | |
ruby: get rid of PrioHeap and use STL
One big difference is that PrioHeap puts the smallest element at the
top of the heap, whereas stl puts the largest element on top, so I
changed all comparisons so they did the right thing.
Some usage of PrioHeap was simply changed to a std::vector, using sort
at the right time, other usage had me just use the various heap functions
in the stl.
Diffstat (limited to 'src/mem/ruby/eventqueue')
| -rw-r--r-- | src/mem/ruby/eventqueue/RubyEventQueue.hh | 1 |
1 files changed, 0 insertions, 1 deletions
diff --git a/src/mem/ruby/eventqueue/RubyEventQueue.hh b/src/mem/ruby/eventqueue/RubyEventQueue.hh index 4a0fb9ceb..6fa8b0ac3 100644 --- a/src/mem/ruby/eventqueue/RubyEventQueue.hh +++ b/src/mem/ruby/eventqueue/RubyEventQueue.hh @@ -63,7 +63,6 @@ #include "sim/eventq.hh" class Consumer; -template <class TYPE> class PrioHeap; class RubyEventQueueNode; class RubyEventQueue : public EventManager |