ChangeLogTag:Sat May 11 13:04:49 2002 Douglas C. Schmidt <schmidt@macarena.cs.wustl.edu>

7 files changed, 34 insertions, 14 deletions

diff --git a/ChangeLog b/ChangeLog
index 9baf6fcde04..4ab21c0aaf0 100644
--- a/ChangeLog
+++ b/ChangeLog
@@ -1,3 +1,9 @@
+Sat May 11 13:04:49 2002  Douglas C. Schmidt  <schmidt@macarena.cs.wustl.edu>
+
+	* ace/Synch.h: Updated the documentation explaining
+	  what an ACE_Barrier does.  Thanks to Timothy Culp
+ 	  <timothy.culp@computer.org> for motivating this.
+
 Sun May 12 09:45:37 2002   Edan Ayal <edanayal@yahoo.com>
 
 	* ace/WIN32_Asynch_IO.cpp (send): Fixed check for ACE_IOV_MAX
diff --git a/ChangeLogs/ChangeLog-02a b/ChangeLogs/ChangeLog-02a
index 9baf6fcde04..4ab21c0aaf0 100644
--- a/ChangeLogs/ChangeLog-02a
+++ b/ChangeLogs/ChangeLog-02a
@@ -1,3 +1,9 @@
+Sat May 11 13:04:49 2002  Douglas C. Schmidt  <schmidt@macarena.cs.wustl.edu>
+
+	* ace/Synch.h: Updated the documentation explaining
+	  what an ACE_Barrier does.  Thanks to Timothy Culp
+ 	  <timothy.culp@computer.org> for motivating this.
+
 Sun May 12 09:45:37 2002   Edan Ayal <edanayal@yahoo.com>
 
 	* ace/WIN32_Asynch_IO.cpp (send): Fixed check for ACE_IOV_MAX
diff --git a/ChangeLogs/ChangeLog-03a b/ChangeLogs/ChangeLog-03a
index 9baf6fcde04..4ab21c0aaf0 100644
--- a/ChangeLogs/ChangeLog-03a
+++ b/ChangeLogs/ChangeLog-03a
@@ -1,3 +1,9 @@
+Sat May 11 13:04:49 2002  Douglas C. Schmidt  <schmidt@macarena.cs.wustl.edu>
+
+	* ace/Synch.h: Updated the documentation explaining
+	  what an ACE_Barrier does.  Thanks to Timothy Culp
+ 	  <timothy.culp@computer.org> for motivating this.
+
 Sun May 12 09:45:37 2002   Edan Ayal <edanayal@yahoo.com>
 
 	* ace/WIN32_Asynch_IO.cpp (send): Fixed check for ACE_IOV_MAX
diff --git a/THANKS b/THANKS
index 670931b37df..14b15463d57 100644
--- a/THANKS
+++ b/THANKS
@@ -1513,6 +1513,7 @@ Ru Gunatilleke  <ru@ociweb.com>
 Peter Kullmann <P.Kullmann@rog.de>
 Lyn Headley <headley@wolve.com>
 Jeff Adams <Jeff.Adams@gd-ais.com>
+Timothy Culp <timothy.culp@computer.org>
 
 I would particularly like to thank Paul Stephenson, who worked with me
 at Ericsson in the early 1990's.  Paul devised the recursive Makefile
diff --git a/ace/Message_Block.h b/ace/Message_Block.h
index c768c05e27d..3cf6ab460cd 100644
--- a/ace/Message_Block.h
+++ b/ace/Message_Block.h
@@ -571,10 +571,10 @@ protected:
   u_long priority_;
 
 #if defined (ACE_HAS_TIMED_MESSAGE_BLOCKS)
-  /// execution time associated with the message
+  /// Execution time associated with the message.
   ACE_Time_Value execution_time_;
 
-  /// absolute deadline time for message
+  /// Absolute deadline time for message.
   ACE_Time_Value deadline_time_;
 #endif /* ACE_HAS_TIMED_MESSAGE_BLOCKS */
 
diff --git a/ace/Synch.h b/ace/Synch.h
index 5f9c0c37027..c30a2243970 100644
--- a/ace/Synch.h
+++ b/ace/Synch.h
@@ -1536,12 +1536,15 @@ struct ACE_Export ACE_Sub_Barrier
  *
  * This class allows <count> number of threads to synchronize
  * their completion of (one round of) a task, which is known as
- * "barrier synchronization".  The implementation uses a
- * "sub-barrier generation numbering" scheme to avoid overhead
- * and to ensure that all threads wait to leave the barrier
- * correct.  This code is based on an article from SunOpsis
- * Vol. 4, No. 1 by Richard Marejka
- * (Richard.Marejka@canada.sun.com).
+ * "barrier synchronization".   After all the threads call <wait()>
+ * on the barrier they are all atomically released and can begin a new
+ * round.
+ * 
+ * This implementation uses a "sub-barrier generation numbering"
+ * scheme to avoid overhead and to ensure that all threads wait to
+ * leave the barrier correct.  This code is based on an article from
+ * SunOpsis Vol. 4, No. 1 by Richard Marejka
+ * (Richard.Marejka@canada.sun.com). 
  */
 class ACE_Export ACE_Barrier
 {
diff --git a/ace/Timer_Wheel_T.h b/ace/Timer_Wheel_T.h
index 2b1141dfe91..7086c29a58d 100644
--- a/ace/Timer_Wheel_T.h
+++ b/ace/Timer_Wheel_T.h
@@ -1,4 +1,3 @@
-
 /* -*- C++ -*- */
 
 //=============================================================================
@@ -11,7 +10,6 @@
  */
 //=============================================================================
 
-
 #ifndef ACE_TIMER_WHEEL_T_H
 #define ACE_TIMER_WHEEL_T_H
 #include "ace/pre.h"
@@ -72,12 +70,12 @@ protected:
 /**
  * @class ACE_Timer_Wheel_T
  *
- * @brief Provides a Timing Wheel version of Timer Queue
+ * @brief Provides a Timing Wheel version of Timer Queue.
  *
  * This implementation uses a hash table of ordered doubly-
- * linked lists of absolute times.  The other enhancements
- * to Timer List include using the pointer to the node as the
- * timer id (to speed up removing), adding a free list and
+ * linked lists of absolute times.  The enhancements to the
+ * <ACE_Timer_List> include using the pointer to the node as the
+ * timer id (to speed up removing), adding a free list, and
  * the ability to preallocate nodes.  Timer Wheel is based on
  * the timing wheel implementation used in Adam M. Costello and
  * George Varghese's paper "Redesigning the BSD Callout and