#include <Local_Tokens.h>
Collaboration diagram for ACE_Token_Proxy_Queue:
Public Methods | |
ACE_Token_Proxy_Queue (void) | |
Constructor. | |
~ACE_Token_Proxy_Queue (void) | |
Destructor. | |
void | enqueue (ACE_TPQ_Entry *new_entry, int position) |
const ACE_TPQ_Entry * | head (void) |
Top of the queue. | |
void | dequeue (void) |
Remove the top waiter. | |
void | remove (const ACE_TPQ_Entry *remove_me) |
Remove the waiter whose proxy ref matches remove_me. | |
int | size (void) |
The number of waiters. | |
void | dump (void) const |
Dump the state of the class. | |
Protected Attributes | |
ACE_TPQ_Entry * | head_ |
Head. | |
ACE_TPQ_Entry * | tail_ |
Tail. | |
int | size_ |
Size. | |
Friends | |
class | ACE_TPQ_Iterator |
Not a public interface. This queue holds all the token proxies waiting for ownership of a token. Along with the proxy reference, it also stores the nesting level, client id, and a magic cookie from the proxy. This queue stores the ACE_TPQ_Entries by pointer values. It DOES NOT make copies. Thus, the user is responsible to ensure that the TPQ's stick around. This is motivated by the need to reduce dynamic memory allocation.
|
Constructor.
|
|
Destructor.
|
|
Remove the top waiter.
|
|
Dump the state of the class.
|
|
Enqueue a proxy, nesting level, client_id, and a magic cookie at the given position in the list. If the position is -1, we enqueue at the end of the list (I think). |
|
Top of the queue.
|
|
Remove the waiter whose proxy ref matches remove_me.
|
|
The number of waiters.
|
|
|
|
Head.
|
|
Size.
|
|
Tail.
|