LINUX——多线程编程

这篇文章展示了如何使用互斥锁和条件变量在多线程环境中实现同步。代码示例中,父亲和母亲线程生产苹果和橘子,而大儿子和大女儿线程消费它们,确保资源的正确访问和避免竞争条件。当盘子里的水果数量达到最大值或为零时,线程通过条件变量等待或唤醒,保证了数据的一致性。
摘要由CSDN通过智能技术生成

一、链接库

二、线程 

 

 

三、信号量 

a、sem_init()

 

b、 sem_wait()

 

 

四、互斥锁与条件变量

a、关系

 实例

 

#include <stdio.h>
#include <stdlib.h>
#include <pthread.h>

#define MAX_FRUITS 4

pthread_mutex_t mutex = PTHREAD_MUTEX_INITIALIZER;
pthread_cond_t father_cv = PTHREAD_COND_INITIALIZER;
pthread_cond_t mother_cv = PTHREAD_COND_INITIALIZER;
pthread_cond_t sons_cv = PTHREAD_COND_INITIALIZER;
pthread_cond_t daughters_cv = PTHREAD_COND_INITIALIZER;

int num_fruits = 0;

void* father(void* arg) {
    while (1) {
        pthread_mutex_lock(&mutex);

        while (num_fruits >= MAX_FRUITS) {
            pthread_cond_wait(&father_cv, &mutex);
        }

        num_fruits++;
        printf("盘子中有%d个苹果,父亲往盘子放1个苹果!\n", num_fruits);

        pthread_cond_signal(&sons_cv);
        pthread_cond_signal(&daughters_cv);
        pthread_mutex_unlock(&mutex);
    }

    return NULL;
}

void* mother(void* arg) {
    while (1) {
        pthread_mutex_lock(&mutex);

        while (num_fruits >= MAX_FRUITS) {
            pthread_cond_wait(&mother_cv, &mutex);
        }

        num_fruits++;
        printf("盘子中有%d个橘子,母亲往盘子放1个橘子!\n", num_fruits);

        pthread_cond_signal(&sons_cv);
        pthread_cond_signal(&daughters_cv);
        pthread_mutex_unlock(&mutex);
    }

    return NULL;
}

void* son(void* arg) {
    while (1) {
        pthread_mutex_lock(&mutex);

        while (num_fruits == 0) {
            pthread_cond_wait(&sons_cv, &mutex);
        }

        num_fruits--;
        printf("盘子中有%d个苹果,大儿子从盘子取1个苹果!\n", num_fruits);

        pthread_cond_signal(&father_cv);
        pthread_cond_signal(&mother_cv);
        pthread_mutex_unlock(&mutex);
    }

    return NULL;
}

void* daughter(void* arg) {
    while (1) {
        pthread_mutex_lock(&mutex);

        while (num_fruits == 0) {
            pthread_cond_wait(&daughters_cv, &mutex);
        }

        num_fruits--;
        printf("盘子中有%d个橘子,大女儿从盘子取1个橘子!\n", num_fruits);

        pthread_cond_signal(&father_cv);
        pthread_cond_signal(&mother_cv);
        pthread_mutex_unlock(&mutex);
    }

    return NULL;
}

int main() {
    pthread_t father_thread, mother_thread, son_thread, daughter_thread;

    pthread_create(&father_thread, NULL, father, NULL);
    pthread_create(&mother_thread, NULL, mother, NULL);
    pthread_create(&son_thread, NULL, son, NULL);
    pthread_create(&daughter_thread, NULL, daughter, NULL);

    pthread_join(father_thread, NULL);
    pthread_join(mother_thread, NULL);
    pthread_join(son_thread, NULL);
    pthread_join(daughter_thread, NULL);

    return 0;
}

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值