淮海工学院-操作系统-实验2-银行家算法.docVIP

#include stdio.h #include string.h #define false 0 #define true 1 #define PROCESSES_NUMBER 5 //系统中所有进程数量 typedef int bool; typedef struct { int A; int B; int C; }RESOURCE; RESOURCE Max[PROCESSES_NUMBER]; //最大需求矩阵 Max RESOURCE Allocation[PROCESSES_NUMBER]; //已分配资源数矩阵 Allocation RESOURCE Need[PROCESSES_NUMBER]; //需求矩阵 RESOURCE Available = {3,3,2}; //可用资源向量 int safe[PROCESSES_NUMBER]; void inputMax() { int i; printf(请输入最大需求矩阵\n); for (i = 0; i PROCESSES_NUMBER; i++) { scanf(%d%d%d,Max[i].A,Max[i].B,Max[i].C); } } void inputAllocation() { int i; printf(请输入已分配资源数矩阵\n); for (i = 0; i PROCESSES_NUMBER; i++) { scanf(%d%d%d,Allocation[i].A,Allocation[i].B,Allocation[i].C); } } //试探分配 void ProbeAlloc(int process,RESOURCE *res) { Available.A -= res-A; Available.B -= res-B; Available.C -= res-C; Allocation[process].A += res-A; Allocation[process].B += res-B; Allocation[process].C += res-C; Need[process].A -= res-A; Need[process].B -= res-B; Need[process].C -= res-C; } //若试探分配后进入不安全状态，将分配回滚 void RollBack(int process,RESOURCE *res) { Available.A += res-A; Available.B += res-B; Available.C += res-C; Allocation[process].A -= res-A; Allocation[process].B -= res-B; Allocation[process].C -= res-C; Need[process].A += res-A; Need[process].B += res-B; Need[process].C += res-C; } //安全性检查 bool SafeCheck() { RESOURCE Work = Available; bool Finish[PROCESSES_NUMBER] = {false,false,false,false,false}; int i; int j = 0; for (i = 0; i PROCESSES_NUMBER; i++) { //是否已检查过 if(Finish[i] == false) { //是否有足够的资源分配给该进程 if(Need[i].A = Work.A Need[i].B = Work.B Need[i].C = Work.C ) { //有则使其执行完成，并将已分配给该进程的资源全部回收 Work.A += Allocation[i].A; Work.B += Allocation[i].B; Work.C += Allocation[i].C;