Return to AsyncQueue.h CVS log | Up to [Pegasus] / pegasus / src / Pegasus / Common |
File: [Pegasus] / pegasus / src / Pegasus / Common / AsyncQueue.h
(download)
Revision: 1.5, Tue Nov 7 21:30:36 2006 UTC (17 years, 8 months ago) by kumpf Branch: MAIN CVS Tags: TASK_PEP328_SOLARIS_NEVADA_PORT, TASK-PEP328_SOLARIS_NEVADA_PORT_v2-root, TASK-PEP328_SOLARIS_NEVADA_PORT-root, TASK-PEP328_SOLARIS_NEVADA_PORT-branch, TASK-PEP328_SOLARIS_IX86_CC_PORT-root, TASK-PEP328_SOLARIS_IX86_CC_PORT-branch-v2, TASK-PEP328_SOLARIS_IX86_CC_PORT-branch, TASK-PEP305_VXWORKS-root, TASK-PEP305_VXWORKS-branch-pre-solaris-port, TASK-PEP305_VXWORKS-branch-post-solaris-port, TASK-PEP305_VXWORKS-branch-beta2, TASK-PEP305_VXWORKS-branch, TASK-PEP305_VXWORKS-2008-10-23, TASK-PEP291_IPV6-root, TASK-PEP291_IPV6-branch, TASK-PEP286_PRIVILEGE_SEPARATION-root, TASK-PEP286_PRIVILEGE_SEPARATION-branch, TASK-PEP274_dacim-root, TASK-PEP274_dacim-merged_out_to_branch, TASK-PEP274_dacim-merged_out_from_trunk, TASK-PEP274_dacim-merged_in_to_trunk, TASK-PEP274_dacim-merged_in_from_branch, TASK-PEP274_dacim-branch, TASK-Bug2102_RCMPIWindows-root, TASK-Bug2102_RCMPIWindows-merged_out_to_branch, TASK-Bug2102_RCMPIWindows-merged_out_from_trunk, TASK-Bug2102_RCMPIWindows-merged_in_to_trunk, TASK-Bug2102_RCMPIWindows-merged_in_from_branch, TASK-Bug2102_RCMPIWindows-branch, TASK-Bug2102Final-root, TASK-Bug2102Final-merged_out_to_branch, TASK-Bug2102Final-merged_out_from_trunk, TASK-Bug2102Final-merged_in_to_trunk, TASK-Bug2102Final-merged_in_from_branch, TASK-Bug2102Final-branch, TASK-BUG7240-root, TASK-BUG7240-branch, TASK-BUG7146_SqlRepositoryPrototype-root, TASK-BUG7146_SqlRepositoryPrototype-merged_out_to_branch, TASK-BUG7146_SqlRepositoryPrototype-merged_out_from_trunk, TASK-BUG7146_SqlRepositoryPrototype-merged_in_to_trunk, TASK-BUG7146_SqlRepositoryPrototype-merged_in_from_branch, TASK-BUG7146_SqlRepositoryPrototype-branch, RELEASE_2_8_2-RC1, RELEASE_2_8_2, RELEASE_2_8_1-RC1, RELEASE_2_8_1, RELEASE_2_8_0_BETA, RELEASE_2_8_0-RC2, RELEASE_2_8_0-RC1, RELEASE_2_8_0-FC, RELEASE_2_8_0, RELEASE_2_8-root, RELEASE_2_8-branch, RELEASE_2_7_3-RC1, RELEASE_2_7_3, RELEASE_2_7_2-RC1, RELEASE_2_7_2, RELEASE_2_7_1-RC1, RELEASE_2_7_1, RELEASE_2_7_0-RC1, RELEASE_2_7_0-BETA, RELEASE_2_7_0, RELEASE_2_7-root, RELEASE_2_7-branch, RELEASE_2_6_3-RC2, RELEASE_2_6_3-RC1, RELEASE_2_6_3, RELEASE_2_6_2-RC1, RELEASE_2_6_2, RELEASE_2_6_1-RC1, RELEASE_2_6_1, RELEASE_2_6_0-RC1, RELEASE_2_6_0-FC, RELEASE_2_6_0, RELEASE_2_6-root, RELEASE_2_6-branch-clean, RELEASE_2_6-branch, PEP286_PRIVILEGE_SEPARATION_ROOT, PEP286_PRIVILEGE_SEPARATION_CODE_FREEZE, PEP286_PRIVILEGE_SEPARATION_BRANCH, PEP286_PRIVILEGE_SEPARATION_1, Makefile Branch point for: TASK-PEP328_SOLARIS_NEVADA_PORT_v2-branch Changes since 1.4: +11 -23 lines BUG#: 5819 TITLE: Common modules do not meet chksrc requirements DESCRIPTION: Remove tab characters and author names and shorten lines that are wider than 80 characters. |
//%2006//////////////////////////////////////////////////////////////////////// // // 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 // of this software and associated documentation files (the "Software"), to // deal in the Software without restriction, including without limitation the // rights to use, copy, modify, merge, publish, distribute, sublicense, and/or // sell copies of the Software, and to permit persons to whom the Software is // furnished to do so, subject to the following conditions: // // THE ABOVE COPYRIGHT NOTICE AND THIS PERMISSION NOTICE SHALL BE INCLUDED IN // ALL COPIES OR SUBSTANTIAL PORTIONS OF THE SOFTWARE. THE SOFTWARE IS PROVIDED // "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT // LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR // PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT // HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN // ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION // WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. // //============================================================================== // //%///////////////////////////////////////////////////////////////////////////// #ifndef Pegasus_AsyncQueue_h #define Pegasus_AsyncQueue_h #include <Pegasus/Common/Linkage.h> #include <Pegasus/Common/List.h> #include <Pegasus/Common/Condition.h> PEGASUS_NAMESPACE_BEGIN /** AsyncQueue implementation (formerly AsyncDQueue). */ template<class ElemType> class AsyncQueue { public: /** Constructor (zero means unlimited capacity). */ AsyncQueue(size_t capacity = 0); /** Destructor. */ virtual ~AsyncQueue(); /** Close the queue so that subsequent enqueue() and dequeue() requests result in ListClosed() exceptions. */ void close(); /** Enqueue an element at the back of queue. */ void enqueue(ElemType *element); /** Enqueue an element at the back of queue (wait if the queue is full). */ void enqueue_wait(ElemType *element); /** Dequeue an element from the front of the queue. Return null immediately if queue is empty. */ ElemType *dequeue(); /** Dequeue an element from the front of the queue (wait if the queue is empty). */ ElemType *dequeue_wait(); /** Discard all the elements on the list. The size becomes zero afterwards. */ void clear(); /** Return number of element in queue. */ Uint32 count() const { return _size.get(); } /** Get capacity. */ Uint32 capacity() const { return _capacity.get(); } /** Return number of element in queue. */ Uint32 size() const { return _size.get(); } /** Return true is queue is empty (has zero elements). */ Boolean is_empty() const { return _size.get() == 0; } /** Return true if the queue is full. */ Boolean is_full() const { return _size.get() == _capacity.get(); } /** Return true if the queue has been closed (in which case no new elements may be enqueued). */ Boolean is_closed() const { return _closed.get(); } private: Mutex _mutex; Condition _not_empty; Condition _not_full; AtomicInt _capacity; AtomicInt _size; AtomicInt _closed; typedef List<ElemType,NullLock> Rep; Rep _rep; }; template<class ElemType> AsyncQueue<ElemType>::AsyncQueue(size_t capacity) : _mutex(Mutex::NON_RECURSIVE), _capacity(capacity) { if (capacity == 0) _capacity.set(0x7FFFFFFF); } template<class ElemType> AsyncQueue<ElemType>::~AsyncQueue() { } template<class ElemType> void AsyncQueue<ElemType>::close() { AutoMutex auto_mutex(_mutex); if (!is_closed()) { _closed++; _not_full.signal(); _not_empty.signal(); } } template<class ElemType> void AsyncQueue<ElemType>::enqueue(ElemType *element) { if (element) { AutoMutex auto_mutex(_mutex); if (is_closed()) throw ListClosed(); if (is_full()) throw ListFull(_capacity.get()); _rep.insert_back(element); _size++; _not_empty.signal(); } } template<class ElemType> void AsyncQueue<ElemType>::enqueue_wait(ElemType *element) { if (element) { AutoMutex auto_mutex(_mutex); while (is_full()) { if (is_closed()) throw ListClosed(); _not_full.wait(_mutex); } if (is_closed()) throw ListClosed(); _rep.insert_back(element); _size++; _not_empty.signal(); } } template<class ElemType> void AsyncQueue<ElemType>::clear() { AutoMutex auto_mutex(_mutex); _rep.clear(); _size = 0; _not_full.signal(); } template<class ElemType> ElemType* AsyncQueue<ElemType>::dequeue() { AutoMutex auto_mutex(_mutex); if (is_closed()) throw ListClosed(); ElemType* p = _rep.remove_front(); if (p) { _size--; _not_full.signal(); } return p; } template<class ElemType> ElemType* AsyncQueue<ElemType>::dequeue_wait() { AutoMutex auto_mutex(_mutex); while (is_empty()) { if (is_closed()) throw ListClosed(); _not_empty.wait(_mutex); } if (is_closed()) throw ListClosed(); ElemType* p = _rep.remove_front(); PEGASUS_DEBUG_ASSERT(p != 0); _size--; _not_full.signal(); return p; } PEGASUS_NAMESPACE_END #endif /* Pegasus_AsyncQueue_h */
No CVS admin address has been configured |
Powered by ViewCVS 0.9.2 |