#include "shm_queue_wrapper.h"
#define MAX_ELE_SIZE 512

typedef struct ele_t {
	char buf[MAX_ELE_SIZE];
} ele_t;

typedef struct shmqueue_t {
	size_t ele_size;
	void *mqueue;
} shmqueue_t;

/**
 * 初始化
 * @ shmqueue 
 * @ key 标识共享队列的唯一key
 * @ queue_size 队列大小
 * @ ele_size 队列中元素大小
 */
void* shmqueue_init( int key, int queue_size, int ele_size) {
	if(ele_size > MAX_ELE_SIZE) {
		err_exit(0, "shmqueue_init : the element size is supper than max element buffer size");
	}
	shmqueue_t *shmqueue = (shmqueue_t*)malloc(sizeof(shmqueue_t));
	SHMQueue<ele_t> *queue = new SHMQueue<ele_t>(key, queue_size);
	shmqueue->mqueue = (void *)queue;
	shmqueue->ele_size = ele_size;
	return (void *)shmqueue;
}

/**
 * 销毁
*/
void shmqueue_destroy(void * _shmqueue) {
	shmqueue_t * shmqueue = (shmqueue_t *)_shmqueue;
	delete (SHMQueue<ele_t> *)shmqueue->mqueue;
	delete _shmqueue;
}

/**
 * 队列元素的个数
 */
uint32_t shmqueue_size(void * _shmqueue) {
	shmqueue_t * shmqueue = (shmqueue_t *)_shmqueue;
	return ((SHMQueue<ele_t> *)(shmqueue->mqueue))->size();
}

/**
 * 是否已满
 */
int shmqueue_full(void * _shmqueue) {
	shmqueue_t * shmqueue = (shmqueue_t *)_shmqueue;
	return ((SHMQueue<ele_t> *)(shmqueue->mqueue))->full();
}

/**
 * 是否为空
 */
int shmqueue_empty(void * _shmqueue) {
	shmqueue_t * shmqueue = (shmqueue_t *)_shmqueue;
	return ((SHMQueue<ele_t> *)(shmqueue->mqueue))->empty();
}

/**
 * 入队, 队列满时等待
 */
int shmqueue_push(void * _shmqueue, void *src_ele) {
	shmqueue_t * shmqueue = (shmqueue_t *)_shmqueue;
	ele_t dest_ele;
	memcpy(&dest_ele.buf, src_ele, shmqueue->ele_size);
	return ((SHMQueue<ele_t> *)(shmqueue->mqueue))->push(dest_ele);
}

/**
 * 入队, 队列满时立即返回
 */
int shmqueue_push_nowait(void * _shmqueue, void *src_ele) {
	shmqueue_t * shmqueue = (shmqueue_t *)_shmqueue;
	ele_t dest_ele;
	memcpy(&dest_ele.buf, src_ele, shmqueue->ele_size);
	return ((SHMQueue<ele_t> *)(shmqueue->mqueue))->push_nowait(dest_ele);
}

/**
 * 入队, 指定时间内入队不成功就返回
 */
int shmqueue_push_timeout(void * _shmqueue, void *src_ele, struct timespec * timeout) {
	shmqueue_t * shmqueue = (shmqueue_t *)_shmqueue;
	ele_t dest_ele;
	memcpy(&dest_ele.buf, src_ele, shmqueue->ele_size);
	return ((SHMQueue<ele_t> *)(shmqueue->mqueue))->push_timeout(dest_ele, timeout);
}

/**
 * 出队, 队列空时等待
 */
int shmqueue_pop(void * _shmqueue, void *dest_ele) {
	shmqueue_t * shmqueue = (shmqueue_t *)_shmqueue;
	ele_t src_ele;
	bool rv = ((SHMQueue<ele_t> *)(shmqueue->mqueue))->pop(src_ele);
	if (rv) {
		memcpy(dest_ele, &src_ele.buf, shmqueue->ele_size);
		return 1;
	} else {
		return 0;
	}

}

/**
 * 出队, 队列空时立即返回
 */
int shmqueue_pop_nowait(void * _shmqueue, void *dest_ele) {
	shmqueue_t * shmqueue = (shmqueue_t *)_shmqueue;
	ele_t src_ele;
	bool rv = ((SHMQueue<ele_t> *)(shmqueue->mqueue))->pop_nowait(src_ele);
	if (rv) {
		memcpy(dest_ele, &src_ele.buf, shmqueue->ele_size);
		return 1;
	} else {
		return 0;
	}
}

/**
 * 出队, 指定时间内出队不成功就返回
 */
int shmqueue_pop_timeout(void * _shmqueue, void *dest_ele, struct timespec * timeout) {
	shmqueue_t * shmqueue = (shmqueue_t *)_shmqueue;
	ele_t src_ele;
	bool rv = ((SHMQueue<ele_t> *)(shmqueue->mqueue))->pop_timeout(src_ele, timeout);
	if (rv) {
		memcpy(dest_ele, &src_ele.buf, shmqueue->ele_size);
		return 1;
	} else {
		return 0;
	}
}