(file) Return to MessageQueue.cpp CVS log (file) (dir) Up to [Pegasus] / pegasus / src / Pegasus / Common

Diff for /pegasus/src/Pegasus/Common/MessageQueue.cpp between version 1.17 and 1.54

version 1.17, 2002/01/02 22:05:46 version 1.54, 2006/11/10 18:14:58
Line 1 
Line 1 
 //%/////////////////////////////////////////////////////////////////////////////  //%2006////////////////////////////////////////////////////////////////////////
 // //
 // 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.
   // Copyright (c) 2006 Hewlett-Packard Development Company, L.P.; IBM Corp.;
   // EMC Corporation; Symantec 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
Line 20 
Line 29 
 // //
 //============================================================================== //==============================================================================
 // //
 // Author: Mike Brasher (mbrasher@bmc.com)  
 //  
 // Modified By:  
 //  
 //%///////////////////////////////////////////////////////////////////////////// //%/////////////////////////////////////////////////////////////////////////////
  
 #include <Pegasus/Common/HashTable.h> #include <Pegasus/Common/HashTable.h>
 #include <Pegasus/Common/IPC.h>  #include <Pegasus/Common/Tracer.h>
   #include <Pegasus/Common/CimomMessage.h>
 #include "MessageQueue.h" #include "MessageQueue.h"
   #include "IDFactory.h"
  
 PEGASUS_USING_STD; PEGASUS_USING_STD;
  
