| | |
| | | #include "hashtable.h" |
| | | #include "lock_free_queue.h" |
| | | #include "logger_factory.h" |
| | | #include "shm_allocator.h" |
| | | |
| | | // default Queue size |
| | | // #define LOCK_FREE_Q_DEFAULT_SIZE 16 |
| | |
| | | |
| | | inline ELEM_T& operator[](unsigned i); |
| | | |
| | | static void remove_queues_exclue(int *keys, size_t length); |
| | | private: |
| | | |
| | | |
| | | protected: |
| | | /// @brief the actual queue-> methods are forwarded into the real |
| | | /// implementation |
| | | LockFreeQueue<ELEM_T>* queue; |
| | | LockFreeQueue<ELEM_T, SHM_Allocator>* queue; |
| | | |
| | | private: |
| | | /// @brief disable copy constructor declaring it private |
| | |
| | | |
| | | |
| | | template < typename ELEM_T > |
| | | void SHMQueue<ELEM_T>::remove_queues_exclue(int *keys, size_t length) |
| | | { |
| | | hashtable_t *hashtable = mm_get_hashtable(); |
| | | std::set<int>* keyset = hashtable_keyset(hashtable); |
| | | std::set<int>::iterator keyItr; |
| | | LockFreeQueue<ELEM_T, SHM_Allocator>* mqueue; |
| | | bool found; |
| | | for (keyItr = keyset->begin(); keyItr != keyset->end(); keyItr++) { |
| | | found = false; |
| | | for(size_t i = 0; i < length; i++) { |
| | | if(*keyItr == keys[i]) { |
| | | found = true; |
| | | break; |
| | | } |
| | | } |
| | | if(!found) { |
| | | mqueue = (LockFreeQueue<ELEM_T, SHM_Allocator> *)hashtable_get(hashtable, *keyItr); |
| | | delete mqueue; |
| | | } |
| | | } |
| | | delete keyset; |
| | | |
| | | } |
| | | |
| | | template < typename ELEM_T > |
| | | SHMQueue<ELEM_T>::SHMQueue(int key, size_t qsize): KEY(key) |
| | | { |
| | | |
| | | hashtable_t *hashtable = mm_get_hashtable(); |
| | | queue = (LockFreeQueue<ELEM_T> *)hashtable_get(hashtable, key); |
| | | 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>(qsize); |
| | | queue = new LockFreeQueue<ELEM_T, SHM_Allocator>(qsize); |
| | | hashtable_put(hashtable, key, (void *)queue); |
| | | } |
| | | queue->reference++; |