用c实现一个阻塞的消息队列

其他 2018-06-21 20:00:26 阅读次数: 3

该消息队列的实现，完全是符合posix标准。

实现了

1.读时，队列空，会阻塞

2.写时，队列满，会阻塞

为了保证线程安全，采用了互斥量，为了阻塞一定时间，采用了条件变量，二者一起用，实现了一个简单消息队列

simple_queue.c

#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<pthread.h>
#include<sys/time.h>
#include"simple_queue.h"

pthread_cond_t msg_cond = PTHREAD_COND_INITIALIZER;

simple_queue* create_simple_queue(const char* queue_name, int queue_length, int queue_type)
{
	simple_queue *this = NULL;
	
	if (NULL == queue_name || 0 == queue_length)
	{
		printf("[%s] param is error\n", __FUNCTION__);
		return NULL;
	}
	this = (simple_queue*)malloc(sizeof(simple_queue) + queue_length * sizeof(void*));
	if (NULL != this)
	{
		this->front = 0;
		this->rear = 0;
		this->length = queue_length;
		this->queue_type = queue_type;
		if (0 != pthread_mutex_init(&(this->data_mutex), NULL))
		{
				printf("[%s]pthread_mutex_init failed!\n", __FUNCTION__);
				free(this);
				this = NULL;
				return NULL;
		}
		strcpy(this->queue_name, queue_name);
	}
	else
	{
		printf("[%s]malloc is failed!\n", __FUNCTION__);
		return NULL;
	}
	
	return this;
}

/*
*/
queue_status is_full_queue(simple_queue* p_queue)
{
	queue_status ret = QUEUE_IS_NORMAL;
	
	do
	{
		if (NULL == p_queue)
		{
			printf("[%s] param is error\n", __FUNCTION__);
			ret = QUEUE_NO_EXIST;
			break;
		}
		if (p_queue->front == ((p_queue->rear + 1) % (p_queue->length)))
		{
			printf("[%s] queue is full\n", __FUNCTION__);
			ret = QUEUE_IS_FULL;
			break;
		}
	}while(0);
	
	return ret;
}

/*
*/
queue_status is_empty_queue(simple_queue* p_queue)
{
	queue_status ret = QUEUE_IS_NORMAL;
	
	do
	{
		if (NULL == p_queue)
		{
			printf("[%s] param is error\n", __FUNCTION__);
			ret = QUEUE_NO_EXIST;;
			break;
		}
		if (p_queue->front == p_queue->rear)
		{
			printf("[%s] queue is empty\n", __FUNCTION__);
			ret = QUEUE_IS_EMPTY;
			break;
		}
	}while(0);
	
	return ret;
}
/*
*/
cntl_queue_ret push_simple_queue(simple_queue* p_queue, void* data)
{
	int w_cursor = 0;
	
	if(NULL == p_queue || NULL == data)
	{
		printf("[%s] param is error\n", __FUNCTION__);
		return CNTL_QUEUE_PARAM_ERROR;
	}
	
	pthread_mutex_lock(&(p_queue->data_mutex));

	w_cursor = (p_queue->rear + 1)%p_queue->length;
	if (w_cursor == p_queue->front)
	{
		struct timeval now;
		struct timespec tsp;
		
		gettimeofday(&now, NULL);
		tsp.tv_sec = now.tv_sec + 5;
		tsp.tv_nsec = now.tv_usec * 1000;
		if (0 != pthread_cond_timedwait(&msg_cond, &(p_queue->data_mutex), &tsp))//队列满，等待消息被抛出,如果5秒内，没有消息被抛出，就返回
		{
			printf("[%s]: queue is full\n", __FUNCTION__);
			pthread_mutex_unlock(&(p_queue->data_mutex));
			return CNTL_QUEUE_TIMEOUT;
		}
		w_cursor = (p_queue->rear + 1)%p_queue->length;
	}
	p_queue->data[p_queue->rear] = data;
	p_queue->rear = w_cursor;

	pthread_mutex_unlock(&(p_queue->data_mutex));
	pthread_cond_signal(&msg_cond);
	//pthread_cond_broadcast(&msg_cond);
	
	return CNTL_QUEUE_SUCCESS;
}

