diff options
Diffstat (limited to 'ace/Timer_Wheel_T.h')
| -rw-r--r-- | ace/Timer_Wheel_T.h | 52 |
1 files changed, 26 insertions, 26 deletions
diff --git a/ace/Timer_Wheel_T.h b/ace/Timer_Wheel_T.h index b8995cf3bb2..2c8976fca7d 100644 --- a/ace/Timer_Wheel_T.h +++ b/ace/Timer_Wheel_T.h @@ -6,13 +6,13 @@ // // = LIBRARY // ace -// +// // = FILENAME // Timer_Wheel.h // // = AUTHOR // Darrell Brunsch <brunsch@cs.wustl.edu> -// +// // ============================================================================ #ifndef ACE_TIMER_WHEEL_T_H @@ -21,7 +21,7 @@ #include "ace/Timer_Queue_T.h" #if !defined (ACE_LACKS_PRAGMA_ONCE) -#pragma once +# pragma once #endif /* ACE_LACKS_PRAGMA_ONCE */ // Forward declaration @@ -37,7 +37,7 @@ class ACE_Timer_Wheel_Iterator_T : public ACE_Timer_Queue_Iterator_T <TYPE, FUNC // = DESCRIPTION // This is a generic iterator that can be used to visit every // node of a timer queue. Be aware that it doesn't transverse - // in the order of timeout values. + // in the order of timeout values. public: ACE_Timer_Wheel_Iterator_T (ACE_Timer_Wheel_T<TYPE, FUNCTOR, ACE_LOCK> &); // Constructor @@ -61,30 +61,30 @@ protected: ACE_Timer_Wheel_T<TYPE, FUNCTOR, ACE_LOCK> &timer_wheel_; // Pointer to the <ACE_Timer_List> that we are iterating over. - size_t pos_; + size_t pos_; // Current position in the timing wheel - - ACE_Timer_Node_T<TYPE> *list_item_; + + ACE_Timer_Node_T<TYPE> *list_item_; // Pointer to the position in the the <pos_>th list }; template <class TYPE, class FUNCTOR, class ACE_LOCK> class ACE_Timer_Wheel_T : public ACE_Timer_Queue_T<TYPE, FUNCTOR, ACE_LOCK> { - // = TITLE + // = TITLE // Provides a Timing Wheel version of Timer Queue // // = DESCRIPTION // This implementation uses a hash table of ordered doubly- - // linked lists of absolute times. The other enhancements + // 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 + // 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 - // Timer Facilities" + // Timer Facilities" // (http://dworkin.wustl.edu/~varghese/PAPERS/newbsd.ps.Z) -public: +public: typedef ACE_Timer_Wheel_Iterator_T<TYPE, FUNCTOR, ACE_LOCK> WHEEL_ITERATOR; // Type of iterator @@ -96,19 +96,19 @@ public: // = Initialization and termination methods - ACE_Timer_Wheel_T (size_t wheelsize, - size_t resolution, + ACE_Timer_Wheel_T (size_t wheelsize, + size_t resolution, size_t prealloc = 0, FUNCTOR *upcall_functor = 0, ACE_Free_List<ACE_Timer_Node_T <TYPE> > *freelist = 0); - // Constructor that takes in <wheelsize> - size of the timing wheel, + // Constructor that takes in <wheelsize> - size of the timing wheel, // <resolution> - resolution of time values the hashing function uses, // and <upcall_functor> - a functor that will be used instead of creating // a default functor. Also, when the freelist is created, <prealloc> nodes - // will be allocated. This can also take in a upcall functor and freelist + // will be allocated. This can also take in a upcall functor and freelist // (if 0, then defaults will be created) - ACE_Timer_Wheel_T (FUNCTOR *upcall_functor = 0, + ACE_Timer_Wheel_T (FUNCTOR *upcall_functor = 0, ACE_Free_List<ACE_Timer_Node_T <TYPE> > *freelist = 0); // Default constructor. <upcall_functor> is the instance of the // FUNCTOR to be used by the queue. If <upcall_functor> is 0, Timer @@ -127,27 +127,27 @@ public: virtual const ACE_Time_Value &earliest_time (void) const; // Returns the time of the earlier node in the <ACE_Timer_Wheel>. - virtual long schedule (const TYPE &type, - const void *act, - const ACE_Time_Value &delay, - const ACE_Time_Value &interval = ACE_Time_Value::zero); + virtual long schedule (const TYPE &type, + const void *act, + const ACE_Time_Value &delay, + const ACE_Time_Value &interval = ACE_Time_Value::zero); // Schedule <type> that will expire after <delay> amount of time. // If it expires then <act> is passed in as the value to the // <functor>. If <interval> is != to <ACE_Time_Value::zero> then it // is used to reschedule the <type> automatically. This method // returns a <timer_id> that uniquely identifies the the timer. - // This <timer_id> can be used to cancel the timer before it expires. + // This <timer_id> can be used to cancel the timer before it expires. // Returns -1 on failure. virtual int cancel (const TYPE &type, - int dont_call_handle_close = 1); + int dont_call_handle_close = 1); // Cancel all timer associated with <type>. If <dont_call> is 0 // then the <functor> will be invoked. Returns number of timers // cancelled. - virtual int cancel (long timer_id, - const void **act = 0, - int dont_call_handle_close = 1); + virtual int cancel (long timer_id, + const void **act = 0, + int dont_call_handle_close = 1); // Cancel the single timer that matches the <timer_id> value (which // was returned from the <schedule> method). If act is non-NULL // then it will be set to point to the ``magic cookie'' argument |