version 1.1.2.2, 2001/11/26 20:48:00
|
version 1.20, 2002/04/24 20:24:57
|
|
|
| |
#include <Pegasus/Common/AsyncOpNode.h> | #include <Pegasus/Common/AsyncOpNode.h> |
| |
PEGASUS_USING_STD; |
|
|
|
|
|
PEGASUS_NAMESPACE_BEGIN | PEGASUS_NAMESPACE_BEGIN |
// const Uint32 AsyncOpFlags::UNKNOWN = 0x00000000; |
|
// const Uint32 AsyncOpFlags::DELIVER = 0x00000001; |
|
// const Uint32 AsyncOpFlags::RESERVE = 0x00000002; |
|
// const Uint32 AsyncOpFlags::PROCESSING = 0x00000004; |
|
// const Uint32 AsyncOpFlags::COMPLETE = 0x00000008; |
|
// const Uint32 AsyncOpFlags::INTERVAL_REPEAT = 0x00000010; |
|
// const Uint32 AsyncOpFlags::INDICATION = 0x00000020; |
|
// const Uint32 AsyncOpFlags::REMOTE = 0x00000040; |
|
// const Uint32 AsyncOpFlags::LOCAL_OUT_OF_PROC = 0x00000080; |
|
|
|
|
|
// const Uint32 AsyncOpState::NORMAL = 0x00000000; |
|
// const Uint32 AsyncOpState::PHASED = 0x00000001; |
|
// const Uint32 AsyncOpState::PARTIAL = 0x00000002; |
|
// const Uint32 AsyncOpState::TIMEOUT = 0x00000004; |
|
// const Uint32 AsyncOpState::SINGLE = 0x00000008; |
|
// const Uint32 AsyncOpState::MULTIPLE = 0x00000010; |
|
// const Uint32 AsyncOpState::TOTAL = 0x00000020; |
|
| |
|
AsyncOpNode * AsyncOpNode::_headOfFreeList; |
|
const int AsyncOpNode::BLOCK_SIZE = 200; |
|
Mutex AsyncOpNode::_alloc_mut; |
|
|
|
void * AsyncOpNode::operator new(size_t size) |
|
{ |
|
if(size != sizeof(AsyncOpNode)) |
|
return :: operator new(size); |
|
|
|
_alloc_mut.lock(pegasus_thread_self()); |
|
|
|
AsyncOpNode *node = _headOfFreeList; |
|
if(node) |
|
_headOfFreeList = node->_parent; |
|
else |
|
{ |
|
AsyncOpNode * newBlock = |
|
static_cast<AsyncOpNode *>(::operator new( BLOCK_SIZE * sizeof(AsyncOpNode))); |
|
int i; |
|
for( i = 1; i < BLOCK_SIZE - 1; ++i) |
|
newBlock[i]._parent = &newBlock[i + 1]; |
|
newBlock[BLOCK_SIZE - 1]._parent = NULL; |
|
node = newBlock; |
|
_headOfFreeList = &newBlock[1]; |
|
} |
|
_alloc_mut.unlock(); |
|
return node; |
|
} |
|
|
|
void AsyncOpNode::operator delete(void *dead, size_t size) |
|
{ |
|
|
|
if(dead == 0) |
|
return; |
|
if(size != sizeof(AsyncOpNode)) |
|
{ |
|
::operator delete(dead); |
|
return; |
|
} |
|
AsyncOpNode *node = static_cast<AsyncOpNode *>(dead); |
|
_alloc_mut.lock(pegasus_thread_self()); |
|
node->_parent = _headOfFreeList; |
|
_headOfFreeList = node; |
|
_alloc_mut.unlock(); |
|
} |
|
|
|
|
|
AsyncOpNode::AsyncOpNode(void) |
|
: _client_sem(0), _request(true), _response(true), |
|
_state(0), _flags(0), _offered_count(0), _total_ops(0), _completed_ops(0), |
|
_user_data(0), _completion_code(0), _op_dest(0), |
|
_parent(0), _children(true), _async_callback(0),__async_callback(0), |
|
_callback_node(0), _callback_response_q(0), |
|
_callback_ptr(0), _callback_parameter(0), |
|
_callback_handle(0), _callback_notify(0), _callback_request_q(0) |
|
{ |
|
gettimeofday(&_start, NULL); |
|
memset(&_lifetime, 0x00, sizeof(struct timeval)); |
|
memset(&_updated, 0x00, sizeof(struct timeval)); |
|
_timeout_interval.tv_sec = 60; |
|
_timeout_interval.tv_usec = 100; |
|
} |
|
|
|
AsyncOpNode::~AsyncOpNode(void) |
|
{ |
|
_request.empty_list(); |
|
_response.empty_list(); |
|
} |
|
|
|
void AsyncOpNode::_reset(unlocked_dq<AsyncOpNode> *dst_q) |
|
{ |
|
AsyncOpNode *child = _children.remove_first(); |
|
while( child != 0 ) |
|
{ |
|
child->_reset(dst_q); |
|
child = _children.remove_first(); |
|
} |
|
|
|
_parent = 0; |
|
_request.empty_list(); |
|
_response.empty_list(); |
|
|
|
_operation_list.reset(); |
|
_state = 0; |
|
_flags = 0; |
|
_offered_count = 0; |
|
_total_ops = 0; |
|
_completed_ops = 0; |
|
_user_data = 0; |
|
_completion_code = 0; |
|
_op_dest = 0; |
|
_async_callback = 0; |
|
__async_callback = 0; |
|
_callback_node =0; |
|
_callback_response_q = 0; |
|
_callback_ptr=0; |
|
_callback_parameter = 0; |
|
_callback_handle = 0; |
|
_callback_notify = 0; |
|
_callback_request_q = 0; |
|
dst_q->insert_first(this); |
|
while ( _client_sem.count() ) |
|
_client_sem.wait(); |
|
PEGASUS_ASSERT( _client_sem.count() == 0 ); |
|
|
|
return; |
|
} |
| |
PEGASUS_NAMESPACE_END | PEGASUS_NAMESPACE_END |