// $Id$ #include "ace/TP_Reactor.h" #include "ace/Thread.h" #include "ace/Timer_Queue.h" #include "ace/Sig_Handler.h" #include "ace/Log_Msg.h" #include "ace/OS_NS_sys_time.h" #if !defined (__ACE_INLINE__) #include "ace/TP_Reactor.inl" #endif /* __ACE_INLINE__ */ ACE_RCSID (ace, TP_Reactor, "$Id$") ACE_BEGIN_VERSIONED_NAMESPACE_DECL ACE_ALLOC_HOOK_DEFINE (ACE_TP_Reactor) int ACE_TP_Token_Guard::acquire_read_token (ACE_Time_Value *max_wait_time) { ACE_TRACE ("ACE_TP_Token_Guard::acquire_read_token"); // The order of these events is very subtle, modify with care. // Try to grab the lock. If someone if already there, don't wake // them up, just queue up in the thread pool. int result = 0; if (max_wait_time) { ACE_Time_Value tv = ACE_OS::gettimeofday (); tv += *max_wait_time; ACE_MT (result = this->token_.acquire_read (&ACE_TP_Reactor::no_op_sleep_hook, 0, &tv)); } else { ACE_MT (result = this->token_.acquire_read (&ACE_TP_Reactor::no_op_sleep_hook)); } // Check for timeouts and errors. if (result == -1) { if (errno == ETIME) return 0; else return -1; } // We got the token and so let us mark ourselves as owner this->owner_ = 1; return result; } int ACE_TP_Token_Guard::acquire_token (ACE_Time_Value *max_wait_time) { ACE_TRACE ("ACE_TP_Token_Guard::acquire_token"); // Try to grab the lock. If someone if already there, don't wake // them up, just queue up in the thread pool. int result = 0; if (max_wait_time) { ACE_Time_Value tv = ACE_OS::gettimeofday (); tv += *max_wait_time; ACE_MT (result = this->token_.acquire (0, 0, &tv)); } else { ACE_MT (result = this->token_.acquire ()); } // Check for timeouts and errors. if (result == -1) { if (errno == ETIME) return 0; else return -1; } // We got the token and so let us mark ourselves as owner this->owner_ = 1; return result; } ACE_TP_Reactor::ACE_TP_Reactor (ACE_Sig_Handler *sh, ACE_Timer_Queue *tq, int mask_signals, int s_queue) : ACE_Select_Reactor (sh, tq, 0, 0, mask_signals, s_queue) { ACE_TRACE ("ACE_TP_Reactor::ACE_TP_Reactor"); this->supress_notify_renew (1); } ACE_TP_Reactor::ACE_TP_Reactor (size_t max_number_of_handles, int restart, ACE_Sig_Handler *sh, ACE_Timer_Queue *tq, int mask_signals, int s_queue) : ACE_Select_Reactor (max_number_of_handles, restart, sh, tq, 0, 0, mask_signals, s_queue) { ACE_TRACE ("ACE_TP_Reactor::ACE_TP_Reactor"); this->supress_notify_renew (1); } int ACE_TP_Reactor::owner (ACE_thread_t, ACE_thread_t *o_id) { ACE_TRACE ("ACE_TP_Reactor::owner"); if (o_id) *o_id = ACE_Thread::self (); return 0; } int ACE_TP_Reactor::owner (ACE_thread_t *t_id) { ACE_TRACE ("ACE_TP_Reactor::owner"); *t_id = ACE_Thread::self (); return 0; } int ACE_TP_Reactor::handle_events (ACE_Time_Value *max_wait_time) { ACE_TRACE ("ACE_TP_Reactor::handle_events"); // Stash the current time -- the destructor of this object will // automatically compute how much time elapsed since this method was // called. ACE_Countdown_Time countdown (max_wait_time); // // The order of these events is very subtle, modify with care. // // Instantiate the token guard which will try grabbing the token for // this thread. ACE_TP_Token_Guard guard (this->token_); int const result = guard.acquire_read_token (max_wait_time); // If the guard is NOT the owner just return the retval if (!guard.is_owner ()) return result; // After getting the lock just just for deactivation.. if (this->deactivated_) return -1; // Update the countdown to reflect time waiting for the token. countdown.update (); return this->dispatch_i (max_wait_time, guard); } int ACE_TP_Reactor::dispatch_i (ACE_Time_Value *max_wait_time, ACE_TP_Token_Guard &guard) { int event_count = this->get_event_for_dispatching (max_wait_time); // We use this count to detect potential infinite loops as described // in bug 2540. int initial_event_count = event_count; int result = 0; // Note: We are passing the around, to have record of // how many events still need processing. May be this could be // useful in future. #if 0 // @Ciju // signal handling isn't in a production state yet. // Commenting it out for now. // Dispatch signals if (event_count == -1) { // Looks like we dont do any upcalls in dispatch signals. If at // a later point of time, we decide to handle signals we have to // release the lock before we make any upcalls.. What is here // now is not the right thing... // // @@ We need to do better.. return this->handle_signals (event_count, guard); } #endif // #if 0 // If there are no signals and if we had received a proper // event_count then first look at dispatching timeouts. We need to // handle timers early since they may have higher latency // constraints than I/O handlers. Ideally, the order of dispatching // should be a strategy... // NOTE: The event count does not have the number of timers that // needs dispatching. But we are still passing this along. We dont // need to do that. In the future we *may* have the timers also // returned through the . Just passing that along for // that day. result = this->handle_timer_events (event_count, guard); if (result > 0) return result; // Else just go ahead fall through for further handling. if (event_count > 0) { // Next dispatch the notification handlers (if there are any to // dispatch). These are required to handle multiple-threads // that are trying to update the . result = this->handle_notify_events (event_count, guard); if (result > 0) return result; // Else just fall through for further handling } if (event_count > 0) { // Handle socket events result = this->handle_socket_events (event_count, guard); } if (event_count != 0 && event_count == initial_event_count) { this->state_changed_ = true; } return 0; } #if 0 // @Ciju // signal handling isn't in a production state yet. // Commenting it out for now. int ACE_TP_Reactor::handle_signals (int & /*event_count*/, ACE_TP_Token_Guard & /*guard*/) { ACE_TRACE ("ACE_TP_Reactor::handle_signals"); /* * * THIS METHOD SEEMS BROKEN * * */ // First check for interrupts. // Bail out -- we got here since