Linux 线程-条件变量-优快云博客

本文链接：https://blog.youkuaiyun.com/weixin_41582705/article/details/82378630

本文通过C++实现了一个典型的生产者-消费者模式案例，利用线程间的同步互斥锁及条件变量来确保链表中数据的安全操作。生产者不断地生成随机数并将其插入到链表头部，而消费者则从链表中移除元素。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

#include <cstdio>
#include<pthread.h>
#include <iostream>
#include<unistd.h>
#include<string.h>

using namespace std;

//节点结构
typedef struct node {
    int data;
    struct node* next;
}Node;
//永远指向链表头部的指针
Node *head = NULL;
//线程同步-互斥锁
pthread_mutex_t mutex;
//条件变量-阻塞线程
pthread_cond_t cond;

//生产者
void* producer(void *arg) {

    while (1) {
        Node* p = new Node;
        //Node * p = (Node*)malloc(sizeof(Node));
        p->data = rand() % 1000;
        pthread_mutex_lock(&mutex);
        p->next = head;
        head = p;
        cout << "====produce:" << pthread_self() << "  " << p->data << endl;
        pthread_mutex_unlock(&mutex);
        pthread_cond_signal(&cond);
        sleep(rand() % 3);
    }
    return NULL;
}
void* customer(void *arg) {

    while (1) {
        pthread_mutex_lock(&mutex);
        if (head == NULL) {
            pthread_cond_wait(&cond, &mutex);

        }
        Node* pdel = head;
        head = head->next;
        cout << "--------customer: " << pthread_self() << " " << pdel->data << endl;
        delete pdel;
        pthread_mutex_unlock(&mutex);
    }
    return NULL;
}


int main()
{
    pthread_t p1, p2;

    pthread_mutex_init(&mutex, NULL);
    pthread_cond_init(&cond, NULL);



    //创建生产者线程
    pthread_create(&p1, NULL, producer, NULL);
    //创建消费者线程
    pthread_create(&p2, NULL, customer, NULL);


    //阻塞回收子线程
    pthread_join(p1, NULL);
    pthread_join(p2, NULL);



    return 0;
}