东北大学操作系统实验：进程同步和通信（生产者消费者问题模拟）

//producer_consumer.cc

#include<iostream>
#include<vector>
#include<queue>
using namespace std;

const int bufferSize = 8;
vector<int> buffer(bufferSize);
queue<int> waitQueue;
int id;
int writeptr, readptr;
int consumer, producer;

void init()
{
	for (int i = 0; i < bufferSize; ++i)
	{
		buffer[i] = 0;
	}
	while(!waitQueue.empty())
	{
		waitQueue.pop();
	}
	id = 0;
	writeptr = readptr = 0;
	consumer = producer = 0;//the num of waiting 
}

int findEmpty(vector<int>& v, int len)
{
	for(int i = 0; i < len; ++i)
	{
		if(v[i] == 0)
			return i;
	}
	return -1; 
}

int findDirty(vector<int>& v, int len)
{
	for(int i = 0; i < len; ++i)
	{
		if(v[i] > 0)
			return i;
	}
	return -1; 
}

void show()
{
    for(int i = 0; i < bufferSize; ++i)
    {
        if(buffer[i] > 0)
            cout << "  " <