/*
*/
cntl_queue_ret pop_simple_queue(simple_queue* p_queue, void** data)
{
	if(NULL == p_queue)
	{
		printf("[%s] param is error\n", __FUNCTION__);
		return CNTL_QUEUE_PARAM_ERROR;
	}

	pthread_mutex_lock(&(p_queue->data_mutex));
	
	if (p_queue->front == p_queue->rear)
	{
		struct timeval now;
		struct timespec tsp;
		
		gettimeofday(&now, NULL);
		tsp.tv_sec = now.tv_sec + 5;
		tsp.tv_nsec = now.tv_usec * 1000;
		if (0 != pthread_cond_timedwait(&msg_cond, &(p_queue->data_mutex), &tsp))//队列空，等待消息来临,如果5秒内，没有消息来，就返回
		{
			printf("[%s]: queue is empty\n", __FUNCTION__);
			pthread_mutex_unlock(&(p_queue->data_mutex));
			return CNTL_QUEUE_TIMEOUT;
		}
	}
	*data = p_queue->data[p_queue->front];
	p_queue->front = (p_queue->front + 1)%p_queue->length;
	
	pthread_mutex_unlock(&(p_queue->data_mutex));
	pthread_cond_signal(&msg_cond);
	//pthread_cond_broadcast(&msg_cond);
	
	return CNTL_QUEUE_SUCCESS;
}
cntl_queue_ret destroy_simple_queue(simple_queue* p_queue)
{
	cntl_queue_ret ret = CNTL_QUEUE_SUCCESS;
	
	if(NULL == p_queue)
	{
		printf("[%s] param is error\n", __FUNCTION__);
		ret = CNTL_QUEUE_PARAM_ERROR;
	}
	else
	{
		pthread_mutex_destroy(&(p_queue->data_mutex));
		pthread_cond_destroy(&msg_cond);
		while (p_queue->front != p_queue->rear)//删除队列中残留的消息
		{
			free(p_queue->data[p_queue->front]);
			p_queue->front = (p_queue->front + 1)%p_queue->length;
		}
		free(p_queue);
		p_queue = NULL;
	}
	
	return ret;
}
simple_queue.h 

#ifndef _SIMPLE_QUEUE_H__
#define _SIMPLE_QUEUE_H__

#define MQ_NAME 						"test"
#define MQ_FLAG_BLOCK 					QUEUE_BLOCK
#define MQ_FLAG_NO_BLOCK 				QUEUE_NO_BLOCK
#define MQ_LENGTH_MAX 					10
#define MQ_SIZE_MAX 					512


typedef struct _simple_queue
{
	int front;
	int rear;
	int length;
	int queue_type;
	pthread_mutex_t data_mutex;
	char queue_name[15];
	void *data[0];
}simple_queue;

typedef struct _simple_queue_buf
{
	int msg_type;
	int msg_prio;
	char msg_buf[50];
	//char* msg_buf;
}queue_buf;

typedef enum _queue_type
{
	QUEUE_BLOCK = 0,
	QUEUE_NO_BLOCK,
}queue_type;

typedef enum _queue_status
{
	QUEUE_IS_NORMAL = 0,
	QUEUE_NO_EXIST,
	QUEUE_IS_FULL,
	QUEUE_IS_EMPTY,
	
}queue_status;

typedef enum _cntl_queue_ret
{
	CNTL_QUEUE_SUCCESS = 0,
	CNTL_QUEUE_FAIL,
	CNTL_QUEUE_TIMEOUT,
	CNTL_QUEUE_PARAM_ERROR,
}cntl_queue_ret;

simple_queue* create_simple_queue(const char* queue_name, int queue_length, int queue_type);
queue_status is_full_queue(simple_queue* p_queue);
queue_status is_empty_queue(simple_queue* p_queue);
cntl_queue_ret push_simple_queue(simple_queue* p_queue, void* data);
cntl_queue_ret pop_simple_queue(simple_queue* p_queue, void** data);
cntl_queue_ret destroy_simple_queue(simple_queue* p_queue);


#endif
main.c 
#include<stdio.h>
#include<pthread.h>
//#include<errno.h>
#include<string.h>
#include<stdlib.h>
#include"simple_queue.h"

