From 4c73fd7179e92bee9cccb65e46823b00f568acb3 Mon Sep 17 00:00:00 2001
From: wangzhengquan <wangzhengquan85@126.com>
Date: 星期五, 22 一月 2021 16:57:34 +0800
Subject: [PATCH] tmp
---
src/queue/shm_queue.h | 23 ++++++++++++-----------
1 files changed, 12 insertions(+), 11 deletions(-)
diff --git a/src/queue/shm_queue.h b/src/queue/shm_queue.h
index 5d2d9b6..0be124b 100644
--- a/src/queue/shm_queue.h
+++ b/src/queue/shm_queue.h
@@ -12,6 +12,7 @@
#include "shm_allocator.h"
#include "usg_common.h"
#include "array_lock_free_sem_queue.h"
+#include "lock_free_queue.h"
#include "bus_error.h"
template <typename ELEM_T> class SHMQueue {
@@ -51,7 +52,7 @@
/// @brief the actual queue-> methods are forwarded into the real
/// implementation
- ArrayLockFreeSemQueue<ELEM_T, SHM_Allocator> *queue;
+ LockFreeQueue<ELEM_T, SHM_Allocator> *queue;
private:
/// @brief disable copy constructor declaring it private
@@ -64,7 +65,7 @@
hashtable_t *hashtable = mm_get_hashtable();
std::set<int> *keyset = hashtable_keyset(hashtable);
std::set<int>::iterator keyItr;
- ArrayLockFreeSemQueue<ELEM_T, SHM_Allocator> *mqueue;
+ LockFreeQueue<ELEM_T, SHM_Allocator> *mqueue;
bool found;
size_t count = 0;
for (keyItr = keyset->begin(); keyItr != keyset->end(); keyItr++) {
@@ -77,7 +78,7 @@
}
if (!found) {
// 閿�姣佸叡浜唴瀛樼殑queue
- mqueue = (ArrayLockFreeSemQueue<ELEM_T, SHM_Allocator> *)hashtable_get(hashtable, *keyItr);
+ mqueue = (LockFreeQueue<ELEM_T, SHM_Allocator> *)hashtable_get(hashtable, *keyItr);
delete mqueue;
hashtable_remove(hashtable, *keyItr);
count++;
@@ -91,11 +92,11 @@
template <typename ELEM_T>
size_t SHMQueue<ELEM_T>::remove_queues(int keys[], size_t length) {
hashtable_t *hashtable = mm_get_hashtable();
- ArrayLockFreeSemQueue<ELEM_T, SHM_Allocator> *mqueue;
+ LockFreeQueue<ELEM_T, SHM_Allocator> *mqueue;
size_t count = 0;
for(int i = 0; i< length; i++) {
// 閿�姣佸叡浜唴瀛樼殑queue
- mqueue = (ArrayLockFreeSemQueue<ELEM_T, SHM_Allocator> *)mm_get_by_key(keys[i]);
+ mqueue = (LockFreeQueue<ELEM_T, SHM_Allocator> *)mm_get_by_key(keys[i]);
delete mqueue;
hashtable_remove(hashtable, keys[i]);
count++;
@@ -113,9 +114,9 @@
SHMQueue<ELEM_T>::SHMQueue(int key, size_t qsize) : KEY(key) {
hashtable_t *hashtable = mm_get_hashtable();
- queue = (ArrayLockFreeSemQueue<ELEM_T, SHM_Allocator> *)hashtable_get(hashtable, key);
+ queue = (LockFreeQueue<ELEM_T, SHM_Allocator> *)hashtable_get(hashtable, key);
if (queue == NULL || (void *)queue == (void *)1) {
- queue = new ArrayLockFreeSemQueue<ELEM_T, SHM_Allocator>(qsize);
+ queue = new LockFreeQueue<ELEM_T, SHM_Allocator>(qsize);
hashtable_put(hashtable, key, (void *)queue);
}
// queue->reference++;
@@ -155,7 +156,7 @@
template <typename ELEM_T>
inline int SHMQueue<ELEM_T>::push_nowait(const ELEM_T &a_data) {
- int rv = queue->push(a_data, NULL, LOCK_FREE_QUEUE_NOWAIT);
+ int rv = queue->push(a_data, NULL, BUS_NOWAIT_FLAG);
if(rv == -1) {
if (errno == EAGAIN)
return EAGAIN;
@@ -170,7 +171,7 @@
template <typename ELEM_T>
inline int SHMQueue<ELEM_T>::push_timeout(const ELEM_T &a_data, const struct timespec *timeout) {
- int rv = queue->push(a_data, timeout, LOCK_FREE_QUEUE_TIMEOUT);
+ int rv = queue->push(a_data, timeout, BUS_TIMEOUT_FLAG);
if(rv == -1) {
if(errno == ETIMEDOUT)
return EBUS_TIMEOUT;
@@ -195,7 +196,7 @@
template <typename ELEM_T>
inline int SHMQueue<ELEM_T>::pop_nowait(ELEM_T &a_data) {
- int rv = queue->pop(a_data, NULL, LOCK_FREE_QUEUE_NOWAIT);
+ int rv = queue->pop(a_data, NULL, BUS_NOWAIT_FLAG);
if(rv == -1) {
if (errno == EAGAIN)
@@ -213,7 +214,7 @@
inline int SHMQueue<ELEM_T>::pop_timeout(ELEM_T &a_data, struct timespec *timeout) {
int rv;
- rv = queue->pop(a_data, timeout, LOCK_FREE_QUEUE_TIMEOUT);
+ rv = queue->pop(a_data, timeout, BUS_TIMEOUT_FLAG);
if(rv == -1) {
if (errno == ETIMEDOUT) {
return EBUS_TIMEOUT;
--
Gitblit v1.8.0