代码实现:
#include<stdio.h>
#include<pthread.h>
#include<stdlib.h>
typedef struct Node{
int value;
struct Node* next;
}Node;
Node* alloc(int value)
{
Node* pTmp = (Node*) malloc(sizeof(Node));
pTmp->value = value;
pTmp->next = NULL;
return pTmp;
}
void Free(Node* pTmp)
{
if(pTmp)
free(pTmp);
pTmp = NULL;
}
void InitList(Node** pHead)
{
*pHead = (Node*) malloc(sizeof(Node));
(*pHead)->next = NULL;
}
void PushFront(Node* pHead, int value)
{
Node* pTmp = alloc(value);
pTmp->next = pHead->next;
pHead->next = pTmp;
}
void PopFront(Node* pHead)
{
Node* pTmp = pHead->next;
if(pTmp)
{
pHead->next = pTmp->next;
Free(pTmp);
}
}
void DestroyList(Node** pHead)
{
while((*pHead)->next)
{
PopFront(*pHead);
}
Free(*pHead);
}
void PrintList(Node* pHead)
{
while(pHead->next)
{
printf("%d ", pHead->next->value);
pHead = pHead->next;
}
printf("\n");
}
int isEmpty(Node* pHead)
{
if(pHead->next)
return 0;
return 1;
}
int SizeList(Node* pHead)
{
int count = 0;
pHead = pHead->next;
while(pHead)
{
count++;
pHead = pHead->next;
}
return count;
}
//创建链表
Node* pHead;
//创建条件变量
pthread_cond_t need_prod = PTHREAD_COND_INITIALIZER;
//创建互斥锁
pthread_mutex_t lock = PTHREAD_MUTEX_INITIALIZER;
//生产者
void *product(void *arg)
{
while(1){
sleep(1);
//申请锁
pthread_mutex_lock(&lock);
int data = rand() % 123;
PushFront(pHead, data);
printf("生产者生产完成: %d\n", data);
//释放锁
pthread_mutex_unlock(&lock);
//唤醒消费者线程
pthread_cond_signal(&need_prod);
}
}
//消费者
void *consumer(void *arg)
{
while(1){
//申请锁
pthread_mutex_lock(&lock);
while(isEmpty(pHead))
{
printf("生产者没有生产完毕,消费者等待\n");
//如果链表中为空,消费者就要进行等待,等生产者生产完成后唤醒自己
//在进入等待队列时,它会释放锁资源,以便其他进程进行生产,在出等待队列时,它会恢复锁的状态
pthread_cond_wait(&need_prod, &lock);
}
printf("消费者消费完毕: %d\n", pHead->next->value);
PopFront(pHead);
//释放锁
pthread_mutex_unlock(&lock);
}
}
int main()
{
InitList(&pHead);
pthread_t thread1;
pthread_t thread2;
pthread_create(&thread1, NULL, product, NULL);
pthread_create(&thread2, NULL, consumer, NULL);
pthread_join(thread1, NULL);
pthread_join(thread2, NULL);
//销毁互斥锁
pthread_mutex_destroy(&lock);
//销毁条件变量
pthread_cond_destroy(&need_prod);
DestroyList(&pHead);
return 0;
}
运行结果: