＜操作系统＞生产者消费者问题—无限缓冲区(C语言实现)

思路：

代码

#include <stdio.h>
#include <unistd.h>
#include <stdlib.h>
#include <string.h>
#include <pthread.h>
#include <semaphore.h>
sem_t full,mutex;
int a=0;
void *producer_i(void *arg){
	while(1){
		sleep(1);
		sem_wait(&mutex);
		a=a+1;
		printf("生产者放入1个产品进入缓冲区,缓冲区现状：");
		for(int i=1;i<=a;i++)
			printf("1");
		printf("\n");
		sem_post(&mutex);
		sem_post(&full);

	}
}
void *consumer_j(void *arg){
	while(1){
		sem_wait(&full);
		sem_wait(&mutex);
		a=a-1;
		printf("消费者从缓冲区取走1个产品,缓冲区现状：");
		for(int i=1;i<=a;i++)
		   printf("1");
		printf("\n");
		sem_post(&mutex);
		sleep(2);
	}
}
int main()
{
	int sg1,sg2;
	pthread_t producer1,producer2,consumer;
	sg1=sem_init(&full,0,0);
	sg2=sem_init(&mutex,0,1);
        pthread_create(&producer1,NULL,(void *)producer_i,NULL);
	pthread_create(&producer2,NULL,(void *)producer_i,NULL);
	pthread_create(&consumer,NULL,(void *)consumer_j,NULL);
	pthread_join(producer1,NULL);
	pthread_join(producer2,NULL);
	pthread_join(consumer,NULL);
	return 0;

}

运行截图