version 1.31, 2002/05/30 00:12:38
|
version 1.43, 2005/05/04 12:44:03
|
|
|
//%///////////////////////////////////////////////////////////////////////////// |
//%2005//////////////////////////////////////////////////////////////////////// |
// | // |
// Copyright (c) 2000, 2001 The Open group, BMC Software, Tivoli Systems, IBM |
// Copyright (c) 2000, 2001, 2002 BMC Software; Hewlett-Packard Development |
|
// Company, L.P.; IBM Corp.; The Open Group; Tivoli Systems. |
|
// Copyright (c) 2003 BMC Software; Hewlett-Packard Development Company, L.P.; |
|
// IBM Corp.; EMC Corporation, The Open Group. |
|
// Copyright (c) 2004 BMC Software; Hewlett-Packard Development Company, L.P.; |
|
// IBM Corp.; EMC Corporation; VERITAS Software Corporation; The Open Group. |
|
// Copyright (c) 2005 Hewlett-Packard Development Company, L.P.; IBM Corp.; |
|
// EMC Corporation; VERITAS Software Corporation; The Open Group. |
// | // |
// Permission is hereby granted, free of charge, to any person obtaining a copy | // Permission is hereby granted, free of charge, to any person obtaining a copy |
// of this software and associated documentation files (the "Software"), to | // of this software and associated documentation files (the "Software"), to |
|
|
// | // |
// Author: Mike Brasher (mbrasher@bmc.com) | // Author: Mike Brasher (mbrasher@bmc.com) |
// | // |
// Modified By: |
// Modified By: Amit K Arora, IBM (amita@in.ibm.com) for Bug#1090 |
|
// Josephine Eskaline Joyce, IBM (jojustin@in.ibm.com) for Bug#2076 |
|
// David Dillard, VERITAS Software Corp. |
|
// (david.dillard@veritas.com) |
// | // |
//%///////////////////////////////////////////////////////////////////////////// | //%///////////////////////////////////////////////////////////////////////////// |
| |
|
|
typedef HashTable<Uint32, MessageQueue*, EqualFunc<Uint32>, HashFunc<Uint32> > | typedef HashTable<Uint32, MessageQueue*, EqualFunc<Uint32>, HashFunc<Uint32> > |
QueueTable; | QueueTable; |
| |
static QueueTable _queueTable(128); |
static QueueTable _queueTable(256); |
static Mutex q_table_mut ; | static Mutex q_table_mut ; |
| |
Uint32 MessageQueue::getNextQueueId() throw(IPCException) |
void MessageQueue::remove_myself(Uint32 qid) |
|
{ |
|
AutoMutex autoMut(q_table_mut); |
|
_queueTable.remove(qid); |
|
} |
|
|
|
|
|
Uint32 MessageQueue::getNextQueueId() |
{ | { |
static Uint32 _nextQueueId = 2; | static Uint32 _nextQueueId = 2; |
| |
// | // |
// Lock mutex: | // Lock mutex: |
// | // |
|
|
static Mutex _id_mut ; | static Mutex _id_mut ; |
_id_mut.lock(pegasus_thread_self()); |
AutoMutex autoMut(_id_mut); |
| |
// Assign next queue id. Handle wrap around and never assign zero as |
Uint32 queueId; |
// a queue id: |
|
| |
|
// Assign the next queue ID that is not already in use |
|
do |
|
{ |
|
// Handle wrap around and never assign zero or one as a queue id: |
if (_nextQueueId == 0) | if (_nextQueueId == 0) |
|
{ |
_nextQueueId = 2; | _nextQueueId = 2; |
|
} |
| |
Uint32 queueId = _nextQueueId++; |
queueId = _nextQueueId++; |
|
} while (lookup(queueId) != 0); |
// |
|
// Unlock mutex: |
|
// |
|
|
|
_id_mut.unlock(); |
|
| |
return queueId; | return queueId; |
} | } |
|
|
strcpy(_name, name); | strcpy(_name, name); |
| |
Tracer::trace(TRC_MESSAGEQUEUESERVICE, Tracer::LEVEL3, | Tracer::trace(TRC_MESSAGEQUEUESERVICE, Tracer::LEVEL3, |
"MessageQueue::MessageQueue name = %s, queueId = %i", name, queueId); |
"MessageQueue::MessageQueue name = %s, queueId = %u", name, queueId); |
| |
// | // |
// Insert into queue table: | // Insert into queue table: |
// | // |
|
AutoMutex autoMut(q_table_mut); |
q_table_mut.lock(pegasus_thread_self()); |
|
|
|
while (!_queueTable.insert(_queueId, this)) | while (!_queueTable.insert(_queueId, this)) |
; | ; |
| |
q_table_mut.unlock(); |
|
|
|
|
|
PEG_METHOD_EXIT(); | PEG_METHOD_EXIT(); |
} | } |
| |
MessageQueue::~MessageQueue() | MessageQueue::~MessageQueue() |
{ | { |
// ATTN-A: thread safety! | // ATTN-A: thread safety! |
|
|
PEG_METHOD_ENTER(TRC_MESSAGEQUEUESERVICE,"MessageQueue::~MessageQueue()"); | PEG_METHOD_ENTER(TRC_MESSAGEQUEUESERVICE,"MessageQueue::~MessageQueue()"); |
|
|
Tracer::trace(TRC_MESSAGEQUEUESERVICE, Tracer::LEVEL3, | Tracer::trace(TRC_MESSAGEQUEUESERVICE, Tracer::LEVEL3, |
"MessageQueue::~MessageQueue queueId = %i, name = %s", _queueId, _name); | "MessageQueue::~MessageQueue queueId = %i, name = %s", _queueId, _name); |
| |
q_table_mut.lock(pegasus_thread_self()); |
{ |
|
AutoMutex autoMut(q_table_mut); |
_queueTable.remove(_queueId); | _queueTable.remove(_queueId); |
q_table_mut.unlock(); |
} // mutex unlocks here |
| |
// Free the name: | // Free the name: |
| |
delete [] _name; | delete [] _name; |
| |
|
while(_front) |
|
{ |
|
Message* tmp = _front; |
|
_front = _front->_next; |
|
delete tmp; |
|
} |
|
|
PEG_METHOD_EXIT(); | PEG_METHOD_EXIT(); |
} | } |
| |
void MessageQueue::enqueue(Message* message) throw(IPCException) |
void MessageQueue::enqueue(Message* message) |
{ | { |
PEG_METHOD_ENTER(TRC_MESSAGEQUEUESERVICE,"MessageQueue::enqueue()"); | PEG_METHOD_ENTER(TRC_MESSAGEQUEUESERVICE,"MessageQueue::enqueue()"); |
| |
|
|
MessageTypeToString(message->getType()), | MessageTypeToString(message->getType()), |
message->getKey() ); | message->getKey() ); |
| |
_mut.lock(pegasus_thread_self()); |
{ |
|
AutoMutex autoMut(_mut); |
if (_back) | if (_back) |
{ | { |
_back->_next = message; | _back->_next = message; |
|
|
Tracer::trace(TRC_MESSAGEQUEUESERVICE, Tracer::LEVEL4, | Tracer::trace(TRC_MESSAGEQUEUESERVICE, Tracer::LEVEL4, |
"MessageQueue::enqueue _queueId = %d, _count = %d", _queueId, _count); | "MessageQueue::enqueue _queueId = %d, _count = %d", _queueId, _count); |
| |
_mut.unlock(); |
} // mutex unlocks here |
| |
handleEnqueue(); | handleEnqueue(); |
PEG_METHOD_EXIT(); | PEG_METHOD_EXIT(); |
} | } |
| |
Message* MessageQueue::dequeue() throw(IPCException) |
Message* MessageQueue::dequeue() |
{ | { |
PEG_METHOD_ENTER(TRC_MESSAGEQUEUESERVICE,"MessageQueue::dequeue()"); | PEG_METHOD_ENTER(TRC_MESSAGEQUEUESERVICE,"MessageQueue::dequeue()"); |
| |
_mut.lock(pegasus_thread_self()); |
AutoMutex autoMut(_mut); |
if (_front) | if (_front) |
{ | { |
Message* message = _front; | Message* message = _front; |
|
|
"MessageQueue::dequeue _queueId = %d, _count = %d", | "MessageQueue::dequeue _queueId = %d, _count = %d", |
_queueId, _count); | _queueId, _count); |
| |
_mut.unlock(); |
|
message->_next = 0; | message->_next = 0; |
message->_prev = 0; | message->_prev = 0; |
message->_owner = 0; | message->_owner = 0; |
|
|
PEG_METHOD_EXIT(); | PEG_METHOD_EXIT(); |
return message; | return message; |
} | } |
_mut.unlock(); |
|
| |
PEG_METHOD_EXIT(); | PEG_METHOD_EXIT(); |
return 0; | return 0; |
} | } |
; |
|
| |
| |
void MessageQueue::remove(Message* message) throw(IPCException) |
|
|
void MessageQueue::remove(Message* message) |
{ | { |
PEG_METHOD_ENTER(TRC_MESSAGEQUEUESERVICE,"MessageQueue::remove()"); | PEG_METHOD_ENTER(TRC_MESSAGEQUEUESERVICE,"MessageQueue::remove()"); |
| |
|
|
throw NoSuchMessageOnQueue(); | throw NoSuchMessageOnQueue(); |
} | } |
| |
_mut.lock(pegasus_thread_self()); |
{ |
|
AutoMutex autoMut(_mut); |
| |
if (message->_next) | if (message->_next) |
message->_next->_prev = message->_prev; | message->_next->_prev = message->_prev; |
|
|
Tracer::trace(TRC_MESSAGEQUEUESERVICE, Tracer::LEVEL4, | Tracer::trace(TRC_MESSAGEQUEUESERVICE, Tracer::LEVEL4, |
"MessageQueue::remove _count = %d", _count); | "MessageQueue::remove _count = %d", _count); |
| |
_mut.unlock(); |
} // mutex unlocks here |
| |
message->_prev = 0; | message->_prev = 0; |
message->_next = 0; | message->_next = 0; |
|
|
PEG_METHOD_EXIT(); | PEG_METHOD_EXIT(); |
} | } |
| |
Message* MessageQueue::findByType(Uint32 type) throw(IPCException) |
Message* MessageQueue::findByType(Uint32 type) |
{ | { |
_mut.lock(pegasus_thread_self()); |
AutoMutex autoMut(_mut); |
| |
for (Message* m = front(); m; m = m->getNext()) | for (Message* m = front(); m; m = m->getNext()) |
{ | { |
if (m->getType() == type) | if (m->getType() == type) |
{ | { |
_mut.unlock(); |
|
return m; | return m; |
} | } |
} | } |
_mut.unlock(); |
|
return 0; | return 0; |
} | } |
| |
Message* MessageQueue::findByKey(Uint32 key) throw(IPCException) |
Message* MessageQueue::findByKey(Uint32 key) |
{ | { |
_mut.lock(pegasus_thread_self()); |
AutoMutex autoMut(_mut); |
| |
for (Message* m = front(); m; m = m->getNext()) | for (Message* m = front(); m; m = m->getNext()) |
{ | { |
if (m->getKey() == key) | if (m->getKey() == key) |
{ | { |
_mut.unlock(); |
|
return m; | return m; |
} | } |
| |
} | } |
_mut.unlock(); |
|
return 0; | return 0; |
} | } |
| |
void MessageQueue::print(ostream& os) const throw(IPCException) |
void MessageQueue::print(ostream& os) const |
{ | { |
const_cast<MessageQueue *>(this)->_mut.lock(pegasus_thread_self()); |
AutoMutex autoMut(const_cast<MessageQueue *>(this)->_mut); |
| |
for (const Message* m = front(); m; m = m->getNext()) | for (const Message* m = front(); m; m = m->getNext()) |
m->print(os); | m->print(os); |
const_cast<MessageQueue *>(this)->_mut.unlock(); |
|
} | } |
| |
Message* MessageQueue::find(Uint32 type, Uint32 key) throw(IPCException) |
Message* MessageQueue::find(Uint32 type, Uint32 key) |
{ | { |
_mut.lock(pegasus_thread_self()); |
AutoMutex autoMut(_mut); |
| |
for (Message* m = front(); m; m = m->getNext()) | for (Message* m = front(); m; m = m->getNext()) |
{ | { |
if (m->getType() == type && m->getKey() == key) | if (m->getType() == type && m->getKey() == key) |
{ | { |
_mut.unlock(); |
|
return m; | return m; |
} | } |
} | } |
_mut.unlock(); |
|
| |
return 0; | return 0; |
} | } |
| |
void MessageQueue::lock() throw(IPCException) |
void MessageQueue::lock() |
{ | { |
_mut.lock(pegasus_thread_self()); | _mut.lock(pegasus_thread_self()); |
} | } |
|
|
return _name; | return _name; |
} | } |
| |
MessageQueue* MessageQueue::lookup(Uint32 queueId) throw(IPCException) |
MessageQueue* MessageQueue::lookup(Uint32 queueId) |
{ | { |
| |
MessageQueue* queue = 0; | MessageQueue* queue = 0; |
q_table_mut.lock(pegasus_thread_self()); |
AutoMutex autoMut(q_table_mut); |
| |
if (_queueTable.lookup(queueId, queue)) | if (_queueTable.lookup(queueId, queue)) |
{ | { |
q_table_mut.unlock(); |
|
return queue; | return queue; |
} | } |
| |
// Not found! | // Not found! |
| |
q_table_mut.unlock(); |
|
|
|
Tracer::trace(TRC_MESSAGEQUEUESERVICE, Tracer::LEVEL3, | Tracer::trace(TRC_MESSAGEQUEUESERVICE, Tracer::LEVEL3, |
"MessageQueue::lookup failure queueId = %i", queueId); |
"MessageQueue::lookup failure queueId = %u", queueId); |
| |
return 0; | return 0; |
} | } |
| |
| |
MessageQueue* MessageQueue::lookup(const char *name) throw(IPCException) |
MessageQueue* MessageQueue::lookup(const char *name) |
{ | { |
| |
if(name == NULL) | if(name == NULL) |
throw NullPointer(); | throw NullPointer(); |
q_table_mut.lock(pegasus_thread_self()); |
|
| |
|
AutoMutex autoMut(q_table_mut); |
for(QueueTable::Iterator i = _queueTable.start(); i; i++) | for(QueueTable::Iterator i = _queueTable.start(); i; i++) |
{ | { |
// ATTN: Need to decide how many characters to compare in queue names | // ATTN: Need to decide how many characters to compare in queue names |
if(! strcmp( ((MessageQueue *)i.value())->getQueueName(), name) ) | if(! strcmp( ((MessageQueue *)i.value())->getQueueName(), name) ) |
{ | { |
q_table_mut.unlock(); |
|
return( (MessageQueue *)i.value()); | return( (MessageQueue *)i.value()); |
} | } |
|
|
} | } |
q_table_mut.unlock(); |
|
| |
Tracer::trace(TRC_MESSAGEQUEUESERVICE, Tracer::LEVEL3, | Tracer::trace(TRC_MESSAGEQUEUESERVICE, Tracer::LEVEL3, |
"MessageQueue::lookup failure - name = %s", name); | "MessageQueue::lookup failure - name = %s", name); |