银行家算法

#include<cstdio>

using namespace std;

#define true 1
#define false 0
#define MAXINT 9999

//typedef int bool;

bool Finish[100];
int request[100];
int processNum = 5;
int resourceNum = 3;
int available[100] = {3, 3, 2};
int safeSeries[100] = {MAXINT, MAXINT, MAXINT, MAXINT, MAXINT};
int need[100][100] = {{7, 4, 3}, {1, 2, 2}, {6, 0, 0}, {0, 1, 1}, {4, 3, 1}};
int maxRequest[100][100] = {{7, 5, 3}, {3, 2, 2}, {9, 0, 2}, {2, 2, 2}, {4, 3, 3}};
int allocation[100][100] = {{0, 1, 0}, {2, 0, 0}, {3, 0, 2}, {2, 1, 1}, {0, 0, 2}};

void SafeInfo(int work[], int i);

void Init()
{
    int i, j;
    printf("输入进程数量、资源数量\n");
    scanf("%d %d", &processNum, &resourceNum);
    printf("输入当前资源可用数目\n");
    for(i = 0; i < resourceNum; i++)
        scanf("%d", &available[i]);
    printf("输入最大需求矩阵\n");
    for(i = 0; i < processNum; i++)
        for(j = 0; j < resourceNum; j++)
            scanf("%d", &maxRequest[i][j]);
    printf("输入分配矩阵\n");
    for(i = 0; i < processNum; i++)
        for(j = 0; j < resourceNum; j++)
            scanf("%d", &allocation[i][j]);
    printf("输入当前需求矩阵\n");
    for(i = 0; i < processNum; i++)
        for(j = 0; j < resourceNum; j++)
            scanf("%d", &need[i][j]);
}

void showInfo()
{
    int i, j;
    printf("当前资源剩余：");
    for(j = 0; j < resourceNum; j++){
        printf("%d ", available[j]);
    }
    printf("\n");
    printf(" PID\t Max\t\tAllocation\tNeed\n");
    for(i = 0; i < processNum; i++)
    {
        printf(" P%d\t", i);
        for(j = 0; j < resourceNum; j++)
            printf("%d ", maxRequest[i][j]);
        printf("\t\t");
        for(j = 0; j < resourceNum; j++)
            printf("%d ", allocation[i][j]);
        printf("\t\t");
        for(j = 0; j < resourceNum; j++)
            printf("%d ",need[i][j]);
        printf("\n");
    }
}

bool isSafe()
{
    int i, j, k;
    int temp = 0;
    int trueFinished = 0;
    int work[resourceNum];
    for(i = 0; i < resourceNum; i++)
        work[i] = available[i];
    for(i = 0; i < processNum; i++)
        Finish[i] = false;
    i = 0; k = 0;
    while(trueFinished != processNum)
    {
        k++;
        if(Finish[i] != true)
        {
            for(j = 0; j < resourceNum; j++)
                if(need[i][j] > work[j]) break;
            if(j == resourceNum)
            {
                k = 0;
                Finish[i] = true;
                SafeInfo(work, i);
                for(j = 0; j < resourceNum; j++)
                    work[j] += allocation[i][j];
                safeSeries[trueFinished++] = i;
            }
        }
        i = (i + 1) % processNum;
        if(k > processNum) break;
    }

    if(trueFinished == processNum)
    {
        printf("\n系统安全！\n\n安全序列为：");
        for(i = 0; i < processNum; i++)
            printf("%d ", safeSeries[i]);
        return true;
    }
    printf("******系统不安全！******\n");
    return false;
}

void SafeInfo(int work[], int i)
{
    int j;
    printf(" P%d\t",i);
    for(j = 0; j < resourceNum; j++)
        printf("%d ", work[j]);
    printf("\t\t");
    for(j = 0; j < resourceNum; j++)
        printf("%d ", need[i][j]);
    printf("\t\t");
    for(j = 0; j < resourceNum; j++)
        printf("%d ", allocation[i][j]);
    printf("\t\t");
    for(j = 0; j < resourceNum; j++)
        printf("%d ", allocation[i][j] + work[j]);
    printf("\n");
}


int main()
{
    int wheInit = 0;
    int i, j, curProcess;
    printf("是否使用内置数据？0是，1否：");
    scanf("%d", &wheInit);
    if(wheInit) Init();  //可以不使用，选用内置的数据进行测试
    printf("---------------------------------------------------------\n");
    showInfo();
    printf("\n系统安全情况分析\n");
    printf(" PID\t Work\t\tNeed\t\tAllocation\t\tWork+Allocation\n");
    isSafe();
    while(true)
    {
        printf("\n---------------------------------------------------------\n");
        printf("\n输入要分配的进程(输入整数-1退出)：");
        scanf("%d", &curProcess);
        if(curProcess == -1) break;

        printf("\n输入要分配给进程P%d的资源：", curProcess);
        for(j = 0; j < resourceNum; j++)
            scanf("%d", &request[j]);
        for(j = 0; j < resourceNum; j++)
        {
            if(request[j] > need[curProcess][j])
            {
                printf("当前资源不足，无法分配！\n"); break;
            }
        }
        if(j == resourceNum)
        {
            for(j = 0; j < resourceNum; j++)
            {
                available[j] -= request[j];
                allocation[curProcess][j] += request[j];
                need[curProcess][j] -= request[j];
            }
            printf("\n系统安全情况分析\n");
            printf(" PID\t Work\t\tNeed\tAllocation\tWork+Allocation\n");
            if(isSafe())
            {
                printf("分配成功！\n\n");
                showInfo();
            }
            else
            {
                for(j = 0; j < resourceNum; j++)
                {
                    available[j] += request[j];
                    allocation[curProcess][j] -= request[j];
                    need[curProcess][j] += request[j];
                }
                printf("分配失败！\n\n");
                showInfo();
            }
        }
    }
}