轻松掌握银行家算法-避免死锁

1.设置四种数据结构，resourcenum定义为资源的类别，processnum为进程号，可利用资源向量数组available，最大需求矩阵Max。已经分配好资源的矩阵allocation，需求矩阵need。以及定义了一些程序所必须的变量，基础准备
2…对于安全的算法，该程序主要是通过不断的循环遍历来找到一个可以合理分配资源的安全序列，如果不存在就直接指出该系统是不安全的
下面是具体代码实现

#include <stdio.h>
#define resourcenum 3
#define processnum 5


int available [resourcenum] = { 3,3,2 };
int max[processnum][resourcenum] = { {7,5,3},{3,2,2},{9,0,2},{2,2,2},{4,3,3} };
int allocation[processnum][resourcenum] = { {0,1,0},{2,0,0},{3,0,2},{2,1,1},{0,0,2} };
int need[processnum][resourcenum] = { {7,4,3},{1,2,2},{6,0,0},{0,1,1},{4,3,1} };
//是否安全
bool finish[processnum];
//安全序列号
int safeseries[processnum] = { 0,0,0,0,0 };
//请求资源
int request[resourcenum];
//分配资源的进程号
int r = 0;

void show() {
	printf("老夫所在的银行\n");
	printf("/--------------------------------------/\n");
	printf("银行剩余的资源为：\n");
	int i, j = 0;
	for (i = 0; i < resourcenum; i++) {
		printf("%d\t",available[i]);
	}
	printf("\n当前的银行资源为：\n");
	printf("PID \t max\t Allocation\t Need\n");
	for ( i = 0; i < processnum; i++)
	{
		printf("p%d\t", i);
		for (j = 0; j < resourcenum; j++) {
			printf("%2d", max[i][j]);
		}
		printf("\t");
		for (j = 0; j < resourcenum; j++) {
			printf("%2d", allocation[i][j]);
		}
		printf("\t\t");
		for (j = 0; j < resourcenum; j++) {
			printf("%2d", need[i][j]);
		}
		printf("\n");
	}
	
}
//打印安全检查信息
void safeshow(int *work,int i) {
	int j;
	printf("\np%d", i);
	printf("\t");
	for (j = 0; j < resourcenum; j++) {
		printf("%2d", work[j]);
	}
	printf("\t\t");
	for (j = 0; j < resourcenum; j++) {
		printf("%2d", allocation[i][j]);
	}
	printf("\t\t");
	for (j = 0; j < resourcenum; j++) {
		printf("%2d", need[i][j]);
	}
	printf("\t\t");
	for (j = 0; j < resourcenum; j++) {
		printf("%2d", work[j]+allocation[i][j]);
	}
	printf("\n");
	
}
//判断一个进程的资源是否全部为零
bool isallzero(int process) {
	int num = 0;
	for (int i = 0; i < resourcenum; i++) {
		if (need[process][i] == 0) {
			num++;
		}
	}
	if (num == resourcenum) {
		return true;
	}
	else
	{
		return false;
	}
}
//进行安全检查
bool isSafe() {
	int work[resourcenum] = { 0 };//提供给进程所需的各类资源数目
	bool result;
	int allfinish=0;//分配好资源的进程数
	int safeindex = 0;//安全序列的索引
	int temp = 0;//方便计数来退出循环
	int pnum = 0;//计数存在的安全序列进程的个数

	for (int i = 0; i < resourcenum; i++) {
		work[i] = available[i];
	}
	//设置进程是否完成的状态
	for (int i = 0; i < processnum; i++) {
		result = isallzero(i);
		if (result ==  true) {
			finish[i] = true;
			allfinish++;
		}
		else {
			finish[i] = false;
		}
	}
	//分配资源开始
	while (allfinish != processnum) {
		int num = 0;
		for (int i = 0; i < resourcenum; i++) {
			if (need[r][i] <= work[i] && finish[r] == false) {
				num++;
			}
		}
		if (num == resourcenum) {
			safeshow(work, r);
			for (int i = 0; i < resourcenum; i++) {
				work[i] = work[i] + allocation[r][i];
			}
			allfinish++;
			finish[r] = true;
			safeseries[safeindex] = r;
			safeindex++;

		}
		r++;

		//循环查找不符合分配资源条件的进程
		if (r >= processnum) {
			r = r % processnum;
			if (temp == allfinish) {
				break;
			}
			temp = allfinish;
		}
		pnum = allfinish;
	}
	//判断进程是否安全
	for (int i = 0; i < pnum ; i++) {
		if (finish[i] == false) {
			printf("当前系统不安全，不存在安全的序列");
			break;
			return false;
		}
	}
	for (int i = 0; i < processnum; i++) {
		result = isallzero(i);
		if (result == true) {
			pnum--;
		}
	}
	//打印安全序列
	printf("\n当前系统安全，安全序列为：\n");
	for (int i = 0; i < pnum; i++) {
		printf("%2d", safeseries[i]);
	}

}


