银行家算法

#include<iostream>
usingnamespacestd;
int**allocate,*total,**need,*require;
intnum_process,num_resource;
boolisDeadLock(intc=0);
boolfindFinish();
voidprintALL(int**b_allocate,int**b_need,int*b_total);
boolisAllFinish(int**);
intmain()
...{
cin>>num_process>>num_resource;
need=newint*[num_process];
allocate=newint*[num_process];
total=newint[num_resource];
require=newint[num_resource];
inti,q;
for(i=0;i<num_process;i++)
...{
need[i]=newint[num_resource];
allocate[i]=newint[num_resource];
}
//definethenumberofeachresource
for(i=0;i<num_resource;i++)
cin>>total[i];
for(i=0;i<num_resource;i++)
cout<<total[i];
//definetheprocessesgethowmuchresource
for(i=0;i<num_process;i++)
for(q=0;q<num_resource;q++)
cin>>allocate[i][q];
//cheaktheresourcehasenoughtoallocate
for(i=0;i<num_resource;i++)
for(q=0;q<num_process;q++)
...{if(total[i]-allocate[q][i]>=0)
total[i]-=allocate[q][i];
else
...{
cerr<<"error!";
return1;
}
}

//definehowmuchresourceswilleachprocessstillneedtogettofinishitselfnow
for(i=0;i<num_process;i++)
for(q=0;q<num_resource;q++)
cin>>need[i][q];
printALL(allocate,need,total);
//cheaktheallocateisdeadlockornot
if(isDeadLock())
...{
cerr<<"deadLock";
return1;
}
else
cout<<"Systemissafe"<<endl;
//autotest
inttest;
cout<<"choose1:autotest, else:customtest. ";
cin>>test;
if(test==1)
...{
isDeadLock(test);
}
//customtest
else
...{
while(isAllFinish(need))
...{
for(i=0;i<num_process;i++)
...{
cout<<i<<":requirehowmuchresource?"<<endl;
for(q=0;q<num_resource;q++)
cin>>require[q];
//determinethedataofrequireisright
for(q=0;q<num_resource;q++)
...{
if(total[q]<require[q]||need[i][q]<require[q])
...{
cout<<"errordatainformation"<<endl;
i--;
break;
}
total[q]-=require[q];
need[i][q]-=require[q];
allocate[i][q]+=require[q];
}
if(isDeadLock(1))
...{
i--;
cout<<"Systemisindeadlockstate"<<endl;
}
else
cout<<"Systemissafe......"<<endl;
}
}
}
return0;
}
//ifalltheprocessesarefinished,thenreturntrue;
boolisAllFinish(int**b_need)
...{
inti,q;
for(i=0;i<num_process;i++)
for(q=0;q<num_resource;q++)
...{
if(b_need[i][q]!=0)
returnfalse;
}
returntrue;
}
//ifitisdeadlock,thenreturntrue;elsereturnfalse
boolisDeadLock(intc)//cisaflagtoshowtheinformationornot.
...{
int**backup_allocate,**backup_need,*backup_total;
backup_need=newint*[num_process];
backup_allocate=newint*[num_process];
backup_total=newint[num_resource];
inti,q;
for(i=0;i<num_process;i++)
...{
backup_need[i]=newint[num_resource];
backup_allocate[i]=newint[num_resource];
}
for(i=0;i<num_process;i++)
for(q=0;q<num_resource;q++)
...{
backup_need[i][q]=need[i][q];
backup_allocate[i][q]=allocate[i][q];
}
for(i=0;i<num_resource;i++)
backup_total[i]=total[i];
//returnfindFinish();
if(c!=0)
printALL(backup_allocate,backup_need,backup_total);
intflag=0,count=0;
while(!isAllFinish(backup_need))
...{
count=0;
for(i=0;i<num_process;i++)
...{for(q=0;q<num_resource;q++)
...{
if(backup_need[i][q]>backup_total[q])
...{
flag=0;
break;
}
flag=1;
}
//findafinishingprocessandcollecttheresource
if(flag==1)
...{
count++;
for(q=0;q<num_resource;q++)
...{
backup_total[q]+=backup_allocate[i][q];
backup_allocate[i][q]=0;
backup_need[i][q]=0;
}

}
printALL(backup_allocate,backup_need,backup_total);
}
//if(c!=0)
//printALL(backup_allocate,backup_need,backup_total);
//ifnoprocessisfinished,itmeansnoresourceiscollectonce.Thenthedeadlockappears.
if(count==0)
...{
delete[]backup_total;
for(i=0;i<num_process;i++)
...{delete[]backup_allocate[i];
delete[]backup_need[i];
}
delete[]backup_allocate;
delete[]backup_need;
returntrue;
}
}

returnfalse;
}
voidprintALL(int**b_allocate,int**b_need,int*b_total)
...{
inti,q;
cout<<"Allocate need"<<endl;
for(i=0;i<num_process;i++)
...{
for(q=0;q<num_resource;q++)
...{
cout<<b_allocate[i][q]<<"";
}
cout<<" ";
for(q=0;q<num_resource;q++)
cout<<b_need[i][q]<<"";
cout<<endl;
}
cout<<"total"<<endl;
for(i=0;i<num_resource;i++)
cout<<b_total[i]<<"";
cout<<endl;
}

/**//*
boolfindFinish()
{
inti,q,flag=0,count=0;
for(i=0;i<num_process;i++)
{for(q=0;q<num_resource;q++)
{
if(need[i][q]>total[q])
{
flag=0;
break;
}
flag=1;
}
if(flag==1)
{
count++;
for(q=0;q<num_resource;q++)
{
total[q]+=allocate[i][q];
allocate[i][q]=0;
}
}
}
if(count!=0)
returntrue;
returnfalse;
}*/