/* -*- C++ -*- */ // $Id$ // ============================================================================ // // = LIBRARY // ace // // = FILENAME // Select_Reactor_Base.h // // = AUTHOR // Doug Schmidt // // ============================================================================ #ifndef ACE_SELECT_REACTOR_BASE_H #define ACE_SELECT_REACTOR_BASE_H #include "ace/pre.h" #include "ace/Signal.h" #if !defined (ACE_LACKS_PRAGMA_ONCE) # pragma once #endif /* ACE_LACKS_PRAGMA_ONCE */ #include "ace/Timer_Queue.h" #include "ace/Event_Handler.h" #include "ace/Handle_Set.h" #include "ace/Token.h" #include "ace/Pipe.h" #include "ace/Reactor_Impl.h" // Add useful typedefs to simplify the following code. typedef void (ACE_Handle_Set::*ACE_FDS_PTMF) (ACE_HANDLE); typedef int (ACE_Event_Handler::*ACE_EH_PTMF) (ACE_HANDLE); // Forward declaration. class ACE_Select_Reactor_Impl; class ACE_Export ACE_Select_Reactor_Handle_Set { // = TITLE // Track handles we are interested for various events. public: ACE_Handle_Set rd_mask_; // Read events (e.g., input pending, accept pending). ACE_Handle_Set wr_mask_; // Write events (e.g., flow control abated, non-blocking connection // complete). ACE_Handle_Set ex_mask_; // Exception events (e.g., SIG_URG). }; class ACE_Export ACE_Event_Tuple { // = TITLE // An ACE_Event_Handler and its associated ACE_HANDLE. // // = DESCRIPTION // One is registered for one or more // . At various points, this information must be // stored explicitly. This class provides a lightweight // mechanism to do so. public: ACE_Event_Tuple (void); // Default constructor. ACE_Event_Tuple (ACE_Event_Handler *eh, ACE_HANDLE h); // Constructor. ~ACE_Event_Tuple (void); // Destructor. int operator== (const ACE_Event_Tuple &rhs) const; // Equality operator. int operator!= (const ACE_Event_Tuple &rhs) const; // Inequality operator. ACE_HANDLE handle_; // Handle. ACE_Event_Handler *event_handler_; // associated with the . }; class ACE_Export ACE_Select_Reactor_Notify : public ACE_Reactor_Notify { // = TITLE // Unblock the from its event loop. // // = DESCRIPTION // This implementation is necessary for cases where the // is run in a multi-threaded program. In // this case, we need to be able to unblock /. Pass over both the // *and* the to allow the caller to dictate // which method the will // invoke. The indicates how long to blocking // trying to notify the . If == 0, // the caller will block until action is possible, else will wait // until the relative time specified in * elapses). virtual int dispatch_notifications (int &number_of_active_handles, ACE_Handle_Set &rd_mask); // Handles pending threads (if any) that are waiting to unblock the // . virtual int handle_input (ACE_HANDLE handle); // Called back by the when a thread wants to // unblock us. virtual void max_notify_iterations (int); // Set the maximum number of times that the // method will iterate and // dispatch the that are passed in via the // notify pipe before breaking out of its loop. By default, // this is set to -1, which means "iterate until the pipe is empty." // Setting this to a value like "1 or 2" will increase "fairness" // (and thus prevent starvation) at the expense of slightly higher // dispatching overhead. virtual int max_notify_iterations (void); // Get the maximum number of times that the // method will iterate and // dispatch the that are passed in via the // notify pipe before breaking out of its loop. virtual void dump (void) const; // Dump the state of an object. ACE_ALLOC_HOOK_DECLARE; // Declare the dynamic allocation hooks. private: ACE_Select_Reactor_Impl *select_reactor_; // Keep a back pointer to the . If this value // if NULL then the has been initialized with // . ACE_Pipe notification_pipe_; // Contains the the is listening // on, as well as the that threads wanting the // attention of the will write to. int max_notify_iterations_; // Keeps track of the maximum number of times that the // method will iterate and // dispatch the that are passed in via the // notify pipe before breaking out of its loop. By default, // this is set to -1, which means "iterate until the pipe is empty." #if defined (ACE_HAS_REACTOR_NOTIFICATION_QUEUE) ACE_Unbounded_Queue alloc_queue_; // Keeps track of allocated arrays of type // . ACE_Unbounded_Queue notify_queue_; // Keeps track of all pending notifications. ACE_Unbounded_Queue free_queue_; // Keeps track of all free buffers. ACE_SYNCH_RW_MUTEX notify_queue_lock_; // Synchronization for handling of queues. #endif /* ACE_HAS_REACTOR_NOTIFICATION_QUEUE */ }; class ACE_Export ACE_Select_Reactor_Handler_Repository { // = TITLE // Used to map s onto the appropriate // *. // // = DESCRIPTION // This class is necessary to shield differences between UNIX // and Win32. In UNIX, is an int, whereas in Win32 // it's a void *. This class hides all these details from the // bulk of the code. All of these methods // are called with the main token lock held. public: friend class ACE_Select_Reactor_Handler_Repository_Iterator; // = Initialization and termination methods. ACE_Select_Reactor_Handler_Repository (ACE_Select_Reactor_Impl &); // Default "do-nothing" constructor. ~ACE_Select_Reactor_Handler_Repository (void); // dtor. int open (size_t size); // Initialize a repository of the appropriate . int close (void); // Close down the repository. // = Search structure operations. ACE_Event_Handler *find (ACE_HANDLE handle, size_t *index_p = 0); // Return the associated with . // If is non-0, then return the index location of the // , if found. int bind (ACE_HANDLE, ACE_Event_Handler *, ACE_Reactor_Mask); // Bind the to the with the // appropriate settings. int unbind (ACE_HANDLE, ACE_Reactor_Mask mask); // Remove the binding of in accordance with the . int unbind_all (void); // Remove all the tuples. // = Sanity checking. // Check the to make sure it's a valid ACE_HANDLE that // within the range of legal handles (i.e., >= 0 && < max_size_). int invalid_handle (ACE_HANDLE handle); // Check the to make sure it's a valid ACE_HANDLE that // within the range of currently registered handles (i.e., >= 0 && < // max_handlep1_). int handle_in_range (ACE_HANDLE handle); // = Accessors. size_t size (void); // Returns the current table size. size_t max_handlep1 (void); // Maximum ACE_HANDLE value, plus 1. void dump (void) const; // Dump the state of an object. ACE_ALLOC_HOOK_DECLARE; // Declare the dynamic allocation hooks. private: ACE_Select_Reactor_Impl &select_reactor_; // Reference to our . ssize_t max_size_; // Maximum number of handles. int max_handlep1_; // The highest currently active handle, plus 1 (ranges between 0 and // . #if defined (ACE_WIN32) // = The mapping from to . ACE_Event_Tuple *event_handlers_; // The NT version implements this via a dynamically allocated // array of . Since NT implements ACE_HANDLE // as a void * we can't directly index into this array. Therefore, // we just do a linear search (for now). Next, we'll modify // things to use hashing or something faster... #else ACE_Event_Handler **event_handlers_; // The UNIX version implements this via a dynamically allocated // array of that is indexed directly using // the ACE_HANDLE value. #endif /* ACE_WIN32 */ }; class ACE_Export ACE_Select_Reactor_Handler_Repository_Iterator { // = TITLE // Iterate through the . public: // = Initialization method. ACE_Select_Reactor_Handler_Repository_Iterator (const ACE_Select_Reactor_Handler_Repository *s); ~ACE_Select_Reactor_Handler_Repository_Iterator (void); // dtor. // = Iteration methods. int next (ACE_Event_Handler *&next_item); // Pass back the that hasn't been seen in the Set. // Returns 0 when all items have been seen, else 1. int done (void) const; // Returns 1 when all items have been seen, else 0. int advance (void); // Move forward by one element in the set. Returns 0 when all the // items in the set have been seen, else 1. void dump (void) const; // Dump the state of an object. ACE_ALLOC_HOOK_DECLARE; // Declare the dynamic allocation hooks. private: const ACE_Select_Reactor_Handler_Repository *rep_; // Reference to the Handler_Repository we are iterating over. ssize_t current_; // Pointer to the current iteration level. }; class ACE_Export ACE_Select_Reactor_Impl : public ACE_Reactor_Impl { // = TITLE // This class simply defines how Select_Reactor's basic interface // functions should look like and provides a common base class for // using various locking mechanism. public: enum { DEFAULT_SIZE = ACE_DEFAULT_SELECT_REACTOR_SIZE // Default size of the Select_Reactor's handle table. }; ACE_Select_Reactor_Impl (void); // Constructor. friend class ACE_Select_Reactor_Notify; friend class ACE_Select_Reactor_Handler_Repository; protected: virtual int bit_ops (ACE_HANDLE handle, ACE_Reactor_Mask mask, ACE_Select_Reactor_Handle_Set &wait_Set, int ops); // Allow manipulation of the mask and mask. virtual void renew (void) = 0; // Enqueue ourselves into the list of waiting threads at the // appropriate point specified by . ACE_Select_Reactor_Handler_Repository handler_rep_; // Table that maps to 's. ACE_Select_Reactor_Handle_Set wait_set_; // Tracks handles that are waited for by . ACE_Timer_Queue *timer_queue_; // Defined as a pointer to allow overriding by derived classes... int delete_timer_queue_; // Keeps track of whether we should delete the timer queue (if we // didn't create it, then we don't delete it). ACE_Sig_Handler *signal_handler_; // Handle signals without requiring global/static variables. int delete_signal_handler_; // Keeps track of whether we should delete the signal handler (if we // didn't create it, then we don't delete it). ACE_Reactor_Notify *notify_handler_; // Callback object that unblocks the if it's // sleeping. int delete_notify_handler_; // Keeps track of whether we need to delete the notify handler (if // we didn't create it, then we don't delete it). int restart_; // Restart the event-loop method automatically when //