| | |
| | | |
| | | inline ELEM_T &operator[](unsigned i); |
| | | |
| | | static void remove_queues_exclude(int *keys, size_t length); |
| | | static void remove_queues_exclude(int keys[], size_t length); |
| | | static void remove_queues_include(int keys[], size_t length); |
| | | |
| | | private: |
| | | protected: |
| | |
| | | }; |
| | | |
| | | template <typename ELEM_T> |
| | | void SHMQueue<ELEM_T>::remove_queues_exclude(int *keys, size_t length) { |
| | | void SHMQueue<ELEM_T>::remove_queues_exclude(int keys[], size_t length) { |
| | | hashtable_t *hashtable = mm_get_hashtable(); |
| | | std::set<int> *keyset = hashtable_keyset(hashtable); |
| | | std::set<int>::iterator keyItr; |
| | |
| | | } |
| | | } |
| | | if (!found) { |
| | | mqueue = (LockFreeQueue<ELEM_T, SHM_Allocator> *)hashtable_get(hashtable, |
| | | *keyItr); |
| | | // 销毁共享内存的queue |
| | | mqueue = (LockFreeQueue<ELEM_T, SHM_Allocator> *)hashtable_get(hashtable, *keyItr); |
| | | delete mqueue; |
| | | hashtable_remove(hashtable, *keyItr); |
| | | } |
| | | } |
| | | delete keyset; |
| | | } |
| | | |
| | | |
| | | template <typename ELEM_T> |
| | | void SHMQueue<ELEM_T>::remove_queues_include(int keys[], size_t length) { |
| | | hashtable_t *hashtable = mm_get_hashtable(); |
| | | LockFreeQueue<ELEM_T, SHM_Allocator> *mqueue; |
| | | for(int i = 0; i< length; i++) { |
| | | // 销毁共享内存的queue |
| | | mqueue = (LockFreeQueue<ELEM_T, SHM_Allocator> *)mm_get_by_key(keys[i]); |
| | | delete mqueue; |
| | | hashtable_remove(hashtable, keys[i]); |
| | | } |
| | | } |
| | | |
| | | template <typename ELEM_T> |
| | |
| | | |
| | | hashtable_t *hashtable = mm_get_hashtable(); |
| | | queue = (LockFreeQueue<ELEM_T, SHM_Allocator> *)hashtable_get(hashtable, key); |
| | | // LockFreeQueue<int, 10000> q; |
| | | if (queue == NULL || (void *)queue == (void *)1) { |
| | | queue = new LockFreeQueue<ELEM_T, SHM_Allocator>(qsize); |
| | | hashtable_put(hashtable, key, (void *)queue); |
| | | } |
| | | queue->reference++; |
| | | LoggerFactory::getLogger().debug("SHMQueue constructor reference===%d", |
| | | queue->reference.load()); |
| | | LoggerFactory::getLogger().debug("SHMQueue constructor reference===%d", queue->reference.load()); |
| | | } |
| | | |
| | | template <typename ELEM_T> SHMQueue<ELEM_T>::~SHMQueue() { |
| | | if(queue == NULL) { |
| | | // queue已经销毁 |
| | | return; |
| | | } |
| | | |
| | | SemUtil::dec(queue->mutex); |
| | | queue->reference--; |
| | | // LoggerFactory::getLogger().debug("SHMQueue destructor reference===%d", |
| | | // queue->reference.load()); |
| | | if (queue->reference.load() == 0) { |
| | | delete queue; |
| | | hashtable_t *hashtable = mm_get_hashtable(); |
| | | hashtable_remove(hashtable, KEY); |
| | | // LoggerFactory::getLogger().debug("SHMQueue destructor delete queue\n"); |
| | | delete queue; |
| | | queue = NULL; |
| | | hashtable_t *hashtable = mm_get_hashtable(); |
| | | hashtable_remove(hashtable, KEY); |
| | | // 此时queue已经销毁,无需 SemUtil::inc(queue->mutex) |
| | | // printf("SHMQueue destructor delete queue\n"); |
| | | } else { |
| | | SemUtil::inc(queue->mutex); |
| | | SemUtil::inc(queue->mutex); |
| | | } |
| | | |
| | | } |
| | | |
| | | template <typename ELEM_T> void SHMQueue<ELEM_T>::force_destroy() { |
| | | if(queue == NULL) { |
| | | // queue已经销毁 |
| | | return; |
| | | } |
| | | |
| | | SemUtil::dec(queue->mutex); |
| | | delete queue; |
| | | queue = NULL; |
| | | hashtable_t *hashtable = mm_get_hashtable(); |
| | | hashtable_remove(hashtable, KEY); |
| | | SemUtil::inc(queue->mutex); |
| | | // 此时queue已经销毁,无需 SemUtil::inc(queue->mutex) |
| | | } |
| | | |
| | | template <typename ELEM_T> inline uint32_t SHMQueue<ELEM_T>::size() { |