| | |
| | | |
| | | static void remove_queues_exclude(int keys[], size_t length); |
| | | static void remove_queues_include(int keys[], size_t length); |
| | | static void remove_queue(int key); |
| | | |
| | | private: |
| | | protected: |
| | |
| | | } |
| | | } |
| | | if (!found) { |
| | | // 销毁共享内存的queue |
| | | mqueue = (LockFreeQueue<ELEM_T, SHM_Allocator> *)hashtable_get(hashtable, *keyItr); |
| | | delete mqueue; |
| | | hashtable_remove(hashtable, *keyItr); |
| | |
| | | } |
| | | |
| | | |
| | | |
| | | 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> |
| | | void SHMQueue<ELEM_T>::remove_queue(int key) { |
| | | int keys[] = {key}; |
| | | remove_queues_include(keys, 1); |
| | | } |
| | | |
| | | template <typename ELEM_T> |
| | | SHMQueue<ELEM_T>::SHMQueue(int key, size_t qsize) : KEY(key) { |
| | | |
| | | hashtable_t *hashtable = mm_get_hashtable(); |