vc实现的生成者，消费者问题

最新推荐文章于 2025-09-17 19:18:46 发布

原创最新推荐文章于 2025-09-17 19:18:46 发布 · 598 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#null #string #file

vc++领域专栏收录该内容

8 篇文章

订阅专栏

本文介绍了一个使用VC实现的生成者与消费者问题的解决方案。通过多线程技术，演示了两个生成者线程与一个消费者线程如何协调工作，确保资源的安全访问及生产消费流程的正确执行。

vc实现的生成者，消费者问题

// Demo_MultiThread.cpp : 定义控制台应用程序的入口点。 // #include "stdafx.h" #include<stdio.h> #include<iostream> #include<windows.h> #include<process.h> #include<stdlib.h> #include<Winbase.h> using namespace std; unsigned _stdcall ThreadProducer(void *pArgement); unsigned _stdcall ThreadProducer2(void *pArgement); unsigned _stdcall ThreadConsumer(void *pArgement); CRITICAL_SECTION cs; int iArriay[5]; static int bJudge=1; int main() { unsigned long hThreadProducer,hThreadProducer2,hThreadConsumer; InitializeCriticalSection(&cs); hThreadProducer=_beginthreadex(NULL,0,&ThreadProducer,NULL,0,NULL); hThreadProducer2=_beginthreadex(NULL,0,&ThreadProducer2,NULL,0,NULL); hThreadConsumer=_beginthreadex(NULL,0,&ThreadConsumer,NULL,0,NULL); WaitForSingleObject((void *)hThreadProducer,INFINITE); WaitForSingleObject((void *)hThreadConsumer,INFINITE); WaitForSingleObject((void *)hThreadProducer2,INFINITE); DeleteCriticalSection(&cs); return 0; } unsigned _stdcall ThreadProducer(void *pArgement) { while(1) { EnterCriticalSection(&cs); bJudge ++; cout<<"生成者1====" << bJudge<< endl; LeaveCriticalSection(&cs); Sleep(500); } return 0; } unsigned _stdcall ThreadConsumer(void *pArgement) { FILE *fFile; while(1) { EnterCriticalSection(&cs); std::string info = "消费者==="; if(bJudge <=0) { cout << "消费者不消费了=========="<< bJudge<<endl; LeaveCriticalSection(&cs); } else { bJudge--; char buf[10]; itoa(bJudge,buf,10); info += buf; fopen_s(&fFile,"f://1.txt","at+"); fprintf(fFile,"%s/r/n",info.c_str()); fclose(fFile); cout << "消费者========="<< bJudge<< endl; Sleep(20); } LeaveCriticalSection(&cs); Sleep(100); } } unsigned _stdcall ThreadProducer2(void *pArgement) { while(1) { EnterCriticalSection(&cs); bJudge ++; cout<<"生成者2====" << bJudge<< endl; LeaveCriticalSection(&cs); Sleep(500); } return 0; }