summaryrefslogtreecommitdiff
path: root/src/mem/ruby/eventqueue
diff options
context:
space:
mode:
authorNathan Binkert <nate@binkert.org>2009-07-06 15:49:47 -0700
committerNathan Binkert <nate@binkert.org>2009-07-06 15:49:47 -0700
commit05f6a4a6b92370162da17ef5cccb5a7e3ba508e5 (patch)
treec2bc3f5e914cb85cb182b184d21c9166e7bc5783 /src/mem/ruby/eventqueue
parent5ae983f8daf36684821c444925cbf49e99a958f6 (diff)
downloadgem5-05f6a4a6b92370162da17ef5cccb5a7e3ba508e5.tar.xz
ruby: replace strings that were missed in original ruby import.
Diffstat (limited to 'src/mem/ruby/eventqueue')
-rw-r--r--src/mem/ruby/eventqueue/RubyEventQueue.hh4
1 files changed, 2 insertions, 2 deletions
diff --git a/src/mem/ruby/eventqueue/RubyEventQueue.hh b/src/mem/ruby/eventqueue/RubyEventQueue.hh
index a2112c922..fe7bc2833 100644
--- a/src/mem/ruby/eventqueue/RubyEventQueue.hh
+++ b/src/mem/ruby/eventqueue/RubyEventQueue.hh
@@ -30,7 +30,7 @@
/*
* $Id$
*
- * Description: The EventQueue class implements an event queue which
+ * Description: The RubyEventQueue class implements an event queue which
* can be trigger events, allowing our simulation to be event driven.
*
* Currently, the only event we support is a Consumer being signaled
@@ -48,7 +48,7 @@
* and a consumer pointer. The event queue will call the wakeup()
* method of the consumer at the appropriate time.
*
- * This implementation of EventQueue uses a dynamically sized array
+ * This implementation of RubyEventQueue uses a dynamically sized array
* managed as a heap. The algorithms used has O(lg n) for insert and
* O(lg n) for extract minimum element. (Based on chapter 7 of Cormen,
* Leiserson, and Rivest.) The array is dynamically sized and is