PV操作(生产者-消费者问题）-1【转帖】

PV操作(生产者-消费者问题）-1【转帖】

1. /*
2. caoyuan
3. 2006-12-26
4. PVoperationproducerandconsumer
5. */
6. #include<windows.h>
7. #include<iostream>
8. usingnamespacestd;
10. constunsignedshortSIZE_OF_BUFFER=10;//缓冲区长度
11. unsignedshortProductID=0;//产品号
12. unsignedshortConsumeID=0;//将被消耗的产品号
13. unsignedshortin=0;//产品进缓冲区时的下标
14. unsignedshortout=0;//产品出缓冲区时的下标
16. intpv_buffer[SIZE_OF_BUFFER];//缓冲区是个循环队列
17. boolpv_continue=true;//控制程序结束
18. HANDLEpv_hMutex;//用于线程间的互斥，主要用于控制台打印
19. HANDLEfullSemaphore;//消费者进程的私用信号量
20. HANDLEemptySemaphore;//生产者进程的私用信号量
22. DWORDWINAPIProducer(LPVOID);//生产者线程
23. DWORDWINAPIConsumer(LPVOID);//消费者线程
25. intmain()
26. {
27. //创建Mutex和Semaphore
28. pv_hMutex=CreateMutex(NULL,FALSE,NULL);
29. fullSemaphore=CreateSemaphore(NULL,0,SIZE_OF_BUFFER,NULL);
30. emptySemaphore=CreateSemaphore(NULL,SIZE_OF_BUFFER,
31. SIZE_OF_BUFFER,NULL);
33. //缓冲区初始化
34. for(inti=0;i<SIZE_OF_BUFFER;++i){
35. pv_buffer[i]=-1;//当值为-1时该项为空
36. }
38. constunsignedshortPRODUCERS_COUNT=3;//生产者的个数
39. constunsignedshortCONSUMERS_COUNT=2;//消费者的个数
41. //总的线程数
42. constunsignedshortTHREADS_COUNT=PRODUCERS_COUNT+CONSUMERS_COUNT;
44. HANDLEpvThreads[THREADS_COUNT];//各线程的handle
45. DWORDproducerID[PRODUCERS_COUNT];//生产者线程的标识符
46. DWORDconsumerID[CONSUMERS_COUNT];//消费者线程的标识符
48. //创建生产者线程
49. for(inti=0;i<PRODUCERS_COUNT;i++){
50. pvThreads[i]=CreateThread(NULL,0,Producer,NULL,0,&producerID[i]);
51. if(pvThreads[i]==NULL)break;
52. }
53. //创建消费者线程
54. for(inti=0;i<CONSUMERS_COUNT;i++){
55. pvThreads[PRODUCERS_COUNT+i]
56. =CreateThread(NULL,0,Consumer,NULL,0,&consumerID[i]);
57. if(pvThreads[i]==NULL)break;
58. }
60. while(pv_continue){
61. if(getchar()){//按回车后终止程序运行
62. pv_continue=false;
63. }
64. }
65. system("pause");
66. return0;
67. }
69. //生产一个产品。简单模拟了一下，仅输出新产品的ID号
70. voidProduce()
71. {
72. cout<<"生产"<<++ProductID<<"号产品";
73. Sleep(1500);
74. cout<<":)"<<endl;
75. }
77. //把新生产的产品放入缓冲区
78. voidPut()
79. {
80. cout<<"向仓库中放入产品";
81. pv_buffer[in]=ProductID;
82. in=(in+1)%SIZE_OF_BUFFER;
83. Sleep(1500);
84. cout<<":)"<<endl;
86. }
88. //从缓冲区中取出一个产品
89. voidTake()
90. {
91. ConsumeID=pv_buffer[out];
92. cout<<"从仓库中取出第"<<ConsumeID<<"号货物";
93. pv_buffer[out]=-1;
94. out=(out+1)%SIZE_OF_BUFFER;
95. Sleep(1500);
96. cout<<":)"<<endl;
98. }
100. //消耗一个产品
101. voidConsume()
102. {
103. cout<<"消费掉第"<<ConsumeID<<"号货物";
104. Sleep(1500);
105. cout<<":)"<<endl;
106. }
108. //生产者
109. DWORDWINAPIProducer(LPVOIDlpPara)
110. {
111. while(pv_continue){
112. WaitForSingleObject(emptySemaphore,INFINITE);//P(emptySemaphore)生产者信号量-1
113. WaitForSingleObject(pv_hMutex,INFINITE);//P(Mutex)获取线程间互斥信号
114. Produce();
115. Put();
116. Sleep(1500);
117. ReleaseSemaphore(fullSemaphore,1,NULL);//V(fullSemaphore)消费者信号量+1
118. ReleaseMutex(pv_hMutex);//V(Mutex)释放线程间互斥信号
119. }
120. return0;
121. }
123. //消费者
124. DWORDWINAPIConsumer(LPVOIDlpPara)
125. {
126. while(pv_continue){
127. WaitForSingleObject(fullSemaphore,INFINITE);//P(fullSemaphore)消费者信号量-1
128. WaitForSingleObject(pv_hMutex,INFINITE);//P(Mutex)获得线程间互斥信号
129. Take();
130. Consume();
131. Sleep(1500);
132. ReleaseSemaphore(emptySemaphore,1,NULL);//V(emptySemaphore)生产者信号量+1
133. ReleaseMutex(pv_hMutex);//V(Mutex)释放线程间互斥信号
134. }
135. return0;
136. }