summaryrefslogtreecommitdiff
path: root/ace/Token.h
diff options
context:
space:
mode:
Diffstat (limited to 'ace/Token.h')
-rw-r--r--ace/Token.h173
1 files changed, 0 insertions, 173 deletions
diff --git a/ace/Token.h b/ace/Token.h
deleted file mode 100644
index 961fdf906a0..00000000000
--- a/ace/Token.h
+++ /dev/null
@@ -1,173 +0,0 @@
-/* -*- C++ -*- */
-// $Id$
-
-
-// ============================================================================
-//
-// = LIBRARY
-// ace
-//
-// = FILENAME
-// Token.h
-//
-// = AUTHOR
-// Original author -- Karl-Heinz Dorn (kdorn@erlh.siemens.de)
-// Ported to ACE by Douglas C. Schmidt (schmidt@cs.wustl.edu)
-//
-// ============================================================================
-
-#if !defined (ACE_TOKEN_H)
-#define ACE_TOKEN_H
-
-#include "ace/Synch.h"
-
-#if defined (ACE_HAS_THREADS)
-
-class ACE_Export ACE_Token
- // = TITLE
- // Class that acquires, renews, and releases a synchronization
- // token that is serviced in strict FIFO ordering.
- //
- // = DESCRIPTION
- // This class is a more general-purpose synchronization mechanism
- // than SunOS 5.x mutexes. For example, it implements "recursive
- // mutex" semantics, where a thread that owns the token can
- // reacquire it without deadlocking. In addition, threads that are
- // blocked awaiting the token are serviced in strict FIFO order as
- // other threads release the token (Solaris and Pthread mutexes don't
- // strictly enforce an acquisition order).
-{
-public:
- // = Initialization and termination.
-
- ACE_Token (LPCTSTR name = 0, void * = 0);
- virtual ~ACE_Token (void);
-
- // = Synchronization operations.
-
- int acquire (void (*sleep_hook)(void *),
- void *arg = 0,
- ACE_Time_Value *timeout = 0);
- // Acquire the token, sleeping until it is obtained or until
- // <timeout> expires. If some other thread currently holds the
- // token then <sleep_hook> is called before our thread goes to
- // sleep. This <sleep_hook> can be used by the requesting thread to
- // unblock a token-holder that is sleeping, e.g., by means of
- // writing to a pipe (the ACE ACE_Reactor uses this functionality).
- // Return values:
- // 0 if acquires without calling <sleep_hook>
- // 1 if <sleep_hook> is called.
- // -1 if failure or timeout occurs (if timeout occurs errno == ETIME)
- // If <timeout> == <&ACE_Time_Value::zero> then acquire has polling
- // semantics (and does *not* call <sleep_hook>).
-
- int acquire (ACE_Time_Value *timeout = 0);
- // This behaves just like the previous <acquire> method, except
- // that it invokes the virtual function called <sleep_hook>
- // that can be overridden by a subclass of ACE_Token.
-
- virtual void sleep_hook (void);
- // This should be overridden by a subclass to define
- // the appropriate behavior before <acquire> goes to sleep.
- // By default, this is a no-op...
-
- int renew (int requeue_position = 0, ACE_Time_Value *timeout = 0);
- // An optimized method that efficiently reacquires the token if no
- // other threads are waiting. This is useful for situations where
- // you don't want to degrad the quality of service if there are
- // other threads waiting to get the token. If <requeue_position> ==
- // -1 and there are other threads waiting to obtain the token we are
- // queued at the end of the list of waiters. If <requeue_position>
- // > -1 then it indicates how many entries to skip over before
- // inserting our thread into the list of waiters (e.g.,
- // <requeue_position> == 0 means "insert at front of the queue").
- // Renew has the rather odd semantics such that if there are other
- // waiting threads it will give up the token even if the
- // nesting_level_ > 1. I'm not sure if this is really the right
- // thing to do (since it makes it possible for shared data to be
- // changed unexpectedly) so use with caution...
-
- int tryacquire (void);
- // Become interface-compliant with other lock mechanisms (implements
- // a non-blocking <acquire>).
-
- int remove (void);
- // Shuts down the ACE_Token instance.
-
- int release (void);
- // Relinquish the token. If there are any waiters then the next one
- // in line gets it.
-
- // = Accessor methods.
-
- int waiters (void);
- // Return the number of threads that are currently waiting to get
- // the token.
-
- ACE_thread_t current_owner (void);
- // Return the id of the current thread that owns the token.
-
- void dump (void) const;
- // Dump the state of an object.
-
- ACE_ALLOC_HOOK_DECLARE;
- // Declare the dynamic allocation hooks.
-
-private:
- // = The following structure implements a ACE_FIFO of waiter threads
- // that are asleep waiting to obtain the token.
-
- struct ACE_Queue_Entry
- {
- ACE_Queue_Entry (ACE_Thread_Mutex &m, ACE_thread_t t_id);
-
- ACE_Queue_Entry *next_;
- // Pointer to next waiter.
-
- ACE_thread_t thread_id_;
- // ACE_Thread id of this waiter.
-
- ACE_Condition_Thread_Mutex cv_;
- // ACE_Condition object used to wake up waiter when it can run again.
-
- int runable_;
- // Ok to run.
- };
-
- int shared_acquire (void (*sleep_hook_func)(void *),
- void *arg,
- ACE_Time_Value *timeout);
- // Implements the <acquire> and <tryacquire> methods above.
-
- void remove_entry (ACE_Queue_Entry *);
- // Remove a waiter from the queue (used when a timeout occurs).
-
- ACE_Queue_Entry *head_;
- // Head of the list of waiting threads.
-
- ACE_Queue_Entry *tail_;
- // Tail of the list of waiting threads.
-
- ACE_Thread_Mutex lock_;
- // ACE_Thread_Mutex used to lock internal data structures.
-
- ACE_thread_t owner_;
- // Current owner of the token.
-
- int in_use_;
- // Some thread (i.e., <owner_>) is using the token. We need this
- // extra variable to deal with POSIX pthreads madness...
-
- int waiters_;
- // Number of waiters.
-
- int nesting_level_;
- // Current nesting level.
-};
-
-#if defined (__ACE_INLINE__)
-#include "ace/Token.i"
-#endif /* __ACE_INLINE__ */
-
-#endif /* ACE_HAS_THREADS */
-#endif /* ACE_TOKEN_H */