version 1.4, 2001/07/10 22:31:14
|
version 1.37, 2003/11/07 19:18:46
|
|
|
//%///////////////////////////////////////////////////////////////////////////// |
//%2003//////////////////////////////////////////////////////////////////////// |
// | // |
// 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. |
// | // |
// 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 |
|
|
// | // |
//%///////////////////////////////////////////////////////////////////////////// | //%///////////////////////////////////////////////////////////////////////////// |
| |
|
#include <Pegasus/Common/HashTable.h> |
|
#include <Pegasus/Common/IPC.h> |
|
#include <Pegasus/Common/Tracer.h> |
#include "MessageQueue.h" | #include "MessageQueue.h" |
|
#include "MessageQueueService.h" |
PEGASUS_USING_STD; | PEGASUS_USING_STD; |
| |
PEGASUS_NAMESPACE_BEGIN | PEGASUS_NAMESPACE_BEGIN |
| |
|
typedef HashTable<Uint32, MessageQueue*, EqualFunc<Uint32>, HashFunc<Uint32> > |
|
QueueTable; |
|
|
|
static QueueTable _queueTable(256); |
|
static Mutex q_table_mut ; |
|
|
|
void MessageQueue::remove_myself(Uint32 qid) |
|
{ |
|
q_table_mut.lock(pegasus_thread_self()); |
|
|
|
_queueTable.remove(qid); |
|
q_table_mut.unlock(); |
|
} |
|
|
|
|
|
Uint32 MessageQueue::getNextQueueId() throw(IPCException) |
|
{ |
|
static Uint32 _nextQueueId = 2; |
|
|
|
// |
|
// Lock mutex: |
|
// |
|
|
|
static Mutex _id_mut ; |
|
_id_mut.lock(pegasus_thread_self()); |
|
|
|
Uint32 queueId; |
|
|
|
// 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) |
|
{ |
|
_nextQueueId = 2; |
|
} |
|
|
|
queueId = _nextQueueId++; |
|
} while (lookup(queueId) != 0); |
|
|
|
// |
|
// Unlock mutex: |
|
// |
|
|
|
_id_mut.unlock(); |
|
|
|
return queueId; |
|
} |
|
|
|
|
|
|
|
MessageQueue::MessageQueue( |
|
const char* name, |
|
Boolean async, |
|
Uint32 queueId) |
|
: _queueId(queueId), _capabilities(0), _count(0), _front(0), _back(0), _async(async) |
|
{ |
|
// |
|
// Copy the name: |
|
// |
|
|
|
PEG_METHOD_ENTER(TRC_MESSAGEQUEUESERVICE,"MessageQueue::MessageQueue()"); |
|
|
|
if (!name) |
|
name = ""; |
|
|
|
_name = new char[strlen(name) + 1]; |
|
strcpy(_name, name); |
|
|
|
Tracer::trace(TRC_MESSAGEQUEUESERVICE, Tracer::LEVEL3, |
|
"MessageQueue::MessageQueue name = %s, queueId = %i", name, queueId); |
|
|
|
// |
|
// Insert into queue table: |
|
// |
|
|
|
q_table_mut.lock(pegasus_thread_self()); |
|
|
|
while (!_queueTable.insert(_queueId, this)) |
|
; |
|
|
|
q_table_mut.unlock(); |
|
|
|
|
|
PEG_METHOD_EXIT(); |
|
} |
|
|
|
MessageQueue::~MessageQueue() |
|
{ |
|
// ATTN-A: thread safety! |
|
|
|
PEG_METHOD_ENTER(TRC_MESSAGEQUEUESERVICE,"MessageQueue::~MessageQueue()"); |
|
|
|
Tracer::trace(TRC_MESSAGEQUEUESERVICE, Tracer::LEVEL3, |
|
"MessageQueue::~MessageQueue queueId = %i, name = %s", _queueId, _name); |
|
|
|
q_table_mut.lock(pegasus_thread_self()); |
|
|
|
_queueTable.remove(_queueId); |
|
q_table_mut.unlock(); |
|
|
|
// Free the name: |
|
|
|
delete [] _name; |
|
|
|
PEG_METHOD_EXIT(); |
|
} |
|
|
void MessageQueue::enqueue(Message* message) | void MessageQueue::enqueue(Message* message) |
{ | { |
|
PEG_METHOD_ENTER(TRC_MESSAGEQUEUESERVICE,"MessageQueue::enqueue()"); |
|
|
if (!message) | if (!message) |
|
{ |
|
Tracer::trace(TRC_MESSAGEQUEUESERVICE, Tracer::LEVEL3, |
|
"MessageQueue::enqueue failure"); |
|
PEG_METHOD_EXIT(); |
throw NullPointer(); | throw NullPointer(); |
|
} |
| |
|
PEG_TRACE_STRING( TRC_MESSAGEQUEUESERVICE, Tracer::LEVEL3, |
|
String("Queue name: ") + getQueueName() ) ; |
|
Tracer::trace ( TRC_MESSAGEQUEUESERVICE, |
|
Tracer::LEVEL3, |
|
"Message: [%s, %d]", |
|
MessageTypeToString(message->getType()), |
|
message->getKey() ); |
|
|
|
_mut.lock(pegasus_thread_self()); |
if (_back) | if (_back) |
{ | { |
_back->_next = message; | _back->_next = message; |
|
|
message->_next = 0; | message->_next = 0; |
} | } |
message->_owner = this; | message->_owner = this; |
|
|
_count++; | _count++; |
|
Tracer::trace(TRC_MESSAGEQUEUESERVICE, Tracer::LEVEL4, |
|
"MessageQueue::enqueue _queueId = %d, _count = %d", _queueId, _count); |
|
|
|
_mut.unlock(); |
|
|
|
handleEnqueue(); |
|
PEG_METHOD_EXIT(); |
} | } |
| |
Message* MessageQueue::dequeue() |
Message* MessageQueue::dequeue() throw(IPCException) |
{ | { |
|
PEG_METHOD_ENTER(TRC_MESSAGEQUEUESERVICE,"MessageQueue::dequeue()"); |
|
|
|
_mut.lock(pegasus_thread_self()); |
if (_front) | if (_front) |
{ | { |
Message* message = _front; | Message* message = _front; |
|
|
if (_back == message) | if (_back == message) |
_back = 0; | _back = 0; |
| |
|
_count--; |
|
Tracer::trace(TRC_MESSAGEQUEUESERVICE, Tracer::LEVEL4, |
|
"MessageQueue::dequeue _queueId = %d, _count = %d", |
|
_queueId, _count); |
|
|
|
_mut.unlock(); |
message->_next = 0; | message->_next = 0; |
message->_prev = 0; | message->_prev = 0; |
message->_owner = 0; | message->_owner = 0; |
_count--; |
|
|
PEG_METHOD_EXIT(); |
return message; | return message; |
} | } |
|
_mut.unlock(); |
|
|
|
PEG_METHOD_EXIT(); |
return 0; | return 0; |
} | } |
|
; |
|
|
| |
void MessageQueue::remove(Message* message) |
void MessageQueue::remove(Message* message) throw(IPCException) |
{ | { |
|
PEG_METHOD_ENTER(TRC_MESSAGEQUEUESERVICE,"MessageQueue::remove()"); |
|
|
if (!message) | if (!message) |
|
{ |
|
PEG_METHOD_EXIT(); |
throw NullPointer(); | throw NullPointer(); |
|
} |
| |
if (message->_owner != this) | if (message->_owner != this) |
|
{ |
|
PEG_METHOD_EXIT(); |
throw NoSuchMessageOnQueue(); | throw NoSuchMessageOnQueue(); |
|
} |
|
|
|
_mut.lock(pegasus_thread_self()); |
| |
if (message->_next) | if (message->_next) |
message->_next->_prev = message->_prev; | message->_next->_prev = message->_prev; |
|
|
else | else |
_front = message->_next; | _front = message->_next; |
| |
|
_count--; |
|
Tracer::trace(TRC_MESSAGEQUEUESERVICE, Tracer::LEVEL4, |
|
"MessageQueue::remove _count = %d", _count); |
|
|
|
_mut.unlock(); |
|
|
message->_prev = 0; | message->_prev = 0; |
message->_next = 0; | message->_next = 0; |
message->_owner = 0; | message->_owner = 0; |
_count--; |
|
|
PEG_METHOD_EXIT(); |
} | } |
| |
Message* MessageQueue::findByType(Uint32 type) |
Message* MessageQueue::findByType(Uint32 type) throw(IPCException) |
{ | { |
|
_mut.lock(pegasus_thread_self()); |
|
|
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) |
Message* MessageQueue::findByKey(Uint32 key) throw(IPCException) |
{ | { |
|
_mut.lock(pegasus_thread_self()); |
|
|
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 |
void MessageQueue::print(ostream& os) const throw(IPCException) |
{ | { |
|
const_cast<MessageQueue *>(this)->_mut.lock(pegasus_thread_self()); |
|
|
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) |
Message* MessageQueue::find(Uint32 type, Uint32 key) throw(IPCException) |
{ | { |
|
_mut.lock(pegasus_thread_self()); |
|
|
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; |
|
} |
|
|
|
void MessageQueue::lock() throw(IPCException) |
|
{ |
|
_mut.lock(pegasus_thread_self()); |
|
} |
|
|
|
void MessageQueue::unlock() |
|
{ |
|
_mut.unlock(); |
|
} |
|
|
|
const char* MessageQueue::getQueueName() const |
|
{ |
|
return _name; |
|
} |
|
|
|
MessageQueue* MessageQueue::lookup(Uint32 queueId) throw(IPCException) |
|
{ |
|
|
|
MessageQueue* queue = 0; |
|
q_table_mut.lock(pegasus_thread_self()); |
|
|
|
if (_queueTable.lookup(queueId, queue)) |
|
{ |
|
q_table_mut.unlock(); |
|
return queue; |
|
} |
|
|
|
// Not found! |
|
|
|
q_table_mut.unlock(); |
|
|
|
Tracer::trace(TRC_MESSAGEQUEUESERVICE, Tracer::LEVEL3, |
|
"MessageQueue::lookup failure queueId = %i", queueId); |
| |
return 0; | return 0; |
} | } |
| |
|
|
|
MessageQueue* MessageQueue::lookup(const char *name) throw(IPCException) |
|
{ |
|
|
|
if(name == NULL) |
|
throw NullPointer(); |
|
q_table_mut.lock(pegasus_thread_self()); |
|
|
|
for(QueueTable::Iterator i = _queueTable.start(); i; i++) |
|
{ |
|
// ATTN: Need to decide how many characters to compare in queue names |
|
if(! strcmp( ((MessageQueue *)i.value())->getQueueName(), name) ) |
|
{ |
|
q_table_mut.unlock(); |
|
return( (MessageQueue *)i.value()); |
|
} |
|
|
|
} |
|
q_table_mut.unlock(); |
|
|
|
Tracer::trace(TRC_MESSAGEQUEUESERVICE, Tracer::LEVEL3, |
|
"MessageQueue::lookup failure - name = %s", name); |
|
|
|
return 0; |
|
} |
|
|
|
|
|
void MessageQueue::handleEnqueue() |
|
{ |
|
|
|
} |
|
|
PEGASUS_NAMESPACE_END | PEGASUS_NAMESPACE_END |