void* send_msg_thread(void* arg)
{
	#if 1
	queue_buf* send_buf = NULL;

	send_buf = (queue_buf*)malloc(sizeof(queue_buf));
	send_buf->msg_type = 9;
	send_buf->msg_prio = 6;

	strcpy(send_buf->msg_buf, "helloworld");
	printf("first1: rear =%d font =%d\n", ((simple_queue*)arg)->rear, ((simple_queue*)arg)->front);
	printf("send_buf = %p\n", send_buf);
    if (push_simple_queue((simple_queue*)arg, (void*)send_buf) < 0) 
	{ 
        printf("[%s]: push_simple_queue failed!\n", __FUNCTION__);  
        return NULL; 
    }
	
	printf("first2: rear =%d font =%d\n", ((simple_queue*)arg)->rear, ((simple_queue*)arg)->front);
	#if 1
	queue_buf* send_buf1 = NULL;

	send_buf1 = (queue_buf*)malloc(sizeof(queue_buf));
	send_buf1->msg_type = 9;
	send_buf1->msg_prio = 6;

	strcpy(send_buf1->msg_buf, "byebye");
	printf("first1: rear =%d font =%d\n", ((simple_queue*)arg)->rear, ((simple_queue*)arg)->front);
	printf("send_buf1 = %p\n", send_buf1);
    if (push_simple_queue((simple_queue*)arg, (void*)send_buf1) < 0) 
	{ 
        printf("[%s]: push_simple_queue\n", __FUNCTION__);  
        return NULL; 
    }
	printf("first2: rear =%d font =%d\n", ((simple_queue*)arg)->rear, ((simple_queue*)arg)->front);
	#endif
	#if 0
	queue_buf* recv_buf = NULL;
	 
	printf("recv_buf = %p\n", recv_buf);
	printf("seconde1 rear =%d font =%d\n", ((simple_queue*)arg)->rear, ((simple_queue*)arg)->front);	
    if (CNTL_QUEUE_SUCCESS != pop_simple_queue((simple_queue*)arg, (void**)&recv_buf)) 
	{  
        printf("[%s]: push_simple_queue failed!\n", __FUNCTION__); 
		return NULL;
    }
	printf("recv_buf = %p\n", recv_buf);
	printf("type = %d, prio = %d, recv_buf = %s\n", recv_buf->msg_type, recv_buf->msg_prio, recv_buf->msg_buf);
	printf("seconde2: rear =%d font =%d\n", ((simple_queue*)arg)->rear, ((simple_queue*)arg)->front);
	free(recv_buf);
	#endif
#endif
	return NULL;
}
void* recv_msg_thread(void* arg)
{
	#if 1
	queue_buf* recv_buf = NULL;
	//usleep(500);
	
	printf("recv_buf = %p\n", recv_buf);
	printf("seconde1 rear =%d font =%d\n", ((simple_queue*)arg)->rear, ((simple_queue*)arg)->front);
	
    if (CNTL_QUEUE_SUCCESS != pop_simple_queue((simple_queue*)arg, (void**)&recv_buf)) 
	{  
        printf("[%s]: pop_simple_queue failed!\n", __FUNCTION__); 
		return NULL;
    }
	printf("recv_buf = %p\n", recv_buf);
	printf("type = %d, prio = %d, recv_buf = %s\n", recv_buf->msg_type, recv_buf->msg_prio, recv_buf->msg_buf);
	printf("seconde2: rear =%d font =%d\n", ((simple_queue*)arg)->rear, ((simple_queue*)arg)->front);
	free(recv_buf);
	recv_buf = NULL;
	//queue_buf* recv_buf = NULL;
	//usleep(500);
#if 1	
	printf("recv_buf = %p\n", recv_buf);
	printf("seconde1 rear =%d font =%d\n", ((simple_queue*)arg)->rear, ((simple_queue*)arg)->front);
	
    if (CNTL_QUEUE_SUCCESS != pop_simple_queue((simple_queue*)arg, (void**)&recv_buf)) 
	{  
        printf("[%s]: pop_simple_queue failed!\n", __FUNCTION__); 
		return NULL;
    }
	printf("recv_buf = %p\n", recv_buf);
	printf("type = %d, prio = %d, recv_buf = %s\n", recv_buf->msg_type, recv_buf->msg_prio, recv_buf->msg_buf);
	printf("seconde2: rear =%d font =%d\n", ((simple_queue*)arg)->rear, ((simple_queue*)arg)->front);
	free(recv_buf);
	recv_buf = NULL;
	printf("recv_buf = %p\n", recv_buf);
#endif
	#if 0
	queue_buf* send_buf1 = NULL;

	send_buf1 = (queue_buf*)malloc(sizeof(queue_buf));
	send_buf1->msg_type = 9;
	send_buf1->msg_prio = 6;

	strcpy(send_buf1->msg_buf, "byebye");
	printf("first1: rear =%d font =%d\n", ((simple_queue*)arg)->rear, ((simple_queue*)arg)->front);
	printf("send_buf1 = %p\n", send_buf1);
    if (push_simple_queue((simple_queue*)arg, (void*)send_buf1) < 0) 
	{ 
        printf("[%s]: push_simple_queue\n", __FUNCTION__);  
        return NULL; 
    }
	printf("first2: rear =%d font =%d\n", ((simple_queue*)arg)->rear, ((simple_queue*)arg)->front);
	#endif
	#endif
	
	
	return NULL;
}
int main(int argc, char* argv[])
{
	int ret = 0;
	pthread_t send_thread_id = 0;
	pthread_t recv_thread_id = 0;
	simple_queue* msg_queue = NULL;
	#if 1
	msg_queue = create_simple_queue(MQ_NAME, MQ_LENGTH_MAX, MQ_FLAG_BLOCK);
	#else
	msg_queue = create_simple_queue(MQ_NAME, MQ_LENGTH_MAX, MQ_FLAG_NO_BLOCK);	
	#endif

	if (NULL == msg_queue)
	{
		printf("[%s]: create simple queue failed!\n", __FUNCTION__);
		return -1;
	}
	ret = pthread_create(&send_thread_id, NULL, send_msg_thread, (void*)msg_queue);
	if (0 != ret)
	{
		printf("[%s]: create send thread failed!\n", __FUNCTION__);
		return -1;
	}
	
	ret = pthread_create(&recv_thread_id, NULL, recv_msg_thread, (void*)msg_queue);
	if (0 != ret)
	{
		printf("[%s]: create recv thread failed!\n", __FUNCTION__);
		return -1;
	}
	printf("begin join\n");
	pthread_join(send_thread_id, NULL);
	pthread_join(recv_thread_id, NULL);
	printf("end join\n");
	ret = destroy_simple_queue(msg_queue);
	if (CNTL_QUEUE_SUCCESS != ret)
	{
		printf("[%s]: destroy simple queue failed!\n", __FUNCTION__);
		return -1;
	}
	
	return 0;
}

