#include <Timer_Wheel_T.h>
Inheritance diagram for ACE_Timer_Wheel_T:
Public Types | |
typedef ACE_Timer_Wheel_Iterator_T< TYPE, FUNCTOR, ACE_LOCK > | Iterator |
Type of iterator. More... | |
typedef ACE_Timer_Node_T< TYPE > | Node |
typedef ACE_Timer_Queue_T< TYPE, FUNCTOR, ACE_LOCK > | Base |
Type inherited from. More... | |
typedef ACE_Free_List< Node > | FreeList |
Public Methods | |
ACE_Timer_Wheel_T (FUNCTOR *upcall_functor=0, FreeList *freelist=0) | |
Default constructor. More... | |
ACE_Timer_Wheel_T (u_int spoke_count, u_int resolution, size_t prealloc=0, FUNCTOR *upcall_functor=0, FreeList *freelist=0) | |
Constructor with opportunities to set the wheelsize and resolution. More... | |
virtual | ~ACE_Timer_Wheel_T (void) |
Destructor. More... | |
virtual int | is_empty (void) const |
True if queue is empty, else false. More... | |
virtual const ACE_Time_Value & | earliest_time (void) const |
Returns the time of the earlier node in the <ACE_Timer_Wheel>. Must be called on a non-empty queue. More... | |
virtual long | schedule (const TYPE &type, const void *act, const ACE_Time_Value &future_time, const ACE_Time_Value &interval=ACE_Time_Value::zero) |
Schedules a timer. More... | |
virtual int | reset_interval (long timer_id, const ACE_Time_Value &interval) |
Changes the interval of a timer (and can make it periodic or non periodic by setting it to ACE_Time_Value::zero or not). More... | |
virtual int | cancel (const TYPE &type, 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. More... | |
virtual int | cancel (long timer_id, const void **act=0, int dont_call_handle_close=1) |
Cancels the single timer that is specified by the timer_id. More... | |
virtual int | expire (void) |
Run the <functor> for all timers whose values are <= <ACE_OS::gettimeofday>. Also accounts for <timer_skew>. Returns the number of timers canceled. More... | |
int | expire (const ACE_Time_Value &) |
This is a specialized version of expire that is more suited for the internal data representation. More... | |
virtual ACE_Timer_Queue_Iterator_T< TYPE, FUNCTOR, ACE_LOCK > & | iter (void) |
Returns a pointer to this <ACE_Timer_Queue_T>'s iterator. More... | |
virtual ACE_Timer_Node_T< TYPE > * | remove_first (void) |
Removes the earliest node from the queue and returns it. More... | |
virtual void | dump (void) const |
Dump the state of an object. More... | |
virtual ACE_Timer_Node_T< TYPE > * | get_first (void) |
Reads the earliest node from the queue and returns it. More... | |
Private Methods | |
ACE_Timer_Node_T< TYPE > * | get_first_i (void) const |
ACE_Timer_Node_T< TYPE > * | remove_first_expired (const ACE_Time_Value &now) |
void | open_i (size_t prealloc, u_int spokes, u_int res) |
Initialize the queue. More... | |
virtual void | reschedule (ACE_Timer_Node_T< TYPE > *) |
Takes an ACE_Timer_Node and inserts it into the correct position in the correct list. More... | |
ACE_Timer_Node_T< TYPE > * | find_spoke_node (u_int spoke, long timer_id) const |
Searches for a node by timer_id within one spoke. More... | |
ACE_Timer_Node_T< TYPE > * | find_node (long timer_id) const |
Searches all spokes for a node matching the specified timer_id Uses the spoke encoded in the timer_id as a starting place. More... | |
u_int | calculate_spoke (const ACE_Time_Value &expire) const |
Uses a simple hash to find which spoke to use based on when the timer is due to expire. Hopefully the 64bit int operations avoid any overflow problems. More... | |
long | generate_timer_id (u_int spoke) |
Generates a unique timer_id for the given spoke. It should be pretty fast until the point where the counter overflows. At that time you have to do exhaustive searches within the spoke to ensure that a particular timer id is not already in use. Some optimizations are in place so that this hopefully doesn't have to happen often. More... | |
void | schedule_i (ACE_Timer_Node_T< TYPE > *n, u_int spoke, const ACE_Time_Value &expire) |
The shared scheduling functionality between schedule() and reschedule(). More... | |
void | cancel_i (ACE_Timer_Node_T< TYPE > *n, int skip_close) |
Shared subset of the two cancel() methods. More... | |
void | unlink (ACE_Timer_Node_T< TYPE > *n) |
void | recalc_earliest (const ACE_Time_Value &last) |
There are a few places where we have to figure out which timer will expire next. This method makes the assumption that spokes are always sorted, and that timers are always in the correct spoke determined from their expiration time. The last time is always passed in, even though you can often calculate it as get_first()->get_timer_value(). More... | |
ACE_Timer_Wheel_T (const ACE_Timer_Wheel_T< TYPE, FUNCTOR, ACE_LOCK > &) | |
void | operator= (const ACE_Timer_Wheel_T< TYPE, FUNCTOR, ACE_LOCK > &) |
Private Attributes | |
ACE_Timer_Node_T< TYPE > ** | spokes_ |
Timing Wheel. More... | |
u_int | spoke_count_ |
Size of the timing wheel. More... | |
int | spoke_bits_ |
Number of timer_id bits used for the spoke. More... | |
u_int | max_per_spoke_ |
Maximum number of timers per spoke. More... | |
int | res_bits_ |
Resolution (in microsoconds) of the timing wheel. More... | |
u_int | earliest_spoke_ |
Index of the list with the earliest time. More... | |
Iterator * | iterator_ |
Iterator used to expire timers. More... | |
ACE_Time_Value | wheel_time_ |
The total amount of time in one iteration of the wheel. (resolution * spoke_count). More... | |
u_int | timer_count_ |
The total number of timers currently scheduled. More... | |
Friends | |
class | ACE_Timer_Wheel_Iterator_T< TYPE, FUNCTOR, ACE_LOCK > |
Iterator is a friend. More... |
This implementation uses a hash table of ordered doubly- linked lists of absolute times. The enhancements over the ACE_Timer_List
include 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" (http://dworkin.wustl.edu/~varghese/PAPERS/newbsd.ps.Z)
|
Type inherited from.
|
|
|
|
Type of iterator.
|
|
|
|
Default constructor.
|
|
Constructor with opportunities to set the wheelsize and resolution.
|
|
Destructor.
|
|
|
|
Uses a simple hash to find which spoke to use based on when the timer is due to expire. Hopefully the 64bit int operations avoid any overflow problems.
|
|
Cancels the single timer that is specified by the timer_id. In this case the timer_id is actually a pointer to the node, so we cast it to the node. This can be dangerous if the timer_id is made up (or deleted twice) so we do a little sanity check. Finally we update the earliest time in case the earliest timer was removed.
Reimplemented from ACE_Timer_Queue_T. |
|
Cancel all timer associated with <type>. If <dont_call> is 0 then the <functor> will be invoked. Returns number of timers cancelled. At the end make sure we reset the earliest time value in case the earliest timers were removed.
Reimplemented from ACE_Timer_Queue_T. |
|
Shared subset of the two cancel() methods.
|
|
Dump the state of an object.
Reimplemented from ACE_Timer_Queue_T. |
|
Returns the time of the earlier node in the <ACE_Timer_Wheel>. Must be called on a non-empty queue.
Reimplemented from ACE_Timer_Queue_T. |
|
This is a specialized version of expire that is more suited for the internal data representation.
Reimplemented from ACE_Timer_Queue_T. |
|
Run the <functor> for all timers whose values are <= <ACE_OS::gettimeofday>. Also accounts for <timer_skew>. Returns the number of timers canceled.
Reimplemented from ACE_Timer_Queue_T. |
|
Searches all spokes for a node matching the specified timer_id Uses the spoke encoded in the timer_id as a starting place.
|
|
Searches for a node by timer_id within one spoke.
|
|
Generates a unique timer_id for the given spoke. It should be pretty fast until the point where the counter overflows. At that time you have to do exhaustive searches within the spoke to ensure that a particular timer id is not already in use. Some optimizations are in place so that this hopefully doesn't have to happen often.
|
|
Reads the earliest node from the queue and returns it.
Reimplemented from ACE_Timer_Queue_T. |
|
|
|
True if queue is empty, else false.
Reimplemented from ACE_Timer_Queue_T. |
|
Returns a pointer to this <ACE_Timer_Queue_T>'s iterator.
Reimplemented from ACE_Timer_Queue_T. |
|
Initialize the queue. Uses the established members for all needed information. |
|
|
|
There are a few places where we have to figure out which timer will expire next. This method makes the assumption that spokes are always sorted, and that timers are always in the correct spoke determined from their expiration time. The last time is always passed in, even though you can often calculate it as get_first()->get_timer_value().
|
|
Removes the earliest node from the queue and returns it.
Reimplemented from ACE_Timer_Queue_T. |
|
|
|
Takes an ACE_Timer_Node and inserts it into the correct position in the correct list. Also makes sure to update the earliest time.
Reimplemented from ACE_Timer_Queue_T. |
|
Changes the interval of a timer (and can make it periodic or non periodic by setting it to ACE_Time_Value::zero or not). Then use set_interval() on the node to update the interval.
Reimplemented from ACE_Timer_Queue_T. |
|
Schedules a timer. Then inserts the node into the wheel using reschedule (). Then returns a timer_id.
Reimplemented from ACE_Timer_Queue_T. |
|
The shared scheduling functionality between schedule() and reschedule().
|
|
|
|
Iterator is a friend.
|
|
Index of the list with the earliest time.
|
|
Iterator used to expire timers.
|
|
Maximum number of timers per spoke.
|
|
Resolution (in microsoconds) of the timing wheel.
|
|
Number of timer_id bits used for the spoke.
|
|
Size of the timing wheel.
|
|
Timing Wheel.
|
|
The total number of timers currently scheduled.
|
|
The total amount of time in one iteration of the wheel. (resolution * spoke_count).
|