template <class TYPE, class FUNCTOR, class ACE_LOCK> long ACE_Timer_List_T<TYPE, FUNCTOR, ACE_LOCK>::schedule_i (const TYPE &type, const void *act, const ACE_Time_Value &future_time, const ACE_Time_Value &interval) { ACE_TRACE ("ACE_Timer_List_T::schedule_i"); ACE_Timer_Node_T<TYPE>* n = this->alloc_node(); if (n != 0) { long id = this->id_counter_++; if (id != -1) { n->set (type, act, future_time, interval, 0, 0, id); this->schedule_i (n, future_time); } return id; } // Failure return errno = ENOMEM; return -1; }
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); }