在linux下面编译

再运行

望大神指教

猜你喜欢

转载自blog.csdn.net/follow_blast/article/details/79020885
今日推荐
Arc Browser for Windows 1.0 正式 GA
90后程序员开发视频搬运软件、不到一年获利超 700 万，结局很刑！
《美国对全球网络空间安全与发展的威胁和破坏》报告发布
火速冲上 GitHub 热榜 —— 开源编程语言、框架哪有这么可爱？
北京人形机器人创新中心发布全球首个纯电驱拟人奔跑的全尺寸人形机器人“天工”
周排行
rbac——界面、权限
Apache CXF + SpringMVC 整合发布WebService
so插件化
Vue.js实战系列---图标字体制作（svg格式）
PAT乙级 1007 素数对猜想(孪生素数对) (20分) ---（C语言 + 详细注释）
被IRM保护的文档，打开失败
Calendar和Date计算日期差的小问题
win10子系统ubuntu18.4安装docker
利用Wrap Shell Script定位Android Native内存泄漏
MySQL: Transaction (Part I - Basic Concept)
每日归档
更多
2024-05-03(19)
2024-05-02(0)
2024-05-01(4)
2024-04-30(1)
2024-04-29(40)
2024-04-28(0)
2024-04-27(56)
2024-04-26(39)
2024-04-25(22)
2024-04-24(36)

代码天地 © 2018 codetd.com

境外服务器   最新电视剧2022