三種關(guān)系：互斥，同步，互斥和同步
兩類(lèi)角色:生產(chǎn)者，消費(fèi)者（線程）
一個(gè)交易場(chǎng)所：生產(chǎn)者消費(fèi)者共享的區(qū)域

賣(mài)蘋(píng)果的模型

• dish上面只有一個(gè)蘋(píng)果
• 買(mǎi)家必須要等賣(mài)家把蘋(píng)果放到dish上才可以去買(mǎi)蘋(píng)果。
• 賣(mài)家必須等待買(mǎi)家把蘋(píng)果買(mǎi)走才可以生產(chǎn)蘋(píng)果
• pthread_mutex_lock(&mutex); 和pthread_mutex_unlock(&mutex); 成對(duì)出現(xiàn)，里面的操作為一個(gè)原子操作
• pthread_cond_wait(&empty,&mutex);內(nèi)部有一個(gè)加鎖解鎖操作
• 過(guò)程詳解
  
  • 蘋(píng)果為0
  • 初始化時(shí)蘋(píng)果為0，買(mǎi)家在pthread_cond_wait(&empty,&mutex); 開(kāi)始等待，賣(mài)家不進(jìn)入while循環(huán)，生產(chǎn)蘋(píng)果后發(fā)出pthread_cond_signal(&empty);讓正在因dish上蘋(píng)果為0的買(mǎi)家停止等待pthread_cond_wait(&empty,&mutex);
  • 蘋(píng)果為1
  • 當(dāng)一個(gè)賣(mài)家進(jìn)入pthread_mutex_lock(&mutex); 但是發(fā)現(xiàn)蘋(píng)果為1時(shí)，就在while循環(huán)處等待pthread_cond_wait(&empty,&mutex);，直到買(mǎi)家發(fā)出信號(hào) pthread_cond_signal(&full);賣(mài)家停止等待，此時(shí)蘋(píng)果為0，跳出while循環(huán)，開(kāi)始生產(chǎn)蘋(píng)果。生產(chǎn)蘋(píng)果后發(fā)出pthread_cond_signal(&empty);讓正在因dish上蘋(píng)果為0的買(mǎi)家停止等待pthread_cond_wait(&empty,&mutex); 這樣這個(gè)過(guò)程就結(jié)束了
    *

#include <stdio.h> #include <unistd.h> #include <stdlib.h> #include <pthread.h>int dish = 0; pthread_cond_t full; pthread_cond_t empty; pthread_mutex_t mutex;void * consumer(void * arg) {int id = (int)arg;while(1){pthread_mutex_lock(&mutex);//上鎖while(dish == 0){//買(mǎi)家發(fā)現(xiàn)沒(méi)有蘋(píng)果開(kāi)始等待pthread_cond_wait(&empty,&mutex);}usleep(100000);dish = 0;printf("consumer %d get an apple!!\n", id);//給賣(mài)家發(fā)送信號(hào)pthread_cond_signal(&full);pthread_mutex_unlock(&mutex);//解鎖}return NULL; }void * product(void *arg) {int id = (int)arg;while(1){pthread_mutex_lock(&mutex); while(dish == 1){pthread_cond_wait(&full,&mutex);}dish =1;printf("producer %d put an apple!!\n", id); pthread_cond_signal(&empty);pthread_mutex_unlock(&mutex);}return NULL; }int main() {pthread_t tid;int set ;//初始化pthread_cond_init(&full,NULL);pthread_cond_init(&empty,NULL);pthread_mutex_init(&mutex,NULL);//四個(gè)賣(mài)家生產(chǎn)蘋(píng)果for(int i = 0;i<4;i++){pthread_create(&tid,NULL,product,(void *)i);}//四個(gè)買(mǎi)家買(mǎi)蘋(píng)果for(int i = 0;i<4;i++){pthread_create(&tid,NULL,consumer,(void *)i);}//等待thread標(biāo)識(shí)的線程終止，防止僵尸進(jìn)程產(chǎn)生pthread_join(tid,NULL);//銷(xiāo)毀所有資源pthread_cond_destroy(&full);pthread_cond_destroy(&empty);pthread_mutex_destroy(&mutex); }

