centOS-消费者生产者问题

#include <stdio.h>
#include <pthread.h>
#define MAX 5
pthread_mutex_t mutex = PTHREAD_MUTEX_INITIALIZER;
pthread_cond_t notfull = PTHREAD_COND_INITIALIZER; 	//是否队满
pthread_cond_t notempty = PTHREAD_COND_INITIALIZER; 	//是否队空
int top = 0;
int bottom = 0;
void* produce(void* arg)
{
	int i;
	for ( i = 0; i < MAX*2; i++)
	{
		pthread_mutex_lock(&mutex);
		while ((top+1)%MAX == bottom)
		{
			printf("full! producer is waiting\n");
			pthread_cond_wait(¬full, &mutex);//等待队不满
		}
 
		top = (top+1) % MAX;
		printf("now top is %d\n", top);
		pthread_cond_signal(¬empty);//发出队非空的消息
 
		pthread_mutex_unlock(&mutex);
	}
	return (void*)1;
}
void* consume(void* arg)
{
	int i;
	for ( i = 0; i < MAX*2; i++)
	{
		pthread_mutex_lock(&mutex);
		while ( top%MAX == bottom)
		{
			printf("empty! consumer is waiting\n");
			pthread_cond_wait(¬empty, &mutex);//等待队不空
		}
		bottom = (bottom+1) % MAX;
		printf("now bottom is %d\n", bottom);
		pthread_cond_signal(¬full);//发出队不满的消息
		pthread_mutex_unlock(&mutex);
	}
	return (void*)2;
}
int main(int argc, char *argv[])
{
	pthread_t thid1;
	pthread_t thid2;
	pthread_t thid3;
	pthread_t thid4;
	int  ret1;
	int  ret2;
	int  ret3;
	int  ret4;
	pthread_create(&thid1, NULL, produce, NULL);
	pthread_create(&thid2, NULL, consume, NULL);
	pthread_create(&thid3, NULL, produce, NULL);
	pthread_create(&thid4, NULL, consume, NULL);
	pthread_join(thid1, (void**)&ret1);
	pthread_join(thid2, (void**)&ret2);
	pthread_join(thid3, (void**)&ret3);
	pthread_join(thid4, (void**)&ret4);
	return 0;
}
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值