Line 37 
Line 44 
 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 = Mutex();  static Mutex q_table_mut ;
   
 Uint32 MessageQueue::getNextQueueId() throw(IPCException)  
 {  
    static Uint32 _nextQueueId = 1;  
   
    //  
    // Lock mutex:  
    //  
   
    static Mutex _id_mut = Mutex();  
    _id_mut.lock(pegasus_thread_self());  
   
    // Assign next queue id. Handle wrap around and never assign zero as  
    // a queue id:  
   
    if (_nextQueueId == 0)  
       _nextQueueId = 1;  
   
    Uint32 queueId = _nextQueueId++;  
  
    //  static IDFactory _qidFactory(CIMOM_Q_ID + 1);
    // Unlock mutex:  
    //  
  
    _id_mut.unlock();  Uint32 MessageQueue::getNextQueueId()
   {
       return _qidFactory.getID();
   }
  
    return queueId;  void MessageQueue::putQueueId(Uint32 queueId)
   {
       if (queueId != CIMOM_Q_ID)
           _qidFactory.putID(queueId);
 } }
  
 MessageQueue::MessageQueue( MessageQueue::MessageQueue(
     const char* name,     const char* name,
     Boolean async,     Boolean async,
     Uint32 queueId)     Uint32 queueId)
     :     : _queueId(queueId), _capabilities(0), _async(async)
     _queueId(queueId), _count(0), _front(0), _back(0), _async(async),  
     _workThread(MessageQueue::workThread, this, false), _workSemaphore(0)  
 { {
     //     //
     // Copy the name:     // Copy the name:
     //     //
  
       PEG_METHOD_ENTER(TRC_MESSAGEQUEUESERVICE,"MessageQueue::MessageQueue()");
   
     if (!name)     if (!name)
         name = "";         name = "";
  
     _name = new char[strlen(name) + 1];     _name = new char[strlen(name) + 1];
     strcpy(_name, name);     strcpy(_name, name);
  
       Tracer::trace(TRC_MESSAGEQUEUESERVICE, Tracer::LEVEL3,
           "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();
   
   
     if(_async == true)  
        _workThread.run();  
 } }
  
 MessageQueue::~MessageQueue() MessageQueue::~MessageQueue()
 { {
     // ATTN-A: thread safety!     // ATTN-A: thread safety!
     q_table_mut.lock(pegasus_thread_self());      PEG_METHOD_ENTER(TRC_MESSAGEQUEUESERVICE,"MessageQueue::~MessageQueue()");
       Tracer::trace(TRC_MESSAGEQUEUESERVICE, Tracer::LEVEL3,
     _queueTable.remove(_queueId);          "MessageQueue::~MessageQueue queueId = %i, name = %s", _queueId, _name);
     q_table_mut.unlock();  
  
     if(_async == true)  
     {     {
        _workThread.cancel();    // cancel thread          AutoMutex autoMut(q_table_mut);
        _workSemaphore.signal();// wake thread          _queueTable.remove(_queueId);
        _workThread.join();     // wait for thread to complete      } // mutex unlocks here
     }  
  
     // Free the name:     // Free the name:
  
     delete [] _name;     delete [] _name;
 }  
   
   
 PEGASUS_THREAD_RETURN PEGASUS_THREAD_CDECL MessageQueue::workThread(void * arg)  
 {  
         // get thread from argument  
         Thread * thread = (Thread *)arg;  
   
         PEGASUS_ASSERT(thread != 0);  
  
         // get message queue from thread      // Return the queue id.
         MessageQueue * queue = (MessageQueue *)thread->get_parm();  
  
         PEGASUS_ASSERT(queue != 0);      putQueueId(_queueId);
  
         while(true)      PEG_METHOD_EXIT();
         {  
            if(thread->is_cancelled())  
            {  
               break;  
            }  
   
            // wait for work  
            queue->_workSemaphore.wait();  
   
            // stop the thread when the message queue has been destroyed.  
            // ATTN: should check the thread cancel flag that is not yet exposed!  
            if(MessageQueue::lookup(queue->_queueId) == 0)  
            {  
               break;  
            }  
   
            // ensure the queue has a message before dispatching  
            if(queue->_count != 0)  
            {  
               queue->handleEnqueue();  
            }  
         }  
   
         thread->exit_self(PEGASUS_THREAD_RETURN(0));  
   
         return(0);  
 }  
   
 void MessageQueue::enqueue(Message* message) throw(IPCException)  
 {  
     if (!message)  
        throw NullPointer();  
   
     if (getenv("PEGASUS_TRACE"))  
     {  
        cout << "===== " << getQueueName() << ": ";  
        message->print(cout);  
     }     }
  
     _mut.lock(pegasus_thread_self());  void MessageQueue::enqueue(Message* message)
     if (_back)  
     {  
        _back->_next = message;  
        message->_prev = _back;  
        message->_next = 0;  
        _back = message;  
     }  
     else  
     {  
        _front = message;  
        _back = message;  
        message->_prev = 0;  
        message->_next = 0;  
     }  
     message->_owner = this;  
     _count++;  
     if( _async == true )  
     {     {
        _workSemaphore.signal();      PEG_METHOD_ENTER(TRC_MESSAGEQUEUESERVICE,"MessageQueue::enqueue()");
  
     }      PEGASUS_ASSERT(message != 0);
  
       PEG_TRACE_STRING(TRC_MESSAGEQUEUESERVICE, Tracer::LEVEL3,
           String("Queue name: ") + getQueueName());
       Tracer::trace(TRC_MESSAGEQUEUESERVICE, Tracer::LEVEL3,
           "Message: [%s]",
           MessageTypeToString(message->getType()));
  
     _mut.unlock();      _messageList.insert_back(message);
  
     if(_async == false )  
        handleEnqueue();        handleEnqueue();
       PEG_METHOD_EXIT();
 } }
  
   Message* MessageQueue::dequeue()
 Boolean MessageQueue::accept_async(Message *message) throw(IPCException)  
 {  
    if(! message)  
       throw NullPointer();  
    if(_async == false)  
       return false;  
   
    if (getenv("PEGASUS_TRACE"))  
    {  
       cout << "==~ accept() ~== " << getQueueName() << ": ";  
       message->print(cout);  
    }  
   
   
    // in derived methods, evaluate the message here to determine  
    // whether or not you can handle it.  
   
     _mut.lock(pegasus_thread_self());  
     if (_back)  
     {  
        _back->_next = message;  
        message->_prev = _back;  
        message->_next = 0;  
        _back = message;  
     }  
     else  
     {     {
        _front = message;      PEG_METHOD_ENTER(TRC_MESSAGEQUEUESERVICE,"MessageQueue::dequeue()");
        _back = message;  
        message->_prev = 0;  
        message->_next = 0;  
     }  
     message->_owner = this;  
     _count++;  
     _workSemaphore.signal();  
     _mut.unlock();  
  
    return true;      Message* message = _messageList.remove_front();
 }  
   
   
 Message* MessageQueue::dequeue() throw(IPCException)  
 {  
    _mut.lock(pegasus_thread_self());  
     if (_front)  
     {  
         Message* message = _front;  
         _front = _front->_next;  
         if (_front)  
             _front->_prev = 0;  
  
         if (_back == message)      PEG_METHOD_EXIT();
             _back = 0;  
         _count--;  
         _mut.unlock();  
         message->_next = 0;  
         message->_prev = 0;  
         message->_owner = 0;  
         return message;         return message;
     }     }
     _mut.unlock();  
     return 0;  
 }  
   
 void MessageQueue::remove(Message* message) throw(IPCException)  
 {  
     if (!message)  
         throw NullPointer();  
   
     if (message->_owner != this)  
         throw NoSuchMessageOnQueue();  
   
     _mut.lock(pegasus_thread_self());  
   
     if (message->_next)  
         message->_next->_prev = message->_prev;  
     else  
         _back = message->_prev;  
   
     if (message->_prev)  
         message->_prev->_next = message->_next;  
     else  
         _front = message->_next;  
   
     _count--;  
     _mut.unlock();  
   
     message->_prev = 0;  
     message->_next = 0;  
     message->_owner = 0;  
 }  
   
 Message* MessageQueue::findByType(Uint32 type) throw(IPCException)  
 {  
    _mut.lock(pegasus_thread_self());  
   
     for (Message* m = front(); m; m = m->getNext())  
     {  
        if (m->getType() == type)  
        {  
           _mut.unlock();  
           return m;  
        }  
     }  
     _mut.unlock();  
     return 0;  
 }  
   
 Message* MessageQueue::findByKey(Uint32 key) throw(IPCException)  
 {  
    _mut.lock(pegasus_thread_self());  
   
     for (Message* m = front(); m; m = m->getNext())  
     {  
        if (m->getKey() == key)  
        {  
           _mut.unlock();  
           return m;  
        }  
   
     }  
     _mut.unlock();  
     return 0;  
 }  
   
 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())  
         m->print(os);  
    const_cast<MessageQueue *>(this)->_mut.unlock();  
 }  
   
 Message* MessageQueue::find(Uint32 type, Uint32 key) throw(IPCException)  
 {  
    _mut.lock(pegasus_thread_self());  
   
     for (Message* m = front(); m; m = m->getNext())  
     {  
        if (m->getType() == type && m->getKey() == key)  
        {  
           _mut.unlock();  
           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 const char* MessageQueue::getQueueName() const
 { {
    if(_name[0] != 0x00)  
       return _name;       return _name;
    return "unknown";  
 } }
  
 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,
           "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(! strncmp( ((MessageQueue *)i.value())->getQueueName(), name, 25) )          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,
           "MessageQueue::lookup failure - name = %s", name);
  
    return 0;    return 0;
 } }

Legend:
Removed from v.1.17  
changed lines
  Added in v.1.54
No CVS admin address has been configured
 Powered by
ViewCVS 0.9.2