如果對(duì)于互斥量含義尚不清楚，建議閱讀Linux/UNIX系統(tǒng)編程手冊(cè)

pthread_mutex_t pthread_mutex_init pthread_mutex_lock pthread_mutex_unlock pthread_mutex_destroy

模型采取Linux/UNIX系統(tǒng)編程手冊(cè)
這個(gè)模型很好，也把概念講清楚了，加了中文注釋

生產(chǎn)者

s = pthread_mutex_lock(&mtx); if (s != 0)errExitEN(s, "pthread_mutex_lock");avail++; /*這是一個(gè)原子操作 */s = pthread_mutex_unlock(&mtx); if (s != 0)errExitEN(s, "pthread_mutex_unlock");s = pthread_cond_signal(&cond); /* 喚醒消費(fèi)者 */ if (s != 0)errExitEN(s, "pthread_cond_signal");

消費(fèi)者

s = pthread_mutex_lock(&mtx); if (s != 0)errExitEN(s, "pthread_mutex_lock");while (avail == 0){ s = pthread_cond_wait(&cond, &mtx);if (s != 0)errExitEN(s, "pthread_cond_wait"); }

完整代碼

#include <time.h> #include <pthread.h> #include "tlpi_hdr.h"static pthread_mutex_t mtx = PTHREAD_MUTEX_INITIALIZER; static pthread_cond_t cond = PTHREAD_COND_INITIALIZER;static int avail = 0;static void * threadFunc(void *arg) {int cnt = atoi((char *) arg);int s, j;for (j = 0; j < cnt; j++) {sleep(1);/* Code to produce a unit omitted */s = pthread_mutex_lock(&mtx);if (s != 0)errExitEN(s, "pthread_mutex_lock");avail++; /* Let consumer know another unit is available */s = pthread_mutex_unlock(&mtx);if (s != 0)errExitEN(s, "pthread_mutex_unlock");s = pthread_cond_signal(&cond); /* Wake sleeping consumer */if (s != 0)errExitEN(s, "pthread_cond_signal");}return NULL; }int main(int argc, char *argv[]) {pthread_t tid;int s, j;int totRequired; /* Total number of units that all threadswill produce */int numConsumed; /* Total units so far consumed */Boolean done;time_t t;t = time(NULL);/* Create all threads */totRequired = 0;for (j = 1; j < argc; j++) {totRequired += atoi(argv[j]);s = pthread_create(&tid, NULL, threadFunc, argv[j]);if (s != 0)errExitEN(s, "pthread_create");}/* Loop to consume available units */numConsumed = 0;done = FALSE;for (;;) {s = pthread_mutex_lock(&mtx);if (s != 0)errExitEN(s, "pthread_mutex_lock");while (avail == 0) { /* Wait for something to consume */s = pthread_cond_wait(&cond, &mtx);if (s != 0)errExitEN(s, "pthread_cond_wait");}/* At this point, 'mtx' is locked... */while (avail > 0) { /* Consume all available units *//* Do something with produced unit */numConsumed ++;avail--;printf("T=%ld: numConsumed=%d\n", (long) (time(NULL) - t),numConsumed);done = numConsumed >= totRequired;}s = pthread_mutex_unlock(&mtx);if (s != 0)errExitEN(s, "pthread_mutex_unlock");if (done)break;/* Perhaps do other work here that does not require mutex lock */}exit(EXIT_SUCCESS); }

總結(jié)

以上是生活随笔為你收集整理的生产者消费者模型（条件变量）的全部?jī)?nèi)容，希望文章能夠幫你解決所遇到的問(wèn)題。

如果覺(jué)得生活随笔網(wǎng)站內(nèi)容還不錯(cuò)，歡迎將生活随笔推薦給好友。