操作系统-生产者与消费者源代码.docVIP

/*生产者/消费者*/ #includestdio.h #includemalloc.h #includeiostream.h struct PCB { int flag; //1为生产者,2为消费者 int numLabel; }; typedef struct QNode { PCB data;//数据域 struct QNode* next;//指针域 }QNode, *QueuePtr; typedef struct { QueuePtr front;//队头指针 QueuePtr rear;//队尾指针 }LinkQueue; typedef struct LNode { QueuePtr data; struct LNode *next; }LNode, *LinkList; void QueueInit(LinkQueue Q)//初始化队列 { Q.front = Q.rear = (QueuePtr)malloc(sizeof(QNode)); Q.front-next = NULL; } void LinkListInit(LinkList L)//初始化链表 { L = (LinkList)malloc(sizeof(LNode)); } void EnQueue(LinkQueue Q, QueuePtr p)//入队 { p-next = NULL; Q.rear-next = p; Q.rear = p; } QueuePtr DeQueue(LinkQueue Q) //出队 { QueuePtr p = Q.front-next; Q.front-next = p-next; if(Q.rear == p)Q.rear =Q.front; return p; } void outqueue(LinkQueue Q) { QueuePtr p = Q.front-next; Q.front-next = p-next; if(Q.rear == p)Q.rear =Q.front; } void LinkListInsert(LinkList L, QueuePtr e)//进入链表 { LinkList p = L; LinkList q = (LinkList)malloc(sizeof(LNode)); while(p-next)p++; q-data = e; q-next = NULL; p-next = q; } void processproc(LinkQueue Q)//创建进程进入初始队列 { int processNum = 0; cout请输入进程的个数:;//确定进程个数，默认为0 cinprocessNum; for(int i = 0; i processNum; i++) { cout输入第i+1个进程的种类,如果是生产者请输入(1)/如果是消费者请输入(2); struct PCB pcb; cinpcb.flag;//输入进程的种类 pcb.numLabel = i+1;//进程序号赋值 QueuePtr p = (QueuePtr)malloc(sizeof(QNode)); p-data = pcb; EnQueue(Q, p); } } bool HasElement(LinkQueue Q)//判断队列是否为空 { if(Q.front == Q.rear) return 0; else return 1; } int ProduceRun(int full, int BufferSize)//运行生产者进程 { if(full BufferSize) { full++; return 1; } return 0; } int ConsumeRun(int full, int BufferSize)//运行消费者进程 { if(full 0) { full--; return 1; } return 0; } void DisPlay(LinkQueue Q)//打印队列 { QueuePtr p = Q.front; while(p-next) { cout进程p-next-data.numLabelendl; p = p-next; } } void main() { int BufferSize;//设置缓冲区大小 cout请设置缓冲区的大小: ; cinBufferSize; int full = 0;//当前缓冲区中的进程数目 int temp = 1