void main() {
	int inputprocess = 0;
	int a = -1; 
	show();
	printf("\n系统安全环境分析:\n");
	printf("PID\t Work\t\t Allocation\t Need\t Work+Allocation\n");
	int m = 0;//类似于计数器，完成后退出循环
	bool isStart = isSafe();
	while (isStart) {
		//限制用户的输入，防止输入超过进程数或者其它字符
		do
		{
			if (inputprocess > processnum || a == 0) {
				printf("\n请不要输入超出进程数的值或其它字符\n");
				while (getchar() != '\n') {};//清空缓存区
				a = -1;
			}
			printf("\n-----------------------------------------------");
			printf("\n输入要分配的进程:");
			a = scanf_s("%d", &inputprocess);
			printf("\n");

		} while (inputprocess > processnum || a == 0);
		for (int i = 0; i < resourcenum; i++) {
			printf("请输入要分配给进程p%d的第%d类资源:", inputprocess,i+1);
			scanf_s("%d", &request[i]);
			
		}
		int num = 0;
		for (int i = 0; i < resourcenum; i++) {
			if (request[i] <=need[inputprocess][i] && request[i] <=available[i]) {
				num++;
			}
			else {
				printf("\n发生错误，可能因为请求分配的资源大于该进程的某些资源的最大需要或者系统所剩的资源不足\n");
			}
			
			}
		//满足条件即可分配资源
		if (num == resourcenum) {
			m++;
			num = 0;
			for (int j = 0; j < resourcenum; j++) {
				available[j] = available[j] - request[j];
				allocation[inputprocess][j] = allocation[inputprocess][j] + request[j];
				need[inputprocess][j] = need[inputprocess][j] - request[j];
				if (need[inputprocess][j] == 0) {
					num++;
				}
			}
			//分配完成后，即刻释放该进程所占用资源
			if (num == resourcenum) {
				for (int j = 0; j < resourcenum; j++) {
					available[j] = available[j] + allocation[inputprocess][j];
				}
				printf("\n\n本次分配进程 P%d 完成,该进程占用资源全部释放完毕！\n", inputprocess);
			}
			else {
				printf("\n本次分配进程p%d失败\n", inputprocess);
			}
		}
			show();
			printf("PID\t Work\t\t Allocation\t Need\t Work+Allocation\n");
			//分配不安全，把已经分配好的资源返回来
			if (!isSafe()) {
				for (int j = 0; j < resourcenum; j++) {
					available[j] = available[j] + request[j];
					allocation[inputprocess][j] = allocation[inputprocess][j] - request[j];
					need[inputprocess][j] = need[inputprocess][j] + request[j];
				}
				if(m!=5){
					printf("\n资源不足，分配失败");
				}
				
			}
			if (m == processnum) {
				printf("\n银行分配成功，结束分配\n");
				break;
			}
			
		


	}

}

结果展示：