template <class TYPE, class FUNCTOR, class ACE_LOCK> long ACE_Timer_List_T<TYPE, FUNCTOR, ACE_LOCK>::schedule (const TYPE &type, const void *act, const ACE_Time_Value &future_time, const ACE_Time_Value &interval) { ACE_TRACE ("ACE_Timer_List_T::schedule"); ACE_MT (ACE_GUARD_RETURN (ACE_LOCK, ace_mon, this->mutex_, -1)); // Place in the middle of the list where it belongs (i.e., sorted in // ascending order of absolute time to expire). ACE_Timer_Node_T<TYPE> *after = this->head_->get_next (); while (after != this->head_ && future_time > after->get_timer_value ()) after = after->get_next (); ACE_Timer_Node_T<TYPE> *temp = this->alloc_node (); temp->set (type, act, future_time, interval, after->get_prev (), after, (long) temp); after->get_prev ()->set_next (temp); after->set_prev (temp); return ACE_reinterpret_cast (long, temp); }
template <class TYPE, class FUNCTOR, class ACE_LOCK> int ACE_Timer_List_T<TYPE, FUNCTOR, ACE_LOCK>::cancel (const TYPE &type, int dont_call) { ACE_TRACE ("ACE_Timer_List_T::cancel"); ACE_MT (ACE_GUARD_RETURN (ACE_LOCK, ace_mon, this->mutex_, -1)); int number_of_cancellations = 0; for (ACE_Timer_Node_T<TYPE> *curr = this->head_->get_next (); curr != this->head_; ) { if (curr->get_type () == type) { number_of_cancellations++; curr->get_prev ()->set_next (curr->get_next ()); curr->get_next ()->set_prev (curr->get_prev ()); ACE_Timer_Node_T<TYPE> *temp = curr; curr = curr->get_next (); this->free_node (temp); } else curr = curr->get_next (); } if (dont_call == 0) this->upcall_functor ().cancellation (*this, type); return number_of_cancellations; }
/// The shared scheduling functionality between schedule() and reschedule() template <class TYPE, class FUNCTOR, class ACE_LOCK> void ACE_Timer_List_T<TYPE, FUNCTOR, ACE_LOCK>::schedule_i (ACE_Timer_Node_T<TYPE>* n, const ACE_Time_Value& expire) { if (this->is_empty()) { n->set_prev(this->head_); n->set_next(this->head_); this->head_->set_prev(n); this->head_->set_next(n); return; } // We always want to search backwards from the tail of the list, because // this minimizes the search in the extreme case when lots of timers are // scheduled for exactly the same time, and it also assumes that most of // the timers will be scheduled later than existing timers. ACE_Timer_Node_T<TYPE>* p = this->head_->get_prev(); while (p != this->head_ && p->get_timer_value() > expire) p = p->get_prev(); // insert after n->set_prev(p); n->set_next(p->get_next()); p->get_next()->set_prev(n); p->set_next(n); }
template <class TYPE, class FUNCTOR, class ACE_LOCK> void ACE_Timer_List_T<TYPE, FUNCTOR, ACE_LOCK>::reschedule (ACE_Timer_Node_T<TYPE> *expired) { ACE_TRACE ("ACE_Timer_List_T::reschedule"); ACE_Timer_Node_T<TYPE> *after = this->head_->get_next (); // Locate the proper position in the queue. while (after != this->head_ && expired->get_timer_value () > after->get_timer_value ()) after = after->get_next (); expired->set_next (after); expired->set_prev (after->get_prev ()); after->get_prev ()->set_next (expired); after->set_prev (expired); }